A Partitioning Algorithm for Solving Capacitated Arc Routing Problem in Ways of Ranking First Cutting Second

被引:0
|
作者
Zhang, Wei [1 ]
Xing, Lining [1 ]
Xi, Ting [1 ]
He, Lei [1 ]
Liu, Jinyuan [1 ]
机构
[1] Natl Univ Def Technol, Coll Informat Syst & Management, Changsha 410073, Hunan, Peoples R China
关键词
Partitioning algorithm; Capacitated arc routing problem; Ranking first cutting second; SEARCH;
D O I
10.1007/978-3-319-25159-2_67
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Capacitated Arc Routing Problem (CARP) is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second (RFCS) could be used. This research proposed a novel partitioning algorithm - the Multi-Label algorithm which obtained better TSP paths meeting the backpack limit on the basis of a complete TSP return. In addition, by experimental verification on questions in the standard question database, the experimental results showed that compared with general partitioning algorithms, for the same complete TSP return, many TSP paths with the shortest total length could be obtained by the Multi-Label algorithm.
引用
收藏
页码:732 / 737
页数:6
相关论文
共 50 条
  • [41] Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm
    Faulin, J.
    Garcia del Valle, A.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (12) : 1685 - 1695
  • [42] Solving Capacitated Vehicle Routing Problem Based on Improved Genetic Algorithm
    Wang Jie-sheng
    Liu Chang
    Zhang Ying
    [J]. 2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, 2011, : 60 - 64
  • [43] Solving capacitated vehicle routing problem by artificial bee colony algorithm
    Gomez, Alberto
    Salhi, Said
    [J]. 2014 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS), 2014, : 48 - 52
  • [44] A Meta-Genetic Algorithm for Solving the Capacitated Vehicle Routing Problem
    Wink, Stefan
    Back, Thomas
    Emmerich, Michael
    [J]. 2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [45] Randomized heuristics for capacitated arc routing problem
    Pelikan, Jan
    [J]. MATHEMATICAL METHODS IN ECONOMICS (MME 2014), 2014, : 772 - 776
  • [46] Heuristics for the periodic capacitated arc routing problem
    Chu, F
    Labadi, N
    Prins, C
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2005, 16 (02) : 243 - 251
  • [47] Heuristics for the periodic capacitated arc routing problem
    Feng Chu
    Nacima Labadi
    Christian Prins
    [J]. Journal of Intelligent Manufacturing, 2005, 16 : 243 - 251
  • [48] THE CAPACITATED ARC ROUTING PROBLEM - LOWER BOUNDS
    BENAVENT, E
    CAMPOS, V
    CORBERAN, A
    MOTA, E
    [J]. NETWORKS, 1992, 22 (07) : 669 - 690
  • [49] The undirected capacitated arc routing problem with profits
    Archetti, Claudia
    Feillet, Dominique
    Hertz, Alain
    Speranza, M. Grazia
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1860 - 1869
  • [50] The capacitated arc routing problem with intermediate facilities
    Ghiani, G
    Improta, G
    Laporte, G
    [J]. NETWORKS, 2001, 37 (03) : 134 - 143