A tabu search based algorithm for optimal lane reservation

Author

Yunfei Fang ; Feng Chu ; Zhibin Wu ; Kejia Chen

Author_Institution

Sch. of Econ. & Manage., Fuzhou Univ., Fuzhou, China

fYear

2015

fDate

9-11 April 2015

Firstpage

607

Lastpage

612

Abstract

This work studies a transportation problem called as lane reservation problem, which is to complete some special transportation tasks within pre-given deadline by optimally selecting lanes to be reserved from the network and designing source-destination paths for the special tasks. Because of the exclusive use of the reserved lanes by the special tasks, negative impact such as increase of travel time on adjacent general-purpose lanes is caused on normal traffic. Then, the objective of the lane reservation problem is to minimize the total negative impact caused by the reserved lanes. To solve this problem, a tabu search based algorithm is developed. Numerical computational results on randomly generated instances show the efficiency of the proposed algorithm compared with a referenced IP solver CPLEX 12.5.

Keywords

road traffic; search problems; transportation; CPLEX 12.5. IP solver; general-purpose lanes; normal traffic; optimal lane reservation problem; randomly generated instances; source-destination paths; tabu search based algorithm; total negative impact minimization; transportation problem; travel time; Electronic mail; IP networks; Linear programming; Roads; Search problems; Vehicles; Transportation planning; lane reservation; optimization; tabu search;

fLanguage

English

Publisher

ieee

Conference_Titel

Networking, Sensing and Control (ICNSC), 2015 IEEE 12th International Conference on

Conference_Location

Taipei

Type

conf

DOI

10.1109/ICNSC.2015.7116107

Filename

7116107