TU Darmstadt / ULB / TUbiblio

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

Scholz, Daniel and Petrick, Anita and 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, pp. 166-178, 197, [Online-Edition: http://dx.doi.org/10.1016/j.ejor.2008.06.028],
[Article]

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.

Item Type: Article
Erschienen: 2009
Creators: Scholz, Daniel and Petrick, Anita and Domschke, Wolfgang
Title: STaTS: A Slicing Tree and Tabu Search based heuristic for the unequal area facility layout problem
Language: English
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.

Journal or Publication Title: European Journal of Operational Research
Volume: 197
Divisions: 01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete > Operations Research
01 Department of Law and Economics > Betriebswirtschaftliche Fachgebiete
01 Department of Law and Economics
Date Deposited: 11 Dec 2009 15:22
Official URL: http://dx.doi.org/10.1016/j.ejor.2008.06.028
Identification Number: doi:10.1016/j.ejor.2008.06.028
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item