A highly-parallel TSP solver for a GPU computing platform

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6046 LNCS, Issue , 2011, Pages 264-271

  Fujimoto, Noriyuki ^a   Tsutsui, Shigeyoshi ^b  

^a Osaka Prefecture University   (Japan)

^b HANNAN UNIVERSITY   (Japan)

Author keywords

genetic algorithm; GPGPU; parallel metaheuristic

Indexed keywords

ALGORITHMIC IDEAS; COMBINATORIAL OPTIMIZATION PROBLEMS; GPGPU; GPU COMPUTING; GPU IMPLEMENTATION; GRAPHICS PROCESSING UNIT; LOCAL SEARCH; LOW COSTS; META HEURISTIC ALGORITHM; NOVEL METHODS; ORDER CROSSOVER; PARALLEL METAHEURISTIC;

COMBINATORIAL OPTIMIZATION; COMPUTER GRAPHICS EQUIPMENT; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; NUMERICAL METHODS; PROGRAM PROCESSORS;

TRAVELING SALESMAN PROBLEM;

EID: 79951969810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18466-6_31     Document Type: Conference Paper

References (16)

1. Applegate, D.L., Bixby, R.E., Chvá, Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)
2. Blelloch, G.E.: Scans as Primitive Parallel Operations. IEEE Transactions on Computing 38(11), 1526-1538 (1989)
3. Blelloch, G.E.: Vector Models for Data-Parallel Computing. MIT Press, Cambridge (1990)
4. Croes, G.A.: A Method for Solving Traveling Salesman Problems. Operations Research 6, 791-812 (1958)
5. Davis, L.: Applying Adaptive Algorithms to Epistatic Domains. In: Proc. of the International Joint Conference on Artificial Intelligence, pp. 162-164 (1985)
6. Hoos, H.H., Stü T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2005)
7. JaJa, J.: An Introduction to Parallel Algorithms. Addison-Wesley Professional, Reading (1992)
8. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
9. Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling- Salesman Problem. Operations Research 21, 498-516 (1973)
10. Lindholm, E., Nickolls, J., Oberman, S., Montrym, J.: NVIDIA Tesla: A Unified Graphics and Computing Architecture. IEEE Micro 28(2), 39-55 (2008)
11. Mahfoud, S.: A Comparison of Parallel and Sequential Niching Methods. In: Proc. of the International Conference on Genetic Algorithms, pp. 136-143 (1995)
12. NVIDIA: CUDA Programming Guide 3.1 (2010), http://www.nvidia.com/object/ cuda-develop.html
13. Reinelt, G.: TSPLIB: A Traveling Salesman Problem Library. ORSA Journal on Computing 3, 376-384 (1991)
14. Sanci, S.: A Parallel Algorithm for Flight Route Planning on GPU Using CUDA, Master Thesis, Middle East Technical University (April 2010)
15. Sengupta, S., Harris, M., Garland, M.: Efficient Parallel Scan Algorithms for GPUs. NVIDIA Technical Report NVR-2008-003 (2008)
16. Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling Problems and Traveling Salesman Problem: The Genetic Edge Recombination Operator. In: Proc. of the International Conference on Genetic Algorithms, pp. 133-140 (1989)