IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-3632-7_14.html
   My bibliography  Save this book chapter

A Global Optimization Method For Weber’s Problem With Attraction And Repulsion

In: Large Scale Optimization

Author

Listed:
  • Costas D. Maranas

    (Princeton University, Department of Chemical Engineering)

  • Christodoulos A. Floudas

    (Princeton University, Department of Chemical Engineering)

Abstract

Weber’s problem involves the optimum location of a single facility on a plane in such a way that the weighted sum of the Euclidean distances of the facility from n given points be at the global minimum. Each point can either have an attractive or repulsive effect on the location of the facility depending on whether the corresponding weight is positive or negative respectively. Because attractive contributions correspond to convex functions and repulsive contributions to concave ones, the total expression for the weighted sum of Euclidean distances is nonconvex. In this paper, two global optimization algorithms are proposed, one based on a concave and one on a concave + convex lower bounding operation. Both of these algorithms utilize efficient rectangular subdivision processes. The proposed approaches attain ∈-convergence to the global minimum in a finite number of iterations. Computational results are presented for problems involving as many as n = 10,000 points.

Suggested Citation

  • Costas D. Maranas & Christodoulos A. Floudas, 1994. "A Global Optimization Method For Weber’s Problem With Attraction And Repulsion," Springer Books, in: W. W. Hager & D. W. Hearn & P. M. Pardalos (ed.), Large Scale Optimization, pages 259-285, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-3632-7_14
    DOI: 10.1007/978-1-4613-3632-7_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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:sprchp:978-1-4613-3632-7_14. 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.