Abstract
Given a non-convex two-dimensional area and identical rectangular stands, we consider the problem of placing the maximum number of stands in the area, by satisfying a number of operational constraints. We present linear programming models and show the total unimodularity of the matrices associated with their constraint sets. We then give computational results obtained by applying the models to the real-world case of the Beira Mar handcraft fair of Fortaleza (Brazil).
Similar content being viewed by others
References
Lodi, A., Martello, S., & Vigo, D. (2002). Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics, 123, 379–396.
Schneuwly, P., & Widmer, M. (2003). Layout modeling and construction procedure for the arrangement of exhibition spaces in a fair. International Transactions in Operational Research, 10, 311–338.
Schrijver, A. (1986). Theory of linear and integer programming. Chichester: Wiley.
Singh, S. P., & Sharma, R. R. K. (2006). A review of different approaches to the facility layout problems. The International Journal of Advanced Manufacturing Technology, 30, 425–433.
Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109–1130.
Widmer, M. (1990) Modèles mathématiques pour une gestion efficace des ateliers flexibles. PhD thesis, Ecole Polytechnique Fédérale de Lausanne, Switzerland.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fernandes Muritiba, A.E., Iori, M., Martello, S. et al. Models and algorithms for fair layout optimization problems. Ann Oper Res 179, 5–14 (2010). https://doi.org/10.1007/s10479-008-0451-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0451-x