An Optimal Computing Allocation Strategy for Swarm-Based Algorithm in Simulation-Based Optimization Problem with Stochastic Constraint

Author:

Chiu Chun-Chih1ORCID,Lai Chyh-Ming2ORCID,Liu Yu-Chi3ORCID

Affiliation:

1. Department of Industrial Engineering and Management, National Yunlin University of Science and Technology, Yunlin 64002, Taiwan

2. Institute of Resources Management and Decision Science, Management College, National Defense University, Taipei 112, Taiwan

3. Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung 411, Taiwan

Abstract

For realizing smart manufacturing, recent studies have been focusing on the capabilities of digital twins (DTs) that offer a virtual portrayal of a process or system and thereby facilitate real-time monitoring, analysis, and optimization. DTs construct a “digital model” of factories by using advanced technologies such as smart sensors, Internet of Things (IoT), artificial intelligence (AI) techniques, and optimization processes for executing critical decisions for enhancing productivity and predicting future events. Therefore, simulation-based optimization techniques play key supporting roles in the decision-making process of the DT shop. Thus, to enhance competitiveness in industrial companies, discourse on properly designing simulation-based optimization techniques begets significant study. This study aims to address a simulation-based optimization problem with stochastic constraint (SO[Formula: see text] using a hybrid particle swarm optimization (PSO). Given the large solution space, the PSO supports design space exploration. However, since all solutions must be verified for feasibility, the optimal computing allocation strategy (OCAS) strategy for SO[Formula: see text] is proposed to allocate the computing budget efficiently. OCAS is an improved version of optimal computing budget allocation for constrained optimization (OCBA-CO), specifically designed for complex systems with an expansive design space that possesses multiple local optimal solutions. During a typical PSO algorithm searching process, OCBA-CO is applied separately for each generation, resulting in a significant number of replications merely distinguishing similar solutions. To overcome this problem, our study proposes the PSO[Formula: see text], which combines PSO with OCAS to avoid wasting simulation runs on similar solutions. Two quantitative experiments are performed to assess the efficacy of PSO[Formula: see text] compared to other competitors. The simulation results indicate that the PSO[Formula: see text] algorithm presents a competitive and superior solution in terms of both quality and searching efficiency.

Funder

National Science and Technology Council of the Republic of China

Publisher

World Scientific Pub Co Pte Ltd

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Reinforcement Learning-based Adaptive Digital Twin Model for Forests;2024 4th International Conference on Applied Artificial Intelligence (ICAPAI);2024-04-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3