Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.18343

Large-scale benchmarking of multi-objective soft-computing metaheuristics for redundancy allocation in repairable k-out-of-n systems

Mateusz Oszczypała·David Ibehej·Jakub Kudela
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents a large-scale budget-aware benchmark of multi-objective soft-computing metaheuristics for a bi-objective redundancy allocation problem in repairable k-out-of-n systems. The problem combines cost minimization and steady-state availability maximization under weight constraints, with binary subsystem-level decisions determining both the number of redundant components and the redundancy strategy. Four strategies are considered: cold standby, warm standby, hot standby, and a mixed active-warm standby strategy. Subsystem availability is evaluated using continuous-time Markov chains, while the optimization task is treated as a constrained mixed-integer multi-objective problem. The study compares 65 metaheuristic algorithms from multiple algorithmic families under two initialization settings, with and without Scaled Binomial Initialization (SBI), across six case studies of increasing structural and dimensional complexity and four weight limits per case. Performance is assessed using hypervolume, budget-dependent convergence profiles, and non-parametric statistical comparisons. The results show that algorithm rankings are strongly budget-dependent, indicating that a single final-budget ranking can be misleading. SBI provides a substantial early advantage and can change the relative performance of competing methods, especially for larger instances. The best-performing algorithms vary across budget regimes: NNIA-SBI and CMOPSO-SBI are competitive under tight budgets, whereas NSGA-II+ARSBX-SBI performs robustly for medium and large budgets. From a system design perspective, Pareto-optimal solutions are dominated by hot standby and mixed redundancy strategies, while cold and warm standby rarely appear. The benchmark highlights the importance of initialization, computational budget, and problem complexity when selecting soft-computing optimizers for practical redundancy allocation.

Explore related subjects

cs.NE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mateusz Oszczypała, David Ibehej, Jakub Kudela. 2026-06-22. Large-scale benchmarking of multi-objective soft-computing metaheuristics for redundancy allocation in repairable k-out-of-n systems. https://arxiv.org/abs/2512.18343

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rethinking Pairwise Token Interaction in Spiking Transformers

Spiking Transformers inherit token interaction mechanisms from conventional Transformers, yet their sparse binary representations fundamentally alter how token-to-token communication is established. In particular, spike-based query-key matching produces highly sparse and input-dependent interaction patterns, coupling information propagation to the instantaneous availability of matching spike events. This motivates a different interaction paradigm in which long-range communication does not rely solely on pairwise spike coincidence. We therefore propose Gated Spike Axial Propagation (GSAP), a spike-native token interaction mechanism that decouples information propagation from context selection. Instead of directly determining communication through query-key matching, GSAP first propagates spike-based context along the horizontal and vertical axes, allowing information to reach distant tokens through structured sequential propagation. A receiver-conditioned gate then determines how much of the propagated context is incorporated at each token, while a lightweight local pathway preserves fine-grained neighborhood information. In this way, GSAP reformulates token interaction as a propagate-then-select process, enabling structured long-range communication while retaining the sparse event-driven nature of spiking representations. Code is available at https://github.com/Fancyssc/GSAP.

cs.NE↗
arXiv2026

Genetic Programming with Behaviour-based Niching for Learning Guided Local Search in Vehicle Routing Problems

Genetic Programming Guided Local Search (GPGLS) learns utility functions that guide local search for vehicle routing. Its evolving programs can have similar fitness while inducing different search behaviour, making fitness alone an incomplete basis for population diversity management. We propose GPGLS with Behaviour-based Niching (BN-GPGLS), which characterises programs through six operator-level descriptors collected during local search. A current-generation archive selects fitness-competitive, compact representatives from strata of a behaviour score. Fixed policies use archive parents continuously, whereas adaptive policies activate them using training-fitness and standardised behaviour-dispersion signals, optionally with a tree-size condition. We compare four behaviour-based variants with a no-archive GPGLS control and fitness-based niching over 30 seed-matched runs on generated 200-customer instances. BN-Adaptive achieves the best descriptive average rank on a separate 90-instance monitoring set; aggregate routing-cost differences are small. All five archive policies produce lower final-population median tree sizes than the GPGLS control, with paired Wilcoxon comparisons remaining significant after Holm adjustment. These results identify useful solution-quality and program-size trade-offs within the evaluated setting, without attributing the size reductions to behaviour representation alone.

cs.NE↗
arXiv2026

DCL-GPGLS: Dynamic Curriculum Learning for Genetic Programming Guided Local Search in Large-Scale Vehicle Routing

Genetic Programming Guided Local Search (GPGLS) uses genetic programming to evolve utility functions for guided local search in large-scale vehicle routing problems (LSVRPs). Evaluating every GP individual on every training instance at every generation is expensive, so GPGLS is usually trained on small instance batches. Existing curriculum-based GPGLS orders these batches mainly by instance size. Adaptive Curriculum Learning GPGLS (ACL-GPGLS) improves training efficiency by adapting when the search moves between fixed curriculum stages, but the instance difficulty order remains predefined. We propose DCL-GPGLS, which estimates the difficulty of each training instance from the current population's solution quality and updates the estimates during evolution. Each generation then receives a batch near a scheduled difficulty level, with a correction that limits repeated selection of the same instances. Experiments on a fixed training-test split of the CVRPLIB X set show that DCL-GPGLS achieves the best observed average rank and mean test cost among six training policies. It obtains the lowest mean cost on 36 of 65 unseen test instances and is significantly better than the static feedback-derived curriculum, matched in total evaluator calls, on 6 instances, with no significant difference on the remaining 59.

cs.NE↗