We present a very large-scale neighborhood (VLNS) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both traditional single-customer multi-exchanges, detected on a suitably defined customer improvement graph, and more innovative multicustomer multi-exchanges, detected on a facility improvement graph dynamically built through the use of a greedy scheme. Computational results for some benchmark instances are reported that demonstrate the effectiveness of the approach for solving large-scale problems. A further test on real data involving an Italian factory is also preseted.
|Autori:||R.K. AHUJA; J.B. ORLIN; S. PALLOTTINO. M.P. SCAPARRA; SCUTELLA' M|
|Titolo:||A multi-exchange heuristic for the single source capacitated facility location problem|
|Anno del prodotto:||2004|
|Digital Object Identifier (DOI):||10.1287/mnsc.1030.0193|
|Appare nelle tipologie:||1.1 Articolo in rivista|