A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
提出一种超大规模邻域搜索算法，通过客户多重交换和设施移动来求解单源容量设施选址问题，在基准实例和意大利工厂真实数据上验证了有效性。
We present a very large-scale neighborhood (VLSN) 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 presented.