Applying an Intensification Strategy on Vehicle Routing Problem

DOI10.1007/978-3-540-85640-5_6zbMath1187.90061OpenAlexW9732225MaRDI QIDQ3564531

Arthur Tórgo Gómez, Etiene P. L. Simas

Publication date: 2 June 2010

Published in: Informatics in Control, Automation and Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85640-5_6

zbMATH Keywords

tabu searchvehicle routing problemintensification strategy

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Implementation techniques for the vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• A tabu search algorithm for the vehicle routing problem
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• Metaheuristics: A bibliography
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A Subpath Ejection Method for the Vehicle Routing Problem
• Tabu Search—Part I
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A guide to vehicle routing heuristics
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem