An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

References

• Akca Z, Berger RT, Ralphs TK, Chinneck JW, Kristjansson B, Saltzman MJ. A branch-and-price algorithm for combined location and routing problems under capacity restrictions. Operations Research and Cyber-Infrastructure (2009) 47(Springer, New York) 309–330Crossref, Google Scholar
• Baldacci R, Mingozzi A. A unified exact method for solving different classes of vehicle routing problems. Math. Programming Ser. A (2009) 120(2):347–380Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R. New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. (2011a) 59(5):1269–1283Link, Google Scholar
• Baldacci R, Mingozzi A, Wolfler Calvo R. An exact method for the capacitated location-routing problem. Oper. Res. (2011b) 59(5):1284–1296Link, Google Scholar
• Belenguer J-M, Benavent E, Prins C, Prodhon C, Wolfler Calvo R. A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. (2011) 38(6):931–941Crossref, Google Scholar
• CPLEX (2009) . IBM ILOG CPLEX 12.1 callable library. ILOGGoogle Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R. Clustering-based heuristics for the two-echelon vehicle routing problem. (2008) . Technical Report CIRRELT-2008-46, CIRRELT, Montreal, Quebec, CanadaGoogle Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R. Two-echelon vehicle routing problem: A satellite location analysis. Procedia Soc. Behav. Sci. (2010) 2(3):5944–5955Crossref, Google Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R, Merz P, Hao JK. Multi-start heuristics for the two-echelon vehicle routing problem. Proc. 11th Eur. Conf. Evolutionary Comput. Combin. Optim. EvoCOP'11 (2011) (Springer-Verlag, Berlin) 179–190Crossref, Google Scholar
• Dror M, Trudeau P. Split delivery routing. Naval Res. Logist. (1990) 37:383–402Crossref, Google Scholar
• Feliu JG, Perboli G, Tadei R, Vigo D. The two-echelon capacitated vehicle routing problem. (2007) . Technical report DEIS OR.INGCE 2007/2(R), Department of Electronics, Computer Science, and Systems, University of Bologna, Bologna, ItalyGoogle Scholar
• Hemmelmayr VC, Cordeau J-F, Crainic TG. An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. (2012) 39(12):3215–3228Crossref, Google Scholar
• Jepsen M, Spoorendonk S, Ropke S. A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transportation Sci. (2013) 47(1):23–37Link, Google Scholar
• Laporte G, Norbert Y, Arpin D. An exact algorithm for solving a capacitated location-routing problem. Ann. Oper. Res. (1986) 6(9):291–310Crossref, Google Scholar
• Nguyen V, Prins C, Prodhon C. A multi-start evolutionary local search for the two-echelon location routing problem. Hybrid Metaheuristics (2010) 6373(Springer, Berlin) 88–102Lecture Notes in Computer ScienceCrossref, Google Scholar
• Perboli G, Tadei R, Masoero F. New families of valid inequalities for the two-echelon vehicle routing problem. Electronic Notes Discrete Math. (2010) 36:639–646Crossref, Google Scholar
• Perboli G, Tadei R, Vigo D. The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Sci. (2011) 45(3):364–380Link, Google Scholar
• Tan KC, Chew YH, Lee LH. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur. J. Oper. Res. (2006) 172(3):855–885Crossref, Google Scholar