The periodic capacitated arc routing problem with irregular services

被引：23
|
作者：
Monroy, I. M. [1 ,2 ,3 ]
Amaya, C. A. [1 ]
Langevin, A. [2 ,3 ]
机构：
[1] Univ Los Andes, Dept Ingn Ind, Bogota, Colombia
[2] Ecole Polytech Montreal, Dept Math & Genie Ind, Montreal, PQ H3C 3A7, Canada
[3] Ctr Rech Reseaux Entreprises Logist & Transport C, Montreal, PQ, Canada
来源：
DISCRETE APPLIED MATHEMATICS | 2013年 / 161卷 / 4-5期
关键词：
Periodic arc routing problem; Matheuristics; SEARCH; ALGORITHMS;
D O I：
10.1016/j.dam.2011.05.014
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The aim of this paper is to introduce the periodic capacitated arc routing problem with irregular services. Some applications can be found in road maintenance operations and road network surveillance. The problem consists of determining a set of routes to cover a given network over a time horizon. The roads must be serviced a number of times in sub-periods over the time horizon, according to a hierarchy of arc classes. We present a mathematical model and a heuristic solution approach. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：691 / 701
页数：11
相关论文
共 50 条
  • [21] An improved heuristic for the capacitated arc routing problem
    Santos, Luis
    Coutinho-Rodrigues, Joao
    Current, John R.
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) : 2632 - 2637
  • [22] The Periodic Capacitated Arc Routing Problem linear programming model, metaheuristic and lower bounds
    Feng Chu
    Nacima Labadi
    Christian Prins
    Journal of Systems Science and Systems Engineering, 2004, 13 (4) : 423 - 435
  • [23] Capacitated Arc Routing Problem in Uncertain Environments
    Mei, Yi
    Tang, Ke
    Yao, Xin
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [24] The periodic capacitated arc routing problem: Linear programming model, metaheuristic and lower bounds
    Chu, F
    Labadi, N
    Prins, C
    SERVICE SYSTEMS AND SERVICE MANAGEMENT - PROCEEDINGS OF ICSSSM '04, VOLS 1 AND 2, 2004, : 784 - 789
  • [25] THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL, METAHEURISTIC AND LOWER BOUNDS
    Nacima LABADI
    Christian PRINS
    Journal of Systems Science and Systems Engineering, 2004, (04) : 423 - 435
  • [26] Adaptive Large Neighborhood Search for the Periodic Capacitated Arc Routing Problem with Inventory Constraints
    Riquelme-Rodriguez, Juan-Pablo
    Langevin, Andre
    Gamache, Michel
    NETWORKS, 2014, 64 (02) : 125 - 139
  • [27] 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 - +
  • [28] AUGMENT INSERT ALGORITHMS FOR THE CAPACITATED ARC ROUTING PROBLEM
    PEARN, WL
    COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (02) : 189 - 198
  • [29] New lower bound for the capacitated arc routing problem
    Wohlk, Sanne
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3458 - 3472
  • [30] A hybrid metaheuristic approach for the capacitated arc routing problem
    Chen, Yuning
    Hao, Jin-Kao
    Glover, Fred
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (01) : 25 - 39
12345