The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals
M. Akyüz,
Temel Öncan and
İ. Altinel
IISE Transactions, 2010, vol. 42, issue 11, 825-841
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.
Date: 2010
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2010.491504 (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:42:y:2010:i:11:p:825-841
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20
DOI: 10.1080/0740817X.2010.491504
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 ().