A novel GIS-based decision-making framework for the school bus routing problem

The school bus routing problem (SBRP) is a central issue in transportation planning and optimization systems. SBRP seeks to plan an efficient schedule for a fleet of school buses where each bus picks up students from various bus stops and delivers them to their designated schools while satisfying various constraints such as the maximum capacity of a bus, and the time window of a school. Due to its inherent complexity, many heuristics have been proposed to solve this combinatorial problem in an effective way. In this paper, a novel geographic information systems (GIS)-based decision-making framework that combines GIS, clustering techniques, network cutting techniques, and a hybrid ant colony optimization metaheuristic with the iterated Lin–Kernighan local improvement heuristic is proposed for solving the SBRP as a split delivery vehicle routing problem (SDVRP). Experiments were conducted for evaluating the proposed framework by comparing the results for solving 11 routing problems using both the proposed decision-making framework and ArcGIS 9.2 Network Analyst which uses the greedy Dijkstra’s algorithm. The reported results of the proposed framework generally outperform that of the ArcGIS Network Analyst. In addition, the proposed decision-making framework was applied to solve a real life SBRP to demonstrate its application.

[1]  Roberto Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, Swarm Intelligence.

[2]  Wout Dullaert,et al.  A multi-start local search algorithm for the vehicle routing problem with time windows , 2004, Eur. J. Oper. Res..

[3]  Keivan Ghoseiri,et al.  Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm , 2010, Appl. Soft Comput..

[4]  R. Montemanni,et al.  Ant colony optimization for real-world vehicle routing problems From theory to applications , .

[5]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[6]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[7]  Yoshiyasu Takefuji,et al.  Solving vehicle routing problems by maximum neuron model , 2002, Adv. Eng. Informatics.

[8]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[9]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[10]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[11]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[12]  Xiaowu. Ke School bus selection, routing and scheduling. , 2005 .

[13]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[14]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[15]  Wen-Chyuan Chiang,et al.  Scatter search for the vehicle routing problem with time windows , 2006, Eur. J. Oper. Res..

[16]  Xinjie Yu,et al.  A Spatial Decision Support System for Large Scale Vehicle Routing , 2009, 2009 International Conference on Measuring Technology and Mechatronics Automation.

[17]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[18]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[19]  Christos D. Tarantilis,et al.  Using a spatial decision support system for solving the vehicle routing problem , 2002, Inf. Manag..

[20]  Warren H. Thomas,et al.  Design of school bus routes by computer , 1969 .

[21]  Julian J. Ray A web-based spatial decision support system optimizes routes for oversize/overweight vehicles in Delaware , 2007, Decis. Support Syst..

[22]  Maria Grazia Speranza,et al.  The Split Delivery Vehicle Routing Problem: A Survey , 2008 .

[23]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[24]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[25]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[26]  Lixin Tang,et al.  A new hybrid ant colony optimization algorithm for the vehicle routing problem , 2009, Pattern Recognit. Lett..

[27]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[28]  Byung-In Kim,et al.  The school bus routing problem: A review , 2010, Eur. J. Oper. Res..

[29]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[30]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[31]  Christos D. Tarantilis,et al.  Combination of geographical information system and efficient routing algorithms for real life distribution operations , 2004, Eur. J. Oper. Res..

[32]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[33]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[34]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

[35]  J RayJulian A web-based spatial decision support system optimizes routes for oversize/overweight vehicles in Delaware , 2007 .

[36]  David Simchi-Levi,et al.  A computerized approach to the New York City school bus routing problem , 1997 .

[37]  Khalid A. Eldrandaly,et al.  A GEP-based spatial decision support system for multisite land use allocation , 2010, Appl. Soft Comput..

[38]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[39]  Noor Hasnah Moin Hybrid Genetic Algorithms for Vehicle Routing Problems with Time Windows , 2002 .