In this work, we study a time-dependent lane reservation problem with varying link travel speed (called the TDLRP) in transportation network, which aims to design optimal routes for special transportation tasks to make sure they are completed within given deadlines by selecting lanes to be reserved. The travel speed on a non-reserved lane does not remain constant all the day, it varies with the time of a day which also makes the total travel time fluctuate with different departure time. However, because of the exclusive occupation of the reserved lanes by special tasks, negative impact such as increase of travel flow on adjacent general purpose lanes is caused. The objective of TDLRP is to minimize the total negative impact caused by the reserved lanes. To solve the TDLRP, we first formulate it into a new mixed integer non-linear programming model which considers the restricted budget, then reformulate it as an equivalent easy-to-handle linear one by a Big-M-based linearization method and solve it through the commercial solver CPLEX. Finally, the effectiveness of the proposed model is demonstrated via experimental results for a real-life instance.
Mixed-Integer Programming for a New Time-Dependent Lane Reservation Problem
2022-11-11
546402 byte
Conference paper
Electronic Resource
English
British Library Online Contents | 2016
|