Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

Authors:
Olli Bräysy;Wout Dullaert;Michel Gendreau
Affiliations:
Department of Optimization, SINTEF ICT, Oslo, Norway;Institute of Transport and Maritime Management Antwerp, Belgium B-2000;Center for Research on Transportation, University of Montreal, Canada H3C 3J7
Venue:
Journal of Heuristics
Year:
2004

Citing 0
Cited 18

PSO-based algorithm for home care worker scheduling in the UK

Computers and Industrial Engineering
Integrated production and distribution planning for single-period inventory products

International Journal of Computer Integrated Manufacturing
Randomized adaptive spatial decoupling for large-scale vehicle routing with time windows

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows

IEEE Transactions on Evolutionary Computation
A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Balanced K-means algorithm for partitioning areas in large-scale vehicle routing problem

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows

Computers and Operations Research
Optimizing delivery time in multi-objective vehicle routing problems with time windows

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
A-plan: integrating interactive visualization with automated planning for cooperative resource scheduling

i-KNOW '11 Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies
An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model

Journal of Intelligent Manufacturing
Localized genetic algorithm for vehicle routing problem with time windows

Applied Soft Computing
A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows

ICCL'11 Proceedings of the Second international conference on Computational logistics
A genetic algorithm for the simultaneous delivery and pickup problems with time window

Computers and Industrial Engineering
A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
A simulated annealing heuristic for the truck and trailer routing problem with time windows

Expert Systems with Applications: An International Journal
High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows

Journal of Mathematical Modelling and Algorithms
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

Operations Research
A two-pheromone trail ant colony system--tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval. All routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. The main types of evolutionary algorithms for the VRPTW are genetic algorithms and evolution strategies. In addition to describing the basic features of each method, experimental results for the benchmark test problems of Solomon (1987) and Gehring and Homberger (1999) are presented and analyzed.