TY - GEN
T1 - Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems
AU - Anita,
AU - Yadav, Anupam
AU - Kumar, Nitin
AU - Kim, Joong Hoon
N1 - Publisher Copyright:
© 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
KW - AEFA algorithm
KW - Quadratic assignment problem
KW - Soft computing optimization
UR - http://www.scopus.com/inward/record.url?scp=85097069449&partnerID=8YFLogxK
U2 - 10.1007/978-981-15-8603-3_36
DO - 10.1007/978-981-15-8603-3_36
M3 - Conference contribution
AN - SCOPUS:85097069449
SN - 9789811586026
T3 - Advances in Intelligent Systems and Computing
SP - 411
EP - 421
BT - Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020
A2 - Nigdeli, Sinan Melih
A2 - Bekdas, Gebrail
A2 - Kim, Joong Hoon
A2 - Yadav, Anupam
PB - Springer Science and Business Media Deutschland GmbH
T2 - 6th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2020
Y2 - 22 April 2020 through 24 April 2020
ER -