Abstract
The Quadratic Assignment Problem (QAP) is known as one of the most difficult problems within combinatorial optimization. It is used to model many practical problems including different layout problems. The main topic of this paper is to provide methods to check whether a particular instance of the QAP is a layout problem. An instance is a layout problem if the distances of the objects can be reconstructed on the plane and/or in the 3-dimensional space. A new mixed integer programming model is suggested for the case if the distances of the objects are supposed to be rectilinear distances. If the distances are Euclidean distances then the use of the well-known Multi-Dimensional Scaling (MDS) method of statistics is suggested for reconstruction purposes. The well-known difficulty of QAP makes it a popular and suitable experimental field for many algorithmic ideas including artificial intelligence methods. These types of results are published sometimes as layout problems. The methods of reconstruction can be used to decide whether the topic of a paper is layout or only general QAP. The issue what the OR community should expect from AI based algorithms, is also addressed.
Similar content being viewed by others
References
Burkard, R., & Derigs, U. (1980). Lecture notes in economics and mathematical systems: Vol. 184. Assignment and matching problems: solution methods with Fortran programs. Berlin: Springer.
Burkard, R., Karisch, S. E., & Rendl, F. (1997). QPLIB—a quadratic assignment problem library. Journal of Global Optimization, 10, 391–403.
Colorni, A., & Maniezzo, V. (1999). The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering, 11, 769–778.
Hahn, P. M., & Krarup, J. (2001). A hospital facility layout problem finally solved. Journal of Intelligent Manufacturing, 12, 487–496.
Wong, K. Y., & See, P. C. (2010). A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems. International Journal for Computer-Aided Engineering and Software, 27(1), 117–128.
http://en.wikipedia.org/wiki/Multidimensional_scaling (2011).
Quadratic Assignment Problem Library (QAPLIB) homepages, http://www.opt.math.tu-graz.ac.at/qaplib/ and http://www.seas.upenn.edu/qaplib/ (2011).
Ramkumar, A. S., Ponnambalam, S. G., & Jawahar, H. (2009). A population-based hybrid ant system for quadratic assignment formulations in facility layout design. The International Journal of Advanced Manufacturing Technology. doi:10.1007/s00170-008-1849-y.
http://www.statsoft.com/textbook/multidimensional-scaling/ (2011).
Taillard, E. D. (1998). FANT: fast ant system. Technical report, IDSIA-46-98, Lugano.
Taillard, E. D., & Gambardella, L. M. (1997). Adaptive memories for the quadratic assignment problem. Technical report, IDSIA-87-97, Lugano.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Niroomand, S., Takács, S. & Vizvári, B. To lay out or not to lay out?. Ann Oper Res 191, 183–192 (2011). https://doi.org/10.1007/s10479-011-1005-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-1005-1