IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v45y2013i1p97-120.html
   My bibliography  Save this article

Approximate solution methods for the capacitated multi-facility Weber problem

Author

Listed:
  • Burak Boyaci
  • İ. Altinel
  • Necat Aras

Abstract

This work considers the capacitated multi-facility Weber problem, which is concerned with locating m facilities and allocating their limited capacities to n customers in order to satisfy their demand at minimum total transportation cost. This is a non-convex optimization problem and difficult to solve. Therefore, approximate solution methods are proposed in this article. Some of them are based on the relaxation of the capacity constraints and apply the subgradient algorithm. The resulting Lagrangian subproblem is a variant of the well-known multi-facility Weber problem and can be solved using column generation and branch-and-price approach on a variant of the set covering formulation. Others are based on the approximating mixed-integer linear programming formulations obtained by exploiting norm properties and the alternate solution of the discrete location and transportation problems. The results of a detailed computational analysis are also reported.

Suggested Citation

  • Burak Boyaci & İ. Altinel & Necat Aras, 2013. "Approximate solution methods for the capacitated multi-facility Weber problem," IISE Transactions, Taylor & Francis Journals, vol. 45(1), pages 97-120.
  • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:1:p:97-120
    DOI: 10.1080/0740817X.2012.695100
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2012.695100
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2012.695100?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. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.

    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:taf:uiiexx:v:45:y:2013:i:1:p:97-120. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.