An exact algorithm for the close enough traveling salesman problem with arc covering constraints

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

Volumn , Issue , 2012, Pages 233-238

  Ha, Minh Hoang ^a,c   Bostel, Nathalie ^b   Langevin, André ^a   Rousseau, Louis Martin ^a  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b UNIVERSITÉ DE NANTES   (France)

^c ECOLE DES MINES DE NANTES   (France)

Author keywords

Automated meter reading; Close enough traveling salesman problem; Cutting planes; Radio frequency identification

Indexed keywords

AUTOMATED METER READINGS; COMPUTATIONAL RESULTS; CUTTING PLANES; EXACT ALGORITHMS; MATHEMATICAL FORMULATION; OPTIMALITY; RADIO FREQUENCY IDENTIFICATION TECHNOLOGY; UTILITY COMPANIES;

ALGORITHMS; RADIO FREQUENCY IDENTIFICATION (RFID); WATER METERS;

TRAVELING SALESMAN PROBLEM;

EID: 84861977273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Dong, J., Yang, N., and Chen, M. (2007). Extending the Horizons: Advances in Computing, Optimisation, and Decision Technologies, chapter Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem, pages 145-163. Springer Verlag.
2. Gendreau, M., Laporte, G., and Semet, F. (1997). The covering tour problem. Operations Research, 45:568-576.
3. Golden, B., Raghavan, S., and Wasil, E. (2008). The Vehicle Routing Problem: Lastest Avances and New Challenges, chapter Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network, pages 487-501. Springer.
4. Gulczynski, D., Heath, J., and Price, C. (2006). Perspectives in Operations Research: Papers in Honor of Saul Gass 80th Birthday, chapter The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics, pages 271-283. Springer Verlag.