Ant Colony with Stochastic Local Search for the Quadratic Assignment Problem

Author(s):  
Malek Mouhoub ◽  
Zhijie Wang
2018 ◽  
Vol 22 (1) ◽  
Author(s):  
Erika Granillo Martinez ◽  
Rogelio González Velázquez ◽  
María Beatriz Bernabé Loranca ◽  
José Luis Martínez Flores

2020 ◽  
Author(s):  
Shalin Shah

<p>The quadratic assignment problem (QAP) is one of the hardest NPhard problems and problems with a dimension of 20 or more can be difficult to solve using exact methods. The QAP has a set of facilities and a set of locations. The goal is to assign each facility to a location such that the product of the flow between pairs of facilities and the distance between them are minimized. Sometimes there is also a cost associated with assigning a facility to a location. In this work, I solve the QAP using a population based iterative local search with open source code in C++. Results show that the code is able to solve all nug instances to optimality, thereby proving that the algorithm is capable of solving larger problems for which optimum solutions are not known.</p>


2021 ◽  
pp. 327-334
Author(s):  
Rogelio González-Velázquez ◽  
Erika Granillo-Martínez ◽  
María Beatriz Bernábe-Loranca ◽  
Jairo E. Powell-González

Sign in / Sign up

Export Citation Format

Share Document