A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
In: European Journal of Operational Research, Jg. 218 (2012-04-16), Heft 2, S. 382-391
Online
academicJournal
To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2011.10.052 Byline: Yavuz A. Bozer (a), Chi-Tai Wang (b) Keywords: Facilities planning and design; Simulated annealing; Graph-pair representation; Heuristics; Integer programming Abstract: a* The proposed graph-pair representation technique for the unequal-area facility layout problem. a* Allows easy and appropriate settings of the departments' relative locations. a* Allows easy and appropriate modifications of the departments' relative locations. a* Does not impose any structural constraints (e.g. bands, cuts) on the solution space. a* May be used with a variety of metaheuristics. Author Affiliation: (a) Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109, USA (b) Institute of Industrial Management, National Central University, Jhongli, Taiwan Article History: Received 10 February 2011; Accepted 29 October 2011
Titel: |
A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
|
---|---|
Autor/in / Beteiligte Person: | Bozer, Yavuz A. ; Wang, Chi-Tai |
Link: | |
Zeitschrift: | European Journal of Operational Research, Jg. 218 (2012-04-16), Heft 2, S. 382-391 |
Veröffentlichung: | 2012 |
Medientyp: | academicJournal |
ISSN: | 0377-2217 (print) |
Schlagwort: |
|
Sonstiges: |
|