Local search with annealing-like restarts to solve the vehicle routing problem with time windows

Authors:
Haibing Li;Andrew Lim
Affiliations:
National University of Singapore, Singapore, 117543;National University of Singapore, Singapore, 117543
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 7
Cited 2

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Vehicle routing with time windows

Operations Research
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
VRP with Time Windows

The vehicle routing problem
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

Journal of Heuristics
A Metaheuristic for the Pickup and Delivery Problem with Time Windows

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence

Manpower scheduling with time windows

Proceedings of the 2003 ACM symposium on Applied computing
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a metaheuristic based on annealing-like restarts to diversify and intensify local searches for solving the vehicle routing problem with time windows (VRPTW). Using the Solomon's benchmark instances for the problem, our method obtained 7 new best results and equaled 19 other best results. Extensive comparisons indicate that our method is comparable to the best published literatures.