摘要： 讨论了多服务中心设置问题的局部搜索近似算法及其在实际计算中表现出的新性质。首先对局部搜索算法求解多服务中心设置问题的实际近似性能比给出了一个针对性分析结果,然后编程实验对局部搜索求解算法的求解时间和求解质量进行了探讨。
关键词:
多服务中心设置,
启发式局部搜索,
贪心算法
Abstract: This paper discusses approximation local search algorithms for uncapacitated facility location problems (UFLP) and its new property inactual computation. This paper firstly presents an analysis result of approximation algorithm about UFLP by using local search, then it discusses therunning time and the quality of solutions through computer verification of local search algorithm.
中图分类号:
肖进杰,朱大铭,马绍汉,潘锐. 多服务中心设置问题局部搜索算法的分析与实验[J]. , 2005, 31(12): 92-94.
XIAO Jinjie1, ZHU Daming2, MA Shaohan2, PAN Rui2. Analysis and Testing of Local Search Algorithms for Uncapacitated Facility Location Problems[J]. , 2005, 31(12): 92-94.