The capacitated lane reservation problem in transportation network

Yunfei Fang, Said Mammar, Feng Chu, Ada Che

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This paper investigates a capacitated lane reservation problem in a transportation network. The problem is to decide the task paths and select lanes to be reserved in a capacitated network to ensure that each commodity can be transported from its source to destination within a given travel time, meanwhile the lane's capacity is not violated. Its objective is to minimize the total impact of all reserved lanes on other normal lanes. To solve this problem, two integer linear programming models are formulated. The complexity of the problem is proved to be NP-hard. Then an algorithm based on a cut-and-solve idea is proposed to obtain optimal solutions. To evaluate the performance of our proposed algorithm, numerical experiments of randomly generated instances are conducted. Computational results show our algorithm significantly outperforms a well-known optimization software package CPLEX.

Original languageEnglish
Title of host publication2011 4th International Conference on Logistics, LOGISTIQUA'2011
Pages439-444
Number of pages6
DOIs
StatePublished - 2011
Event2011 4th International Conference on Logistics, LOGISTIQUA'2011 - Hammamet, Tunisia
Duration: 31 May 20113 Jun 2011

Publication series

Name2011 4th International Conference on Logistics, LOGISTIQUA'2011

Conference

Conference2011 4th International Conference on Logistics, LOGISTIQUA'2011
Country/TerritoryTunisia
CityHammamet
Period31/05/113/06/11

Fingerprint

Dive into the research topics of 'The capacitated lane reservation problem in transportation network'. Together they form a unique fingerprint.

Cite this