计算机工程与科学2011，Vol.33Issue(3)：141-145,5.DOI:10.3969/j.issn.1007-130X.2011.03.025
PBIL算法在组合优化问题中的应用研究
Application of the PBIL Algorithm to the Combinatorial Problem
摘要
Abstract
PBIL combines the features of genetic algorithms(GA) and competitive learning in an efficient way, which has the advantage of simple execution process, quick and accurate solutions to problems.In this paper, the PBIL algorithm is applied to solving combinatorial optimization problems.Using the logistics center location as an example, we illustrate a general method of solving the combinatorial optimization problems based on PBIL.A new algorithm for producing individuals for such problems is proposed.In order to improve the convergence speed and search capability, an acceleration method of probability learning is put forward based on the comparison of contemporary optimal solution and the successive optimal solution.Finally, the effectiveness of improvement is verified through simulation experiments.关键词
PBIL/组合优化/进化计算/基因算法/物流中心选址Key words
PBIL/ combinatorial optimization/ evolutionary computation/ genetic algorithm/ logistics center location分类
信息技术与安全科学引用本文复制引用
袁利永,倪应华,金炳尧,马永进..PBIL算法在组合优化问题中的应用研究[J].计算机工程与科学,2011,33(3):141-145,5.基金项目
2008年度浙江省教育厅项目(Y200805671) （Y200805671）
2010年度浙江省教育厅项目(Y201016493) （Y201016493）
