Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
414654 | Robotics and Computer-Integrated Manufacturing | 2008 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
A.S. Ramkumar, S.G. Ponnambalam, N. Jawahar, R.K. Suresh,