### Details

#### Title

A comparison of nature inspired algorithms for the quadratic assignment problem#### Journal title

Bulletin of the Polish Academy of Sciences: Technical Sciences#### Yearbook

2017#### Numer

No 4#### Publication authors

#### Divisions of PAS

Nauki Techniczne#### Publisher

Polish Academy of Sciences#### Date

2017#### Identifier

ISSN 0239-7528, eISSN 2300-1917#### References

Roucairol (1984), An efficient branching scheme in branch and bound procedures Paris, null, 21. ; Pham (2014), and comparison of nature - inspired population - based continuous optimisation algorithms, Soft Computing, 18, 871. ; Mamaghani (2012), Solving the quadratic assignment problem with the modified hybrid PSO algorithm International Conference on Application of Information and Communication Technologies, null, 26, 1. ; Bonabeau (1999), From Natural to Artificial Swarm University, Intelligence, 29. ; Chmiel (null), Bees algorithm for the quadratic assignment problem on CUDA platform th International Conference on Man - Machine Interactions Publishing, Int, 615. ; Grötschel (1991), mathematics in manufacturing in Proceedings of the Second International Conference on Industrial and Applied Mathematics, Discrete ICIAM SIAM, 16, 119. ; Schaffer (1991), Simple local search problems that are hard to solve, SIAM J Comput, 20, 56. ; Mason (1997), Solution methods for the balancing of jet turbines Computers OR, null, 13, 153. ; Burkard (1997), a quadratic assignment problem library, null, 1. ; Ugi (1979), Neue Anwendungsgebiete für Computer in der Chemie in, Angewandte Chemie, 14. ; Duman (2012), Migrating birds optimization new metaheuristic approach and its performance on quadratic assignment problem, Information Sciences, 27, 217. ; Loiola (2007), de survey for the quadratic assignment problem, European Journal of Operational Research, 19, 176. ; Drezner (null), The quadratic assignment problem Location eds Springer International Publishing, Science, 18, 345. ; Saravanov (1981), The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of factorial cardinality in cubic time Software Programs, Algorithms, 31, 11. ; Taillard (1998), Fast ant system Technical Report, null. ; Derrac (2011), practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms Swarm, Comput, 53. ; Filipowicz (2011), Swarm algorithms in optimization of quadratic assignment problem in Polish, null, 15, 159. ; Mautor (1992), Contribution a la resolution des problemes dimplanation : algorithmes sequentiels et paralleles pour laffectation quadratique thesis, null, 39. ; Aurenhammer (1988), On - line sorting of twisted sequences in linear time, BIT, 28, 37. ; Chmiel (2009), Performance of swarm algorithms for permutation problems in Polish, null, 15, 117. ; Koopmans (1957), Assignment problems and the location of economic activities, Econometrica, 11, 25. ; Garey (1979), Computers Intractability Guide to the Theory of Completeness Co New York, null. ; Murthy (1992), local search algorithm for the quadratic assignment problem, Informatica, 524. ; Nyberg (2011), New exact discrete linear reformulation of the quadratic assignment problem Technical Report Abo University, null. ; Bölte (1996), Optimizing simulated annealing schedules with genetic programming, European Journal of Operational Research, 402. ; Sahni (1976), complete approximation problems, ACM, 23, 555. ; Roucairol (1979), reduction method for quadratic assignment problem Verfahren of, Operations Research Methods Operations Research, 20, 185. ; Dorigo (1992), Optimization learning natural algorithms Thesis di Italy, null, 28. ; Roucairol (1987), parallel branch and bound algorithm for the quadratic assignment problem, Discrete Applied Mathematics, 22, 211. ; Burkard (1995), Heuristics for biquadratic assignment problems and their computational comparison, European Journal of Operational Research, 17, 283. ; Fischetti (2011), Three ideas for the quadratic assignment problem report, null, 20, 11. ; Fleurent (1993), Genetic hybrids for the quadratic assignment problem Series in Mathematics and Mathematical, Theoretical Computer Science American Society, 173. ; Ji (2006), solution method for the quadratic assignment problem The th on and Xinjiang China, International Symposium Operations Research Its Applications, 106. ; Li (1992), Generating quadratic assignment test problems with known optimal permutations Optimization and Applications, Computational, 1. ; Congying (2011), Particle swarm optimization algorithm for quadratic assignment problem International Conference on and Network Technology, Computer Science, 25, 1728. ; Anstreicher (2002), Solving large quadratic assignment problems on computational grids, Mathematical Programming, 563. ; Misevicius (2012), An implementation of the iterated tabu search algorithm for the quadratic assignment problem OR, Spectrum, 34, 665. ; Taillard (1995), Comparison of iterative searches for the quadratic assignment problem Location, Science, 3, 87. ; Skorin (1990), Tabu search applied to the quadratic assignment problem on, Journal Computing, 2, 33. ; Bashiri (2012), Effective heuristics and meta - heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons, Journal of Industrial Engineering International, 24, 1. ; Phillips (1994), quadratic assignment formulation of the molecular conformation problem of Optimization, Journal Global, 15, 229. ; Brüngger (1997), Joining forces in solving large - scale quadratic assignment problems in parallel Proceedings of the th International on Parallel Processing, Symposium, 418. ; Taillard (1997), Adaptive memories for the quadratic assignment problem, null, 49. ; Christofides (1989), An exact algorithm for the quadratic assignment problem on a tree, Operations Research, 37, 760. ; Colorni (1991), Distributed optimization by ant colonies European Conference on Artificial, Life, 31, 134. ; Chong (2006), Low bee colony optimization algorithm to job shop scheduling Proceedings of the th Conference on Winter Simulation, null. ; Johnson (1988), How easy is local search, Comput Syst Sci, 37, 79. ; Erdoḡan (2007), branch and - cut algorithm for quadratic assignment problems based on linearizations Computers, Operations Research, 23, 1085. ; Bermudez (1102), genetic algorithm approach to door assignments in breakbulk terminals Technical ReportMBTC University of Arkansas, Transportation, 12.#### DOI

10.1515/bpasts-2017-0056