COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM

DOI10.1142/S1469026804001136zbMath1097.90593OpenAlexW1970401431MaRDI QIDQ3022133

Clemente Rodriguez, Olatz Arbelaitz

Publication date: 22 June 2005

Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1469026804001136

zbMATH Keywords

Simulated AnnealingEvolutionary searchVehicle Routing ProblemsTime Windows.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A bi-criteria heuristic for the vehicle routing problem with time windows
• A parallel algorithm for the vehicle routing problem with time window constraints
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows