设施选址问题
计算机科学
水准点(测量)
方案(数学)
启发式
图形
数学优化
工厂(面向对象编程)
贪婪算法
比例(比率)
理论计算机科学
算法
人工智能
数学
数学分析
量子力学
地理
物理
程序设计语言
大地测量学
作者
Ravindra K. Ahuja,James B. Orlin,Stefano Pallottino,Maria Paola Scaparra,Maria Grazia Scutellà
出处
期刊:Management Science
[Institute for Operations Research and the Management Sciences]
日期:2004-06-01
卷期号:50 (6): 749-760
被引量:148
标识
DOI:10.1287/mnsc.1030.0193
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI