A Genetic Algorithm for the Unequal Area Facility Layout Problem

Udo Buscher (), Birgit Mayer () and Tobias Ehrig ()
Additional contact information
Udo Buscher: TU Dresden
Birgit Mayer: TU Dresden
Tobias Ehrig: TU Dresden

A chapter in Operations Research Proceedings 2012, 2014, pp 109-114 from Springer

Abstract: Abstract In this paper we apply a genetic algorithm for solving the facility layout problem. The focus is on departments of unequal sizes. The objective is primarily to minimize material flow factor cost. The chosen genetic method bases on an implemented space-filling curve which continuously connects each unequal area department in order to avoid disjoint areas. In contrast to the existing literature, which applies sweeping, spiral or Hilbert-type patterns, we propose Peano-type patterns. The original Peano curve has to be adjusted in order to be applicable to the considered facility layout problem. We describe the generation of the Peano curve and the applied genetic search. Further, we provide results from several test problems that demonstrate the very good suitability of modified Peano curves for the unequal area facility layout problem.

Keywords: Material Handling; Plant Area; Facility Layout; Quadratic Assignment Problem; Facility Layout Problem (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_16

Ordering information: This item can be ordered from
http://www.springer.com/9783319007953

DOI: 10.1007/978-3-319-00795-3_16

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().