Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP)

IEEE Transactions on Systems, Man and Cybernetics

Volumn 24, Issue 5, 1994, Pages 728-735

  Gu, Jun ^a   Huang, Xiaofei ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Local search; search space; search space smoothing; the Traveling Salesman Problem (TSP)

Indexed keywords

ALGORITHMS; HEURISTIC METHODS;

CONVENTIONAL HEURISTIC APPROACHES; EFFICIENT LOCAL SEARCH; HEURISTIC SEARCH ALGORITHMS; LOCAL SEARCH ALGORITHMS; SEARCH SPACE SMOOTHING; TRAVELING SALESMAN PROBLEM (TSP);

HEURISTIC PROGRAMMING;

EID: 0028424454     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.293486     Document Type: Article

References (29)

1. V. CÄ›rny, “A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm,” Technical report, Institute of Physics and Biophysics, Comenius University, Bratislava, 1982.
2. R. Durbin and D. Willshaw, “An analogue approach to the traveling salesman problem using an elastic net method,” Nature, 326:689-691, 1987.
3. B. L. Golden and W. R. Stewart, “Empirical Analysis of Heuristics,” In The Traveling Salesman Problem. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, pp. 207–249. John Wiley & Sons, New York, 1985.
4. G. A. Groes, “A method for solving traveling-salesman problems,” Operation Research, vol. 6, 791–812, 1958.
5. J. Gu, “How to solve Very Large-Scale Satisfiability (VLSS) problems,” Technical Report, 1988 (Present in part in, J. Gu, Benchmarking {SAT} Algorithms, Technical Report UCECE-TR-90-002, 1990).
6. J. Gu. “Efficient local search for very large-scale satisfiability problem,” SIGART Bulletin, vol. 3, no. 1, pp. 8–12, Jan. 1992, ACM Press.
7. J. Gu. “Local search for satisfiability (SAT) problem,” Trans. on Systems, Man, and Cybernetics, vol. 23, no. 4, pp. 1108–1129, 1993.
8. J. Gu, “Multispace search: A new optimization approach, “ In Technical Report UCECE-TR-90-001, Mar. 1990.
9. J. Gu, “Constraint-Based Search,” Cambridge University Press, New York, to appear.
10. J. Gu and B. Du, “Graph partitioning by simulated evolution,” Technical Report UCECE-TRT-92-001, Jan. 1992.
11. J. J. Hopfield and D. Tank, “Neural computation of decisions in optimization problems,” Biological Cybernetics, vol. 5, pp. 141–152, 1985.
12. D. S. Johnson, “More approaches to the traveling salesman guide,” Nature, vol. 330, pp. 5 25, 1987.
13. S. Kirkpatrick, C. D. Gelat and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680, 1983.
14. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New York, 1985.
15. S. Lin, “Computer solutions of the traveling salesman problem,” Bell Sys. Tech. Journal, vol. 44, no. 10, pp. 2245–2269, Dec. 1965.
16. S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling salesman problem,” Operation Research, vol. 21, no. 498–516, 1973.
17. J. P. Norback and R. F. Love, “Geometric approaches to solving the traveling salesman problem,” Management Science, vol. 23, pp. 1208–1223, 1977.
18. J. P. Norback and R. F. Love, “Heuristic for the hamiltonian path problem in euclidian two space,” J. Oper. Res. Soc., vol., 30, pp. 363–368, 1979.
19. I. Or, “Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking,” Ph.D. thesis, Northwestern University, Evanston, IL, 1976.
20. C. H. Papadimitriou and K. Steiglitz, “On the complexity of local search for the traveling salesman problem,” SIAM J. on Computing, vol. 6, no. 1, pp. 76–83, 1977.
21. R. Puri and J. Gu, “An efficient algorithm for microword length minimization,” IEEE Transactions on CAD, vol. 12, no. 10, pp. 1449–1457, Oct. 1993.
22. D. J. Rosenkrantz, R. E. Stearns and P. M. Lewis, “An analysis of several heuristics for the traveling salesman problem,” SIAM J. on Computing, vol. 6, pp. 563–581, 1977.
23. B. M. Schwartzschild, “Statistical mechanics algorithm for monte carlo optimization,” Physics Today, vol. 35, pp. 17–19, 1982.
24. R. SosiÄ and J. Gu, “How to search for million queens,” Technical Report UUCS-TR-88-008, Dept. of Computer Science, Univ. of Utah, Feb. 1988.
25. R. SosiÄ and J. Gu, “A polynomial time algorithm for the n-queens problem,” SIGART Bulletin, vol. 1, no. 3, pp. 7–11, Oct. 1990, ACM Press.
26. R. SosiÄ” and J. Gu, “3,000,000 queens in less than one minute,” SIGART Bulletin, vol. 2, no. 2, pp. 22–24, Apr. 1991, ACM Press.
27. R. SosiÄ and J. Gu, “Fast search algorithms for the n-queens problem,” IEEE Trans. on Systems, Man, and Cybernetics, SMC-21, no. 6, pp. 1572–1576, Nov./Dec. 1991.
28. R. SosiÄ and J. Gu, “Efficient local search with conflict minimization,” IEEE Trans. on Knowledge and Data Engineering, vol. 6, 1994.
29. W. R. Stewart, “A computationally efficient heuristic for the traveling salesman problem,” In Proc. 13th Annual Meeting of S.E. TIMS, pp. 75–85, 1977.