Iterated fast local search algorithm for solving quadratic assignment problems |
| |
Authors: | A.S. Ramkumar S.G. Ponnambalam N. Jawahar R.K. Suresh |
| |
Affiliation: | aAmrita School of Engineering, AVVP, India;bSchool of Engineering and Science, Monash University, Malaysia;cThiagarajar College of Engineering, Madurai, India |
| |
Abstract: | This paper concentrates on multi-row machine layout problems that can be accurately formulated as quadratic assignment problems (QAPs). A genetic algorithm-based local search approach is proposed for solving QAPs. In the proposed algorithm, three different mutation operators namely adjacent, pair-wise and insertion or sliding operators are separately combined with a local search method to form a mutation cycle. Effectiveness of introducing the mutation cycle in place of mutation is studied. Performance of the proposed iterated approach is analyzed and the solution qualities obtained are reported. |
| |
Keywords: | Facility layout QAP Optimization Evolutionary algorithm |
本文献已被 ScienceDirect 等数据库收录! |