Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models

Oper. Res. Pub Date : 2021-12-13 DOI:10.1287/opre.2021.2155
A. Balakrishnan, P. Mirchandani, Sifeng Lin
{"title":"Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models","authors":"A. Balakrishnan, P. Mirchandani, Sifeng Lin","doi":"10.1287/opre.2021.2155","DOIUrl":null,"url":null,"abstract":"Modeling Crew Assignments for Urban Transport Services Using Differentiated Flows Public transit agencies need to judiciously deploy their limited crew members to operate numerous daily scheduled services, while meeting duty and working time regulations for each crew member. Since crew costs account for a large portion of the organizations’ operating expenses, minimizing the total crew and transfer costs is very important. But, with hundreds of daily trips and millions of possible crew itineraries, optimizing trip-to-crew assignment decisions is challenging. In “Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models,” Balakrishnan, Mirchandani, and Lin propose a novel integer optimization model that represents itineraries as multicommodity flows, differentiated by first trip and depot, to capture the duty time limits and incorporate additional requirements such as selecting equitable schedules. The authors show that this compact model can be tighter than previous formulations, further strengthen the model, and propose a restricted optimization approach combined with an optimality test to generate near-optimal solutions quickly. Extensive computational tests using well-known and real-life problem instances show that the proposed model and solution approach can be very effective in practice.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"98 1","pages":"690-714"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/opre.2021.2155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Modeling Crew Assignments for Urban Transport Services Using Differentiated Flows Public transit agencies need to judiciously deploy their limited crew members to operate numerous daily scheduled services, while meeting duty and working time regulations for each crew member. Since crew costs account for a large portion of the organizations’ operating expenses, minimizing the total crew and transfer costs is very important. But, with hundreds of daily trips and millions of possible crew itineraries, optimizing trip-to-crew assignment decisions is challenging. In “Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models,” Balakrishnan, Mirchandani, and Lin propose a novel integer optimization model that represents itineraries as multicommodity flows, differentiated by first trip and depot, to capture the duty time limits and incorporate additional requirements such as selecting equitable schedules. The authors show that this compact model can be tighter than previous formulations, further strengthen the model, and propose a restricted optimization approach combined with an optimality test to generate near-optimal solutions quickly. Extensive computational tests using well-known and real-life problem instances show that the proposed model and solution approach can be very effective in practice.
运输服务中有任务时间限制的船员分配:紧密的多商品模型
公共交通机构需要明智地部署其有限的机组人员来运行大量的日常定期服务,同时满足每个机组人员的职责和工作时间规定。由于船员成本占组织运营费用的很大一部分,因此最小化船员和转移成本是非常重要的。但是,由于每天有数百次旅行和数百万个可能的船员行程,优化船员之间的分配决策是具有挑战性的。Balakrishnan, Mirchandani和Lin在“运输服务的值班时间限制的船员分配:紧密的多商品模型”中提出了一个新的整数优化模型,该模型将行程表示为多商品流,通过第一次旅行和仓库区分,以捕获值班时间限制并纳入其他要求,例如选择公平的时间表。作者证明了该紧凑模型可以比以前的公式更紧凑,并进一步加强了模型,并提出了一种结合最优性检验的受限优化方法来快速生成近最优解。大量的计算测试表明,所提出的模型和解决方法在实践中是非常有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信