Iterated fast local search algorithm for solving quadratic assignment problems

Authors:
A. S. Ramkumar;S. G. Ponnambalam;N. Jawahar;R. K. Suresh
Affiliations:
Amrita School of Engineering, AVVP, India;School of Engineering and Science, Monash University, Malaysia;Thiagarajar College of Engineering, Madurai, India;Amrita School of Engineering, AVVP, India
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2008

Citing 12
Cited 1

A parallel algorithm for the quadratic assignment problem

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A new lower bound for the quadratic assignment problem

Operations Research - Supplement
A genetic approach to the quadratic assignment problem

Computers and Operations Research - Special issue on genetic algorithms
P-Complete Approximation Problems

Journal of the ACM (JACM)
ACO algorithms for the quadratic assignment problem

New ideas in optimization
A greedy genetic algorithm for the quadratic assignment problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Formal Memetic Algorithms

Selected Papers from AISB Workshop on Evolutionary Computing
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem

HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Paper: Robust taboo search for the quadratic assignment problem

Parallel Computing
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A new iterated fast local search heuristic for solving QAP formulation in facility layout design

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.00

Visualization

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.