Using pareto-optimality for solving multi-objective unequal area facility layout problem

  title={Using pareto-optimality for solving multi-objective unequal area facility layout problem},
  author={Kazi Shah Nawaz Ripon and Kashif Nizam Khan and Kyrre Glette and Mats Erling H\ovin and Jim T\orresen},
A lot of optimal and heuristic algorithms for solving facility layout problem (FLP) have been developed in the past few decades. The majority of these approaches adopt a problem formulation known as the quadratic assignment problem (QAP) that is particularly suitable for equal area facilities. Unequal area FLP comprises a class of extremely difficult and widely applicable optimization problems arising in many diverse areas to meet the requirements for real-world applications. Unfortunately… CONTINUE READING


Publications referenced by this paper.
Showing 1-7 of 7 references

A sequence-pair representation and MIP model based heuristic for the facility layout problem with rectangular departments

  • Q. Liu, R. D. Meller
  • IIE Trans
  • 2007
Highly Influential
9 Excerpts

Using genetic algorithms on facilities layout problems

  • M. H. Hu, Wang, –J M.
  • Int. J. Adv Manuf. Tech
  • 2004
Highly Influential
5 Excerpts

Unequal-area facility layout by genetic search

  • D. M. Tate, E SmithA.
  • IIE Trans
  • 1995
Highly Influential
8 Excerpts

A fast and elitist multiobjective genetic algorithm: NSGA-II

  • K. Deb, A. Pratap, S. Agarwal, T. Meyarivan
  • IEEE T. Evolut. Comput
  • 2002
Highly Influential
3 Excerpts

A heuristic algorithm and simulation approach to relative location of facilities

  • G. C. Armour, E. S. Buffa
  • Manage. Sci
  • 1963
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…