A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots

References

• Augerat P, Belenguer JM, Benavent E, Corberán Á, Naddef D (1998) Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106(2–3):546–557.Crossref, Google Scholar
• Augerat P, Belenguer JM, Benavent E, Corberán Á, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical report RR-949-M, ARTEMIS-IMAG, Université Joseph Fourier, Grenoble, France.Google Scholar
• Baldacci R, Mingozzi A, Roberti R, Wolfler Calvo R (2013) An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61(2):298–314.Link, Google Scholar
• Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler-Calvo R (2011) A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38(6):931–941.Crossref, Google Scholar
• Benavent E, Martínez A (2013) Multi-depot multiple TSP: A polyhedral study and computational results. Ann. Oper. Res. 207(1): 7–25.Crossref, Google Scholar
• Caramia MC, Guerriero F (2010a) A heuristic approach for the truck and trailer routing problem. J. Oper. Res. Soc. 61(7):1168–1180.Crossref, Google Scholar
• Caramia MC, Guerriero F (2010b) A milk collection problem with incompatibility constraints. Interfaces 40(2):130–143.Link, Google Scholar
• Chao IM (2002) A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1):33–51.Crossref, Google Scholar
• Contardo C, Cordeau J-F, Gendron B (2013) A computational comparison of flow formulations for the capacitated location-routing problem. Discrete Optim. 10(4):263–295.Crossref, Google Scholar
• Contardo C, Hemmelmayr VC, Crainic TG (2012) Lower and upper bounds for the two-echelon capacitated location-routing problem. Comput. Oper. Res. 39(12):3185–3199.Crossref, Google Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R (2011) Multi-start heuristics for the two-echelon vehicle routing problem. Merz P, Hao JK, eds. Evolutionary Computation in Combinatorial Optimization, EvoCOP 2011, Vol. 6622. Lecture Notes Comput. Sci. (Springer, Berlin), 179–190.Crossref, Google Scholar
• Crainic TG, Mancini S, Perboli G, Tadei R (2013) GRASP with path relinking for the two-echelon vehicle routing problem. Di Gaspero L, Schaerf A, Stutzle T, eds. Advances in Metaheuristics, Vol. 53. Oper. Res./Comput. Sci. Interfaces Series (Springer, New York), 113–125.Crossref, Google Scholar
• Cuda R, Guastaroba G, Speranza M (2015) A survey on two-echelon routing problems. Comput. Oper. Res. 55:185–199.Crossref, Google Scholar
• Derigs U, Pullmann M, Vogel U (2013) Truck and trailer routing—Problems, heuristics and computational experience. Comput. Oper. Res. 40(2):536–546.Crossref, Google Scholar
• Drexl M (2007) On some generalized routing problems. Doctoral dissertation, Faculty of Business and Economics, Rheinisch-Westfaelische Technische Hochschule, Aachen University, Aachen, Germany.Google Scholar
• Drexl M (2011) Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. Revista Métodos Cuantitativos Econom. Empresa 12:5–38.Google Scholar
• Drexl M (2014) Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1): 119–133.Crossref, Google Scholar
• Fischetti M, Salazar-González JJ, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10(2):133–148.Link, Google Scholar
• Ghiani G, Laporte G (2000) A branch-and-cut algorithm for the undirected rural postman problem. Math. Programming 87(3): 467–481.Crossref, Google Scholar
• Gomory RE, Hu TC (1961) Multi-terminal network flows. J. Soc. Indust. Appl. Math. 9(4):551–556.Crossref, Google Scholar
• Gonzalez-Feliu J, Perboli G, Tadei R, Vigo D (2007) The two-echelon capacitated vehicle routing problem. Technical report DEIS OR.INGCE 2007/2(R), DEIS, Bologna, Italy.Google Scholar
• Hemmelmayr VC, Cordeau J-F, Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12): 3215–3228.Crossref, Google Scholar
• Hoff A (2012) Milk collection in western Norway using trucks and trailers. ODYSSEUS 2012, 5th Internat. Workshop Freight Transportation Logist., Mykonos, Greece, 180–183.Google Scholar
• Hoff A, Løkketangen A (2007) A tabu search approach for milk collection in western Norway using trucks and trailers. TRISTAN VI: Sixth Triennial Sympos. Transportation Anal., Phuket, Thailand.Google Scholar
• IBM-ILOG (2010) CPLEX 12.1. User’s Manual. ftp://public.dhe.ibm.com/software/websphere/ ilog/docs/optimization/cplex/ps_usrmancplex.pdf.Google Scholar
• Jepsen M, Spoorendonk S, Røpke S (2013) A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transportation Sci. 47(1):23–37.Link, Google Scholar
• Laporte G (2007) What you should know about the vehicle routing problem. Naval Res. Logist. 54(8):811–819.Crossref, Google Scholar
• Laporte G (2009) Fifty years of vehicle routing. Transportation Sci. 43(4):408–416.Link, Google Scholar
• Letchford AN, Reinelt G, Theis DO (2004) A faster exact separation algorithm for blossom inequalities. Nemhauser GL, Bienstock D, eds. Integer Programming and Combinatorial Optimization, Vol. 3064. Lecture Notes Comput. Sci. (Springer, Berlin), 196–205.Crossref, Google Scholar
• Lin SW, Yu VF, Chou SY (2009) Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput. Oper. Res. 36(5):1683–1692.Crossref, Google Scholar
• Lin SW, Yu VF, Chou SY (2010) A note on the truck and trailer routing problem. Expert Systems Appl. 37(1):899–903.Crossref, Google Scholar
• Lin SW, Yu VF, Lu CC (2011) A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Systems Appl. 38(12):15244–15252.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Sci. 45(3):364–380.Link, Google Scholar
• Pureza V, Morabito R, Reimann M (2012) Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW. Eur. J. Oper. Res. 218(3):636–647.Crossref, Google Scholar
• Ralphs TK (2003) Parallel branch and cut for capacitated vehicle routing. Parallel Comput. 29(5):607–629.Crossref, Google Scholar
• Santos FA, da Cunha AS, Mateus GR (2013) Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem. Optim. Lett. 7(7):1537–1547.Crossref, Google Scholar
• Scheuerer S (2006) A tabu search heuristic for the truck and trailer routing problem. Comput. Oper. Res. 33(4):894–909.Crossref, Google Scholar
• Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2009) GRASP/Evolutionary local search hybrids for a truck and trailer routing problem. VIII Metaheuristic Internat. Conf. (MIC 2009), Hamburg, Germany.Google Scholar
• Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2010) GRASP/VND and multistart evolutionary local search for the single truck and trailer routing problem with satellite depots. Engrg. Appl. Artificial Intelligence 23(5):780–794.Crossref, Google Scholar
• Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2011) A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38(9):1319–1334.Crossref, Google Scholar
• Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2013) A matheuristic for the truck and trailer routing problem. Eur. J. Oper. Res. 230(2):231–244.Crossref, Google Scholar