Local search with annealing-like restarts to solve the VRPTW

DOI10.1016/S0377-2217(02)00486-1zbMath1023.90090MaRDI QIDQ1400662

Haibing Li, Andrew E. B. Lim

Publication date: 13 August 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

local searchroutingdiversificationintensificationvehicle routing problem with time windows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (8)

A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique ⋮ The tree representation for the pickup and delivery traveling salesman problem with LIFO loading ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Optimizing departure times in vehicle routes ⋮ Simulation on vehicle routing problems in logistics distribution

Uses Software

• VRP

Cites Work

• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Vehicle Routing with Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland
• 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
• Vehicle Routing with Time Windows: Two Optimization Algorithms
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Solving vehicle routing problems using constraint programming and metaheuristics
• Using constraint-based operators to solve the vehicle routing problem with time windows
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local search with annealing-like restarts to solve the VRPTW