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
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.