New large-scale data instances for CARP and new variations of CARP

被引:20
作者
Kiilerich, Lone [1 ]
Wohlk, Sanne [1 ]
机构
[1] Aarhus Univ, Dept Econ & Business Econ, Cluster Operat Res & Logist, Aarhus, Denmark
关键词
Capacitated arc routing problem; waste collection; real-life benchmark instances; new variations; ARC-ROUTING PROBLEM; INTERMEDIATE FACILITIES; HEURISTIC METHODS; COLLECTION; ALGORITHM; SEARCH; BOUNDS;
D O I
10.1080/03155986.2017.1303960
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The capacitated arc routing problem (CARP) captures important aspects of real-life problems and has been studied extensively over the past two decades. Based on a waste collection project, we introduce a number of new CARP variations. We first present three multi-compartment CARP variations of different levels of complexity regarding compartments and where one incorporates a time horizon. We then present a variation that seeks to coordinate vehicles over a planning horizon such that the vehicles that collect different waste fractions from the same households do so on the same day of the week. Finally, the semi-periodic CARP takes into account that the households on a street, providing the demand of the edge, may not request waste collection at the same interval. We present large-scale instances both for the classical CARP and for the five new problems. The instances are based on real-life networks and waste data from five areas in Denmark and cover rural as well as urban areas. The largest instances contain more than 10,000 nodes. We give detailed information about the construction of the instances from the real-life data, and explain how they can be used to perform scenario analyses.
引用
收藏
页码:1 / 32
页数:32
相关论文
共 30 条
  • [1] The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries
    Amponsah, SK
    Salhi, S
    [J]. WASTE MANAGEMENT, 2004, 24 (07) : 711 - 721
  • [2] GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem
    Araoz, Julian
    Fernandez, Elena
    Franquesa, Carles
    [J]. JOURNAL OF HEURISTICS, 2013, 19 (02) : 343 - 371
  • [3] Solving an urban waste collection problem using ants heuristics
    Bautista, Joaquin
    Fernandez, Elena
    Pereira, Jordi
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) : 3020 - 3033
  • [4] Lower and upper bounds for the mixed capacitated arc routing problem
    Belenguer, Jose-Manuel
    Benavent, Enrique
    Lacomme, Philippe
    Prins, Christian
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3363 - 3383
  • [5] THE CAPACITATED ARC ROUTING PROBLEM - LOWER BOUNDS
    BENAVENT, E
    CAMPOS, V
    CORBERAN, A
    MOTA, E
    [J]. NETWORKS, 1992, 22 (07) : 669 - 690
  • [6] A deterministic tabu search algorithm for the capacitated arc routing problem
    Brandao, Jose
    Eglese, Richard
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) : 1112 - 1126
  • [7] The mixed capacitated arc routing problem with non-overlapping routes
    Constantino, Miguel
    Gouveia, Luis
    Mourao, Maria Candida
    Nunes, Ana Catarina
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (02) : 445 - 456
  • [8] Corberan A., 2015, Arc routing: problems, methods, and applications, V20
  • [9] The Windy Clustered Prize-Collecting Arc-Routing Problem
    Corberan, Angel
    Fernandez, Elena
    Franquesa, Carles
    Maria Sanchis, Jose
    [J]. TRANSPORTATION SCIENCE, 2011, 45 (03) : 317 - 334
  • [10] Coutinho-Rodrigues J., 1993, Belgian Journal of Operations Research, Statistics and Computer Science, V33, P2