IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v56y2002i1p3-27.html
   My bibliography  Save this article

An Attractor-Repeller approach to floorplanning

Author

Listed:
  • Miguel F. Anjos
  • Anthony Vannelli

Abstract

The floorplanning (or facility layout) problem consists in finding the optimal positions for a given set of modules of fixed area (but perhaps varying height and width) within a facility such that the distances between pairs of modules that have a positive connection cost are minimized. This is a hard combinatorial optimization problem; even the restricted version where the shapes of the modules are fixed and the optimization is taken over a fixed finite set of possible module locations is NP-hard. In this paper, we extend the concept of target distance introduced by Etawil and Vannelli and apply it to derive the AR (Attractor-Repeller) model which is designed to improve upon the NLT method of van Camp et al. This new model is designed to find a good initial point for the Stage-3 NLT solver and has the advantage that it can be solved very efficiently using a suitable optimization algorithm. Because the AR model is not a convex optimization problem, we also derive a convex version of the model and explore the generalized target distances that arise in this derivation. Computational results demonstrating the potential of our approach are presented. Copyright Springer-Verlag Berlin Heidelberg 2002

Suggested Citation

  • Miguel F. Anjos & Anthony Vannelli, 2002. "An Attractor-Repeller approach to floorplanning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(1), pages 3-27, August.
    • Handle: RePEc:spr:mathme:v:56:y:2002:i:1:p:3-27
    DOI: 10.1007/s001860200197
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200197
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860200197?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. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    2. Chaomin Luo & Miguel F. Anjos & Anthony Vannelli, 2008. "A nonlinear optimization methodology for VLSI fixed-outline floorplanning," Journal of Combinatorial Optimization, Springer, vol. 16(4), pages 378-401, November.
    3. Ignacio Castillo & Thaddeus Sim, 2004. "A spring-embedding approach for the facility layout problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 73-81, January.
    4. Miguel F. Anjos & Anthony Vannelli, 2006. "A New Mathematical-Programming Framework for Facility-Layout Design," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 111-118, February.
    5. Jankovits, Ibolya & Luo, Chaomin & Anjos, Miguel F. & Vannelli, Anthony, 2011. "A convex optimisation framework for the unequal-areas facility layout problem," European Journal of Operational Research, Elsevier, vol. 214(2), pages 199-215, October.
    6. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.

    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:mathme:v:56:y:2002:i:1:p:3-27. 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.