Show simple item record

dc.contributor.authorAhuja, R.K.
dc.contributor.authorOrlin, J.B.
dc.contributor.authorPallottino, S.
dc.contributor.authorScaparra, M.P.
dc.contributor.authorScutella, M.G.
dc.date.accessioned2003-01-27T16:46:03Z
dc.date.available2003-01-27T16:46:03Z
dc.date.issued2003-01-27T16:46:03Z
dc.identifier.urihttp://hdl.handle.net/1721.1/1797
dc.description.abstractThis 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 problemsen
dc.format.extent275189 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMIT Sloan School of Management Working Paper;4387-02
dc.subjectlocation problemsen
dc.subjectlarge scale optimizationen
dc.subjectmulti-exchangeen
dc.titleA MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEMen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record