期刊文献+

基于信息熵的量子免疫遗传算法 被引量:6

Quantum immune genetic algorithm based on information entropy
下载PDF
导出
摘要 针对目前的量子进化算法在高维函数优化时容易陷入局部最优,利用信息熵的概念,将量子进化算法和免疫遗传算法进行改进与融合,提出一种基于信息熵的量子免疫遗传算法.该方法对抗体采用相位编码,用信息熵准确地度量量子比特的不确定信息;提出了一种按变量的种群熵降序排列的邻域搜索策略;对于抗体之间的相似度,给出了一种按个体熵相同变量位数的度量方法;用繁殖概率对抗体的多样性进行评价,并分别以函数优化问题和VRPSDP问题进行了仿真验证.研究结果表明:该算法收敛速度快,求解精度高. Currently,high-dimensional function is optimized through quantum evolutionary algorithm,and it is easy to fall into local optimum.In this paper,the authors introduce the concept of information entropy and improve and integrate the fusion quantum evolutionary algorithm and immune genetic algorithm to propose a new quantum immune genetic algorithm based on information entropy.In this proposed algorithm,the antibody is encoded according to the phase,and uncertain information is measured by information entropy accurately.The authors propose a neighborhood search strategy by descending order of population entropy.For the degree of similarity between the antibodies,the authors give a measure based on the same individual entropy variable median,and the antibody diversity is evaluated through reproduction probability.The function optimization and VRPSDP(Vehicle Routing Problem with Simultaneous Delivery and Pickup,VRPSDP) are simulated and validated.The results show that the algorithm achieves a fast speed in convergence and accuracy in solution.
出处 《辽宁工程技术大学学报(自然科学版)》 CAS 北大核心 2013年第4期549-556,共8页 Journal of Liaoning Technical University (Natural Science)
基金 高等学校博士学科点专项科研基金资助项目(20110042120027)
关键词 量子免疫遗传算法 信息熵 量子进化算法 免疫遗传算法 函数优化 VRPSDP 相位编码 邻域搜索策略 quantum immune genetic algorithm information entropy quantum evolution algorithm immune genetic algorithm function optimization VRPSDP phase encoding neighborhood search strategy
  • 相关文献

参考文献7

二级参考文献61

  • 1曾三友,魏巍,康立山,姚书振.基于正交设计的多目标演化算法[J].计算机学报,2005,28(7):1153-1162. 被引量:36
  • 2周急流.[D].成都:四川大学,2000.
  • 3Dantzig G B,Ramser J H.The truck dispatching problem[J].Management Science, 1959,6( 1 ) : 80-91.
  • 4Min H.The multiple vehicle routing problem with simultaneous delivery and pickup points[J].Transportation Research A, 1989, 23A(5) : 377-386.
  • 5Dethloff J.Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up[J].OR Spektrum,2001,23(1) : 79-96.
  • 6Salhi S,Nagy G.A cluster insertion heuristic for single and multiple depot vehicle routing problem with backhauling[J].Journal of the Operational Research Society, 1999,50(10):1034-1042.
  • 7Crispim J, Brandao J.Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with baekhauls[J].Joumal of the Operational Research Society, 2005, 56 ( 11 ) : 1296-1302.
  • 8Tang Montane F A, Galvao R D.A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J].Computers & Operations Research, 2006,33 (3) : 595-619.
  • 9Cao Er-bao, Lai Ming-young.An improved genetic algorithm for the vehicle routing problem with simultaneous delivery and pickup[C]//The Sixth Wuhan International Conference on E-Business-Innovation Management Track,2007,50(9):2100-2106.
  • 10Mosheiov G.The traveling salesman problem with pick-up and delivery[J].European Journal of Operational Research, 1994, 79 (2):299-310.

共引文献248

同被引文献63

引证文献6

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部