A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
From MaRDI portal
Publication:4367064
DOI10.1287/trsc.31.1.49zbMath0888.90053OpenAlexW2149242966MaRDI QIDQ4367064
Jean-Yves Potvin, Jean-Marc Rousseau, Christophe Duhamel
Publication date: 25 November 1997
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.31.1.49
Related Items (16)
A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ Routing relatively few customers per route ⋮ Multi-ant colony system (MACS) for a vehicle routing problem with backhauls ⋮ A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations ⋮ A memetic algorithm for a vehicle routing problem with backhauls ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ Comparing backhauling strategies in vehicle routing using ant colony optimization ⋮ Vehicle routing problems with simultaneous pick-up and delivery service. ⋮ Adaptive memory programming: a unified view of metaheuristics ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service ⋮ Heuristic solutions to multi-depot location-routing problems ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ Metaheuristics in combinatorial optimization ⋮ Tabu search heuristics for the vehicle routing problem with time windows.
This page was built for publication: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
