Hybrid Value Function Approximation for Solving the Technician Routing Problem with Stochastic Repair Requests

IF 4.4 2区 工程技术 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Dai T. Pham, Gudrun P. Kiesmüller
{"title":"Hybrid Value Function Approximation for Solving the Technician Routing Problem with Stochastic Repair Requests","authors":"Dai T. Pham, Gudrun P. Kiesmüller","doi":"10.1287/trsc.2022.0434","DOIUrl":null,"url":null,"abstract":"We investigate the combined planning problem involving the routing of technicians and the stocking of spare parts for servicing geographically distributed repair tasks. The problem incorporates many operational uncertainties, such as future repair requests and the required spare parts to replace malfunctioned components. We model the problem as a sequential decision problem where decisions are made at the end of each day about the next day’s technician route and spare part inventory in the van. We show that exact methods are intractable because of the inherent high-dimensional state, decision, and transition spaces involved. To overcome these challenges, we present two novel algorithmic techniques. First, we suggest a hybrid value function approximation method that combines a genetic search with a graph neural network capable of reasoning, learning, and decision making in high-dimensional, discrete decision spaces. Second, we introduce a unique state-encoding method that employs multiattribute graphs and spatial markers, eliminating the need for manually designed basis functions and allowing efficient learning. We illustrate the general adaptive learning capacity by solving a variety of instance settings without instance-specific hyperparameter tuning. An extensive numerical study demonstrates that our hybrid learning technique outperforms other benchmark policies and adapts well to changes in the environment. We also generate a wide range of insights that not only shed light on the algorithmic components but also offer guidance on how to execute on-site repair tasks more efficiently. The techniques showcased are versatile and hold potential for application in other dynamic and stochastic problems, particularly in the realm of transportation planning.Funding: This work was supported by Deutsche Forschungsgemeinschaft (DFG). The Research Training Group 2201 [Grant 277991500], “Advanced Optimization in a Networked Economy,” funded by the DFG, has provided partial support for this work.Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0434 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"10 1","pages":""},"PeriodicalIF":4.4000,"publicationDate":"2024-01-24","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.0434","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 investigate the combined planning problem involving the routing of technicians and the stocking of spare parts for servicing geographically distributed repair tasks. The problem incorporates many operational uncertainties, such as future repair requests and the required spare parts to replace malfunctioned components. We model the problem as a sequential decision problem where decisions are made at the end of each day about the next day’s technician route and spare part inventory in the van. We show that exact methods are intractable because of the inherent high-dimensional state, decision, and transition spaces involved. To overcome these challenges, we present two novel algorithmic techniques. First, we suggest a hybrid value function approximation method that combines a genetic search with a graph neural network capable of reasoning, learning, and decision making in high-dimensional, discrete decision spaces. Second, we introduce a unique state-encoding method that employs multiattribute graphs and spatial markers, eliminating the need for manually designed basis functions and allowing efficient learning. We illustrate the general adaptive learning capacity by solving a variety of instance settings without instance-specific hyperparameter tuning. An extensive numerical study demonstrates that our hybrid learning technique outperforms other benchmark policies and adapts well to changes in the environment. We also generate a wide range of insights that not only shed light on the algorithmic components but also offer guidance on how to execute on-site repair tasks more efficiently. The techniques showcased are versatile and hold potential for application in other dynamic and stochastic problems, particularly in the realm of transportation planning.Funding: This work was supported by Deutsche Forschungsgemeinschaft (DFG). The Research Training Group 2201 [Grant 277991500], “Advanced Optimization in a Networked Economy,” funded by the DFG, has provided partial support for this work.Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0434 .
解决具有随机维修请求的技术人员路由问题的混合值函数近似法
我们研究了涉及技术人员路线安排和备件储备的组合规划问题,以便为地理上分散的维修任务提供服务。该问题包含许多操作上的不确定性,如未来的维修请求和更换故障部件所需的备件。我们将该问题建模为一个连续决策问题,每天结束时对第二天的技术人员路线和货车上的备件库存做出决策。我们的研究表明,由于涉及固有的高维状态、决策和转换空间,精确方法是难以解决的。为了克服这些挑战,我们提出了两种新颖的算法技术。首先,我们提出了一种混合值函数近似方法,该方法结合了遗传搜索和图神经网络,能够在高维、离散的决策空间中进行推理、学习和决策。其次,我们引入了一种独特的状态编码方法,该方法采用多属性图和空间标记,无需手动设计基础函数,从而实现高效学习。我们通过解决各种实例设置来说明通用自适应学习能力,而无需针对特定实例进行超参数调整。广泛的数值研究表明,我们的混合学习技术优于其他基准策略,并能很好地适应环境变化。我们还提出了一系列见解,这些见解不仅揭示了算法的组成部分,还为如何更高效地执行现场修复任务提供了指导。所展示的技术用途广泛,有望应用于其他动态和随机问题,尤其是交通规划领域:本研究得到了德国科学基金会(DFG)的支持。由 DFG 资助的 2201 研究培训小组 [Grant 277991500]"网络经济中的高级优化 "为本研究提供了部分支持:在线附录请访问 https://doi.org/10.1287/trsc.2022.0434 。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Transportation Science
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.
×
引用
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学术官方微信