A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times

Abstract : This paper investigates an optimal lane reservation problem with dynamic link travel times via a lane reservation strategy. This strategy is to select some existing general-purpose lanes from a transportation network and convert them to reserved lanes for some special road users only so that a time-guaranteed transportation can be ensured. However, such conversion may cause traffic impact such as an increase of link travel times on adjacent lanes due to the disallowing utilisation of reserved lanes by general-purpose vehicles. Thus, the considered problem aims to design reserved lane-based paths for the time-guaranteed transportation with the objective of minimising the total traffic impact caused by the conversion. Different from lane reservation problems with constant link travel times in the literature, the considered problem assumes dynamic link travel times, which is proved NP-hard. The problem is initially formulated as a mixed integer non-linear programming model. In order to solve it, the non-linear model is reformulated as an equivalent linear model 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 a commercial CPLEX MIP solver.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00859848
Contributor : Frédéric Davesne <>
Submitted on : Monday, September 9, 2013 - 3:38:47 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM

Identifiers

Collections

Citation

Yunfei Fang, Feng Chu, Saïd Mammar, Ada Che. A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times. International Journal of Production Research, Taylor & Francis, 2014, 52 (4), pp.1003--1015. ⟨10.1080/00207543.2013.828169⟩. ⟨hal-00859848⟩

Share

Metrics

Record views

153