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

The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals

Author

Listed:
  • M. Akyüz
  • Temel Öncan
  • İ. Altinel

Abstract

The Capacitated Multi-facility Weber Problem (CMWP) is concerned with locating I capacitated facilities so as to satisfy the demand of J customers with the minimum total transportation cost of a single commodity. This is a non-convex optimization problem and is difficult to solve. This work focuses on a multi-commodity extension and considers the situation where K distinct commodities are shipped to the customers subject to capacity and demand constraints. Customer locations, demands, and capacities for each commodity are known a priori. The transportation costs, which are proportional to the distance between customers and facilities, depend on the commodity type. A mathematical programming formulation of the problem is presented and two alternate location-allocation heuristics and a discrete approximation method are proposed and subsequently used to statistically estimate confidence intervals on the optimal objective function values. Computational experiments on standard and randomly generated test instances are also presented.

Suggested Citation

  • M. Akyüz & Temel Öncan & İ. Altinel, 2010. "The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals," IISE Transactions, Taylor & Francis Journals, vol. 42(11), pages 825-841.
  • Handle: RePEc:taf:uiiexx:v:42:y:2010:i:11:p:825-841
    DOI: 10.1080/0740817X.2010.491504
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/0740817X.2010.491504?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.

    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:42:y:2010:i:11:p:825-841. 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.