Dynamic Workforce Scheduling and Routing in a Smart City Using Temporal Batch Decomposition

Hunabad Tejdeep Reddy, Rishabh Ranjan, Kujirai Toshihiro
{"title":"Dynamic Workforce Scheduling and Routing in a Smart City Using Temporal Batch Decomposition","authors":"Hunabad Tejdeep Reddy, Rishabh Ranjan, Kujirai Toshihiro","doi":"10.1109/ISCSIC54682.2021.00056","DOIUrl":null,"url":null,"abstract":"A major challenge for the service providers in smart cities operating in domains such as health, security, maintenance, etc. is to provide efficient assignments of personnel to handle the incidents related to their services. These incidents could be divided into two categories. The first category is called scheduled events like regular maintenance operations, whose information is available in prior. The second category is called dynamic events and consists of emergency events that occur unpredictably at any time which we call dynamic events. The goal is to assign a common set of personnel efficiently to both the categories simultaneously, to reduce average service time of each event. Typically, in large scenarios, heuristics like greedy algorithms are used to obtain solutions in real time to facilitate immediate handling of dynamic events. However, they are myopic and cannot deliver optimized solutions across a large horizon. We propose a method for large scenarios in real time that are more globally optimized as compared to greedy algorithms. The proposed method involves a) A newly developed Mixed Integer Linear Program formulation, which considers multiple independent events that need to be handled parallelly, and b) Decomposition of the large scenario into a queue of smaller batches of events based on their occurrence/requested time. This method handles dynamically occurring events immediately without having to recompute the schedule for the entire time horizon but instead do batchwise assignment. Proposed method was validated by comparing it with the baseline greedy method and a modified version of the baseline called Priority greedy method. The assignment of personnel by the proposed method resulted in a reduction in average service time of events for large scenarios compared to that of the other two methods and was able to provide solution in a reasonable time. The proposed method increases the efficiency of providing services by reducing the associated risk.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSIC54682.2021.00056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A major challenge for the service providers in smart cities operating in domains such as health, security, maintenance, etc. is to provide efficient assignments of personnel to handle the incidents related to their services. These incidents could be divided into two categories. The first category is called scheduled events like regular maintenance operations, whose information is available in prior. The second category is called dynamic events and consists of emergency events that occur unpredictably at any time which we call dynamic events. The goal is to assign a common set of personnel efficiently to both the categories simultaneously, to reduce average service time of each event. Typically, in large scenarios, heuristics like greedy algorithms are used to obtain solutions in real time to facilitate immediate handling of dynamic events. However, they are myopic and cannot deliver optimized solutions across a large horizon. We propose a method for large scenarios in real time that are more globally optimized as compared to greedy algorithms. The proposed method involves a) A newly developed Mixed Integer Linear Program formulation, which considers multiple independent events that need to be handled parallelly, and b) Decomposition of the large scenario into a queue of smaller batches of events based on their occurrence/requested time. This method handles dynamically occurring events immediately without having to recompute the schedule for the entire time horizon but instead do batchwise assignment. Proposed method was validated by comparing it with the baseline greedy method and a modified version of the baseline called Priority greedy method. The assignment of personnel by the proposed method resulted in a reduction in average service time of events for large scenarios compared to that of the other two methods and was able to provide solution in a reasonable time. The proposed method increases the efficiency of providing services by reducing the associated risk.
基于时间批分解的智慧城市动态劳动力调度与路由
在健康、安全、维护等领域运营的智慧城市服务提供商面临的一个主要挑战是,如何有效地分配人员来处理与其服务相关的事件。这些事件可分为两类。第一类称为计划事件,如定期维护操作,其信息可在预先获取。第二类被称为动态事件,包括在任何时候不可预测地发生的紧急事件,我们称之为动态事件。目标是将一组公共人员有效地同时分配到这两个类别,以减少每个事件的平均服务时间。通常,在大型场景中,使用贪婪算法等启发式算法来实时获取解,以便于立即处理动态事件。然而,他们目光短浅,无法在大范围内提供优化的解决方案。我们提出了一种实时大场景的方法,与贪婪算法相比,它更具有全局优化性。所提出的方法涉及a)新开发的混合整数线性规划公式,该公式考虑需要并行处理的多个独立事件;b)根据事件发生/请求时间将大型场景分解为较小批次事件的队列。此方法立即处理动态发生的事件,而不必重新计算整个时间范围的调度,而是进行批处理分配。将该方法与基线贪婪法和改进的基线优先级贪婪法进行比较,验证了该方法的有效性。与其他两种方法相比,采用拟议的方法分配人员减少了大型场景事件的平均服务时间,并能够在合理的时间内提供解决方案。所提出的方法通过降低相关风险来提高提供服务的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信