A genetic algorithm for vehicle routing with backhauling

被引：68

作者：

Potvin, JY

Duhamel, C

Guertin, F

机构：

[1] UNIV MONTREAL,DEPT INFORMAT & RECH OPERAT,MONTREAL,PQ H3C 3J7,CANADA

[2] ISIMA,LAB INFORMAT & MODELISAT SYST,F-63173 CLERMONT FERRAN,FRANCE

来源：

APPLIED INTELLIGENCE | 1996年 / 6卷 / 04期

关键词：

vehicle routing; backhauling; time windows; genetic algorithms; heuristics;

D O I：

10.1007/BF00132738

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, a greedy route construction heuristic for a vehicle routing problem with backhauling is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of customers. Then, a genetic algorithm is used to identify an ordering that produces good routes. Numerical comparisons are provided with an exact algorithm and with other heuristic approaches.

引用

页码：345 / 355

页数：11

共 20 条

[1] [Anonymous], 1987, P 2 INT C GEN ALG
[2] [Anonymous], 1991, Handbook of genetic algorithms
[3] Baker J. E., 1985, Proceedings of the International Conference on Genetic Algorithms and their Applications, P101
[4] Baker J.E., 1987, 2ND P INT C GEN ALG, P14
[5] BLANTON JL, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P452
[6] Casco DO, 1988, Vehicle Routing: Methods and Studies, V16, P127
[7] DAVIS L, 1985, 9TH INT JOINT C ART, P162
[8] Deif I., 1984, P BABS C SOFTW US TR, P75
[9] A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS
DESROCHERS, M
DESROSIERS, J
SOLOMON, M
[J]. OPERATIONS RESEARCH, 1992, 40 (02) : 342 - 354
[10] Eshelman L. J., 1991, FDN GENETIC ALGORITH, V1, P265, DOI DOI 10.1016/B978-0-08-050684-5.50020-3

← 1 2 →