Solving the Close-Enough Arc Routing Problem

被引：23
|
作者：
Minh Hoang Ha [1 ,2 ,3 ,4 ]
Bostel, Nathalie [5 ,6 ]
Langevin, Andre [3 ,4 ]
Rousseau, Louis-Martin [3 ,4 ]
机构：
[1] LUNAM Univ, IRCCyN, F-44307 Nantes 3, France
[2] Ecole Mines Nantes, IRCCyN, F-44307 Nantes 3, France
[3] Ecole Polytech, Dept Math & Ind Engn, Montreal, PQ H3C 3A7, Canada
[4] Ecole Polytech, CIRRELT, Montreal, PQ H3C 3A7, Canada
[5] LUNAM Univ, IRCCyN, F-44606 St Nazaire, France
[6] Univ Nantes, F-44606 St Nazaire, France
来源：
NETWORKS | 2014年 / 63卷 / 01期
关键词：
close-enough arc routing problem; close-enough traveling salesman problem; automated meter reading; radio frequency identification; branch-and-cut algorithm; ALGORITHM; HEURISTICS;
D O I：
10.1002/net.21525
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The close-enough arc routing problem has an interesting real-life application to routing for meter reading. In this article, we propose a new mathematical formulation for this problem. We analyze our formulation and compare it with two formulations in the literature. We also develop branch-and-cut algorithms to solve the problem to optimality. We present computational results for instances based on three types of graphs: directed, undirected, and mixed. Copyright (c) 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 107-118 2014
引用
收藏
页码：107 / 118
页数：12
相关论文
共 50 条
  • [31] The generalized close enough traveling salesman problem
    Di Placido, Andrea
    Archetti, Claudia
    Cerrone, Carmine
    Golden, Bruce
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 310 (03) : 974 - 991
  • [32] On Close Enough Orienteering Problem with Dubins Vehicle
    Faigl, Jan
    Penicka, Robert
    2017 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2017, : 5646 - 5652
  • [33] Solving arc routing problems with turn penalties
    Clossey, J
    Laporte, G
    Soriano, P
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (04) : 433 - 439
  • [34] A vulnerability-based vehicle routing approach for solving capacitated arc routing problem in urban snow plowing operations
    Jin, Lei
    Lin, Sixiang
    Xie, Binglei
    Liu, Lin
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2020, 18 (01) : 166 - 181
  • [35] When close enough is close enough
    Scheinerman, ER
    AMERICAN MATHEMATICAL MONTHLY, 2000, 107 (06): : 489 - 499
  • [36] Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
    Martin, Xabier A.
    Panadero, Javier
    Peidro, David
    Perez-Bernabeu, Elena
    Juan, Angel A. A.
    NETWORKS, 2023, 82 (04) : 318 - 335
  • [37] Knowledge Transfer Genetic Programming With Auxiliary Population for Solving Uncertain Capacitated Arc Routing Problem
    Ardeh, Mazhar Ansari
    Mei, Yi
    Zhang, Mengjie
    Yao, Xin
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (02) : 311 - 325
  • [38] A Partitioning Algorithm for Solving Capacitated Arc Routing Problem in Ways of Ranking First Cutting Second
    Zhang, Wei
    Xing, Lining
    Xi, Ting
    He, Lei
    Liu, Jinyuan
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, KSEM 2015, 2015, 9403 : 732 - 737
  • [39] Multiobjective Capacitated Arc Routing Problem
    Lacomme, P
    Prins, C
    Sevaux, M
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PROCEEDINGS, 2003, 2632 : 550 - 564
  • [40] The arc routing and scheduling problem with transshipment
    De Rosa, B
    Improta, G
    Ghiani, G
    Musmanno, R
    TRANSPORTATION SCIENCE, 2002, 36 (03) : 301 - 313
12345