Randomized gravitational emulation search algorithm for symmetric traveling salesman problem

Applied Mathematics and Computation

Volumn 192, Issue 2, 2007, Pages 413-421

  Raja Balachandar, S ^a   Kannan, K ^a  

^a SASTRA UNIVERSITY   (India)

Author keywords

Gravitational force; Newton's law; Swapping; Symmetric traveling salesman problem; Velocity

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; NUMERICAL METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; SEARCH ENGINES; SIMULATED ANNEALING;

GRAVITATIONAL FORCE; SWAPPING; SYMMETRIC TRAVELING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 34548826780     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.03.019     Document Type: Article

References (20)

1. Barry Lynn Webster, Solving Combinatorial Optimization Problems Using a New Algorithm Based on Gravitational Attraction, Ph.D., thesis, Melbourne, Florida Institute of Technology, May, 2004.
2. Brest J., and Zerovnik J. An approximation algorithm for the asymmetric traveling salesman problem. Ricerca Operativa 28 (1998) 59-67
3. Bui T., and Moon B. A new genetic approach for the traveling salesman problem. Proceedings of the First IEEE Conference on Evolution Computation 2 (1994) 7-13
4. Chan D., and Mercier D. IC insertion: an application of the traveling salesman problem. International Journal of Production Research 27 (1989) 1837-1841
5. Chatterjee S., Carrera C., and Lynch L. Genetic algorithms and traveling salesman problems. European Journal of Operational Research 93 (1996) 490-510
6. Fischetti M., Salazar-Gonza'lez J.J., and Toth P. A branch and- cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45 3 (1997) 378-394
7. Karp R. A patching algorithm for the non symmetric traveling-salesman problem. SIAM Journal Computing 8 (1979) 561-573
8. Knox J. Tabu search performance on the symmetric traveling salesman problem. Computers and Operations Research 21 (1994) 867-876
9. Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 345-358
10. Lawler E., Lenstra J., Rinnooy Kan A., and Shmoys D. The traveling salesman problem: a guided tour of combinatorial optimization (1985), Wiley, New York
11. Lin S., and Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
12. Litke J. An improved solution to the traveling salesman problem with thousands of nodes. Communications of the ACM 27 (1984) 1227-1236
13. 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.
14. Poon P., and Carter J. Genetic algorithm crossover operations for ordering applications. Computers and Operations Research 22 (1995) 135-147
15. Potvin J. Genetic algorithm for the traveling salesman problem. Annals of Operations Research 63 (1996) 339-370
16. Reinelt G. TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 4 (1996) 134-143
17. Schmitt L., and Amini M. Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: an empirical study. European Journal of Operational Research 108 (1998) 551-570
18. Sears F.W., Zemansky M.W., and Young H.D. University Physics. seventh ed. (1987), Addison - Wesley, Reading, MA
19. Tsubakitani S., and Evans J. Optimizing tabu list size for the traveling salesman problem. Computers and Operations Research 25 (1998) 91-97
20. Voudouris, chris, Edward Tsang, Guided Local Search. Technical Report CSM-247, Department of Computer Science, University of Essex, UK, August 1995.