Approximate solution methods for the capacitated multi-facility Weber problem

Burak Boyaci, İ. Altinel and Necat Aras

IISE Transactions, 2013, vol. 45, issue 1, 97-120

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.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.695100 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:45:y:2013:i:1:p:97-120

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2012.695100

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().