A hybrid heuristic for the unequal-area dynamic facility layout problem

Autor:	Alan R. McKendall, Artak Hakobyan
Rok vydání:	2013
Předmět:	Mathematical optimization Operations research Simplex algorithm Computer science Heuristic Modeling and Simulation General Decision Sciences Boundary (topology) Time horizon Facility layout problem Material handling Tabu search Dual (category theory)
Zdroj:	International Journal of Mathematics in Operational Research. 5:743
ISSN:	1757-5869 1757-5850
DOI:	10.1504/ijmor.2013.057492
Popis:	The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on the plant floor for a multi-period planning horizon such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimised. In this paper, the departments may have unequal-areas and can be placed anywhere within the boundary of the continuous plant floor. Because of the complexity of the problem, only small-size problems can be solved in reasonable time using exact methods. As a result, a hybrid heuristic, which consists of a dual simplex method and a tabu search (TS) heuristic, is developed for the DFLP, and the heuristic was tested on some instances from the literature. The results obtained demonstrate the effectiveness of the heuristic.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b1f08d039ea25cc574aff5aee6ba1331 https://doi.org/10.1504/ijmor.2013.057492 Zobrazit plný text záznamu