A new hybrid genetic algorithm for the capacitated vehicle routing problem

被引：51

作者：

Berger, J ^{[1
]}

Barkaoui, M ^{[1
]}

机构：

[1] Def Res & Dev Canada, Val Belair, PQ G3J 1X5, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2003年 / 54卷 / 12期

关键词：

vehicle routing problems; heuristics;

D O I：

10.1057/palgrave.jors.2601635

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Recently proved successful for variants of the vehicle routing problem (VRP) involving time windows, genetic algorithms have not yet shown to compete or challenge current best search techniques in solving the classical capacitated VRP. A new hybrid genetic algorithm to address the capacitated VRP is proposed. The basic scheme consists in concurrently evolving two populations of solutions to minimize total travelled distance using genetic operators combining variations of key concepts inspired from routing techniques and search strategies used for a time variant of the problem to further provide search guidance while balancing intensification and diversification. Results from a computational experiment over common benchmark problems report the proposed approach to be very competitive with the best-known methods.

引用

页码：1254 / 1262

页数：9