Skip to Main content Skip to Navigation
Conference papers

Optimal lane reservation via new optimization model and heuristic algorithm

Abstract : This paper studies a transportation planning problem called capacitated lane reservation problem (CLRP). It focuses on designing time-efficient paths for a set of transportation tasks by choosing lanes from the network to be reserved while respecting the road residual capacity. For the special tasks, lane reservation increases their transportation efficiency, while for general-purpose vehicles on adjacent non-reserved lanes, travel delay may be caused. The objective of CLRP is to minimize such negative impact via optimal lane reservation. For this problem, we develop an improved model and an efficient heuristic. Results of extensive numerical experiments on benchmark instances show the efficiency of the proposed model and algorithm.
Document type :
Conference papers
Complete list of metadata
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Monday, April 16, 2018 - 9:42:01 PM
Last modification on : Saturday, May 1, 2021 - 3:51:19 AM



Peng Wu, Feng Chu, yunfei Fang, Cheng-Hu yang. Optimal lane reservation via new optimization model and heuristic algorithm. 15th IEEE International Conference on Networking, Sensing and Control (ICNSC 2018), Mar 2018, Zhuhai, China. pp.1--6, ⟨10.1109/ICNSC.2018.8361364⟩. ⟨hal-01768091⟩



Record views