A hybrid search method for the vehicle routing problem with time windows

DOI10.1007/S10479-008-0487-YzbMath1202.90057OpenAlexW2073588680WikidataQ56619957 ScholiaQ56619957MaRDI QIDQ613770

Germano Crispim Vasconcelos, Humberto César Brandão de Oliveira

Publication date: 22 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0487-y

zbMATH Keywords

optimizationhybrid systemssimulated annealingvehicle routing problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (2)

A time-based pheromone approach for the ant system ⋮ A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking

Uses Software

• SINTEF
• AS 181

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• Tabu search heuristics for the vehicle routing problem with time windows.
• A multi-start local search algorithm for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• The Truck Dispatching Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Introduction to evolutionary computing

This page was built for publication: A hybrid search method for the vehicle routing problem with time windows