A bi-level school bus routing problem with bus stops selection and possibility of demand outsourcing

Abstract This paper develops a bi-level mathematical model for the school bus routing problem aiming at designing an efficient transportation system considering the possibility of predicting the students’ response. In the real world, the demand for using private cars depends on how well public transportation systems are operating especially in metropolitan cities. An inefficient public transportation will lead to an increase in the demand for using private cars. This issue will result in problems such as increased traffics and urban pollutions. To address this issue, an efficient public transportation system is designed by developing a new bi-level mathematical model. In the proposed model, the designer of the public transportation system, as the upper-level decision-maker, will locate appropriate bus stops and identify bus navigation routes. Subsequently, the decision regarding the allocation of students to transportation systems or outsourcing them will be made at the lower level which is considered as an operational-level decision-making. To solve this problem, two hybrid metaheuristic approaches named GA-EX-TS and SA-EX-TS have been proposed based on location-allocation-routing (LAR) strategy. The performance of these proposed methods is compared with exact solutions achieved from an explicit enumeration approach followed in the small-scale instances. Finally, the proposed approaches are used to solve 50 random instance problems. Comparing the results of the two tuned hybrid algorithms and conducting the sensitivity analysis of the model provide evidence for the good performance of the proposed approach.

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

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

[3]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[4]  Robert G. Jeroslow,et al.  The polynomial hierarchy and a simple model for competitive analysis , 1985, Math. Program..

[5]  B. Vahdani,et al.  A robust parameter design for multi-response problems , 2009 .

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Herminia I. Calvete,et al.  A genetic algorithm for solving linear fractional bilevel problems , 2009, Ann. Oper. Res..

[8]  An-Hsiang Wang,et al.  Solving Location-allocation Problems with Rectilinear Distances by Simulated Annealing , 1994 .

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  Michel Bierlaire,et al.  Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem , 2005, Transp. Sci..

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  El-Ghazali Talbi,et al.  A Taxonomy of Metaheuristics for Bi-level Optimization , 2013 .

[13]  K. Sorensen,et al.  A mathematical formulation for a school bus routing problem , 2006, 2006 International Conference on Service Systems and Service Management.

[14]  Haluk Damgacioglu,et al.  A genetic algorithm for the uncapacitated single allocation planar hub location problem , 2015, Comput. Oper. Res..

[15]  Magdalene Marinaki,et al.  A Bilevel Genetic Algorithm for a real life location routing problem , 2008 .

[16]  Christopher R. Houck,et al.  Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems , 1996, Comput. Oper. Res..

[17]  Paul H. Calamai,et al.  A multi-objective optimization approach to urban school bus routing: Formulation and solution method , 1995 .

[18]  Zhuo Fu,et al.  The school bus routing problem: a case study , 2002, J. Oper. Res. Soc..

[19]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

[20]  Byung-In Kim,et al.  A post-improvement procedure for the mixed load school bus routing problem , 2012, Eur. J. Oper. Res..

[21]  Tolga Bektas,et al.  Solving school bus routing problems through integer programming , 2007, J. Oper. Res. Soc..

[22]  Mohammad Mehdi Sepehri,et al.  Linear bilevel programming solution by genetic algorithm , 2002, Comput. Oper. Res..

[23]  Jonathan F. Bard,et al.  The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..

[24]  Yufu Ning,et al.  A multilevel approach for modelling vehicle routing problem with uncertain travelling time , 2017, J. Intell. Manuf..

[25]  Ma Yanfang,et al.  Vehicle routing problem with multiple decision-makers for construction material transportation in a fuzzy random environment , 2014 .

[26]  Abbas Ahmadi,et al.  A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment , 2015, Appl. Soft Comput..

[27]  Herminia I. Calvete,et al.  Bilevel model for production-distribution planning solved by using ant colony optimization , 2011, Comput. Oper. Res..

[28]  Daniel Aloise,et al.  A simple and effective genetic algorithm for the two-stage capacitated facility location problem , 2014, Comput. Ind. Eng..

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

[30]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[31]  Paul H. Calamai,et al.  Bilevel and multilevel programming: A bibliography review , 1994, J. Glob. Optim..

[32]  Lawrence Bodin,et al.  Routing and Scheduling of School Buses by Computer , 1979 .

[33]  G. Laporte The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[34]  Herminia I. Calvete,et al.  A new approach for solving linear bilevel problems using genetic algorithms , 2008, Eur. J. Oper. Res..

[35]  Ichiro Nishizaki,et al.  Cooperative and Noncooperative Multi-Level Programming , 2009 .

[36]  Li Hecheng,et al.  Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems , 2008 .

[37]  Panos M. Pardalos,et al.  A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm , 2007, J. Glob. Optim..

[38]  Joaquín A. Pacheco,et al.  Tabu search for a multi-objective routing problem , 2006, J. Oper. Res. Soc..

[39]  Nilson Tadeu Ramos Nunes,et al.  A mixed load capacitated rural school bus routing problem with heterogeneous fleet: Algorithms for the Brazilian context , 2016, Expert Syst. Appl..

[40]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[41]  Din Mohammad Imani,et al.  Optimizing a vendor managed inventory (VMI) supply chain for perishable products by considering discount: Two calibrated meta-heuristic algorithms , 2017, Comput. Ind. Eng..

[42]  Armin Fügenschuh,et al.  Solving a school bus scheduling problem with integer programming , 2009, Eur. J. Oper. Res..

[43]  Jean-Marc Rousseau,et al.  Clustering for routing in densely populated areas , 1985 .

[44]  Gary R. Weckman,et al.  Applying genetic algorithm to a new bi-objective stochastic model for transportation, location, and allocation of hazardous materials , 2016, Expert Syst. Appl..

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

[46]  Miaomiao Wang,et al.  Improved particle swarm optimization based approach for bilevel programming problem-an application on supply chain model , 2014, Int. J. Mach. Learn. Cybern..

[47]  M. Goodchild,et al.  Discrete space location-allocation solutions from genetic algorithms , 1986 .

[48]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[49]  Jacques A. Ferland,et al.  School bus routes generator in urban surroundings , 1980, Comput. Oper. Res..

[50]  Reza Ramezanian,et al.  A tri-level covering fortification model for facility protection against disturbance in r-interdiction median problem , 2016, Comput. Ind. Eng..

[51]  David Ripplinger Rural School Vehicle Routing Problem , 2005 .

[52]  Frits C. R. Spieksma,et al.  A metaheuristic for the school bus routing problem with bus stop selection , 2013, Eur. J. Oper. Res..

[53]  Y. Jiao,et al.  Orthogonal genetic algorithm for solving quadratic bilevel programming problems , 2010 .

[54]  Mostafa Hajiaghaei-Keshteli,et al.  Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm , 2014, Appl. Soft Comput..

[55]  J. Bard Some properties of the bilevel programming problem , 1991 .

[56]  Sumanta Basu Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey , 2012 .

[57]  Deniz Aksen,et al.  A bilevel fixed charge location model for facilities under imminent attack , 2012, Comput. Oper. Res..