|
|
|
|
Comparison of simulated annealing parallelization methods for quadratic assignment problems
|
|
|
|
|
|
|
|
نویسنده
|
akkaş selahattin ,kavaklioğlu kadir
|
|
منبع
|
pamukkale university journal of engineering sciences - 2018 - دوره : 24 - شماره : 5 - صفحه:898 -905
|
|
چکیده
|
Quadratic assignment problem (qap) is one of the most difficultcombinatorial optimization problems in the np-hard class. due to thedifficulty of the problem, many researchers have been studying this typeof assignment problem. in this work, simulated annealing method isparallelized on matlab platform and is used to solve 36 problems fromqaplib which is a well-known qap library. the performance ofdifferent parallelization methods is compared for the problems used. asa result, when compared with the serial simulated annealing method, itis seen that the parallel methods give faster results when theappropriate parameters are used.
|
|
کلیدواژه
|
Quadratic assignment problem ,Parallel programming ,Simulated annealing ,Optimization
|
|
آدرس
|
pamukkale üniversitesi, mühendislik fakültesi, bilgisayar mühendisliği bölümü, Turkey, pamukkale üniversitesi, mühendislik fakültesi, makine mühendisliği bölümü, Turkey
|
|
پست الکترونیکی
|
kadir.kavaklioglu@pau.edu.tr
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|