基于规则的铁路驼峰堆场运行优化离散事件仿真

H. Khadilkar, Sudhir K. Sinha
{"title":"基于规则的铁路驼峰堆场运行优化离散事件仿真","authors":"H. Khadilkar, Sudhir K. Sinha","doi":"10.1109/IEEM.2016.7798058","DOIUrl":null,"url":null,"abstract":"This paper presents a simulation-based optimisation approach for planning railway hump yard operations. A hump yard is used for processing carriages (cars) brought by incoming trains, through a set of classification tracks, into newly formed outbound trains. There are specific constraints on the order in which each operation can be carried out, as well the standing order of cars in each outbound train. The set of decisions to be computed includes (i) the hump (processing) schedule of inbound trains, (ii) the assignment of cars to classification tracks, and (iii) the assembly schedule of outbound trains. The objective is to minimise the average dwell time of cars (the time spent from arrival at receiving tracks to departure). A simple set of rules is used to develop a discrete event simulator. The resulting objective function values vary between 5% and 20% of previously published optimisation formulations, depending on problem constraints. The execution time is between 3 and 5 minutes for a 42-day planning problem.","PeriodicalId":114906,"journal":{"name":"2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Rule-based discrete event simulation for optimising railway hump yard operations\",\"authors\":\"H. Khadilkar, Sudhir K. Sinha\",\"doi\":\"10.1109/IEEM.2016.7798058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a simulation-based optimisation approach for planning railway hump yard operations. A hump yard is used for processing carriages (cars) brought by incoming trains, through a set of classification tracks, into newly formed outbound trains. There are specific constraints on the order in which each operation can be carried out, as well the standing order of cars in each outbound train. The set of decisions to be computed includes (i) the hump (processing) schedule of inbound trains, (ii) the assignment of cars to classification tracks, and (iii) the assembly schedule of outbound trains. The objective is to minimise the average dwell time of cars (the time spent from arrival at receiving tracks to departure). A simple set of rules is used to develop a discrete event simulator. The resulting objective function values vary between 5% and 20% of previously published optimisation formulations, depending on problem constraints. The execution time is between 3 and 5 minutes for a 42-day planning problem.\",\"PeriodicalId\":114906,\"journal\":{\"name\":\"2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2016.7798058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2016.7798058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种基于仿真的铁路驼峰站场规划优化方法。驼峰车场用于将进站列车带来的车厢(车厢)通过一组分类轨道加工成新形成的出站列车。每项操作的执行顺序都有特定的限制,每列出站列车上的车厢也有固定的顺序。要计算的决策集包括:(i)进站列车的驼峰(处理)时间表,(ii)将车辆分配到分类轨道,以及(iii)出站列车的装配时间表。目标是尽量减少车辆的平均停留时间(从到达接收轨道到出发所花费的时间)。使用一组简单的规则来开发离散事件模拟器。最终的目标函数值在之前公布的优化公式的5%到20%之间变化,这取决于问题约束。对于一个42天的计划问题,执行时间在3到5分钟之间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rule-based discrete event simulation for optimising railway hump yard operations
This paper presents a simulation-based optimisation approach for planning railway hump yard operations. A hump yard is used for processing carriages (cars) brought by incoming trains, through a set of classification tracks, into newly formed outbound trains. There are specific constraints on the order in which each operation can be carried out, as well the standing order of cars in each outbound train. The set of decisions to be computed includes (i) the hump (processing) schedule of inbound trains, (ii) the assignment of cars to classification tracks, and (iii) the assembly schedule of outbound trains. The objective is to minimise the average dwell time of cars (the time spent from arrival at receiving tracks to departure). A simple set of rules is used to develop a discrete event simulator. The resulting objective function values vary between 5% and 20% of previously published optimisation formulations, depending on problem constraints. The execution time is between 3 and 5 minutes for a 42-day planning problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信