Volume 4, Issue 4, June 2011, Pages 530 - 549
An Enhanced MOGWW for the bi-objective Quadratic Assignment Problem
Everardo Gutierrez, Carlos Brizuela
Available Online 1 June 2011.
- 10.2991/ijcis.2011.4.4.12How to use a DOI?
- Multi Objective Go With the Winners, Bi-objective QAP, Pareto Local Search, Greedy Nondominated Local Search.
This paper proposes an enhanced Multi-objective Go with the Winners (MOGWW) algorithm to solve multi-objective combinatorial optimization problems. The original MOGWW algorithm is equipped with the well known Pareto Local Search (PLS) procedure. In order to assess the performance of the hybridization, the non-dominated solutions it generates are compared with the ones generated by each of its components. The algorithms are applied to benchmark instances of the bi-objective Quadratic Assignment Problem. Experimental results show that the hybridized version outperforms both its components, i.e. the original MOGWW algorithm and a PLS variant.
- © 2011, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - JOUR AU - Everardo Gutierrez AU - Carlos Brizuela PY - 2011 DA - 2011/06/01 TI - An Enhanced MOGWW for the bi-objective Quadratic Assignment Problem JO - International Journal of Computational Intelligence Systems SP - 530 EP - 549 VL - 4 IS - 4 SN - 1875-6883 UR - https://doi.org/10.2991/ijcis.2011.4.4.12 DO - 10.2991/ijcis.2011.4.4.12 ID - Gutierrez2011 ER -