A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network
This paper considers a multiperiod vehicle lease planning problem for urban freight consolidation centers (UFCCs) in the urban freight transport network where short-term-leased and long-term-leased vehicles are hired together. The objective is to allocate the two kinds of leased vehicles optimally f...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/921482 |
id |
doaj-ed45d43a3391463783db44c9cba6a888 |
---|---|
record_format |
Article |
spelling |
doaj-ed45d43a3391463783db44c9cba6a8882020-11-24T23:04:30ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/921482921482A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation NetworkWoosuk Yang0Taesu Cheong1Sang Hwa Song2Korea Investment & Securities, Seoul 1507450, Republic of KoreaSchool of Industrial Management Engineering, Korea University, Seoul 136713, Republic of KoreaGraduate School of Logistics, Incheon National University, Incheon 406130, Republic of KoreaThis paper considers a multiperiod vehicle lease planning problem for urban freight consolidation centers (UFCCs) in the urban freight transport network where short-term-leased and long-term-leased vehicles are hired together. The objective is to allocate the two kinds of leased vehicles optimally for direct transportation services from the associated origin node to the associated UFCC or from the associated UFCC to the associated destinations so as to satisfy a given set of period-to-period freight demands over a given planning horizon at total minimum vehicle allocation cost subject to demand-dependent transportation time restriction. The problem is formulated as an integer programming model and proven to be NP-hard in a strong sense. Thus, a Lagrangian heuristic is proposed to find a good solution efficiently. Numerical experiments show that the proposed algorithm finds good lower and upper bounds within reasonable time.http://dx.doi.org/10.1155/2015/921482 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Woosuk Yang Taesu Cheong Sang Hwa Song |
spellingShingle |
Woosuk Yang Taesu Cheong Sang Hwa Song A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network Mathematical Problems in Engineering |
author_facet |
Woosuk Yang Taesu Cheong Sang Hwa Song |
author_sort |
Woosuk Yang |
title |
A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network |
title_short |
A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network |
title_full |
A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network |
title_fullStr |
A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network |
title_full_unstemmed |
A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network |
title_sort |
multiperiod vehicle lease planning for urban freight consolidation network |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
This paper considers a multiperiod vehicle lease planning problem for urban freight consolidation centers (UFCCs) in the urban freight transport network where short-term-leased and long-term-leased vehicles are hired together. The objective is to allocate the two kinds of leased vehicles optimally for direct transportation services from the associated origin node to the associated UFCC or from the associated UFCC to the associated destinations so as to satisfy a given set of period-to-period freight demands over a given planning horizon at total minimum vehicle allocation cost subject to demand-dependent transportation time restriction. The problem is formulated as an integer programming model and proven to be NP-hard in a strong sense. Thus, a Lagrangian heuristic is proposed to find a good solution efficiently. Numerical experiments show that the proposed algorithm finds good lower and upper bounds within reasonable time. |
url |
http://dx.doi.org/10.1155/2015/921482 |
work_keys_str_mv |
AT woosukyang amultiperiodvehicleleaseplanningforurbanfreightconsolidationnetwork AT taesucheong amultiperiodvehicleleaseplanningforurbanfreightconsolidationnetwork AT sanghwasong amultiperiodvehicleleaseplanningforurbanfreightconsolidationnetwork AT woosukyang multiperiodvehicleleaseplanningforurbanfreightconsolidationnetwork AT taesucheong multiperiodvehicleleaseplanningforurbanfreightconsolidationnetwork AT sanghwasong multiperiodvehicleleaseplanningforurbanfreightconsolidationnetwork |
_version_ |
1725629909036957696 |