Summary
The use of automated meter reading (AMR) with radio frequency identification (RFID) technology allows utility companies to read utility meters from a distance. Therefore, a utility company does not need to visit every customer. Rather, it must get within a certain radius of the customer in order to read the customer’s meter. This changes the problem for a meter reader from a traveling salesman problem (TSP) to a close enough TSP (CETSP) over a realistic street network. In this project, we teamed with RouteSmart Technologies, Inc., a leading logistics solution provider, to propose and implement several heuristic approaches that look promising for this new problem class. In particular, the solutions generated from the proposed heuristics are compared to solutions from a rural postman problem solver (where every customer must be visited) and the improvements are documented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Brotcorne, G. Laporte, F. Semet. Fast Heuristics for Large Scale Covering-Location Problems.Computers & Operations Research,29:651–665, 2002.
J.Dong, N.Yang, M.Chen. Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem,Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies, E. Baker, A. Joseph, A. Mehrotra, and M. Trick, eds, 145–163, Springer Verlag, 2007.
A. Dumitrescu, J. Mitchell. Approximation Algorithms for TSP with Neighborhoods in the Plane.Journal of Algorithms, 48:135–159, 2003.
S. Gavirneni, L. Clark, G. Pataki. Schlumberger Optimizes Receiver Location for Automated Meter Reading.Interfaces, 34:208–214, 2004.
M. Gendreau, G. Laporte, F. Semet. The Covering Tour Problem.Operations Research, 45:568–576, 1997.
D. Gulczynski, J. Heath, C. Price. The Close Enough TravelingSalesman Problem: A Discussion of Several Heuristics.Perspectives in Operations Research: Papers in Honor of Saul Gass’ 80th Birthday, F. Alt, M. Fu, and B. Golden, eds, 271–283, Springer Verlag, 2006.
G. Laporte, F. Semet, V. Dadeshidze, L. Olsson. A Tiling and Routing Heuristic for the Screening of Cytological Samples,Journal of the Operational Research Society, 49:1233–1238, 1998.
E. Ngai, T. Cheng, S. Au, K-H. Lai. Mobile Commerce Integrated with RFID Technology in a Container Depot.Decision Support Systems, 43:62–76, 2007.
P. Zipkin. The Best Things in Life were Free: On the Technology of Transactions.Manufacturing & Service Operations Management, 8:321–329, 2006.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Shuttleworth, R., Golden, B.L., Smith, S., Wasil, E. (2008). Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-77778-8_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77777-1
Online ISBN: 978-0-387-77778-8
eBook Packages: Business and EconomicsBusiness and Management (R0)