Yassine Moumen
ABSTRACT
Metaheuristics methods are the most efficient if not the only way to solve difficult problems in both science and industry. In computer science, these methods are being used to find a good answer for NP-hard optimization problems in moderate execution times by shrinking the size of the search space to focus on regions with the height change of having an acceptable solution. Nevertheless, if we consider a large problem instance as in the real word, finding a good solution with traditional implementation of metaheuristics needs a huge computational power (in term of processing capability and memory usage) as well as time to solve, even the best known machines in our time cannot handle the massive work load to just initials a real word scenario. For that reason, implementing a parallel computing of these methods is number one priority to speed up the search giving that in most cases, the biggest limitation is the time; one of the newest techniques to achieve the best results is by using Graphical processing units (GPUs). However, taking advantage of GPU's parallel nature to compute Metaheuristics is rarely studied in the literature. In this paper, we present a new approach for the design and implementation of effective metaheuristics algorithms on GPU by using the latest technologies like CUDA. To accelerate the search mechanism even more, we have introduce new functions like host-device data transfer optimization, thread control, Coalesced memory access.
- Dongarra, J. P., et al. (2003) "Sourcebook of Parallel Computing", San Francisco, CA: Morgan Kaufmann. Google Scholar
Digital Library
- S. Che, M. Boyer, J. Meng, D. Tarjan, J. W. Sheaffer, and K. Skadron, "A performance study of general-purpose applications on graphics processors using cuda," J. Parallel Distributed Computing, vol. 68, no. 10, pp. 1370--1380, 2008. Google ScholarDigital Library
- J. Nickolls, I. Buck, M. Garland, and K. Skadron, "Scalable parallel programming with cuda," ACM Queue, vol. 6, no. 2, pp. 40--53, 2008. Google ScholarDigital Library
- A. E. Lefohn, S. Sengupta, J. O. E. Kniss, R. Strzodka, J. D. Owens, Glift: Generic, Efficient, Random-Access GPU Data Structures, ACM Trans. Graph., 25 (2006), no. 1, 60--99. Google ScholarDigital Library
- M. Mendez-Lojo, M. Burtscher, K. Pingali, A GPU Implementation of Inclusion-based Points-to Analysis, ACM SIGPLAN Notices, 47 (2012), 107--116. Google ScholarDigital Library
- C.-H. Yang and K. E. Nygard, The Effects of Initial for Time Constrained Population Traveling in Genetic Search Salesman Problems, ACM, (1993), 378--383. Google ScholarDigital Library
- Y. Bartal, L.-A. Gottlieb, R. Krauthgamer, The Traveling Salesman Problem: Low-dimensionality implies a polynomial time approximation scheme, Proceedings of the 44th symposium on Theory of Computing - STOC '12, (2012), 663--672. Google ScholarDigital Library
- P. Fekete, H. Meijer, Andre Rohe, W. Tietze, Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems, Chapter in Algorithm Engineering and Experimentation, Springer Berlin Heidelberg, 2001. Google ScholarDigital Library
- E. Lawler, D. Shmoys, A. Kan, and J. Lenstra. The Traveling Salesman Problem. John Wiley & Sons, 1985. 1Google Scholar
- D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook. The Traveling Salesman Problem: A Computational Study. Princeton University Press, 2007. 1 Google ScholarDigital Library
- P. A. Pevzner, H. Tang, and M. S. Waterman. A eulerian path approach to dna fragment assembly. In National Academy of Science 98(17), pages 9748--9753, August 2001. 1Google Scholar
- W. J. Cook. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, 2012. 1Google Scholar
- G. Reinelt, \TSPLIB| A Traveling Salesman Problem Library," ORSA Journal on Computing, Vol. 3, No. 4, pp. 376{384, 1991.Google ScholarCross Ref
- G. Reinelt, the Traveling Salesman: Computational Solutions for TSP Applications. Vol. 840 of Lecture Notes in Computer Science, Springer-Verlag, 1994. Google ScholarDigital Library
- NVIDIA Corp., NVIDIA CUDA Programming Guide Version 4.1, 2011.Google Scholar
- http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp/index.htmlGoogle Scholar
Recommendations
Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem
LION 6: Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219The purpose of this paper is to propose effective parallelization strategies for the Iterated Local Search ILS metaheuristic on Graphics Processing Units GPU. We consider the decomposition of the 3-opt Local Search procedure on the GPU processing ...
Implementing Genetic Algorithm Accelerated By Intel Xeon Phi
SoICT '17: Proceedings of the 8th International Symposium on Information and Communication TechnologyIn this paper, genetic algorithm (GA) accelerated by Intel Xeon Phi coprocessor based on Intel Many Integrated Chip (MIC) Architecture is proposed and called GAPhi framework. The GAPhi framework solves the power-aware task scheduling (PATS) problems in ...
Parallel ant colony for nonlinear function optimization with graphics hardware acceleration
SMC'09: Proceedings of the 2009 IEEE international conference on Systems, Man and CyberneticsThis paper presents a massively parallel Ant Colony Optimization - Pattern Search (ACO-PS) algorithm with graphics hardware acceleration on nonlinear function optimization problems. The objective of this study is to determine the effectiveness of using ...
Comments