A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1797

Full metadata record

DC Field	Value	Language
dc.creator	Ahuja, R.K.	-
dc.creator	Orlin, J.B.	-
dc.creator	Pallottino, S.	-
dc.creator	Scaparra, M.P.	-
dc.creator	Scutella, M.G.	-
dc.date	2003-01-27T16:46:03Z	-
dc.date	2003-01-27T16:46:03Z	-
dc.date	2003-01-27T16:46:03Z	-
dc.date.accessioned	2013-05-31T20:04:52Z	-
dc.date.available	2013-05-31T20:04:52Z	-
dc.date.issued	2013-06-01	-
dc.identifier	http://hdl.handle.net/1721.1/1797	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neigh- borhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges, detected on a suitably defined cus- tomer improvement graph, and multi-customer multi-exchanges, detected on a facility improvement graph dynamically built through the use of a greedy scheme. Compu- tational results for some benchmark instances are reported, which demonstrate the effectiveness of the approach for solving large-scale problems	-
dc.format	275189 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	MIT Sloan School of Management Working Paper;4387-02	-
dc.subject	location problems	-
dc.subject	large scale optimization	-
dc.subject	multi-exchange	-
dc.title	A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI