Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (2): 34-36.DOI: 10.3778/j.issn.1002-8331.2010.02.011

• 研究、探讨 • Previous Articles     Next Articles

Test of local search algorithms for uncapacitated facility location problems

XIAO Jin-jie,XIE Qing-song,NIU Cui-xia   

  1. Department of Computer Science and Technology,Shandong Institute of Business and Technology,Yantai,Shandong 264005,China
  • Received:2008-07-31 Revised:2008-10-20 Online:2010-01-11 Published:2010-01-11
  • Contact: XIAO Jin-jie



  1. 山东工商学院 计算机科学与技术学院,山东 烟台 264005
  • 通讯作者: 肖进杰

Abstract: This paper discusses approximation local search algorithms for Uncapacitated Facility Location Problems(UFLP) and its new property in actual computation.This paper mainly discusses different generation methods of the initial solution,the influence of facility cost and service cost and the improvement of local search algorithm.The testing data shows:There are about 99% instances for which local search algorithm can be used to directly compute their optimal solutions;the running time of the algorithm using initial solutions of greedy algorithm is shorter than that of algorithm using initial solutions of randomized algorithm,but the quality of solutions is almost the same;the bigger the facility cost and the service cost are,the easier local search algorithm gets the optimal solutions.

Key words: uncapacitated facility location problems, local search algorithm, greedy algorithm

摘要: 讨论设备问题的局部搜索近似算法及其在实际计算中表现出的新性质。主要讨论局部搜索算法中初始解的产生方法,设备价值与服务价值大小对算法求解性能的影响。实验表明:约有99%以上的实例可直接利用局部搜索算法求得最优解;贪心算法产生初始解的局部搜索算法求解时间明显短于随机算法产生初始解的方法,但两者求解质量相当;设备价值和服务价值数值范围越大,局部搜索算法越容易求得最优解。

关键词: 设备定位问题, 局部搜索, 贪心算法

CLC Number: