Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem

References

• Adulyasak Y, Cordeau JF, Jans R (2014) Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Sci. 48(1):20–45.Link, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. Christofides N, Mingozzi A, Toth P, Sandi C, eds. Combinatorial Optimization (Wiley, Chichester, UK), 315–338.Google Scholar
• Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568–581.Link, Google Scholar
• Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12:129–146.Crossref, Google Scholar
• Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res. Methodology 37(6):579–594.Crossref, Google Scholar
• Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8):928–936.Crossref, Google Scholar
• Dabia S, Ropke S, van Woensel T, Kok TD (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):380–396.Link, Google Scholar
• Dayarian I, Crainic TG, Gendreau M, Rei W (2015) A branch-and-price approach for a multi-period vehicle routing problem. Comput. Oper. Res. 55:167–184.Crossref, Google Scholar
• Dayarian I, Crainic TG, Gendreau M, Rei W (2016) An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem. Transportation Res. Logist. Transportation Rev. 95:95–123.Crossref, Google Scholar
• Feillet D, Garaix T, Lehuédé F, Péton O, Quadri D (2014) A new consistent vehicle routing problem for the transportation of people with disabilities. Networks 63(3):211–224.Crossref, Google Scholar
• Goeke D, Schneider M (2015) Routing a mixed fleet of electric and conventional vehicles. Eur. J. Oper. Res. 245(1):81–99.Crossref, Google Scholar
• Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manufacturing Service Oper. Management 11(4):630–643.Link, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497–511.Link, Google Scholar
• Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680.Crossref, Google Scholar
• Kovacs AA, Parragh SN, Hartl RF (2014) A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63(1):60–81.Crossref, Google Scholar
• Kovacs AA, Parragh SN, Hartl RF (2015) The multi-objective generalized consistent vehicle routing problem. Eur. J. Oper. Res. 247(2):441–458.Crossref, Google Scholar
• Kovacs AA, Golden BL, Hartl RF, Parragh SN (2015) The generalized consistent vehicle routing problem. Transportation Sci. 49(4):796–816.Link, Google Scholar
• Kovacs AA, Hartl RF, Parragh SN, Golden BL (2014) Vehicle routing problems in which consistency considerations are important: A survey. Networks 64(3):192–213.Crossref, Google Scholar
• Lian K, Milburn AB, Rardin RL (2016) An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem. IIE Trans. 48(10):975–992.Crossref, Google Scholar
• Masson R, Lehuédé F, Péton O (2013) An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Sci. 47(3):344–355.Link, Google Scholar
• Pecin D, Contardo C, Desaulniers G, Uchoa E (2017a) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J. Comput. 29(3):489–502.Link, Google Scholar
• Pecin D, Pessoa A, Poggi M, Uchoa E (2017b) Improved branch-cut-and-price for capacitated vehicle routing. Math. Programming Comput. 9(1):61–100.Crossref, Google Scholar
• Ropke S, Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Ropke S, Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3):750–775.Crossref, Google Scholar
• Sarstedt M, Mooi E (2014) Cluster analysis. A Concise Guide to Market Research: The Process, Data, and Methods Using IBM SPSS Statistics (Springer, Berlin, Heidelberg), 273–324.Google Scholar
• Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Maher M, Puget JF, eds. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 1520 (Springer, London), 417–431.Crossref, Google Scholar
• Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10):2519–2531.Crossref, Google Scholar
• Subramanyam A, Gounaris CE (2016) A branch-and-cut framework for the consistent traveling salesman problem. Eur. J. Oper. Res. 248(2):384–395.Crossref, Google Scholar
• Subramanyam A, Gounaris CE (2017) A decomposition algorithm for the consistent traveling salesman problem with vehicle idling. Transportation Sci. 52(2):386–401.Link, Google Scholar
• Sungur I, Ren Y, Ordóñez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44(2):193–205.Link, Google Scholar
• Tarantilis C, Stavropoulou F, Repoussis P (2012) A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Systems Appl. 39(4):4233–4239.Crossref, Google Scholar