Lane reservation problem with time-dependent travel times

Yunfei Fang, Feng Chu, Saïd Mammar, Ada Che

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

2 Scopus citations

Abstract

This paper presents an mixed integer nonlinear programming formulation for the lane reservation problem with time-dependent travel times. It aims to design time-guaranteed paths for some transportation tasks via lane reservation strategy, which is to optimally select and reserve some lanes for the use of the tasks with the objective of minimizing the total traffic impact caused by the reserved lanes. The considered problem is NP-hard. The original nonlinear model is transformed into an mixed integer linear program and a cut-and-solve based algorithm is proposed to obtain optimal solutions. Experimental tests on randomly generated instances show that the overall performance of the proposed algorithm outperforms a direct use of an optimization solver of CPLEX.

Original languageEnglish
Title of host publicationProceedings - INCOM'12, 14th IFAC Symposium on Information Control Problems in Manufacturing
PublisherIFAC Secretariat
Pages584-589
Number of pages6
EditionPART 1
ISBN (Print)9783902661982
DOIs
StatePublished - 2012
Event14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'12 - Bucharest, Romania
Duration: 23 May 201225 May 2012

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
NumberPART 1
Volume14
ISSN (Print)1474-6670

Conference

Conference14th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'12
Country/TerritoryRomania
CityBucharest
Period23/05/1225/05/12

Keywords

  • Cut-and-solve method
  • Lane reservation
  • Mixed integer programming
  • Optimization
  • Time-dependent travel time
  • Time-guaranteed transportation

Fingerprint

Dive into the research topics of 'Lane reservation problem with time-dependent travel times'. Together they form a unique fingerprint.

Cite this