Benchmarking metaheuristic algorithms for the bi-objective redundancy allocation problem in repairable systems with multiple strategies

• URL: http://arxiv.org/abs/2512.18343v1
• Date: Sat, 20 Dec 2025 12:16:37 GMT
• Title: Benchmarking metaheuristic algorithms for the bi-objective redundancy allocation problem in repairable systems with multiple strategies
• Authors: Mateusz Oszczypała, David Ibehej, Jakub Kudela,
• Abstract summary: This article investigates a bi-objective redundancy allocation problem (RAP) for repairable systems.<n> Binary decisions jointly select the number of components and the standby strategy at the subsystem level.<n>System availability is evaluated using continuous-time Markov chains.
• Score: 3.632189127068905
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This article investigates a bi-objective redundancy allocation problem (RAP) for repairable systems, defined as cost minimization and availability maximization. Binary decisions jointly select the number of components and the standby strategy at the subsystem level. Four redundancy strategies are considered: cold standby, warm standby, hot standby, and a mixed strategy. System availability is evaluated using continuous-time Markov chains. The main novelty is a large, controlled benchmark that compares 65 multi-objective metaheuristics under two initialization settings, with and without Scaled Binomial Initialization (SBI), on six case studies of rising structural and dimensional complexity and four weight limits. Each run uses a fixed budget of 2x10^6 evaluations, and repeated runs support statistical comparisons based on hypervolume and budget-based performance. The Pareto-optimal sets are dominated by hot standby and mixed redundancy, while cold and warm standby are rare in the full populations and almost absent from the Pareto fronts. Hot standby is favored under tight weight limits, whereas mixed redundancy becomes dominant when more spares are allowed. Algorithm results show strong budget effects, so a single overall ranking can be misleading. SBI gives a clear hypervolume gain and can change method rankings; in several cases, the SBI initial population is already close to the best-found reference. NSGAIIARSBX-SBI performs well for medium and large budgets, while NNIA-SBI and CMOPSO-SBI are strongest when the budget is tight. Finally, larger systems require much more search effort to reach high-quality fronts, highlighting the need to plan the evaluation budget in practical RAP studies. The code and the results are available at a Zenodo repository https://doi.org/10.5281/zenodo.17981720.

Related papers

• A Replicate-and-Quantize Strategy for Plug-and-Play Load Balancing of Sparse Mixture-of-Experts LLMs [64.8510381475827]
  Sparse Mixture-of-Experts (SMoE) architectures are increasingly used to scale large language models efficiently.<n>SMoE models often suffer from severe load imbalance across experts, where a small subset of experts receives most tokens while others are underutilized.<n>We present a systematic analysis of expert routing during inference and identify three findings: (i) load imbalance persists and worsens with larger batch sizes, (ii) selection frequency does not reliably reflect expert importance, and (iii) overall expert workload and importance can be estimated using a small calibration set.
  arXiv  Detail & Related papers  (2026-02-23T15:11:16Z)
• Search-Based Risk Feature Discovery in Document Structure Spaces under a Constrained Budget [1.2507839249605703]
  Early-phase system validation under limited budgets mandates uncovering diverse failure mechanisms.<n>We formalize this challenge as a Search-Based Software Testing (SBST) problem.<n>Our methodology operates on a space of document configurations, rendering instances of structural emphrisk features to induce realistic failure conditions.
  arXiv  Detail & Related papers  (2026-01-29T12:14:18Z)
• Bayesian Optimization for Non-Cooperative Game-Based Radio Resource Management [3.652142532307204]
  This paper considers formulating the resource allocation among spectrum sharing BSs as a non-cooperative game.<n>We propose PPR-UCB, a novel Bayesian optimization strategy that learns from sequential decision-evaluation pairs.<n>Experiments on downlink transmission power allocation in a multi-cell multi-antenna system demonstrate the efficiency of PPR-UCB.
  arXiv  Detail & Related papers  (2025-12-01T03:44:43Z)
