| 定位-运输路线安排问题的改进离散粒子群优化算法 |
| |
| 引用本文： | 彭扬,陈子侠,吴承键. 定位-运输路线安排问题的改进离散粒子群优化算法[J]. 智能系统学报, 2010, 5(1): 74-79. DOI: 10.3969/j.issn.1673-4785.2010.01.013 |
| |
| 作者姓名： | 彭扬 陈子侠 吴承键 |
| |
| 作者单位： | 浙江工商大学,计算机与信息工程学院,浙江,杭州,310018 |
| |
| 基金项目： | 国家自然科学基金资助项目，浙江省科技计划重点资助项目 |
| |
| 摘 要： | 定位-运输路线安排问题(LRP)是集成物流中的一个NP-hard难题,为求解一类特殊的LRP问题,提出改进的离散粒子群优化算法.该方法采用整体优化的思想,将LAP和VRP集成在一起.通过合适的粒子编码方式,并改进粒子的运动方程,引入相应的变异算子和趋同扰动算子等,使得算法的适用性和性能获得了改善.通过仿真实验及与另2个典型算法的比较分析,证明了该算法的有效性.
|
| 关 键 词： | 定位-运输路线安排问题 离散粒子群优化 变异算子 进化算法 |
Improved discrete particle swarm optimization algorithm for location-routing problems |
| |
| PENG Yang,CHEN Zi-xia,WU Cheng-jian. Improved discrete particle swarm optimization algorithm for location-routing problems[J]. CAAL Transactions on Intelligent Systems, 2010, 5(1): 74-79. DOI: 10.3969/j.issn.1673-4785.2010.01.013 |
| |
| Authors: | PENG Yang CHEN Zi-xia WU Cheng-jian |
| |
| Affiliation: | PENG Yang,CHEN Zi-xia,WU Cheng-jian(College of Computer Science & Information Engineering,Zhejiang Gongshang University,Hangzhou 310018,China) |
| |
| Abstract: | The location-routing problem (LRP) is an NP-hard problem in integrated logistics systems.An improved discrete particle swarm optimization (PSO) algorithm was developed to tackle a special kind of LRP.It adopted the principle of whole optimization,integrating the location-allocation problem (LAP) with a vehicle routing problem (VRP).First,a novel code for the particle was introduced.Next,the particle's motion equation was improved,and the mutation operator and the disturbing operator against the population i... |
| |
| Keywords: | location routing problem discrete particle swarm optimization mutation operator evolution algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
