摘要
针对一种简单的车辆路径规划问题,利用基本和声搜索算法,使用顺序编码方式求解,并进行仿真试验。实验结果表明:基本和声搜索算法在求解车辆路径规划问题具有一定的性能。
For a simple vehicle routing problem,the basic harmony search algorithm is used,and the sequential coding method is used to solve the problem.The experimental results show that the basic harmony search algorithm has certain performance in solving the vehicle routing problem.
引文
[1]Basher C,Foulds L R,Wilson J M.Heuristic for Vehicle Routing Oil Tree-Like Networks[J].Joumal of Operational Research Society,1999,50(6):627-635
[2]Eiichi Taniguchi, Hiroshi Shimamoto. Intelligent transportation system based on dynamic vehicle routing and scheduling with variable travel times[J].Transportation Research Part C,2004, 12(3-4):235-250
[3]王玲玲,覃运梅.城市直送式配送运输线路优化[J].广西科技大学学报,2004,15(4):16-18
[4]蔡延光,汤雅连.关联运输调度问题带遗传算子的自适应蚁群算法[J].计算机应用研究,2015,32(8):2313-2318
[5]Zong W G, Kim J H, Loganathan G V. A New Heuristic Optimization Algorithm:Harmony Search[J]. Simulation Transactions of the Society for Modeling&Simulation International,2001, 76(2):60-68
[6]Mahdavi M, Fesanghary M, Damangir E. An improved harmony search algorithm for solving optimization problems[J].Applied Mathematics&Computation, 2007, 188(2):1567-1579
[7]李亮,迟世春,林皋.改进和声搜索算法及其在土坡稳定分析中的应用[J].土木工程学报,2006,39(5):107-111
[8]金永强,苏怀智,李子阳.基于和声搜索的边坡稳定性投影寻踪聚类分析[J].水利学报,2007(s1):687-691
[9]刘杰.改进的和声搜索算法在快递配送路径优化中的应用[J].佳木斯大学学报(自然科学版),2013,31(4):586-588
[10]Kang Seok Lee, Zong Woo Geem, Sang-ho Lee, et al. The harmony search heuristic algorithm for discrete structural optimization[J]. Engineering Optimization,2005,37(7):663-684