The periodic capacitated arc routing problem with irregular services

被引：24
|
作者：
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 条
  • [31] Route Stability in the Uncertain Capacitated Arc Routing Problem
    Liu, Yuxin
    Wang, Jiaxin
    Zhao, Jingjie
    Li, Xianghua
    FRONTIERS IN ENERGY RESEARCH, 2022, 10
  • [32] NEW LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
    PEARN, WL
    NETWORKS, 1988, 18 (03) : 181 - 191
  • [33] The capacitated arc routing problem: Valid inequalities and facets
    Belenguer, JM
    Benavent, E
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 10 (02) : 165 - 187
  • [34] The Capacitated Arc Routing Problem: Valid Inequalities and Facets
    J.M. Belenguer
    E. Benavent
    Computational Optimization and Applications, 1998, 10 : 165 - 187
  • [35] A cutting plane algorithm for the capacitated arc routing problem
    Belenguer, JM
    Benavent, E
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) : 705 - 728
  • [36] A Global Repair Operator for Capacitated Arc Routing Problem
    Mei, Yi
    Tang, Ke
    Yao, Xin
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (03): : 723 - 734
  • [37] THE FLEET SIZE AND MIX PROBLEM FOR CAPACITATED ARC ROUTING
    ULUSOY, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (03) : 329 - 337
  • [38] A memetic algorithm for the open capacitated arc routing problem
    Fung, Richard Y. K.
    Liu, Ran
    Jiang, Zhibin
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2013, 50 : 53 - 67
  • [39] 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
  • [40] A tabu search heuristic for the capacitated arc routing problem
    Hertz, A
    Laporte, G
    Mittaz, M
    OPERATIONS RESEARCH, 2000, 48 (01) : 129 - 135
12345