摘要
追求高效的启发式算法是包装配送问题的重要研究方向。对此,设计一种求解包装配送问题的混沌自适应水波算法(CAWWA)。根据包装配送问题特征设计水波算法(WWA)个体表达式;利用混沌系统生成WWA算法初始种群,并提出一种自适应调整的碎波系数,根据进化代数调整算法搜索范围;利用包装配送实例和6个国际算例进行仿真实验。结果表明,该算法能够适用于包装配送问题求解,且与GA算法、TS算法和ACO算法相比,其全局搜索能力更强、收敛速度更快。
The efficient heuristic algorithm is an important research direction of packaging and distribution problem.So this paper designed the chaotic adaptive water wave algorithm (CAWWA) to solve packaging and distribution problem.The individual expression of WWA was designed according to the characteristics of packaging and distribution problem.Then,the initial population of WWA was generated by the chaotic system,and an adaptive wave breaking coefficient was proposed,which was used to adjust the search range of algorithm on evolutionary algebra.Simulation experiments were carried out by using packaging distribution examples and 6 international examples.The results show that this algorithm can be applied to solve packaging and distribution problems.Compared with GA,TS and ACO,CAWWA has stronger global search ability and faster convergence speed.
作者
彭维
Peng Wei(College of Business Administration,Chongqing City Management College,Chongqing 401331,China)
出处
《计算机应用与软件》
北大核心
2019年第10期55-59,74,共6页
Computer Applications and Software
基金
重庆市教育委员会2017年度科学技术研究项目(1609155488)
关键词
包装配送
混沌
自适应
水波算法
Packaging and distribution
Chaotic
Adaptive
Water wave algorithm