Indexed by:
Abstract:
This paper studies a robust bus lane reservation problem with discrete scenarios for efficient bus transit to handle uncertain negative traffic impact due to reserved lanes where a scenario represents a possible discretization of the negative impact at a given time period. The goal is to select some lanes from the transit network to be reserved for time-efficient bus transit while minimizing the worst total negative impact over all scenarios. To solve this challenging problem, we formulate it as a mixed-integer linear programming model, which is solved using commercial optimization software package CPLEX 12.7. Computational results for randomly generated instances show that the proposed approach is feasible in solving this robust bus lane reservation problem of a certain scale. © 2018 IEEE.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
Year: 2018
Page: 1-5
Language: English
Cited Count:
SCOPUS Cited Count: 4
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 4
Affiliated Colleges: