TU Darmstadt / ULB / TUbiblio

STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem

Scholz, Daniel ; Petrick, Anita ; Domschke, Wolfgang (2009)
STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem.
In: European Journal of Operational Research, 197
doi: 10.1016/j.ejor.2008.06.028
Artikel, Bibliographie

Kurzbeschreibung (Abstract)

In this paper a slicing tree based tabu search heuristic for the rectangular, continual plane facility layout problem is presented. In addition to the incorporation of facilities with unequal areas we also integrate the possibility to specify various requirements regarding (rectangular) shape and dimensions of each individual facility by using bounding curves. Therefore, it is possible to solve problems containing facilities of fixed and facilities of flexible shapes at the same time. We present a procedure that calculates the layout corresponding to a given slicing tree on the basis of bounding curves. These layouts are slicing structures which are able to contain empty spaces to guarantee that stringent shape restrictions of facilities are kept. Due to these features this approach is better suited for practical use than so far existing ones. The effectiveness of our approach in terms of objective function value is shown by comparing our results to those found in the literature. Even a large problem instance comprised of 62 facilities has been solved.

Typ des Eintrags: Artikel
Erschienen: 2009
Autor(en): Scholz, Daniel ; Petrick, Anita ; Domschke, Wolfgang
Art des Eintrags: Bibliographie
Titel: STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem
Sprache: Englisch
Publikationsjahr: 2009
Titel der Zeitschrift, Zeitung oder Schriftenreihe: European Journal of Operational Research
Jahrgang/Volume einer Zeitschrift: 197
DOI: 10.1016/j.ejor.2008.06.028
Kurzbeschreibung (Abstract):

In this paper a slicing tree based tabu search heuristic for the rectangular, continual plane facility layout problem is presented. In addition to the incorporation of facilities with unequal areas we also integrate the possibility to specify various requirements regarding (rectangular) shape and dimensions of each individual facility by using bounding curves. Therefore, it is possible to solve problems containing facilities of fixed and facilities of flexible shapes at the same time. We present a procedure that calculates the layout corresponding to a given slicing tree on the basis of bounding curves. These layouts are slicing structures which are able to contain empty spaces to guarantee that stringent shape restrictions of facilities are kept. Due to these features this approach is better suited for practical use than so far existing ones. The effectiveness of our approach in terms of objective function value is shown by comparing our results to those found in the literature. Even a large problem instance comprised of 62 facilities has been solved.

Fachbereich(e)/-gebiet(e): 01 Fachbereich Rechts- und Wirtschaftswissenschaften > Betriebswirtschaftliche Fachgebiete > Operations Research
01 Fachbereich Rechts- und Wirtschaftswissenschaften > Betriebswirtschaftliche Fachgebiete
01 Fachbereich Rechts- und Wirtschaftswissenschaften
Hinterlegungsdatum: 11 Dez 2009 15:22
Letzte Änderung: 05 Mär 2013 09:28
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen