Abstract
Quadratic Assignment Problem (QAP) is a problem of facility locations of individual resources. QAP is a proven NP-hard challenging optimization problem and has a large number of real-life applications in diverse fields such as hospital layout problems, machine scheduling, keyboard design, and backboard wiring problem. Artificial electric field optimization (AEFA) is a new metaheuristic optimization algorithm and has achieved great success in continuous optimization problems. This paper presents a discrete artificial electric field algorithm for QAP. Due to the combinatorial nature of QAP, the general operations of AEFA such as particle representations, velocity and position update rules, and subtraction operations are modified. The proposed algorithm is applied to solve the QAP instances taken from the QAP library. The results show the promising performance of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
