返回
Model-Based Proposal Learning for Monte Carlo Optimization of Redundancy Allocation Problem
DOI:10.1109/ACCESS.2018.2867744.png)
摘要
En 中文
Most existing approaches to heterogeneous redundancy allocation problem (RAP) are prone to getting trapped in local optimal modes during optimization, mainly due to the rugged combinatoric landscapes. Recently, optimization-by-sampling paradigm based on the stochastic approximation Monte Carlo (SAMC) sampling has shown superior performance in solving the heterogeneous RAP for multi-state systems (MSSs). However, one drawback of this method is that the global move of a Markov chain relying only on a uniform distribution is typically hard to hit the low-energy regions due to the uninformative proposal, leading to insufficient global exploration in sampling. To address the problem of where to sample for efficient optimization of heterogeneous RAP, we introduce a rejection-free Monte Carlo method to sample from the target distribution over the combinatorial space. Specifically, a model-based proposal learning algorithm is derived to guide the global exploration towards promising regions of the descrete state space. Experimental evaluations on a set of benchmark instances show the superiority of the proposed approach compared with the several state-of-the-arts in terms of the solution quality and computational efficiency.
Keyword:
Redundancy allocation problem
multi-state system
optimization-by-sampling
Markov chain Monte Carlo
model-based proposal learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Efficient Stochastic Approximation Monte Carlo Sampling for Heterogeneous Redundancy Allocation Problem
IEEE ACCESS
IF3.6
A heuristic for solving the redundancy allocation problem for multi-state series-parallel systems一种求解多状态串并联系统冗余分配问题的启发式算法

