Application of the noising method to the travelling salesman problem

European Journal of Operational Research

Volumn 125, Issue 2, 2000, Pages 266-277

  Charon, Irène ^a   Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SENSITIVITY ANALYSIS; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION; METAHEURISTICS; NOISING METHOD;

TRAVELING SALESMAN PROBLEM;

EID: 0033723605     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00457-9     Document Type: Article

References (15)

1. Aarts E.H.L., Korst J.H.M., van Laarhoven P.J.M. Simulated annealing. Aarts E.H.L., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;91-120 Wiley, New York.
2. E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997.
3. J. Beardwood, J.H. Halton, J.M. Hammersley, The shortest path through many points, in: Proceedings of the Cambridge Philosophical Society, vol. 55, 1959, pp. 299-327.
4. Bonomi E., Lutton J.-L. The N-city travelling salesman problem: Statistical mechanics and the Metropolis algorithm. SIAM Review. 26:1984;551-568.
5. Charon I., Hudry O. The noising method: A new combinatorial optimization method. Operations Research Letters. 14:1993;133-137.
6. I. Charon, O. Hudry, The noising method: A generalization of some metaheuristics, submitted for publication.
7. I. Charon, O. Hudry, A totally self-tuned noising method, in preparation.
8. Johnson D.S., McGeoch L.A. The traveling salesman problem: A case study. Aarts E.H.L., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;215-310 Wiley, New York.
9. M. Jünger, G. Reinelt, G. Rinaldi, The traveling salesman problem, in: M.O. Ball et al. (Eds.), Handbooks in OR and MS, vol. 7, Elsevier, Amsterdam, 1995, pp. 225-330.
10. van Laarhoven P.J.M., Aarts E.H.L. Simulated Annealing: Theory and Applications. 1987;Kluwer, Dordrecht.
11. Lawler E.L., Lenstra A., Rinnooy Kan G. The Travelling Salesman Problem. 1985;Wiley, New York.
12. Lin S. Computer solutions for the travelling salesman problem. Bell System Technical Journal. 44:1965;2245-2269.
13. C. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.
14. G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA Journal on Computing 3, 4 (1991) 376-384.
15. D. Stein, Scheduling dial-a-ride transportation systems: An asymptotic approach, Ph.D. thesis, Harvard University, Cambridge, MA, 1977.