A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
暂无分享,去创建一个
[1] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[2] Thomas Stützle,et al. Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study , 2004, Metaheuristics for Multiobjective Optimisation.
[3] Sergio A. Lugo-Serrato,et al. Transit Capacity and Quality-of-Service Manual: Applications to Mexican Transit Systems , 2008 .
[4] Byung-In Kim,et al. The school bus routing problem: A review , 2010, Eur. J. Oper. Res..
[5] Wei Wang,et al. Modeling Bus Dwell Time and Time Lost Serving Stop in China , 2016 .
[6] Maria Grazia Speranza,et al. The Split Delivery Vehicle Routing Problem: A Survey , 2008 .
[7] Gilbert Laporte,et al. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..
[8] Gilbert Laporte,et al. Fifty Years of Vehicle Routing , 2009, Transp. Sci..
[9] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[10] Byung-In Kim,et al. A post-improvement procedure for the mixed load school bus routing problem , 2012, Eur. J. Oper. Res..
[11] R. M. R. Lewis,et al. A Guide to Graph Colouring , 2016, Springer International Publishing.
[12] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[13] Sungsoo Park,et al. Algorithms for the variable sized bin packing problem , 2003, Eur. J. Oper. Res..
[14] Martin W. P. Savelsbergh,et al. Worst-Case Analysis for Split Delivery Vehicle Routing Problems , 2006, Transp. Sci..
[15] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[16] Frits C. R. Spieksma,et al. School bus routing - a column generation approach , 2014, Int. Trans. Oper. Res..
[17] Kate Smith-Miles,et al. The School Bus Routing Problem: An Analysis and Algorithm , 2017, IWOCA.
[18] Robert L. Bertini,et al. Modeling Transit Trip Time using Archived Bus Dispatch System Data , 2004 .
[19] Gilbert Laporte,et al. Improvements to the Or-opt heuristic for the symmetric travelling salesman problem , 2007, J. Oper. Res. Soc..
[20] Frits C. R. Spieksma,et al. A metaheuristic for the school bus routing problem with bus stop selection , 2013, Eur. J. Oper. Res..
[21] Moshe Dror,et al. Savings by Split Delivery Routing , 1989, Transp. Sci..
[22] R. M. R. Lewis,et al. Guide to Graph Colouring: Algorithms and Applications , 2015, Texts in Computer Science.
[23] Anand Subramanian,et al. An iterated local search heuristic for the split delivery vehicle routing problem , 2015, Comput. Oper. Res..
[24] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[25] M. Dror,et al. Split delivery routing , 1990 .
[26] Juan José Salazar González,et al. A column generation approach for a school bus routing problem with resource constraints , 2013, Comput. Oper. Res..
[27] Byung-In Kim,et al. A school bus scheduling problem , 2012, Eur. J. Oper. Res..
[28] Adam N. Letchford,et al. A branch-and-cut algorithm for the capacitated open vehicle routing problem , 2007, J. Oper. Res. Soc..
[29] Michel Gendreau,et al. A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..
[30] Burak Eksioglu,et al. The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..
[31] Andrew Lim,et al. A tabu search algorithm for the multi-period inspector scheduling problem , 2014, Comput. Oper. Res..