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

  • Authors:

  • A. S. Ramkumar;S. G. Ponnambalam;N. Jawahar

  • Affiliations:

  • Amrita School of Engineering, AVVP, India;School of Engineering, Monash University, Sunway Campus, Malaysia;Thiagarajar College of Engineering, Madurai, India

  • Venue:
  • Robotics and Computer-Integrated Manufacturing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In facility layout design, the problem of locating facilities with material flow between them was formulated as a quadratic assignment problem (QAP), so that the total cost to move the required material between the facilities is minimized, where the cost is defined by a quadratic function. In this paper, we propose a modification to iterated fast local search algorithm (IFLS) with a new recombination crossover operator and the modified IFLS is addressed as NIFLS. The ideas we incorporate in the NIFLS are iterated self-improvement with evolutionary based perturbation tool, which includes (i) recombination crossover as perturbation tool and (ii) self-improvement in mutation operation followed by a local search. Three schemes of NIFLS are proposed and the obtained solution qualities by the three schemes are compared. We test our algorithm on all the benchmark instances of QAPLIB, a well-known library of QAP instances. The performance of proposed recombination crossover with sliding mutation (RCSM) scheme of NIFLS is well superior to the other two schemes of NIFLS.