The rescheduling arc routing problem

被引：17
|
作者：
Monroy-Licht, Marcela [1 ,2 ]
Alberto Amaya, Ciro [3 ]
Langevin, Andre [1 ,2 ]
Rousseau, Louis-Martin [1 ,2 ]
机构：
[1] Ecole Polytech Montreal, Dept Mathemat & Genie Ind, Montreal, PQ, Canada
[2] CIRRELT, Montreal, PQ, Canada
[3] Univ Los Andes, Dept Ingn Ind, Bogota, Colombia
来源：
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2017年 / 24卷 / 06期
关键词：
rescheduling; disruption schedule costs; mixed-integer programming; arc routing problem; VEHICLE; CONSTRAINTS; ALGORITHMS;
D O I：
10.1111/itor.12346
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, the rescheduling arc routing problem is introduced. This is a dynamic routing and scheduling problem that considers adjustments to an initial routing itinerary when one or more vehicle failures occur during the execution stage and the original plan must be modified. We minimize the operational and schedule disruption costs. Formulations based on mixed-integer programming are presented to compare different policies in the rerouting phase. A solution strategy is developed when both costs are evaluated and it is necessary to find a solution quickly. Computational tests on a large set of instances compare the different decision-maker policies.
引用
收藏
页码：1325 / 1346
页数：22
相关论文
共 50 条
  • [41] Lower bounds for the mixed capacitated arc routing problem
    Gouveia, Luis
    Mourao, Maria Candida
    Pinto, Leonor Santiago
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (04) : 692 - 699
  • [42] Reformulation and Metaheuristic for the Team Orienteering Arc Routing Problem
    Ke, Liangjun
    Yang, Weibo
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT II, 2017, 10386 : 494 - 501
  • [43] An Evolutionary Approach to the Multidepot Capacitated Arc Routing Problem
    Xing, Lining
    Rohlfshagen, Philipp
    Chen, Yingwu
    Yao, Xin
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (03) : 356 - 374
  • [44] Improved Memetic Algorithm for Capacitated Arc Routing Problem
    Mei, Yi
    Tang, Ke
    Yao, Xin
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 1699 - +
  • [45] AUGMENT INSERT ALGORITHMS FOR THE CAPACITATED ARC ROUTING PROBLEM
    PEARN, WL
    COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (02) : 189 - 198
  • [46] The periodic capacitated arc routing problem with irregular services
    Monroy, I. M.
    Amaya, C. A.
    Langevin, A.
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (4-5) : 691 - 701
  • [47] Solving the Close-Enough Arc Routing Problem
    Minh Hoang Ha
    Bostel, Nathalie
    Langevin, Andre
    Rousseau, Louis-Martin
    NETWORKS, 2014, 63 (01) : 107 - 118
  • [48] The Profitable Close-Enough Arc Routing Problem
    Bianchessi, Nicola
    Corberan, Angel
    Plana, Isaac
    Reula, Miguel
    Sanchis, Jose M.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 140
  • [49] A PARALLEL INSERT METHOD FOR THE CAPACITATED ARC ROUTING PROBLEM
    CHAPLEAU, L
    FERLAND, JA
    LAPALME, G
    ROUSSEAU, JM
    OPERATIONS RESEARCH LETTERS, 1984, 3 (02) : 95 - 99
  • [50] An arc interdiction vehicle routing problem with information asymmetry
    Bidgoli, Masume Messi
    Kheirkhah, AmirSaman
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 115 : 520 - 531
12345