A Parallel Algorithm for the Vehicle Routing Problem

References

• Agarwal Y., Mathur K., Salkin H. M. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks (1989) 19(7):731–749Crossref, Google Scholar
• Alba E., Dorronsoro B., Gottlieb J., Raidl G. R. Solving the vehicle routing problem by using cellular genetic algorithms. Evolutionary Computation in Combinatorial Optimization (2004) 3004(Springer, Berlin) 11–20Lecture Notes in Computer ScienceCrossref, Google Scholar
• Alba E., Dorronsoro B.Cellular Genetic Algorithms (2008) (Springer, New York) Crossref, Google Scholar
• Alba E., Luque G., Alba E. Measuring the performance of parallel metaheuristics. Parallel Metaheuristics: A New Class of Algorithms (2005) (John Wiley & Sons, Hoboken, NJ) 43–62Crossref, Google Scholar
• Alvarenga G. B., Mateus G. R., de Tomi G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. (2007) 34(6):1561–1584Crossref, Google Scholar
• Bixby A. Polyhedral analysis and effective algorithms for the capacitated vehicle routing problem. (1998) . Ph.D. thesis, Northwestern University, Evanston, ILGoogle Scholar
• Bramel J., Simchi-Levi D., Toth P., Vigo D. Set-covering-based algorithms for the capacitated VRP. The Vehicle Routing Problem (2001) (Society for Industrial and Applied Mathematics, Philadelphia) 85–108Google Scholar
• Chao I-M., Golden B. L., Wasil E. An improved heuristic for the period vehicle routing problem. Networks (1995) 26(1):25–44Crossref, Google Scholar
• Christofides N., Eilon S. An algorithm for the vehicle-dispatching problem. Oper. Res. Quart. (1969) 20(3):309–318Crossref, Google Scholar
• Christofides N., Mingozzi A., Toth P., Christofides N., Mingozzi A., Toth P., Sandi C. The vehicle routing problem. Combinatorial Optimization (1979) (John Wiley & Sons, Chichester, UK) 315–338Google Scholar
• COIN-OR (COmputational INfrastructure for Operations Research) (2010) . Retrieved August 6, 2010, VRPH. http://www.coin-or.org/projects/VRPH.xmlGoogle Scholar
• Cordeau J.-F., Gendreau M., Hertz A., Laporte G., Sormany J.-S., Langevin A., Riopel D. New heuristics for the vehicle routing problem. Logistics Systems: Design and Optimization (2005) (Springer, New York) 279–297Crossref, Google Scholar
• Crainic T. G., Golden B. L., Raghavan S., Wasil E. A. Parallel solution methods for vehicle routing problems. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 171–198Crossref, Google Scholar
• Crainic T. G., Nourredine H., Alba E. Parallel metaheuristics applications. Parallel Metaheuristics: A New Class of Algorithms (2005) (John Wiley & Sons, Hoboken, NJ) 447–494Crossref, Google Scholar
• Dantzig G. B., Ramser J. H. The truck dispatching problem. Management Sci. (1959) 6(1):80–91Link, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40(2):342–354Link, Google Scholar
• Doerner K., Hartl R. F., Kiechle G., Lucká M., Reimann M., Gottlieb J., Raidl G. R. Parallel ant systems for the capacitated vehicle routing problem. Evolutionary Computation in Combinatorial Optimization (2004) 3004(Springer, Berlin) 72–83Lecture Notes in Computer ScienceCrossref, Google Scholar
• Dorronsoro B., Arias D., Luna F., Nebro A. J., Alba E., Smari W. A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP. 2007 High Performance Comput. Simulation Conf. (HPCS 2007) (2007) Prague, Czech Republic:759–765 http://www.scs-europe.net/conf/ecms2007/ecms2007-cd/ecms2007/ecms2007%20pdf/HPCS2007.pdfGoogle Scholar
• Franceschi R. D., Fischetti M., Toth P. A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming (2006) 105(2–3):471–499Crossref, Google Scholar
• Gendreau M., Potvin J.-Y., Bräysy O., Hasle G., Løkketangen A., Golden B. L., Raghavan S., Wasil E. A. Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 143–169Crossref, Google Scholar
• Golden B. L., Raghavan S., Wasil E. A.The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) Crossref, Google Scholar
• Golden B. L., Wasil E. A., Kelly J. P., Chao I-M., Crainic T. G., Laporte G. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston) 33–56Crossref, Google Scholar
• Groër C., Golden B., Wasil E. A library of local search heuristics for the vehicle routing problem. Math. Programming Comput. (2010) 2(2):79–101Crossref, Google Scholar
• Hadjiconstantinou E., Christofides N., Mingozzi A. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxation. Ann. Oper. Res. (1995) 61(1):21–43Crossref, Google Scholar
• Le Bouthillier A., Crainic T. G. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. (2005) 32(7):1685–1708Crossref, Google Scholar
• Le Bouthillier A., Crainic T., Kropf P. Towards a guided cooperative search. (2005) . Technical Report CRT-05-09, Centre de recherche sur les transports, Université de Montréal, MontréalGoogle Scholar
• Li F., Golden B., Wasil E. Very large-scale vehicle routing: New test problems, algorithms, and results. Comput. Oper. Res. (2005) 32(5):1165–1179Crossref, Google Scholar
• Lin S., Kernighan B. W. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. (1973) 21(2):498–516Link, Google Scholar
• Mester D., Bräysy O. Active-guided evolution strategies for large-scale vehicle routing problems. Comput. Oper. Res. (2007) 34(10):2964–2975Crossref, Google Scholar
• Nagata Y., Bräysy O., van Hemert J., Cotta C. Efficient local search limitation strategies for vehicle routing problems. Evolutionary Computation in Combinatorial Optimization (2008) 4972(Springer, Berlin) 48–60Lecture Notes in Computer ScienceCrossref, Google Scholar
• Nagata Y., Bräysy O. Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks (2009) 54(4):205–-215Crossref, Google Scholar
• Or I. H. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. (1976) . Ph.D. thesis, Northwestern University, Evanston, ILGoogle Scholar
• Osman I. H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. (1993) 41(1–4):421–451Crossref, Google Scholar
• Pisinger D., Røpke S. A general heuristic for vehicle routing problems. Comput. Oper. Res. (2007) 34(8):2403–2435Crossref, Google Scholar
• Prins C., Pereira F. B., Tavares J. A GRASP × evolutionary local search hybrid for the vehicle routing problem. Bio-inspired Algorithms for the Vehicle Routing Problem (2009) 161(Studies in Computational Intelligence, Berlin) 35–53Crossref, Google Scholar
• Ralphs T. K., Kopman L., Pulleyblank W. R., Trotter L. E. On the capacitated vehicle routing problem. Math. Programming (2003) 94(2–3):343–359Crossref, Google Scholar
• Rego C. Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Parallel Comput. (2001) 27(3):201–222Crossref, Google Scholar
• Rochat Y., Taillard E. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1(1):147–167Crossref, Google Scholar
• Schulze J., Fahle T. A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. (1999) 86:585–607Crossref, Google Scholar
• Taillard E. Parallel iterative search methods for vehicle routing problems. Networks (1993a) 23(8):661–676Crossref, Google Scholar
• Taillard E. Vehicle routeing instances. (1993b) . Retrieved August 6, 2010, http://mistic.heig-vd.ch/taillard/problemes.dir/vrp.dir/vrp.htmlGoogle Scholar
• Taillard E., Boffey B. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Oper. Res. (1999) 33(1):1–14Crossref, Google Scholar
• Toth P., Tramontani A., Golden B. L., Raghavan S., Wasil E. A. An integer linear programming local search for capacitated vehicle routing problems. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 275–295Crossref, Google Scholar
• Yellow P. C. A computational modification to the savings method of vehicle scheduling. Oper. Res. Quart. (1970) 21(2):281–293Crossref, Google Scholar