摘要
提出一种求解物流配送车辆路径问题的离散微粒群优化算法。通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。设计了求解车辆路径问题一种新的整数编码方案,并采用罚函数法处理约束条件。计算结果表明,该算法是解决车辆路径问题的有效方法。
A modified particle swarm optimization (PSO) algorithm is proposed for vehicle routing problem (VRP). A PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator. A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function. Simulation results demonstrated the effectiveness of this algorithm.
出处
《系统工程》
CSCD
北大核心
2005年第4期97-100,共4页
Systems Engineering
基金
上海市高校科技发展基金资助项目(03IK09)
上海市教委科研重点资助项目(04FA02)
关键词
车辆路径问题
微粒群优化
整数编码
组合优化
Vehicle Routing Problem
Particle Swarm Optimization
Integer-code
Combinatorial Optimization
