disstrain:列车调度仿真工具

Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005. Pub Date : 2005-10-24 DOI:10.1109/ITSC.2005.1520152

P. Rebreyend

{"title":"disstrain:列车调度仿真工具","authors":"P. Rebreyend","doi":"10.1109/ITSC.2005.1520152","DOIUrl":null,"url":null,"abstract":"This paper describes an on-going research work on the train dispatching problem. This dispatching or rescheduling problem (which is NP-complete in general cases) lacks a benchmark or a library to test different algorithms. Therefore, we present a modelisation of the problem, on which our future tool is based. The tool is decomposed into a simulation engine (event driven) which may use different algorithms to solve the problem. Different algorithms may be used and tried.","PeriodicalId":153203,"journal":{"name":"Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.","volume":"221 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"DisTrain: a simulation tool for train dispatching\",\"authors\":\"P. Rebreyend\",\"doi\":\"10.1109/ITSC.2005.1520152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes an on-going research work on the train dispatching problem. This dispatching or rescheduling problem (which is NP-complete in general cases) lacks a benchmark or a library to test different algorithms. Therefore, we present a modelisation of the problem, on which our future tool is based. The tool is decomposed into a simulation engine (event driven) which may use different algorithms to solve the problem. Different algorithms may be used and tried.\",\"PeriodicalId\":153203,\"journal\":{\"name\":\"Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.\",\"volume\":\"221 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2005.1520152\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2005.1520152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文描述了一项正在进行的关于列车调度问题的研究工作。这种调度或重新调度问题(在一般情况下是np完备的)缺乏测试不同算法的基准或库。因此，我们提出了一个问题的模型，这是我们未来工具的基础。该工具被分解为一个模拟引擎(事件驱动)，它可以使用不同的算法来解决问题。可以使用和尝试不同的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

DisTrain: a simulation tool for train dispatching

This paper describes an on-going research work on the train dispatching problem. This dispatching or rescheduling problem (which is NP-complete in general cases) lacks a benchmark or a library to test different algorithms. Therefore, we present a modelisation of the problem, on which our future tool is based. The tool is decomposed into a simulation engine (event driven) which may use different algorithms to solve the problem. Different algorithms may be used and tried.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005.

自引率

0.00%

发文量