The quadratic assignment problem (QAP) is one of the most studied combinatorial optimization problems with various practical applications. In This paper, we present an Elite Opposition-Flower Pollination Algorithm (EOFPA) for solving Quadratic Assignment Problems. The performance of the proposed algorithm is tested against a set of benchmarks of QAP from the public QAPLIB Library. we compare the algorithm against the best proposals from the related literatures and we determine that the proposed algorithm is superior to some other algorithms.
KoopmansT.C. and BeckmannM., Assignment problems and the location of economic activities, Econometrica25(1) (1957), 53–76.
2.
CelaE., The quadratic assignment problem: Theory and algorithms, Vol. 1. Springer Science & Business Media, 2013.
3.
SteinbergL., The backboard wiring problem: A placement algorithm, Siam Review3(1) (1961), 37–50.
4.
GeoffrionA.M. and GravesG.W., Scheduling parallel production lines with changeover costs: Practical application of a quadratic assignment/LP approach, Operations Research24(4) (1976), 595–610.
5.
PollatschekM.A., GershoniN. and RaddayY.T., Optimization of the typewriter keyboard by simulation, Angewandte Informatik17 (1976), 438–439.
6.
ElshafeiA.N., Hospital layout as a quadratic assignment problem, Operational Research Quarterly (1970-1977)28(1) (1977), 167–179.
7.
WilhelmM.R. and WardT.L., Solving q uadratic assignment problems by ‘simulated annealing’, Iie Transactions19(1) (1987), 107–119.
8.
BruscoM.J. and StahlS., Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices, Journal of Classification17(2) (2000), 197–223.
9.
LoiolaE.M., et al., A survey for the quadratic assignment problem, European Journal of Operational Research176(2) (2007), 657–690.
10.
DreznerZ., The quadratic assignment problem, Location Science, Springer International Publishing, 2015, pp. 345–363.
11.
AmudhaT., Improving the solution quality of quadratic assignment problems using harmony improvised, 3(8) (2012), 1–8.
12.
Skorin-KapovJ., Tabu search applied to the quadratic assignment problem, Informs Journal on Computing2(1) (1990), 33–45.
13.
TaillardE., Robust tabu search for the quadratic assignment problem, Parallel Comput, vol. 17, 1991, pp. 443–455.
14.
MonteroA.R. and LópezA.S., Ant Colony Optimization for Solving the Quadratic Assignment Problem, Fourteenth Mexican International Conference on Artificial Intelligence (2015), pp. 182–187. IEEE.
15.
AzarbonyadH. and BabazadehR., A Genetic Algorithm for solving Quadratic Assignment Problem (QAP), Computer Science (2014).
16.
AhujaR.K., OrlinJ.B. and TiwariA., A greedy genetic algorithm for the quadratic assignment problem[J], Computers & Operations Research27(10) (1995), 917–934.
17.
AhmedZ.H., A multi-parent genetic algorithm for the quadratic assignment problem, Opsearch (2015), 1–19.
18.
MamaghaniA.S. and MeybodiM.R., Solving the Quadratic Assignment Problem with the modified hybrid PSO algorithm, International Conference on Application of Information and Communication Technologies IEEE, 2012, pp. 1–6.
19.
Durkota, Implementation of a discrete firefly algorithm for the QAP problem within the sage framework, Master’s thesis, Czech Technical University, Prague, 2009.
20.
RiffiM. Essaid and BouzidiA., Discrete cat swarm optimization for solving the quadratic assignment problem, International Journal of Soft Computing and Software Engineering [JSCSE]4(6) (2014), 85–92.
21.
DokerogluT., Hybrid teaching–learning-based optimization algorithms for the Quadratic Assignment Problem, Computers & Industrial Engineering85(C) (2015), 86–101.
22.
YangX.S., KaramanogluM. and HeX., Flower pollination algorithm: A novel approach for multiobjective optimization[J], Engineering Optimization46(9) (2014), 1222–1237.
23.
ReddyP.D.P., ReddyV.C.V. and ManoharT.G., Application of flower pollination algorithm for optimal placement and sizing of distributed generation in Distribution systems, Journal of Electrical Systems & Information Technology3(1) (2016), 14–22.
24.
Abdel-RaoufO., Abdel-BasetM. and El-henawyI., An Improved Flower Pollination Algorithm with Chaos, I.J. Education and Management Engineering, vol. 2, 2014, pp. 1–8.
25.
YangX.-S., Flower pollination algorithm for global optimization, Unconventional computation and natural computation, Springer, Berlin, Heidelberg, 2012, pp. 240–249.
KennedyJ., EberhartR.C., Particle swarm optimization, in: Proc of the IEEE International Conference on Neural Networks, IEEE Service Center, Piscataway, NJ, 1995, pp. 1942–1948.
29.
BurkardR.E., KarischS.E. and RendlF., QAPLIB–a quadratic assignment problem library, Journal of Global Optimization10(4) (1997), 391–403. Accessed: 5 June 2016.
30.
RaoufO., El-henawyI. and Abdel-BasetM., A novel hybrid flower pollination algorithm with chaotic harmony search for solving Sudoku puzzles, International Journal of Modern Education and Computer Science3 (2014), 38–44.
31.
Abdel-BasetM. and HezamI., An improved flower pollination algorithm based on simulated annealing for solving engineering optimization problems, Asian Journal of Mathematics and Computer Research3(3) (2015), 194–170.
32.
Abdel-BasetM. and HezamI., A hybrid flower pollination algorithm for solving ill-conditioned set of equations, International Journal of Bio-Inspired Computation8(4) (2016), 215–220.
33.
Abdel-BasetM. and HezamI.M., An improved flower pollination algorithm for ratios optimization problems, Applied Mathematics & Information Sciences Letters An International Journal3(2) (2015), 83–91.
34.
Abdel-BasetM. and HezamI.M., An effective hybrid flower pollination and genetic algorithm for constrained optimization problems, Advanced Engineering Technology and Application An International Journal4 (2015), 27–27.
35.
Abdel-BasetM. and HezamI., A hybrid flower pollination algorithm for engineering optimization problems, International Journal of Computer Applications140(12) (2016).
