Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems

Anita; Anupam Yadav; Nitin Kumar; Joong Hoon Kim

doi:10.1007/978-981-15-8603-3_36

Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems

Anita
, Anupam Yadav^*
, Nitin Kumar
, Joong Hoon Kim

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020
Editors	Sinan Melih Nigdeli, Gebrail Bekdas, Joong Hoon Kim, Anupam Yadav
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	411-421
Number of pages	11
ISBN (Print)	9789811586026
DOIs	https://doi.org/10.1007/978-981-15-8603-3_36
Publication status	Published - 2021
Event	6th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2020 - Istanbul, Turkey Duration: 2020 Apr 22 → 2020 Apr 24

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	1275
ISSN (Print)	2194-5357
ISSN (Electronic)	2194-5365

Conference

Conference	6th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2020
Country/Territory	Turkey
City	Istanbul
Period	20/4/22 → 20/4/24

Bibliographical note

Publisher Copyright:
© 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Keywords

AEFA algorithm
Quadratic assignment problem
Soft computing optimization

ASJC Scopus subject areas

Control and Systems Engineering
General Computer Science

Access to Document

10.1007/978-981-15-8603-3_36

Cite this

Anita, Yadav, A., Kumar, N., & Kim, J. H. (2021). Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems. In S. M. Nigdeli, G. Bekdas, J. H. Kim, & A. Yadav (Eds.), Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020 (pp. 411-421). (Advances in Intelligent Systems and Computing; Vol. 1275). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-15-8603-3_36

Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems. / Anita; Yadav, Anupam; Kumar, Nitin et al.
Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020. ed. / Sinan Melih Nigdeli; Gebrail Bekdas; Joong Hoon Kim; Anupam Yadav. Springer Science and Business Media Deutschland GmbH, 2021. p. 411-421 (Advances in Intelligent Systems and Computing; Vol. 1275).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Anita, Yadav, A, Kumar, N & Kim, JH 2021, Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems. in SM Nigdeli, G Bekdas, JH Kim & A Yadav (eds), Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020. Advances in Intelligent Systems and Computing, vol. 1275, Springer Science and Business Media Deutschland GmbH, pp. 411-421, 6th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2020, Istanbul, Turkey, 20/4/22. https://doi.org/10.1007/978-981-15-8603-3_36

Anita, Yadav A, Kumar N, Kim JH. Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems. In Nigdeli SM, Bekdas G, Kim JH, Yadav A, editors, Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020. Springer Science and Business Media Deutschland GmbH. 2021. p. 411-421. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-981-15-8603-3_36

Anita ; Yadav, Anupam ; Kumar, Nitin et al. / Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems. Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020. editor / Sinan Melih Nigdeli ; Gebrail Bekdas ; Joong Hoon Kim ; Anupam Yadav. Springer Science and Business Media Deutschland GmbH, 2021. pp. 411-421 (Advances in Intelligent Systems and Computing).

@inproceedings{e37e73cae67d4820872a9bc4a41615af,

title = "Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems",

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.",

keywords = "AEFA algorithm, Quadratic assignment problem, Soft computing optimization",

author = "Anita and Anupam Yadav and Nitin Kumar and Kim, \{Joong Hoon\}",

note = "Publisher Copyright: {\textcopyright} 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.; 6th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2020 ; Conference date: 22-04-2020 Through 24-04-2020",

year = "2021",

doi = "10.1007/978-981-15-8603-3\_36",

language = "English",

isbn = "9789811586026",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "411--421",

editor = "Nigdeli, \{Sinan Melih\} and Gebrail Bekdas and Kim, \{Joong Hoon\} and Anupam Yadav",

booktitle = "Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications - ICHSA 2020",

address = "Germany",

}

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

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 - https://www.scopus.com/pages/publications/85097069449

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 -

Development of Discrete Artificial Electric Field Algorithm for Quadratic Assignment Problems

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this