Affiliations: [a] Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, Zagazig, Sharqiyah, Egypt
| [b] College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, China
Correspondence:
[*]
Corresponding author. Mohamed Abdel-Baset, Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, Zagazig, Sharqiyah, Egypt. Tel.: +20 11 2228 8843; E-mail: [email protected].
Abstract: 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.
Keywords: Flower pollination algorithm, meta-heuristics, optimization, quadratic assignment problem, NP hard and combinatorial optimization
