| 基于离散微粒群优化的物流配送车辆路径问题 |
| |
| 引用本文： | 肖健梅,黄有方,李军军,王锡淮. 基于离散微粒群优化的物流配送车辆路径问题[J]. 系统工程, 2005, 23(4): 97-100 |
| |
| 作者姓名： | 肖健梅 黄有方 李军军 王锡淮 |
| |
| 作者单位： | 上海海事大学,物流工程学院,上海,200135 |
| |
| 基金项目： | 上海市高校科技发展基金资助项目(03IK09)，上海市教委科研重点资助项目(04FA02) |
| |
| 摘 要： | 提出一种求解物流配送车辆路径问题的离散微粒群优化算法。通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。计算结果表明，该算法是解决车辆路径问题的有效方法。
|
| 关 键 词： | 车辆路径问题 微粒群优化 整数编码 组合优化 |
| 文章编号： | 1001-4098(2005)04-0097-04 |
Vehicle Routing Problem Based on Discrete Particle Swarm Optimization |
| |
| XIAO Jian-mei,HUANG You-fang,LI Jun-jun,WANG Xi-huai. Vehicle Routing Problem Based on Discrete Particle Swarm Optimization[J]. Systems Engineering, 2005, 23(4): 97-100 |
| |
| Authors: | XIAO Jian-mei HUANG You-fang LI Jun-jun WANG Xi-huai |
| |
| Abstract: | 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. |
| |
| Keywords: | Vehicle Routing Problem Particle Swarm Optimization Integer-code Combinatorial Optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
