基于逐步优化和图划分的铁路乘员调度

Ryuta Kamata, R. Watanabe
{"title":"基于逐步优化和图划分的铁路乘员调度","authors":"Ryuta Kamata, R. Watanabe","doi":"10.9746/SICETR.55.92","DOIUrl":null,"url":null,"abstract":"A railway crew scheduling problem is an assignment problem of crews for a given operational schedule under the constraint on labor regulations. In this paper, we discuss an automatic railway crew scheduling method based on numerical optimization for a large-scale and complex railway route with branch lines and multiple bases. The proposed method makes the crew schedule automatically using step by step optimization based on a partial pairing, an elastic embedded set partitioning problem and a graph partitioning.","PeriodicalId":416828,"journal":{"name":"Transactions of the Society of Instrument and Control Engineers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Railway Crew Scheduling Based on Step by Step Optimization and Graph Partitioning\",\"authors\":\"Ryuta Kamata, R. Watanabe\",\"doi\":\"10.9746/SICETR.55.92\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A railway crew scheduling problem is an assignment problem of crews for a given operational schedule under the constraint on labor regulations. In this paper, we discuss an automatic railway crew scheduling method based on numerical optimization for a large-scale and complex railway route with branch lines and multiple bases. The proposed method makes the crew schedule automatically using step by step optimization based on a partial pairing, an elastic embedded set partitioning problem and a graph partitioning.\",\"PeriodicalId\":416828,\"journal\":{\"name\":\"Transactions of the Society of Instrument and Control Engineers\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions of the Society of Instrument and Control Engineers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9746/SICETR.55.92\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions of the Society of Instrument and Control Engineers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9746/SICETR.55.92","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

铁路班组调度问题是在劳动法规约束下,在给定的运行计划下对班组的分配问题。针对具有分支线路和多基地的大型复杂铁路线路,讨论了一种基于数值优化的铁路班组自动调度方法。该方法基于局部配对、弹性嵌入集划分问题和图划分问题,采用逐步优化的方法实现机组调度的自动优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Railway Crew Scheduling Based on Step by Step Optimization and Graph Partitioning
A railway crew scheduling problem is an assignment problem of crews for a given operational schedule under the constraint on labor regulations. In this paper, we discuss an automatic railway crew scheduling method based on numerical optimization for a large-scale and complex railway route with branch lines and multiple bases. The proposed method makes the crew schedule automatically using step by step optimization based on a partial pairing, an elastic embedded set partitioning problem and a graph partitioning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信