The close enough traveling salesman problem: A discussion of several heuristics

Operations Research/ Computer Science Interfaces Series

Volumn 36, Issue , 2006, Pages 271-284

  Gulczynski, Damon J ^a   Heath, Jeffrey W ^a   Price, Carter C ^a  

^a Bldg 142   (United States)

Author keywords

Electronic meter reading; Radio frequency identification; Traveling salesman problem

Indexed keywords

EID: 77950874585     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-39934-8_16     Document Type: Article

References (9)

1. B. Davis, T. Retchless and N. Vakili. Radio-frequency adoption for home meter reading and vehicle routing implementation. Final project for BMGT831 R. H. Smith School of Business. University of Maryland. Spring 2005.
2. J. Dong, N. Yang and M. Chen. A heuristic algorithm for a TSP variant: Meter reading shortest tour problem. Final project for BMGT831 R. H. Smith School of Business. University of Maryland. Spring 2005.
3. T. Gala, B. Subramanian and C. Wu. Meter reading using radio frequency identification. Final Project for BMGT831 R. H. Smith School of Business. University of Maryland. Spring 2005.
4. T. Gonzalez. Covering a set of points in multidimensional space. Proceedings of the Twenty-eighth Annual Allerton Conference on Communications, Control, and Computing, Oct 1990.
5. D.J. Gulczynski, J.W. Heath and C.C. Price. Close enough traveling salesman problem: Close only counts in horseshoes, and hand grenades and meter reading? Final Project for BMGT831 R. H. Smith School of Business. University of Maryland. Spring 2005.
6. G. Gutin and A.P. Punnen, The Traveling Salesman Problem and Its Variations. Springer, 2002.
7. S. Hamdar, A. Afshar and G. Akar. Sweeping circle heuristic. Final Project for BMGT831 R. H. Smith School of Business. University of Maryland. Spring 2005.
8. W. Mennell, S. Nestler, K. Panchamgam and M. Reindorp. Radio frequency identification vehicle routing problem. Final Project for BMGT831 R. H. Smith School of Business. University of Maryland. Spring 2005.
9. M. Solomon. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35:254-265, 1987.