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