Designing restart strategy for randomized algorithms and its application in solving the TSP

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 25, Issue 5, 2002, Pages 514-519

  Chen, Guo Liang ^a   Xie, Xing ^a   Xu, Yun ^a   Gu, Jun ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Combinatorial optimization; Randomized algorithm; Restart strategy; TSP

Indexed keywords

ALGORITHMS; OPTIMIZATION; STABILITY;

COMBINATORIAL OPTIMIZATION; LAS VEGAS ALGORITHM; RANDOMIZED ALGORITHM; RESTART STRATEGY;

COMPUTATIONAL COMPLEXITY;

EID: 0036589241     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Garey M R, Johnson D S. Computers and Intrastability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979
2. Goldberg D E. Genetic Algorithm in Search, Optimization and Machine Learning. New York: Addison-Wesley, 1989
3. Kirkpatrick S, Gelatt C D, d Vecchi M P. Optimization by simulated annealing. Science, 1983, (4598): 671-680
4. Gambardella L M, Dorigo M. Ant-Q: A reinforcement learning approach to the traveling salesman problem. In: Proc the 12th International Conference on Machine Learning, San Francisco, USA, 1995. 252-260
5. Johnson D S, McGeoch L A. The traveling salesman: A case study in local optimization. In: Aarts E H L, Lenstra J K eds. Local Search in Combinatorial Optimization. New York: Wiley and Sons, 1996. 215-310
6. Motwani R, Raghavan P. Randomized algorithms. ACM Computing Surveys, 1996, 28 (1): 33-37
7. Zhu H. Design and Analysis of Algorithms. Shanghai: Documentary Publishing House of Science and Technology of Shanghai, 1989 (in Chinese)
8. Hoos H, Stutzle T. Developing new concepts to characterize empirical phenomena. In: Proc IJCAI'99 workshop on empirical AI, Stockholm, Sweden, 1999. 59-67
9. Hoss H. Stochastic local search-methods, models, applications [Ph D dissertation]. Computer Science Department of the Darmstadt University of Technology, Germany, 1998
10. Hogg T, Williams C. Expected gains from parallelizing constraint solving for hard problems. In: Proc. AAAI'94, Seattle, USA, 1994. 331-338
11. Gomes C, Selman B, Kautz H. Boosting combinatorial search through randomization. In: Proc AAAI'98, Madison, USA, 1998. 430-437
12. Gomes C, Selman B, Crato N, Kautz H. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 1999, 24 (1): 67-100
13. Huberman B A, Lukose R M, Hogg T. An economics approach to hard computational problems. Science, 1997, (5296): 51-54
14. Chalasani P, Jha S, Shehory O, Sycara K. Query restart strategies for web agents. In: Proc the 2nd International Conference on Autonomous Agents, Minneapolis, USA, 1998. 124-131
15. Luby M, Sinclair A, Zuckerman D. Optimal speedup of Las Vegas algorithms. Information Processing Letters, 1993, 47 (4): 173-180
16. Reinelt G. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing, 1991, 3 (3): 376-384
17. Jin R, Huang W. Parallel computing: An efficient approach for improving the performance of solving SAT, Journal of Software, 2000, 11 (3): 398-400
18. Xie X, Zhou Z, Chen G, Gu J. Performance analysis of random competition strategy in Monte Carlo algorithms. Chinese Journal of Computers, 2000, 23 (10): 1015-1020
19. Xie X. Optimization strategies of randomized algorithm for NP hard problems [Ph D dissertation]: Computer Science Department of USTC, Hefei, 2001 (in Chinese)
20. Xie X, Zhou Z, Chen G. An efficient restart strategy of local optimization for the TSP. In: Proc. the 16th IFIP World Computer Congress, Beijing, China, 2000. 756-759