Optimal Planning for the Double-Track Train Scheduling Based on Chaotic Particle Swarm Optimization

Ren Ping, Li Nan, Gao Liqun
{"title":"Optimal Planning for the Double-Track Train Scheduling Based on Chaotic Particle Swarm Optimization","authors":"Ren Ping, Li Nan, Gao Liqun","doi":"10.1109/ICNC.2009.337","DOIUrl":null,"url":null,"abstract":"This paper proposes a multi-objective optimization model for the double-track train scheduling optimal planning problem. In this study, lowering the fuel consumption cost is the measure of satisfaction of the railway company and shortening the total passenger-time is being regarded as the passenger satisfaction criterion. To overcome the drawbacks of conventional mathematical optimization method in arriving at local optimum and dimension disasters, etc., we introduce the chaotic particle swarm optimization (CPSO) technique into the train scheduling for double-track railroad planning for the first time, from which the supreme scheme is generated. A case on the train scheduling optimal planning problem is presented to illustrate the methodology’s feasibility and efficiency, compared with the existing optimal planning methods, the search time of the particle swarm optimization method is shorter.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2009.337","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposes a multi-objective optimization model for the double-track train scheduling optimal planning problem. In this study, lowering the fuel consumption cost is the measure of satisfaction of the railway company and shortening the total passenger-time is being regarded as the passenger satisfaction criterion. To overcome the drawbacks of conventional mathematical optimization method in arriving at local optimum and dimension disasters, etc., we introduce the chaotic particle swarm optimization (CPSO) technique into the train scheduling for double-track railroad planning for the first time, from which the supreme scheme is generated. A case on the train scheduling optimal planning problem is presented to illustrate the methodology’s feasibility and efficiency, compared with the existing optimal planning methods, the search time of the particle swarm optimization method is shorter.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于混沌粒子群优化的双线列车调度优化规划
针对双线列车调度优化规划问题,提出了一个多目标优化模型。在本研究中,降低燃油消耗成本是铁路公司满意度的衡量标准,缩短乘客总时间是乘客满意度的衡量标准。为了克服传统数学优化方法难以达到局部最优和维数灾害等缺点,首次将混沌粒子群优化(CPSO)技术引入到双线铁路规划的列车调度中,并由此产生最高方案。以列车调度优化规划问题为例说明了该方法的可行性和有效性,与现有的优化规划方法相比,粒子群优化方法的搜索时间更短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Minimum Abandoned Water Optimization Model of Reservoir and Its Application A New Image Denoising Method via Self-Organizing Feature Map Based on Hidden Markov Models Adaptive Genetic Algorithm and its Application to the Structural Optimization of Steel Tower A New Multistage Chaos Synchronized System for Secure Communications Application of MEC-Based Fuzzy Control in Boiler of Sludge Combustion
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1