Active-guided evolution strategies for large-scale capacitated vehicle routing problems

被引:122
作者
Mester, David [1 ]
Braysy, Olli
机构
[1] Univ Haifa, Inst Evolut, Math & Populat Genet Lab, IL-31905 Haifa, Israel
[2] Univ Jyvaskyla, Agora Ctr, Agora Innoroad Lab, FI-40014 Jyvaskyla, Finland
关键词
vehicle routing; heuristics; evolution strategies; guided local search;
D O I
10.1016/j.cor.2005.11.006
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We present an adaptation of the active-guided evolution strategies metaheuristic for the capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical problem in operations research in which a set of minimum total cost routes must be determined for a fleet of identical capacitated vehicles in order to service a number of demand or supply points. The applied metaheuristic combines the strengths of the well-known guided local search and evolution strategies metaheuristics into an iterative two-stage procedure. The computational experiments were carried out on a set of 76 benchmark problems. The results demonstrate that the suggested method is highly competitive, providing the best-known solutions to 70 test instances. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2964 / 2975
页数:12
相关论文
共 33 条
[1]   A two-stage hybrid local search for the vehicle routing problem with time windows [J].
Bent, R ;
Van Hentenryck, P .
TRANSPORTATION SCIENCE, 2004, 38 (04) :515-530
[2]  
Bramel J, 2002, SIAM MONOG DISCR MAT, P85
[3]  
Christofides N., 1979, Combinatorial optimization, P315
[4]  
Cordeau J. - F., 2005, NEW HEURISTICS VEHIC, P279
[5]  
Cordeau JF, 2002, J OPER RES SOC, V53, P512, DOI [10.1057/palgrave/jors/2601319, 10.1057/palgrave.jors.2601319]
[6]  
DONGARRA J, 2005, CS8985 U TENN DEP CO
[7]   THE TRAVELING-SALESMAN PROBLEM [J].
FLOOD, MM .
OPERATIONS RESEARCH, 1956, 4 (01) :61-75
[8]  
Gehring H., 1999, PROC EUROGEN99, P57
[9]  
Gendreau M, 2002, SIAM MONOG DISCR MAT, P129
[10]  
Golden BL, 1998, FLEET MANAGEMENT AND LOGISTICS, P33