{"title":"随机任务类型系统的结构化替换策略","authors":"Rui Zheng","doi":"10.1002/nav.22201","DOIUrl":null,"url":null,"abstract":"This paper optimizes condition‐based replacement policies for a mission‐oriented system. The key challenge in our problem is that the system does not work under a fixed mission type but is subject to an infinite sequence of random types of missions assigned in a Markovian manner, which is realistic in many practical situations. The mission process modulates the deterioration process. Taking advantage of the opportunities when missions are switched, condition monitoring is conducted to support replacement decision‐making. This paper considers two practical scenarios in which the type of the next mission is either available or unavailable at each decision epoch. The objective is to determine the optimal replacement decisions for both scenarios that minimize their long‐run expected average cost rates. The optimization problems are analyzed in the framework of the Markov decision process. The optimal decisions of both scenarios are proven to be of partially monotone control‐limit forms. Near‐optimal policies with multilevel thresholds are provided for more convenient decision‐making. The policy iteration algorithm is modified for efficient optimization. A numerical example is used to demonstrate the feasibility of the proposed approach.","PeriodicalId":49772,"journal":{"name":"Naval Research Logistics","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Structured replacement policies for a system subject to random mission types\",\"authors\":\"Rui Zheng\",\"doi\":\"10.1002/nav.22201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper optimizes condition‐based replacement policies for a mission‐oriented system. The key challenge in our problem is that the system does not work under a fixed mission type but is subject to an infinite sequence of random types of missions assigned in a Markovian manner, which is realistic in many practical situations. The mission process modulates the deterioration process. Taking advantage of the opportunities when missions are switched, condition monitoring is conducted to support replacement decision‐making. This paper considers two practical scenarios in which the type of the next mission is either available or unavailable at each decision epoch. The objective is to determine the optimal replacement decisions for both scenarios that minimize their long‐run expected average cost rates. The optimization problems are analyzed in the framework of the Markov decision process. The optimal decisions of both scenarios are proven to be of partially monotone control‐limit forms. Near‐optimal policies with multilevel thresholds are provided for more convenient decision‐making. The policy iteration algorithm is modified for efficient optimization. A numerical example is used to demonstrate the feasibility of the proposed approach.\",\"PeriodicalId\":49772,\"journal\":{\"name\":\"Naval Research Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2024-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1002/nav.22201\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1002/nav.22201","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Structured replacement policies for a system subject to random mission types
This paper optimizes condition‐based replacement policies for a mission‐oriented system. The key challenge in our problem is that the system does not work under a fixed mission type but is subject to an infinite sequence of random types of missions assigned in a Markovian manner, which is realistic in many practical situations. The mission process modulates the deterioration process. Taking advantage of the opportunities when missions are switched, condition monitoring is conducted to support replacement decision‐making. This paper considers two practical scenarios in which the type of the next mission is either available or unavailable at each decision epoch. The objective is to determine the optimal replacement decisions for both scenarios that minimize their long‐run expected average cost rates. The optimization problems are analyzed in the framework of the Markov decision process. The optimal decisions of both scenarios are proven to be of partially monotone control‐limit forms. Near‐optimal policies with multilevel thresholds are provided for more convenient decision‐making. The policy iteration algorithm is modified for efficient optimization. A numerical example is used to demonstrate the feasibility of the proposed approach.
期刊介绍:
Submissions that are most appropriate for NRL are papers addressing modeling and analysis of problems motivated by real-world applications; major methodological advances in operations research and applied statistics; and expository or survey pieces of lasting value. Areas represented include (but are not limited to) probability, statistics, simulation, optimization, game theory, quality, scheduling, reliability, maintenance, supply chain, decision analysis, and combat models. Special issues devoted to a single topic are published occasionally, and proposals for special issues are welcomed by the Editorial Board.