A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network

Woosuk Yang, Tae Su Cheong, Sang Hwa Song

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number921482
JournalMathematical Problems in Engineering
Volume2015
DOIs
Publication statusPublished - 2015 Jan 1

Fingerprint

Consolidation
Planning
Cost Allocation
Integer programming
Integer Programming
Programming Model
Horizon
Upper and Lower Bounds
NP-complete problem
Numerical Experiment
Heuristics
Restriction
Dependent
Vertex of a graph
Costs
Experiments

ASJC Scopus subject areas

  • Mathematics(all)
  • Engineering(all)

Cite this

A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network. / Yang, Woosuk; Cheong, Tae Su; Song, Sang Hwa.

In: Mathematical Problems in Engineering, Vol. 2015, 921482, 01.01.2015.

Research output: Contribution to journalArticle

@article{6292ce5d3c0643f8b602b948618243ba,
title = "A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network",
abstract = "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.",
author = "Woosuk Yang and Cheong, {Tae Su} and Song, {Sang Hwa}",
year = "2015",
month = "1",
day = "1",
doi = "10.1155/2015/921482",
language = "English",
volume = "2015",
journal = "Mathematical Problems in Engineering",
issn = "1024-123X",
publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network

AU - Yang, Woosuk

AU - Cheong, Tae Su

AU - Song, Sang Hwa

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84946924718&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946924718&partnerID=8YFLogxK

U2 - 10.1155/2015/921482

DO - 10.1155/2015/921482

M3 - Article

AN - SCOPUS:84946924718

VL - 2015

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

SN - 1024-123X

M1 - 921482

ER -