A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM
Name
4387-02.pdf
Size
268.74 KB
Format
Adobe PDF
Checksum (MD5)
43012bfdb02dd0967a4186a20936c646
Author(s)
Ahuja, R.K.
Orlin, J.B.
Pallottino, S.
Scaparra, M.P.
Scutella, M.G.
Date Issued
January 27, 2003
Series/Report no.
MIT Sloan School of Management Working Paper;4387-02
Abstract
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
Subjects
location problems
large scale optimization
multi-exchange
Persistent DSpace Link
