首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于粒子群算法的多目标车辆调度模型求解
引用本文:丰伟,李雪芹.基于粒子群算法的多目标车辆调度模型求解[J].系统工程,2007,25(4):15-19.
作者姓名:丰伟  李雪芹
作者单位:西南交通大学,交通运输学院,四川,成都,610031
基金项目:交通部行业联合科技攻关计划
摘    要:车辆调度问题是具有复杂约束条件的组合优化问题,在理论上属NP-hard问题.考虑车辆数目最少和车辆运行时间最短,建立了具有时间约束的多目标车辆调度模型.并采用粒子群算法(PSO)求解车辆调度问题,以寻求最优车辆调度方案.在实例中通过运用粒子群算法和遗传算法进行比较分析,结果表明,PSO算法简单可行,在优化性能、收敛速度及鲁棒性等方面优于遗传算法,能较好地解决组合优化问题.

关 键 词:车辆调度  粒子群算法  时间约束  组合优化
文章编号:1001-4098(2007)04-0015-05
修稿时间:2007-02-05

Solution of Multi-Objective Vehicle Scheduling Model Based on Particle Swarm Optimization
FENG Wei,LI Xue-qin.Solution of Multi-Objective Vehicle Scheduling Model Based on Particle Swarm Optimization[J].Systems Engineering,2007,25(4):15-19.
Authors:FENG Wei  LI Xue-qin
Institution:School of Traffic and Transp. ,Southwest Jiaotong University ,ChengDu 610031. China
Abstract:Vehicle scheduling is the combinational optimization problem that has complex restricted conditions.It belongs to the NP-hard problem theoretically. A multi-objective vehicle scheduling model based on the time constraints was established by considering the minimal vehicle number and the shortest vehicle runtime.Based on this model,a particle swarm optimization(PSO) based scheduling algorithm was proposed to obtain the optimum vehicle scheduling scheme.A scheduling example was resolved by the PSO and generic algorithm(GA).The result shows that the proposed algorithm is simple and feasible,with better performances in optimization,convergence speed and robustness compared with GA.
Keywords:Vehicle Scheduling  Particle Swarm Optimization  Time Constraints  Combinational Optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号