Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi

2147-5881

Pamukkale Üniversitesi

Engineering

Mühendislik

Karesel atama problemleri için tavlama benzetimi paralelleştirme yöntemlerinin karşılaştırılması

Comparison of simulated annealing parallelization methods for quadratic assignment problems

https://orcid.org/0000-0001-8121-9300

Akkaş

Selahattin

https://orcid.org/0000-0002-9050-9219

Kavaklıoğlu

Kadir

10 12 2018

24 5 898 905 06 09 2017

2013

Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi

Kareselatama problemi (KAP), NP-hard sınıfındaki en zor kombinatoryal optimizasyonproblemlerinden birisidir. Problemin zorluğundan dolayı birçok araştırmacı butip atama problemini çalışılmaktadır. Bu çalışmada tavlama benzetimi yöntemiMATLAB platformunda paralelleştirilerek iyi bilinen bir KAP Kütüphanesi olanQAPLIB’den alınan 36 örnek problemi çözmek için kullanılmıştır. Değişikparalelleştirme yöntemlerinin performansları kullanılan problemler içinkarşılaştırılmıştır. Sonuç olarak seri tavlama benzetimi yöntemiylekarşılaştırıldığında, paralel yöntemlerin uygun parametreler kullanıldığındadaha hızlı sonuç verdiği görülmüştür.

Quadraticassignment problem (QAP) is one of the most difficult combinatorialoptimization problems in the NP-hard class. Due to the difficulty of theproblem, many researchers have been studying this type of assignment problem.In this work, simulated annealing method is parallelized on MATLAB platform andis used to solve 36 problems from QAPLIB which is a well-known QAP library. Theperformance of different parallelization methods is compared for the problemsused. As a result, when compared with the serial simulated annealing method, itis seen that the parallel methods give faster results when the appropriateparameters are used.

Karesel atama problemi Paralel programlama Tavlama benzetimi Optimizasyon

Quadratic assignment problem Parallel programming Simulated annealing Optimization

Koopmans TC, Beckmann M. “Assignment problems and the location of economic activities”. Econometrica, 25(1), 53-76, 1957.

Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T. “A survey for the quadratic assignment problem”. Europian Journal of Operational Research, 176(2), 657-690, 2007.

Paul G. “Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem”. Operations Research Letters, 38(6), 577-581, 2010.

Onbaşoǧlu E, Özdamar L. “Parallel simulated annealing algorithms in global optimization”. Journal of Global Optimization, 19(1), 27-50, 2001.

Ferreiro AM, García JA, López-Salas JG, Vázquez C. “An efficient implementation of parallel simulated annealing algorithm in GPUs”. Journal of Global Optimization, 57(3), 863-890, 2013.

Laursen PS. “Parallel heuristic search-introductions and a new approach”. Solving Combinatorial Optimization Problems in Parallel. Editors: Ferreira A, Pardalos P. Lecture Notes in Computer Science, 1054, 248-274, 1996.

Holmqvist K, Migdalas A, Pardalos PM. Parallelized Heuristics for Combinatorial Search. Editors: Migdalas A, Pardalos PM, Storøy S. Parallel Computing in Optimization, 269-294, Boston, MA, USA, Springer, 1997.

Hussin MS, Stützle T. “Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances”. Computers & Operation Research, 43, 286-291, 2014.

Said GAENA, Mahmoud AM, El-Horbaty ESM. “A comparative study of meta-heuristic algorithms for solving quadratic assignment problem”. International Journal of Advanced Computer Science and Applications, 5(1), 1-6, 2014.

Karami M, Niroomand S, Mirzaei N, Vizvari B. “Analysis and performance measurement of existing solution methods of quadratic assignment problem”. International Journal of Electronics, Mechanical and Mechatronics Engineering, 3(2), 557-570, 2014.

Ghandeshtani KS, Mollai N, Seyedkashi SMH, Neshati MM. “New simulated annealing algorithm for quadratic assignment problem”. ADVCOMP 2010: The Fouth International Conference on Advanced Engineering Computing and Applications in Sciences, Florence, Italy, 25-30 October 2010.

Wang JC. “A multistart simulated annealing algorithm for the quadratic assignment problem”. 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, Kaohsiung, Taiwan, 26-28 September 2012.

Kovac M. “Solving quadratic assignment problem in parallel using local search with simulated annealing elements”. The International Conference on Digital Technologies 2013, Zilina, Slovakia 29-31 May 2013.

Kaviani MA, Abbasi M, Rahpeyma B, Yusefi MM. “A hybrid tabu search-simulated annealing method to solve quadratic assignment problem”. Decision Science Letters, 3(3), 391-396, 2014.

Paul G. “A GPU implementation of the simulated annealing heuristic for the quadratic assignment problem”. Computing Research Repository, arXiv: 1208.2675, 2012.

Rao SS. Engineering Optimization Theory and Practice. 4th ed. New Jersey, USA, Wiley, 2009.

Chen H, Flann NS, Watson DW. “Parallel genetic simulated annealing: a massively parallel SIMD algorithm”. IEEE Transactions on Parallel and Distributed Systems, 9(2), 126-136, 1998.

Burkard RE, Çela E, Karisch SE, Rendl F. "QAPLIB”. http://anjos.mgi.polymtl.ca/qaplib/ (09.05.2017).

Nugent CE, Vollmann TE, Ruml J. “An experimental comparison of techniques for the assignment of facilities to locations”. Operations Research, 16(1), 150-173, 1968.

Skorin-Kapov J. “Tabu search applied to the quadratic assignment problem”. ORSA Journal of Computing, 2(1), 33-45, 1990.

Burkard RE, Karisch SE, Rendl F. “QAPLIB A quadratic assignment problem library”. Journal of Global Optimization, 10(4), 391-403, 1997.

Li Y, Pardalos PM. “Generating quadratic assignment test problems with known optimal permutations”. Computational Optimization and Applications, 1(2), 163-184, 1992.