A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems
T. G. Pradeepmon,
Vinay V. Panicker () and
R. Sridharan
Additional contact information
T. G. Pradeepmon: National Institute of Technology Calicut
Vinay V. Panicker: National Institute of Technology Calicut
R. Sridharan: National Institute of Technology Calicut
OPSEARCH, 2021, vol. 58, issue 1, No 12, 203-233
Abstract:
Abstract Quadratic Assignment Problem (QAP) is one of the most complex combinatorial optimization problems. Many real-world problems such as printed circuit board design, facility location problems, assigning gates to airplanes can be modelled as QAP. Problems of size greater than 35 is not able to solve optimally using conventional optimization methods. This warrants the use of evolutionary optimization methods for obtaining optimal or near optimal solutions for QAPs. This work proposes a hybridization on a univariate Estimation of Distribution Algorithm, namely the Population Based Incremental Learning Algorithm (PBILA), with Variable Neighbourhood Search (VNS) for solving QAPs. The proposed algorithm is employed to solve benchmark instances of QAP and the results are reported. The results of this work reveals that PBILA on its own is not efficient for solving the QAPs. However, when hybridised with VNS, the algorithm performs well providing best known solutions for 95 test instances out of the 101 instances considered. For most of the test instances, the percentage deviation is less than one percentage. The overall average percentage deviation of the obtained solutions from the best-known solutions is 0.037%, which is a significant improvement when compared with state-of-the-art algorithms.
Keywords: Quadratic assignment problem; Estimation of distribution algorithms; Variable neighbourhood search (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s12597-020-00475-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:58:y:2021:i:1:d:10.1007_s12597-020-00475-4
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597
DOI: 10.1007/s12597-020-00475-4
Access Statistics for this article
OPSEARCH is currently edited by Birendra Mandal
More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().