Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1163.90614
Sankaran, Jayaram K.
On solving large instances of the capacitated facility location problem. (English)
[J] Eur. J. Oper. Res. 178, No. 3, 663-676 (2007). ISSN 0377-2217

Summary: We present two sets of results pertaining to the solution of capacitated facility location problems that are large, especially with regard to the number of customers. One set of results relates to customer aggregation, while another set of results concerns the judicious selection of variable-upper-bounding (VUB) constraints to include in the initial integer-programming formulation.In many real-world instances of facility location problems, cities and towns define `customers' and their `demands'. Such problems typically feature large metropolises that have numerous satellite townships whose total population is exceeded (often, greatly) by that of the associated metropolis. We argue that both sets of our results would be relevant in solving such problems. We discuss our computational experiences with reference to a real-world variant of the classical capacitated facility location problem that spurred the results reported here.

MSC 2000:: *90B80 Discrete location and assignment
90C10 Integer programming

Keywords: facilities planning and design; customer aggregation; integer programming; polyhedral approaches; variable-upper-bounds

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]