Heuristic approaches for a TSP variant: The automatic meter reading shortest tour problem

Operations Research/ Computer Science Interfaces Series

Volumn 37, Issue , 2007, Pages 145-163

  Dong, Jing ^a   Yang, Ning ^a   Chen, Ming ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Automatic meter reading shortest tour problem; Clustering; Convex hull; Mixed integer nonlinear program; Traveling salesman problem

Indexed keywords

EID: 84888591687     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-48793-9_10     Document Type: Article

References (19)

1. T. D. Tamarkin (1992), Automatic Meter Reading, Public Power, 50(5).
2. Carlos A. Osorio Urzua (2004), Bits of Power: The Involvement of Municipal Electric Utilities in Broadbank Services, master thesis, MIT.
3. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy, D. B. Shmoys (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York.
4. G. Gutin and A. P. Punnen (2002), Traveling Salesman Problem and Its Variations, Kluwer Academic Publishers.
5. A. K. Jain, M. N. Murty, and P. J. Rynn (1999), Data clustering: a review, ACM Computing Surveys, 31 (3): 264-323.
6. C. Fraley and A. E. Raftery (1998), How many clusters? which clustering method? answers via model-based cluster analysis, The Computer Journal, 41(8): 578-588.
7. J. B. MacQueen (1967), Some Methods for classification and Analysis of Multivariate Observations, Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, 1: 281-297.
8. J. N. MacGregor, T. C., Ormerod (1996), Human performance on the traveling salesman problem. Perception & Psychophysics, 58: 527-539.
9. C. B. Barber, D. P. Dobkin, and H. T. Huhdanpaa (1996), The Quickhull algorithm for convex hulls, ACM Trans, on Mathematical Software, 22(4): 469-483.
10. R. C. Larson and A. R. Odoni Eds. (1981), Urban Operations Research, Prentice-Hall, NJ.
11. U. S. Arora (1996), Polynomial time approximations schemes for Euclidean TSP and other geometric problems, Proc. 37th IEEE Foundations of Computer Science: 1-10.
12. J. Mitchell (1996), Guillotine subdivisions approximate polygonal subdivisions: Part II-A simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems. University at Stony Brook, Part I appears in SODA'96, 402-408.
13. S. Eilon, C. Watson-Gandy and N. Christofides (1971), Distribution Management, Griffin, London.
14. B. Golden; L. Bodin; T. Doyle; W. Stewart Jr. (1980), Approximate Traveling Salesman Algorithms, Operations Research, 28(3): 694-711.
15. N. Metropolis, A. W Rosenbluth., M. N. Rosenbluth, and A, H. Teller (1953), Equation of State Calculation by Fast Computing Machines, Journal of Chemical Physics, 21: 1087-1092.
16. S. Kirkpatrick, C. D. Gelatt, and M, P. Vecchi (1983), Optimization by Simulated Annealing Science, 220: 671-680.
17. Christopher C. Skiscim, Bruce L. Golden, Optimization by Simulated Annealing: A Preliminary Computational Study for the TSP, Proceedings of the 1983 Winter Simulation Conference: 523-535.
18. Concorde TSP solver; http://www. tsp, gatcch, edu/concorde/index. html.
19. TSPLIB; http://www. iwr, uni-heidelberg, de/groups/comopt/software/TSPLIB95/.