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 条
  • [1] The stochastic close-enough arc routing problem
    Renaud, Alexandre
    Absi, Nabil
    Feillet, Dominique
    NETWORKS, 2017, 69 (02) : 205 - 221
  • [2] The Profitable Close-Enough Arc Routing Problem
    Bianchessi, Nicola
    Corberan, Angel
    Plana, Isaac
    Reula, Miguel
    Sanchis, Jose M.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 140
  • [3] Heuristics for the Profitable Close-Enough Arc Routing Problem
    Reula, Miguel
    Marti, Rafael
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 230
  • [4] The min-max close-enough arc routing problem
    Bianchessi, Nicola
    Corberan, Angel
    Plana, Isaac
    Reula, Miguel
    Sanchis, Jose M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (03) : 837 - 851
  • [5] A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
    Ángel Corberán
    Isaac Plana
    Miguel Reula
    José M. Sanchis
    TOP, 2019, 27 : 312 - 326
  • [6] A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
    Corberan, Angel
    Plana, Isaac
    Reula, Miguel
    Sanchis, Jose M.
    TOP, 2019, 27 (02) : 312 - 326
  • [7] VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem
    Reula, Miguel
    Parreno-Torres, Consuelo
    Martinez-Gavara, Anna
    Marti, Rafael
    METAHEURISTICS, MIC 2024, PT I, 2024, 14753 : 103 - 109
  • [8] On the Distance-Constrained Close Enough Arc Routing Problem
    Corberan, Angel
    Plana, Isaac
    Reula, Miguel
    Sanchis, Jose M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (01) : 32 - 51
  • [9] Close-Enough Facility Location
    Moya-Martinez, Alejandro
    Landete, Mercedes
    Monge, Juan Francisco
    MATHEMATICS, 2021, 9 (06)
  • [10] An effective memetic algorithm for the close-enough traveling salesman problem
    Lei, Zhenyu
    Hao, Jin-Kao
    APPLIED SOFT COMPUTING, 2024, 153
12345