• Hierarchical Budget Policy Optimization for Adaptive Reasoning [49.621779447691665]
  We present Hierarchical Budget Policy Optimization (HBPO), a reinforcement learning framework that enables models to learn problem-specific reasoning depths without sacrificing capability.<n>HBPO partitions the exploration space into budget-constrained hierarchies (512-2560 tokens), each with differentiated reward structures that preserve both efficiency incentives and reasoning capabilities.<n>Extensive experiments demonstrate that HBPO reduces average token usage by up to 60.6% while improving accuracy by 3.14% across four reasoning benchmarks.
  arXiv  Detail & Related papers  (2025-07-21T17:52:34Z)
• NDCG-Consistent Softmax Approximation with Accelerated Convergence [67.10365329542365]
  We propose novel loss formulations that align directly with ranking metrics.<n>We integrate the proposed RG losses with the highly efficient Alternating Least Squares (ALS) optimization method.<n> Empirical evaluations on real-world datasets demonstrate that our approach achieves comparable or superior ranking performance.
  arXiv  Detail & Related papers  (2025-06-11T06:59:17Z)
• Sequential Stochastic Combinatorial Optimization Using Hierarchal Reinforcement Learning [5.57541853212632]
  We propose a two-layer option-based framework that simultaneously decides adaptive budget allocation on the higher layer and node selection on the lower layer.<n> Empirical results show that WS-option exhibits significantly improved effectiveness and generalizability compared to traditional methods.
  arXiv  Detail & Related papers  (2025-02-08T12:00:30Z)
• Best Arm Identification for Stochastic Rising Bandits [84.55453174601826]
  Rising Bandits (SRBs) model sequential decision-making problems in which the expected reward of the available options increases every time they are selected. This paper focuses on the fixed-budget Best Arm Identification (BAI) problem for SRBs. We propose two algorithms to tackle the above-mentioned setting, namely R-UCBE and R-SR.
  arXiv  Detail & Related papers  (2023-02-15T08:01:37Z)
• $\eta$-DARTS++: Bi-level Regularization for Proxy-robust Differentiable Architecture Search [96.99525100285084]
  Regularization method, Beta-Decay, is proposed to regularize the DARTS-based NAS searching process (i.e., $beta$-DARTS) In-depth theoretical analyses on how it works and why it works are provided.
  arXiv  Detail & Related papers  (2023-01-16T12:30:32Z)
• A Novel Simplified Swarm Optimization for Generalized Reliability Redundancy Allocation Problem [1.2043574473965315]
  This study proposes a novel RRAP called General RRAP (GRRAP) to be applied to network systems. Since GRRAP is an NP-hard problem, a new algorithm called Binary-addition simplified swarm optimization (BSSO) is also proposed in this study.
  arXiv  Detail & Related papers  (2021-10-01T00:12:11Z)
• Confidence-Budget Matching for Sequential Budgeted Learning [69.77435313099366]
  We formalize decision-making problems with querying budget. We consider multi-armed bandits, linear bandits, and reinforcement learning problems. We show that CBM based algorithms perform well in the presence of adversity.
  arXiv  Detail & Related papers  (2021-02-05T19:56:31Z)
• Exploration in two-stage recommender systems [79.50534282841618]
  Two-stage recommender systems are widely adopted in industry due to their scalability and maintainability. A key challenge of this setup is that optimal performance of each stage in isolation does not imply optimal global performance. We propose a method of synchronising the exploration strategies between the ranker and the nominators.
  arXiv  Detail & Related papers  (2020-09-01T16:52:51Z)
• Simplified Swarm Optimization for Bi-Objection Active Reliability Redundancy Allocation Problems [1.5990720051907859]
  The reliability redundancy allocation problem (RRAP) is a well-known problem in system design, development, and management. In this study, a bi-objective RRAP is formulated by changing the cost constraint as a new goal. To solve the proposed problem, a new simplified swarm optimization (SSO) with a penalty function, a real one-type solution structure, a number-based self-adaptive new update mechanism, a constrained non-dominated solution selection, and a new pBest replacement policy is developed.
  arXiv  Detail & Related papers  (2020-06-17T13:15:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.