| 改进的二进制粒子群算法求解车辆路径问题 |
| |
| 引用本文： | 罗金炎.改进的二进制粒子群算法求解车辆路径问题[J].数学的实践与认识,2014(23). |
| |
| 作者姓名： | 罗金炎 |
| |
| 作者单位： | 闽江学院数学系; |
| |
| 基金项目： | 国家自然科学基金(11301255);福建省中青年教师教育科研项目(JK2013040) |
| |
| 摘 要： | 设计了一种改进的二进制粒子群优化算法来求解车辆路径问题,算法基于粒子群算法的寻优模式充分考虑粒子之间的导向作用,改进二进制粒子群算法的位取值方式,减小了在进化过程中停滞于局部最优解的概率,并通过构造辅助函数处理优化问题的约束条件,基于分层次实现多个目标的思路来寻优,提高了算法的搜索效率和计算速度.实验测试结果验证了该算法对求解车辆路径问题的适用性和有效性.
|
| 关 键 词： | 车辆路径问题 NP难问题 二进制粒子群优化算法 |
Modified Binary Particle Swarm Optimization Algorithm forSolving Vehicle Routing Problem |
| |
| Abstract: | An improved binary Particle Swarm Optimization algorithm is designed to solve the Vehicle routing problem.Compared to the basic binary Particle Swarm Optimization,the algorithm introduces a new bit change function which can reduce the probabihty of stagnation in the process of evolution.and by applying a relaxed dominance concept adapted from the multi-objective optimization,the approach can be able to assess progress towards feasibility and optimality.The experimental result shows that the proposed algorithm can get the solution more effectively to solve the vehicle routing problem with time windows. |
| |
| Keywords: | vehicle routing problem NP-hard problem binary particle swarm optimization |
| 本文献已被 CNKI 等数据库收录！ |
