Time-Dependent Urban Customized Bus Routing With Path Flexibility
- 3 September 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 22 (4) , 2381-2390
Abstract
Urban customized bus companies are increasingly motivated by design efforts that entail more efficient route scenarios to incorporate adaptation to temporal and spatial heterogeneity in travel demand. However, such motivations are usually hindered by ubiquitous arrival unpunctuality resulting from traffic congestion. To resolve this problem, we suggest a time-dependent bus route planning methodology that explicitly considers path flexibility between nodes to be visited. First, we establish a mixed-integer programming model to formulate the problem, where decision-making considerations in bus route planning, path choice between nodes, and passenger assignment are concurrently integrated. Then, we develop a hybrid metaheuristic (combining tabu search and variable neighborhood search) to solve the model, in which satisfactory performance is observed from the numerical test in a small-sized example. Finally, the problem and methodology are addressed in a city-scale instance, where the effects of time-window features and traffic congestion, as well as the benefits from path flexibility inclusion in terms of cost, travel time, and distance are investigated.Keywords
Funding Information
- National Natural Science Foundation of China (71961137008, 91746201, 71621001)
This publication has 37 references indexed in Scilit:
- Location-arc routing problem: Heuristic approaches and test instancesComputers & Operations Research, 2014
- Branch and Price for the Time-Dependent Vehicle Routing Problem with Time WindowsTransportation Science, 2013
- The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristicsTransportation Research Part E: Logistics and Transportation Review, 2012
- Vehicle routing problems with alternative paths: An application to on-demand transportationEuropean Journal of Operational Research, 2010
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windowsDiscrete Optimization, 2008
- The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problemComputers & Operations Research, 2006
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveriesEuropean Journal of Operational Research, 2005
- Vehicle dispatching with time-dependent travel timesEuropean Journal of Operational Research, 2003
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- A note on two problems in connexion with graphsNumerische Mathematik, 1959