首页 | 官方网站   微博 | 高级检索  
     

基于混沌粒子群算法的高速旅客列车优化调度
引用本文:高立群,任苹,李楠.基于混沌粒子群算法的高速旅客列车优化调度[J].东北大学学报(自然科学版),2007,28(2):176-179,192.
作者姓名:高立群  任苹  李楠
作者单位:1. 东北大学,信息科学与工程学院,辽宁,沈阳,110004
2. 沈阳大学,信息工程学院,辽宁,沈阳,110044
3. 沈阳大学,科技处,辽宁沈阳,110044
摘    要:列车优化调度是一个大规模、复杂的、具有非线性离散变量和多约束的多目标数学优化问题.在优化过程中,考虑了特快旅客列车中途离开时间和整个运行时间等因素.首次将粒子群优化(particle swarmoptimization,PSO)技术引入列车优化调度,克服了传统优化方法易陷入局部最优和维数灾难等弊端.通过一个工程实例验证了该算法的可行性和有效性.同时,与现存的列车优化调度方法相比,粒子群优化方法的搜索时间短而且优化结果更接近最优解.

关 键 词:列车调度  多目标优化  混沌粒子群优化算法  惩罚函数方法  
文章编号:1005-3026(2007)02-0176-04
收稿时间:2006-03-14
修稿时间:2006-03-14

Optimal Scheduling Based on CPSO for High-Speed Passenger Trains
GAO Li-qun,REN Ping,LI Nan.Optimal Scheduling Based on CPSO for High-Speed Passenger Trains[J].Journal of Northeastern University(Natural Science),2007,28(2):176-179,192.
Authors:GAO Li-qun  REN Ping  LI Nan
Abstract:The scheduling for high-speed passenger trains is in fact a complex multi-objective and multi-restrictive mathematical optimization problem involving nonlinear discrete variables,where the departing time of express trains in transit and the time for whole travel should be considered in optimization.To overcome the drawbacks of conventional mathematical optimization methods,such as easy to come into local optimization and dimensional disasters,the particle swarm optimization(PSO) is first introduced into the train scheduling with the intention of offering a better one.An example of train scheduling is given to illustrate the feasibility and effectiveness of the algorithm proposed,and the algorithm is compared with the existing optimal scheduling methods.The results show that the scheduling by PSO is shorter with the whole optimized closer to the ideal one.
Keywords:train scheduling  multi-objective optimization  chaotic particle swarm optimization(CPSO) algorithm  penalty function approach
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号