An improved exact ε-constraint and cut-and-solve combined method for biobjective robust lane reservation

Abstract : This study investigates a new biobjective lane- reservation problem, which is to exclusively reserve lanes from an existing transportation network for special transport tasks with given deadlines. The objectives are to minimize the total negative impact on normal traffic due to the reduction of available lanes for general-purpose vehicles and to maximize the robustness of the lane-reservation solution against the uncertainty in link travel times. We first define the robustness for the lane- reservation problem and formulate a biobjective mixed-integer linear program. Then, we develop an improved exact \varepsilon-constraint and a cut-and-solve combined method to generate its Pareto front. Computational results for an instance based on a real network topology and 220 randomly generated instances with up to 150 nodes, 600 arcs, and 50 tasks demonstrate that the proposed method is able to find the Pareto front and that the proposed cut-and-solve method is more efficient than the direct use of optimization software CPLEX.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01169416
Contributor : Frédéric Davesne <>
Submitted on : Monday, June 29, 2015 - 1:16:24 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM

Identifiers

Citation

Peng Wu, Ada Che, Feng Chu, Mengchu Zhou. An improved exact ε-constraint and cut-and-solve combined method for biobjective robust lane reservation. IEEE Transactions on Intelligent Transportation Systems, IEEE, 2015, 16 (3), pp.1479--1492. ⟨10.1109/TITS.2014.2368594⟩. ⟨hal-01169416⟩

Share

Metrics

Record views

111