IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v191y2011i1p183-19210.1007-s10479-011-1005-1.html
   My bibliography  Save this article

To lay out or not to lay out?

Author

Listed:
  • Sadegh Niroomand
  • Szabolcs Takács
  • Béla Vizvári

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. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Sadegh Niroomand & Szabolcs Takács & Béla Vizvári, 2011. "To lay out or not to lay out?," Annals of Operations Research, Springer, vol. 191(1), pages 183-192, November.
    • Handle: RePEc:spr:annopr:v:191:y:2011:i:1:p:183-192:10.1007/s10479-011-1005-1
    DOI: 10.1007/s10479-011-1005-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-1005-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-1005-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ramazan Şahin & Sadegh Niroomand & Esra Duygu Durmaz & Saber Molla-Alizadeh-Zavardehi, 2020. "Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem," Annals of Operations Research, Springer, vol. 295(1), pages 313-336, December.
    2. Richárd Molnár-Szipai & Anita Varga, 2019. "Integrating combinatorial algorithms into a linear programming solver," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 475-482, June.
    3. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:191:y:2011:i:1:p:183-192:10.1007/s10479-011-1005-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.