Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control

IF 4.4 2区工程技术 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Transportation Science Pub Date : 2023-08-03 DOI:10.1287/trsc.2022.0099

Zerui Wu, Ran Liu, E. Pan

{"title":"Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control","authors":"Zerui Wu, Ran Liu, E. Pan","doi":"10.1287/trsc.2022.0099","DOIUrl":null,"url":null,"abstract":"We study a server routing-scheduling problem in a distributed queueing system, where the system consists of multiple queues at different locations. In a distributed queueing system, servers are shared among multiple queues, and they travel between queues in response to stochastic and time-varying demands. Although server traveling can improve service levels and shorten queue lengths, server routing and scheduling is complicated. We propose a dynamic programming model to solve this special routing-scheduling problem with time-varying demand, stochastic travel time, and queue-length constraints. In order to tackle large-scale practical instances, we design a dynamic programming-based rollout heuristic algorithm. Experiments on large-scale airports and scenic spots show that our approach reduces the total working periods of servers/employees without violating queue-length constraints. Furthermore, we demonstrate that our algorithm outperforms existing benchmark methods and the practical schedules of a scenic spot. Funding: Financial support from the National Natural Science Foundation of China [Grant 71972133] is gratefully acknowledged. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0099 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"1 1","pages":""},"PeriodicalIF":4.4000,"publicationDate":"2023-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1287/trsc.2022.0099","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

Abstract

We study a server routing-scheduling problem in a distributed queueing system, where the system consists of multiple queues at different locations. In a distributed queueing system, servers are shared among multiple queues, and they travel between queues in response to stochastic and time-varying demands. Although server traveling can improve service levels and shorten queue lengths, server routing and scheduling is complicated. We propose a dynamic programming model to solve this special routing-scheduling problem with time-varying demand, stochastic travel time, and queue-length constraints. In order to tackle large-scale practical instances, we design a dynamic programming-based rollout heuristic algorithm. Experiments on large-scale airports and scenic spots show that our approach reduces the total working periods of servers/employees without violating queue-length constraints. Furthermore, we demonstrate that our algorithm outperforms existing benchmark methods and the practical schedules of a scenic spot. Funding: Financial support from the National Natural Science Foundation of China [Grant 71972133] is gratefully acknowledged. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0099 .

查看原文本刊更多论文

具有时变需求和队列长度控制的分布式排队系统中的服务器路由调度问题

研究了分布式排队系统中的服务器路由调度问题，该系统由位于不同位置的多个队列组成。在分布式排队系统中，服务器在多个队列之间共享，并且它们在队列之间移动以响应随机和时变的需求。尽管服务器移动可以提高服务水平并缩短队列长度，但服务器路由和调度是复杂的。我们提出了一个动态规划模型来解决这类具有时变需求、随机行程时间和队列长度约束的特殊路由调度问题。为了处理大规模的实际实例，我们设计了一种基于动态规划的启发式算法。在大型机场和景点的实验表明，我们的方法在不违反队列长度约束的情况下减少了服务器/员工的总工作时间。此外，我们还证明了我们的算法优于现有的基准方法和景点的实际时间表。基金资助:感谢国家自然科学基金[基金号:71972133]的资助。补充材料:在线附录可在https://doi.org/10.1287/trsc.2022.0099上获得。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Transportation Science 工程技术-运筹学与管理科学

CiteScore

8.30

自引率

10.90%

发文量

111

审稿时长

12 months

期刊介绍： Transportation Science, published quarterly by INFORMS, is the flagship journal of the Transportation Science and Logistics Society of INFORMS. As the foremost scientific journal in the cross-disciplinary operational research field of transportation analysis, Transportation Science publishes high-quality original contributions and surveys on phenomena associated with all modes of transportation, present and prospective, including mainly all levels of planning, design, economic, operational, and social aspects. Transportation Science focuses primarily on fundamental theories, coupled with observational and experimental studies of transportation and logistics phenomena and processes, mathematical models, advanced methodologies and novel applications in transportation and logistics systems analysis, planning and design. The journal covers a broad range of topics that include vehicular and human traffic flow theories, models and their application to traffic operations and management, strategic, tactical, and operational planning of transportation and logistics systems; performance analysis methods and system design and optimization; theories and analysis methods for network and spatial activity interaction, equilibrium and dynamics; economics of transportation system supply and evaluation; methodologies for analysis of transportation user behavior and the demand for transportation and logistics services. Transportation Science is international in scope, with editors from nations around the globe. The editorial board reflects the diverse interdisciplinary interests of the transportation science and logistics community, with members that hold primary affiliations in engineering (civil, industrial, and aeronautical), physics, economics, applied mathematics, and business.