Novel hybrid approach with elite group optimal computing budget allocation for the stochastic multimodal problem

被引:7
|
作者
Chiu, Chun-Chih [1 ]
Lin, James T. [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu 300, Taiwan
关键词
Particle swarm optimization; Elite group optimal computing budget allocation; Stochastic multimodal problem; Stochastic resource allocation problem; PARTICLE SWARM OPTIMIZATION; SIMULATION OPTIMIZATION; ALGORITHM; SELECTION; SEARCH; 2-STAGE;
D O I
10.1016/j.neucom.2017.04.041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The stochastic multimodal problem commonly arises in the search for efficiency and solution quality in practice. In this study, a hybrid approach is developed for the stochastic multimodal problem. The proposed approach comprises particle swarm optimization (PSO), constriction factor PSO (CPSO), and elite group optimal computing budget allocation (EGOCBA). CPSO or PSO is applied to determine the correct direction in the design space, and EGOCBA is adopted to allocate the appropriate number of samples to each alternative and provide reliable evaluations and identifications to rank particles in the CPSO or PSO procedure. This work improves the searching efficiency of optimal computing budget allocation (OCBA) in the stochastic multimodal problem. Several alternatives referred to as the "elite group," the performance of which is close to that of the current best solution in each swarm, absorb most of the computing budget of OCBA. However, distinguishing the best solution from the elite group is time consuming because of the various local and global optima in the stochastic multimodal problem. Therefore, this study proposes EGOCBA that avoids extra computing costs for the elite group by implementing a new selection procedure. This EGOCBA reserves all the solutions of the elite group and filters them to form an optimal set that contains all the best solutions having an equal mean performance without a significant difference. These tasks are achieved through a confidence interval test in the end of the algorithm. The optimal set can provide more than one best solution to support multiple decisions depending on different decision variables. Two experiments are conducted on stochastic multimodal optimization problem and stochastic resource allocation problem. Experimental results reveal the efficiency and effectiveness of the proposed approach in deriving multiple optimal solutions in a multimodal class and stochastic environment. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:449 / 465
页数:17
相关论文
共 50 条
  • [21] Stochastic Unit Commitment and Optimal Allocation of Reserves: A Hybrid Decomposition Approach
    Lopez-Salgado, Carlos J.
    Ano, Osvaldo
    Ojeda-Esteybar, Diego M.
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2018, 33 (05) : 5542 - 5552
  • [22] Convergence rate analysis for optimal computing budget allocation algorithms
    Li, Yanwen
    Gao, Siyang
    AUTOMATICA, 2023, 153
  • [23] Optimal computing budget allocation for complete ranking with input uncertainty
    Xiao, Hui
    Gao, Fei
    Lee, Loo Hay
    IISE TRANSACTIONS, 2020, 52 (05) : 489 - 499
  • [24] Approximately Optimal Computing-Budget Allocation for Subset Ranking
    Zhang, JunQi
    Li, ZeZhou
    Wang, Cheng
    Zang, Di
    Zhou, MengChu
    2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 3856 - 3861
  • [25] Monte Carlo tree search with optimal computing budget allocation
    Li, Yunchuan
    Fu, Michael
    Xu, Jie
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 6332 - 6337
  • [26] Ordinal Optimization with Computing Budget Allocation for Selecting an Optimal Subset
    Almomani, Mohammad H.
    Alrefaei, Mahmoud H.
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2016, 33 (02)
  • [27] A Computing Budget Allocation Approach to Multiband Spectrum Sensing
    Bruno, Joseph M.
    Mark, Brian L.
    Ephraim, Yariv
    Chen, Chun-Hung
    2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2017,
  • [28] Improving Analytic Hierarchy Process Expert Allocation Using Optimal Computing Budget Allocation
    Huang, Edward
    Zhang, Si
    Lee, Loo Hay
    Chew, Ek Peng
    Chen, Chun-Hung
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2016, 46 (08): : 1140 - 1147
  • [29] New development of optimal computing budget allocation for discrete event simulation
    Chen, HC
    Chen, CH
    Dai, LY
    Yucesan, E
    PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE, 1997, : 334 - 341
  • [30] Contextual Ranking and Selection with Gaussian Processes and Optimal Computing Budget Allocation
    Cakmak, Sait
    Wang, Yuhao
    Gao, Siyang
    Zhou, Enlu
    ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION, 2024, 34 (02):