欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出一种模拟文化进化的Memetic算法求解带时间窗的车辆路径问题。设计了一种实数编码方案,将离散的问题转为连续优化问题。采用邻域搜索帮助具备一定学习能力的个体提高寻优速度;采用禁忌搜索帮助部分个体跳出局部最优点,增强全局寻优性能。实验结果表明,该算法可以更有效地求出优化解,是带时间窗车辆路径问题的一种有效求解算法。
英文摘要：
This paper proposed a Memetic algorithm,which simulated the process of culture evolution,to solve vehicle routing problem with time windows（VRPTW）.To convert VRPTW into continuous problem,it designed a real coding method.The memetic algorithm helped the particles which had certain learning capacity accelerate convergence rate by local search strategy.Meanwhile,because of helping some particles which fell into the local optimum escape from local optimum by tabu search,it enhanced the diversity of swarm.The experimental result shows that the proposed algorithm can get the solution more effectively and it is an effective method for VRPTW.
同期刊论文项目
同项目期刊论文
期刊信息
位置：