Journal article
I. Jankovits, C. Luo, M.F. Anjos, A. Vannelli
European Journal of Operational Research, vol. 214(2), 2011, pp. 199-215
European Journal of Operational Research, vol. 214(2), 2011, pp. 199-215
Semantic Scholar
DBLP
DOI
Cite
Cite
APA
Click to copy
Jankovits, I., Luo, C., Anjos, M. F., & Vannelli, A. (2011). A convex optimisation framework for the unequal-areas facility layout problem. European Journal of Operational Research, 214(2), 199–215. https://doi.org/10.1016/j.ejor.2011.04.013
Chicago/Turabian
Click to copy
Jankovits, I., C. Luo, M.F. Anjos, and A. Vannelli. “A Convex Optimisation Framework for the Unequal-Areas Facility Layout Problem.” European Journal of Operational Research 214, no. 2 (2011): 199–215.
MLA
Click to copy
Jankovits, I., et al. “A Convex Optimisation Framework for the Unequal-Areas Facility Layout Problem.” European Journal of Operational Research, vol. 214, no. 2, 2011, pp. 199–215, doi:10.1016/j.ejor.2011.04.013.
BibTeX Click to copy
@article{i2011a,
title = {A convex optimisation framework for the unequal-areas facility layout problem},
year = {2011},
issue = {2},
journal = {European Journal of Operational Research},
pages = {199-215},
volume = {214},
doi = {10.1016/j.ejor.2011.04.013},
author = {Jankovits, I. and Luo, C. and Anjos, M.F. and Vannelli, A.}
}
Abstract
The unequal-areas facility layout problem is concerned with finding the optimal arrangement of a given number of non-overlapping indivisible departments with unequal area requirements within a facility. We present a convex-optimisation-based framework for efficiently finding competitive solutions for this problem. The framework is based on the combination of two mathematical programming models. The first model is a convex relaxation of the layout problem that establishes the relative position of the departments within the facility, and the second model uses semidefinite optimisation to determine the final layout. Aspect ratio constraints, frequently used in facility layout methods to restrict the occurrence of overly long and narrow departments in the computed layouts, are taken into account by both models. We present computational results showing that the proposed framework consistently produces competitive, and often improved, layouts for well-known large instances when compared with other approaches in the literature.
