Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem

Journal of Optimization Theory and Applications

Volumn 124, Issue 2, 2005, Pages 407-433

  Mendivil, F ^a   Shonkwiler, R ^b   Spruill, M C ^b  

^a ACADIA UNIVERSITY   (Canada)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Global optimization; Iterated improvement; Random restart; Traveling salesman problem

Indexed keywords

TRAVELING SALESMAN PROBLEM;

A-PRIORI ESTIMATES; GLOBAL OPTIMISATION; ITERATED IMPROVEMENT; LOCAL MINIMUMS; OPTIMIZATION METHOD; PRIOR EXPERIENCE; PROBABILITY OF STARTING; PROPERTY; RANDOM RESTART; RUNTIMES;

GLOBAL OPTIMIZATION;

EID: 21244499847     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-004-0943-z     Document Type: Article

References (10)

1. MENDIVIL, F., SHONKWILER, R., and SPRUILL, C., Restarting Search Algorithms with Applications to Simulated Annealing, Advances in Applied Probability, Vol. 33, pp. 242-259, 2001.
2. HAJEK, B., Cooling Schedules for Optimal Annealing, Mathematics of Operations Research, Vol. 13, pp. 311-329, 1988.
3. CATONI, O., Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules, Annals of Probability, Vol. 20, pp. 1109-1146, 1992.
4. SHONKWILER, R., and VAN VLECK, E., Parallel Speedup of Monte Carlo Methods for Global Optimization, Journal of Complexity, Vol. 10, pp. 64-95, 1994.
5. BOENDER, G., and RINNOOY KAN, A., Bayesian Stopping Rules for Multistart Optimization Methods, Mathematical Programming, Vol. 37, pp. 59-80, 1987.
6. AZENCOTT, R., Simulated Annealing, Parallelization Techniques, John Wiley and Sons, New York, NY, 1992.
7. LIN, S., and KERNIGHAN, B. W., An Effective Heuristic Algorithm for the Traveling Salesman Problem, Operations Research, Vol. 21, pp. 489-516, 1973.
8. CHANDRA, B., KARLOFF, H., and TOVEY, C., New Results on the Old k-Opt Algorithm for the TSP, SIAM Journal on Computation, Vol. 28, pp. 1998-2029, 1999.
9. KERN, W., A Probabilistic Analysis of the Switching Algorithm for the Euclidean TSP, Mathematical Programming, Vol. 44, pp. 213-219, 1989.
10. KIRKPATRICK, S., GELATT, C., and VECCHI, M., Optimization by Simulated Annealing, Science, Vol. 220, pp. 671-680, 1983.