• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

PBIL算法在组合优化问题中的应用研究

展开
  • (1.浙江师范大学数理与信息工程学院,浙江 金华 321004;2.浙江师范大学行知学院,浙江 金华 321004;
    3.浙江师范大学信息传播实验教学中心,浙江 金华 321004)
袁利永(1978),男,浙江嵊州人,讲师,研究方向为进化计算和机器学习。倪应华(1977),男,浙江海盐人,讲师,研究方向为计算机辅助技术和多媒体技术应用。金炳尧(1964),男,浙江兰溪人,硕士,教授,研究方向为模式识别和进化计算。

收稿日期: 2010-03-11

  修回日期: 2010-05-29

  网络出版日期: 2011-03-25

基金资助

2008年度浙江省教育厅项目(Y200805671)

Application of the PBIL Algorithm to the Combinatorial Problem

Expand
  • (1.School of Mathematics Physics and Information Engineering,Zhejiang Normal University,Jinhua 321004;
    2.Xinzhi School,Zhejiang Normal University,Jinhua 321004;
    3.Information Dissemination Experimental Teaching Center,Zhejiang Normal University,Jinhua 321004,China)

Received date: 2010-03-11

  Revised date: 2010-05-29

  Online published: 2011-03-25

摘要

基于群体的增量学习(PBIL)算法有效结合了遗传算法和竞争学习的优点,运行过程简单,解决问题快速准确。本文提出将PBIL算法应用于求解CMN组合优化问题,以物流中心选址优化问题为例,介绍了基于PBIL求解CMN组合优化问题的一般方法,提出了针对此类问题的个体产生算法。为了提高算法的收敛速度和寻优能力,提出了基于当代最优解与历代最优解比较结果的概率学习加速方法。最后,通过实验仿真验证了上述改进的有效性。

本文引用格式

袁利永1,倪应华2,金炳尧3,马永进1 . PBIL算法在组合优化问题中的应用研究[J]. 计算机工程与科学, 2011 , 33(3) : 141 -145 . DOI: 10.3969/j.issn.1007130X.2011.

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.

参考文献

[1]Baluja S.PopulationBased Incremental Learning[R].Technical Report CMUCS94163,CarnegieMellon University,1994.
[2]Rastegar R,Hariri A,Mazoochi M.A Convergence Proof for the Population Based Incremental Learning Algorithm[C]∥Proc of the 17th IEEE Int’l Conf on Tools with Artificial Intelligence,2005:387391.
[3]金炳尧,蔚承建,何振亚.一个用于优化搜索的学习算法[J].软件学报,2001,12(3):448453.
[4]Zhang Qingbin, Wu Tihua, Liu Bo. A Population Based Incremental Learning Algorithm with Elitist Strategy[C]∥Proc of the 3rd Int’l Conf on Natural Computation,2007:583587.
[5]GallagherM, Frean M. Population Based Continuous Optimization Probabilistic Modeling and Mean Shift[J]. Evolutionary Computation,2005,13(1):2942.
[6]金炳尧,马永进,骆红波.基于PBIL 算法的自动组卷系统研究[J].计算机工程与科学,2005,27(10):4849.
[7]Baluja S,Caruana R.Removing the Genetics form the Standardgenetic Algorithm[C]∥Proc of the Int’l Conf on Machine Learning,1995:3846.
[8]万莉,黄挚雄,李志勇.基于GIS优化Dijkstra算法在物流中心选址中的研究[J].计算机应用研究,2007,24(8):289291.

文章导航

/