IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v2y2007i2p188-207.html
   My bibliography  Save this article

A branch-and-price algorithm for the multi-source Weber problem

Author

Listed:
  • Giovanni Righini
  • Luca Zaniboni

Abstract

We present a branch-and-price algorithm for the exact solution of the multi-source Weber problem, a classical NP-hard optimisation problem in location science with binary variables and non-linear objective. The algorithm is based on a set covering reformulation whose linear relaxation is solved via column generation at every node of a search tree. The pricing subproblem is equivalent to a single-source Weber problem with limited distances. The algorithm solved to optimality several previously unsolved instances with some thousands of points and some hundreds of sources. Computational experiments show that the algorithm is particularly effective at solving instances in which the ratio between the number of sources and the number of points is high.

Suggested Citation

  • Giovanni Righini & Luca Zaniboni, 2007. "A branch-and-price algorithm for the multi-source Weber problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 2(2), pages 188-207.
    • Handle: RePEc:ids:ijores:v:2:y:2007:i:2:p:188-207
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=12460
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Prahalad Venkateshan & Kamlesh Mathur, 2015. "A Heuristic for the Multisource Weber Problem with Service Level Constraints," Transportation Science, INFORMS, vol. 49(3), pages 472-483, August.
    2. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    3. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.

    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:ids:ijores:v:2:y:2007:i:2:p:188-207. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.