Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows

Published Online:https://doi.org/10.1287/trsc.2017.0765

References

  • Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.LinkGoogle Scholar
  • Batsyn M, Ponomarenko A (2014) Heuristic for a real-life truck and trailer routing problem. Procedia Comput. Sci. 31:778–792.CrossrefGoogle Scholar
  • Belenguer J, Benavent E, Martínez A, Prins C, Prodhon C, Villegas J (2016) A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots. Transportation Sci. 50(2):735–749.LinkGoogle Scholar
  • Ben Amor H, Desrosiers J, Valério de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463.LinkGoogle Scholar
  • Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5):1167–1182.LinkGoogle Scholar
  • Bodin L, Levy L (2000) Scheduling of local delivery carrier routes for the United States Postal Service. Dror M, ed. Arc Routing: Theory, Solutions, and Applications (Kluwer, Boston), 419–442.CrossrefGoogle Scholar
  • Brønmo G, Christiansen M, Nygreen B (2007) Ship routing and scheduling with flexible cargo sizes. J. Oper. Res. Soc. 58(9):1167–1177.CrossrefGoogle Scholar
  • Caramia M, Guerriero F (2010a) A heuristic approach for the truck and trailer routing problem. J. Oper. Res. Soc. 61(7):1168–1180.CrossrefGoogle Scholar
  • Caramia M, Guerriero F (2010b) A milk collection problem with incompatibility constraints. Interfaces 40(2):130–143.LinkGoogle Scholar
  • Chao I (2002) A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1):33–51.CrossrefGoogle Scholar
  • Cuda R, Guastaroba G, Speranza M (2015) A survey on two-echelon routing problems. Comput. Oper. Res. 55:185–199.CrossrefGoogle Scholar
  • Derigs U, Pullmann M, Vogel U (2013) Truck and trailer routing—Problems, heuristics and computational experience. Comput. Oper. Res. 40(2):536–546.CrossrefGoogle Scholar
  • Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1):179–192.LinkGoogle Scholar
  • Desaulniers G, Errico F, Irnich S, Schneider M (2016) Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6):1388–1405.LinkGoogle Scholar
  • Drexl M (2011) Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. J. Quant. Methods Econom. Bus. Admin. 12:5–38.Google Scholar
  • Gerdessen J (1996) Vehicle routing problem with trailers. Eur. J. Oper. Res. 93(1):135–147.CrossrefGoogle Scholar
  • Gschwind T, Irnich S (2016) Dual inequalities for stabilized column generation revisited. INFORMS J. Comput. 28(1):175–194.LinkGoogle Scholar
  • Hennig F, Nygreen B, Lübbecke M (2012) Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery. Naval Res. Logist. 59(3–4):298–310.CrossrefGoogle Scholar
  • Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon M, eds. Column Generation (Springer, New York), 33–65.CrossrefGoogle 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.LinkGoogle Scholar
  • Lin S, Yu V, Lu C (2011) A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Systems Appl. 38(12):15244–15252.CrossrefGoogle Scholar
  • Lübbecke M, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.LinkGoogle Scholar
  • Mirmohammadsadeghi S, Ahmed S (2015) Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows. Networks Spatial Econom. 15(4):1093–1115.CrossrefGoogle Scholar
  • Parragh SN, Cordeau JF (2017) Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83:28–44.CrossrefGoogle Scholar
  • Pasha U, Hoff A, Løkketangen A (2014) A hybrid approach for milk collection using trucks and trailers. Ann. Management Sci. 3(1):87–110.CrossrefGoogle Scholar
  • Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3):255–273.CrossrefGoogle Scholar
  • Scheuerer S (2006) A tabu search heuristic for the truck and trailer routing problem. Comput. Oper. Res. 33(4):894–909.CrossrefGoogle Scholar
  • Semet F, Taillard E (1993) Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41(4):469–488.CrossrefGoogle Scholar
  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.LinkGoogle Scholar
  • Tan K, Chew Y, Lee L (2006) A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur. J. Oper. Res. 172(3):855–885.CrossrefGoogle Scholar
  • Tilk C, Bianchessi N, Drexl M, Irnich S, Meisel F (2018) Branch-and-price for the active-passive vehicle-routing problem. Transportation Sci. 52(2):300–319.LinkGoogle Scholar
  • Torres I, Cruz C, Verdegay JL (2015) Solving the truck and trailer routing problem with fuzzy constraints. Internat. J. Comput. Intelligence Systems 8(4):713–724.CrossrefGoogle Scholar
  • Tricoire F (2016) Private communication, June 10, 2016.Google Scholar
  • Villegas J, Prins C, Prodhon C, Medaglia A, Velasco N (2010) GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engrg. Appl. Artificial Intelligence 23(5):780–794.CrossrefGoogle Scholar
  • Villegas J, Prins C, Prodhon C, Medaglia A, Velasco N (2011) A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38(9):1319–1334.CrossrefGoogle Scholar
  • Villegas J, Prins C, Prodhon C, Medaglia A, Velasco N (2013) A matheuristic for the truck and trailer routing problem. Eur. J. Oper. Res. 230(2):231–244.CrossrefGoogle Scholar
  • Villeneuve D, Desaulniers G (2005) The shortest path problem with forbidden paths. Eur. J. Oper. Res. 165(1):97–107.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.