Evolutionary algorithms for the vehicle routing problem with time windows

被引：78

作者：

Bräysy, O

Dullaert, W

Gendreau, M

机构：

[1] SINTEF, ICT, Dept Optimizat, N-0314 Oslo, Norway

[2] Inst Transport & Maritime Management Antwerp, B-2000 Antwerp, Belgium

[3] Univ Montreal, Ctr Rech Transportat, Montreal, PQ H3C 3J7, Canada

来源：

JOURNAL OF HEURISTICS | 2004年 / 10卷 / 06期

基金：

加拿大自然科学与工程研究理事会;

关键词：

evolutionary algorithms; genetic algorithms; vehicle routing; transportation;

D O I：

10.1007/s10732-005-5431-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 most 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.

引用

页码：587 / 611

页数：25

共 107 条

[61]

LARSEN J, 1999, THESIS I MATH MODELL

[62]

LAU HC, 1999, COLLABORATIVE MODEL

[63] A cooperative parallel meta-heuristic for the vehicle routing problem with time windows [J].