A genetic algorithm for the capacitated arc routing problem and its extensions

被引：0
|
作者：
Lacomme, P [1 ]
Prins, C [1 ]
Ramdane-Chérif, W [1 ]
机构：
[1] Univ Technol Troyes, Lab Ind Syst Optimizat, F-10010 Troyes, France
来源：
APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS | 2001年 / 2037卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The NP-hard Capacitated Arc Routing Problem (CARP) allows to model urban waste collection or road gritting, for instance. Exact algorithms are still limited to small problems and metaheuristics are required for large scale instances. The paper presents the first genetic algorithm (GA) published for the CARP. This hybrid GA tackles realistic extensions like mixed graphs or prohibited turns. It displays excellent results and outperforms the best metaheuristics published when applied to two standard sets of benchmarks: the average deviations to lower bounds are 0.24 % and 0.69 % respectively, a majority of instances are solved to optimality, and eight best known solutions are improved.
引用
收藏
页码：473 / 483
页数：11
相关论文
共 50 条
  • [21] A hybrid genetic algorithm for the capacitated vehicle routing problem
    Berger, J
    Barkaoui, M
    GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2003, PT I, PROCEEDINGS, 2003, 2723 : 646 - 656
  • [22] Applying Genetic Algorithm for Capacitated Vehicle Routing Problem
    Ren, Chunyu
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ELECTRONIC & MECHANICAL ENGINEERING AND INFORMATION TECHNOLOGY (EMEIT-2012), 2012, 23
  • [23] Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
    Ren, Chunyu
    SUSTAINABLE DEVELOPMENT OF URBAN INFRASTRUCTURE, PTS 1-3, 2013, 253-255 : 1459 - 1462
  • [24] Multiobjective Capacitated Arc Routing Problem
    Lacomme, P
    Prins, C
    Sevaux, M
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PROCEEDINGS, 2003, 2632 : 550 - 564
  • [25] The open capacitated arc routing problem
    Usberti, Fabio Luiz
    Franca, Paulo Morelato
    Morelato Franca, Andre Luiz
    COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) : 1543 - 1555
  • [26] Improved lower bounds and exact algorithm for the capacitated arc routing problem
    Enrico Bartolini
    Jean-François Cordeau
    Gilbert Laporte
    Mathematical Programming, 2013, 137 : 409 - 452
  • [27] Improved lower bounds and exact algorithm for the capacitated arc routing problem
    Bartolini, Enrico
    Cordeau, Jean-Francois
    Laporte, Gilbert
    MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) : 409 - 452
  • [28] A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem
    Martinelli, Rafael
    Pecin, Diego
    Poggi, Marcus
    Longo, Humberto
    EXPERIMENTAL ALGORITHMS, 2011, 6630 : 315 - +
  • [29] Memetic algorithm with route decomposing for periodic capacitated arc routing problem
    Zhang, Yuzhou
    Mei, Yi
    Tang, Ke
    Jiang, Keqin
    APPLIED SOFT COMPUTING, 2017, 52 : 1130 - 1142
  • [30] Memetic Algorithm with adaptive Local Search for Capacitated Arc Routing Problem
    Yao, Tingting
    Yao, Xin
    Han, Shuangshuang
    Wang, Yingchun
    Cao, Dongpu
    Wang, Feiyue
    2017 IEEE 20TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2017,
12345