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

被引:120
|
作者
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
相关论文
共 50 条
  • [31] A Multi-GPU Parallel Genetic Algorithm For Large-Scale Vehicle Routing Problems
    Abdelatti, Marwan
    Sodhi, Manbir
    Sendag, Resit
    [J]. 2022 IEEE HIGH PERFORMANCE EXTREME COMPUTING VIRTUAL CONFERENCE (HPEC), 2022,
  • [32] The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
    Li, Feiyue
    Golden, Bruce
    Wasil, Edward
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 2918 - 2930
  • [33] Vehicle routing for medical supplies in large-scale emergencies
    Liu, Degang
    Han, Jiye
    Zhu, Hanming
    [J]. Optimization and Systems Biology, 2007, 7 : 412 - 419
  • [34] Guided Local Search with an Adaptive Neighbourhood Size Heuristic for Large Scale Vehicle Routing Problems
    Costa, Joao Guilherme Cavalcanti
    Mei, Yi
    Zhang, Mengjie
    [J]. PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 213 - 221
  • [35] Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs
    Diaby, M.
    Nsakanda, A. L.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (09) : 1100 - 1112
  • [36] Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
    Jesica de Armas
    Peter Keenan
    Angel A. Juan
    Seán McGarraghy
    [J]. Annals of Operations Research, 2019, 273 : 135 - 162
  • [37] Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
    de Armas, Jesica
    Keenan, Peter
    Juan, Angel A.
    McGarraghy, Sean
    [J]. ANNALS OF OPERATIONS RESEARCH, 2019, 273 (1-2) : 135 - 162
  • [38] A very large-scale neighborhood search approach to capacitated warehouse routing problem
    Geng, Y
    Li, YZ
    Lim, A
    [J]. ICTAI 2005: 17TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, : 58 - 65
  • [39] APPROXIMATE SOLUTIONS TO LARGE-SCALE CAPACITATED FACILITY LOCATION-PROBLEMS
    SHETTY, B
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 1990, 39 (02) : 159 - 175
  • [40] A Math-Hyper-Heuristic Approach for Large-Scale Vehicle Routing Problems with Time Windows
    Sabar, Nasser R.
    Zhang, Xiuzhen Jenny
    Song, Andy
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 830 - 837