摘要
本文研究了选址问题中无容量限制的p-中值问题,在Rolland等人提出的有效禁忌搜索算法基础上,提出了一种以目标函数变化量作为评价函数的改进禁忌搜索算法,并进行了理论分析,然后将其与有效禁忌搜索算法作了性能比较。通过比较三个公共测试数据集的计算结果,验证了本文提出的禁忌搜索算法的可行性和有效性。
This paper deals with the uncapacitated facility location p-median problem. Based on the efficient tabu search algorithm proposed by Rolland et al, a novel tabu search algorithm, which uses the objective function difference as evaluation function, is developed to solve the uneapaeitated p-median problem. The new approach is compared with the efficient tabu search algorithm by three benchmark test problems. The numerical results show that the proposed tabu search algorithm for uneapaeitated p-median problem is feasible and more efficient.
出处
《运筹与管理》
CSCD
2008年第1期18-23,共6页
Operations Research and Management Science
基金
国家自然科学基金资助项目(10571018
70431001)
关键词
运筹学
选址问题
禁忌搜索算法
p-中值问题
operational research
location problems
tabu search algorithm
p-median problem
