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 metadatas

https://hal.archives-ouvertes.fr/hal-01768091
Contributor : Frédéric Davesne <>
Submitted on : Monday, April 16, 2018 - 9:42:01 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

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⟩

Share

Metrics

Record views

125