loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Minh Hoang Ha 1 ; Nathalie Bostel 2 ; André Langevin 3 and Louis-Martin Rousseau 3

Affiliations: 1 École Polytechnique de Montréal and IRCCyN, Canada ; 2 IRCCyN, France ; 3 École Polytechnique de Montréal, Canada

ISBN: 978-989-8425-97-3

Keyword(s): Close enough traveling salesman problem, Automated meter reading, Radio frequency identification, Cutting planes.

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; e-Business ; Enterprise Information Systems ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Logistics ; Methodologies and Technologies ; Operational Research ; Optimization ; OR in Transportation ; Pattern Recognition ; Routing ; Software Engineering ; Symbolic Systems

Abstract: In this paper, we consider a problem still seldom studied in the literature, the Close Enough Traveling Salesman problem with covering constraints on the arcs. This problem arises in the context of utility companies that use automated meter reading (AMR) with radio frequency identification (RFID) technology to read meters from a distance. The contribution of this paper is to introduce a new mathematical formulation and to propose a first exact algorithm for this problem. Computational results show that our algorithm is capable of solving to optimality instances of realistic size, such as those introduced in (Golden et al., 2008), with 1000 arcs and 9000 customers in less than 2 hours.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.201.121.213

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Hoang Ha, M.; Bostel, N.; Langevin, A. and Rousseau, L. (2012). AN EXACT ALGORITHM FOR THE CLOSE ENOUGH TRAVELING SALESMAN PROBLEM WITH ARC COVERING CONSTRAINTS.In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8425-97-3, pages 233-238. DOI: 10.5220/0003698702330238

@conference{icores12,
author={Minh Hoang Ha. and Nathalie Bostel. and André Langevin. and Louis{-}Martin Rousseau.},
title={AN EXACT ALGORITHM FOR THE CLOSE ENOUGH TRAVELING SALESMAN PROBLEM WITH ARC COVERING CONSTRAINTS},
booktitle={Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2012},
pages={233-238},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003698702330238},
isbn={978-989-8425-97-3},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - AN EXACT ALGORITHM FOR THE CLOSE ENOUGH TRAVELING SALESMAN PROBLEM WITH ARC COVERING CONSTRAINTS
SN - 978-989-8425-97-3
AU - Hoang Ha, M.
AU - Bostel, N.
AU - Langevin, A.
AU - Rousseau, L.
PY - 2012
SP - 233
EP - 238
DO - 10.5220/0003698702330238

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.