Cost optimization, reliability, and MTTF analysis for failed excavators in hydraulic repair center using queueing theory

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Khushbu S. Antala, Sudeep Singh Sanga
{"title":"Cost optimization, reliability, and MTTF analysis for failed excavators in hydraulic repair center using queueing theory","authors":"Khushbu S. Antala,&nbsp;Sudeep Singh Sanga","doi":"10.1016/j.swevo.2024.101824","DOIUrl":null,"url":null,"abstract":"<div><div>In the present study, we utilize the application of queues at construction sites where excavators are used extensively. Excavators are prone to failures requiring timely repairs and maintenance. We establish a hydraulic repair center (HRC) to repair and maintain these failed excavators. The HRC is equipped with a dedicated hydraulic hose crimper (HHC) machine, which acts as the server providing repairs to the arriving failed excavators, referred to as customers. Two types of excavators are considered: crawler excavator (CE) and mini excavator (ME), with ME being given priority in repair jobs over CE. To address realistic situations, various queueing characteristics are incorporated, including a non-preemptive priority rule, a retrial orbit, etc. First, we develop a mathematical model by considering the arrival of excavators at the HRC following a Poisson process, with repair times adhering to exponential distributions. We construct the Markov model by formulating time-dependent differential-difference equations for each system state. These equations are then solved using a matrix method based on spectral theory to develop the corresponding probability distributions. Second, we establish several expressions of queueing and reliability indices. Third, a nonlinear cost function is formulated, and optimized using particle swarm optimization (PSO) algorithm and the bat algorithm (BA).</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101824"},"PeriodicalIF":8.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003626","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In the present study, we utilize the application of queues at construction sites where excavators are used extensively. Excavators are prone to failures requiring timely repairs and maintenance. We establish a hydraulic repair center (HRC) to repair and maintain these failed excavators. The HRC is equipped with a dedicated hydraulic hose crimper (HHC) machine, which acts as the server providing repairs to the arriving failed excavators, referred to as customers. Two types of excavators are considered: crawler excavator (CE) and mini excavator (ME), with ME being given priority in repair jobs over CE. To address realistic situations, various queueing characteristics are incorporated, including a non-preemptive priority rule, a retrial orbit, etc. First, we develop a mathematical model by considering the arrival of excavators at the HRC following a Poisson process, with repair times adhering to exponential distributions. We construct the Markov model by formulating time-dependent differential-difference equations for each system state. These equations are then solved using a matrix method based on spectral theory to develop the corresponding probability distributions. Second, we establish several expressions of queueing and reliability indices. Third, a nonlinear cost function is formulated, and optimized using particle swarm optimization (PSO) algorithm and the bat algorithm (BA).
基于排队理论的液压维修中心故障挖掘机成本优化、可靠性及MTTF分析
在本研究中,我们利用队列在挖掘机广泛使用的建筑工地的应用。挖掘机容易出现故障,需要及时维修和保养。我们建立了一个液压维修中心(HRC)来维修和维护这些故障的挖掘机。HRC配备了专用的液压软管卷曲机(HHC),作为服务器为到达的故障挖掘机(即客户)提供维修。考虑两种类型的挖掘机:履带式挖掘机(CE)和小型挖掘机(ME),其中ME在维修工作中优先于CE。为解决实际情况,结合了各种排队特征,包括非抢占优先规则、重审轨道等。首先,我们开发了一个数学模型,考虑到挖掘机在泊松过程中到达HRC,维修时间遵循指数分布。我们通过为系统的每个状态建立随时间变化的微分-差分方程来构造马尔可夫模型。然后用基于谱理论的矩阵法求解这些方程,得到相应的概率分布。其次,建立了排队指标和可靠性指标的表达式。第三,建立非线性代价函数,并采用粒子群算法(PSO)和蝙蝠算法(BA)进行优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信