{"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}
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.