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 条

[21] General Heuristics Algorithms for Solving Capacitated Arc Routing Problem
Fadzli, Mohammad
Najwa, Nurul
Masran, Hafiz
INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2014 (ICOMEIA 2014), 2015, 1660
[22] Approximation algorithms for solving the constrained arc routing problem in mixed graphs
Ding, Honglin
Li, Jianping
Lih, Ko-Wei
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (01) : 80 - 88
[23] Solving the Team Orienteering Arc Routing Problem with a column generation approach
Riera-Ledesma, Jorge
Jose Salazar-Gonzalez, Juan
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (01) : 14 - 27
[24] Solving an Arc-Routing Problem Using Artificial Ants with a Graph Transformation
Perez-Delgado, Maria-Luisa
ADVANCES IN PRACTICAL APPLICATIONS OF AGENTS AND MULTIAGENT SYSTEMS, 2010, 70 : 241 - 246
[25] The rescheduling arc routing problem
Monroy-Licht, Marcela
Alberto Amaya, Ciro
Langevin, Andre
Rousseau, Louis-Martin
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (06) : 1325 - 1346
[26] The Generalized Arc Routing Problem
Araoz, Julian
Fernandez, Elena
Franquesa, Carles
TOP, 2017, 25 (03) : 497 - 525
[27] The Generalized Arc Routing Problem
Julián Aráoz
Elena Fernández
Carles Franquesa
TOP, 2017, 25 : 497 - 525
[28] On solving close enough orienteering problems with overlapped neighborhoods
Qian, Qiuchen
Wang, Yanran
Boyle, David
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (02) : 369 - 387
[29] Modeling and solving the non-smooth arc routing problem with realistic soft constraints
de Armas, Jesica
Ferrer, Albert
Juan, Angel A.
Lalla-Ruiz, Eduardo
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 98 : 205 - 220
[30] SIM-RANDSHARP: A HYBRID ALGORITHM FOR SOLVING THE ARC ROUTING PROBLEM WITH STOCHASTIC DEMANDS
Gonzalez, Sergio
Riera, Daniel
Juan, Angel A.
Elizondo, Monica G.
Fonseca, Pau
2012 WINTER SIMULATION CONFERENCE (WSC), 2012,

← 1 2 3 4 5 →