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 条

[41] The target visitation arc routing problem
Jessica Rodríguez-Pereira
Gilbert Laporte
TOP, 2022, 30 : 60 - 76
[42] The open capacitated arc routing problem
Usberti, Fabio Luiz
Franca, Paulo Morelato
Morelato Franca, Andre Luiz
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) : 1543 - 1555
[43] On the Collaboration Uncapacitated Arc Routing Problem
Fernandez, Elena
Fontana, Dario
Grazia Speranza, M.
COMPUTERS & OPERATIONS RESEARCH, 2016, 67 : 120 - 131
[44] The target visitation arc routing problem
Rodriguez-Pereira, Jessica
Laporte, Gilbert
TOP, 2022, 30 (01) : 60 - 76
[45] The Team Orienteering Arc Routing Problem
Archetti, Claudia
Speranza, M. Grazia
Corberan, Angel
Sanchis, Jose M.
Plana, Isaac
TRANSPORTATION SCIENCE, 2014, 48 (03) : 442 - 457
[46] THE ARC ORIENTED LOCATION ROUTING PROBLEM
LEVY, L
INFOR, 1989, 27 (01) : 74 - 94
[47] Extending and Solving the Refrigerated Routing Problem
Ceschia, Sara
Di Gaspero, Luca
Meneghetti, Antonella
ENERGIES, 2020, 13 (23)
[48] Solving location and routing problem for UAVs
Yakici, Ertan
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 102 : 294 - 301
[49] Solving the Vehicle Routing Problem on GPU
Benaini, Abdelhamid
Berrajaa, Achraf
Daoudi, El Mostafa
PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION & COMMUNICATION TECHNOLOGIES 2015 (MEDCT 2015), VOL 2, 2016, 381 : 239 - 248
[50] Heuristic and Exact Approach for the Close Enough Ridematching Problem
Balardino, Allan F.
Santos, Andre G.
HYBRID INTELLIGENT SYSTEMS, HIS 2015, 2016, 420 : 281 - 293

← 1 2 3 4 5 →