Non-linear threshold algorithm based solution for the redundancy allocation problem considering multiple redundancy strategies
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Purpose The purpose of this paper is to introduce an efficient algorithm based on a non-linear accepting threshold to solve the redundancy allocation problem (RAP) considering multiple redundancy strategies. In addition to the components reliability, multiple redundancy strategies are simultaneously considered to vary the reliability of the system. The goal is to determine the optimal selection of elements, redundancy levels and redundancy strategy, which maximizes the system reliability under various system-level constraints. Design/methodology/approach The mixed RAP considering the use of active and standby components at the subsystem level belongs to the class of NP-hard problems involving selection of elements and redundancy levels, to maximize a specific system performance under a given set of physical and budget constraints. Generally, the authors recourse to meta-heuristic algorithms to solve this type of optimization problem in a reasonable computational time, especially for large-size problems. A non-linear threshold accepting algorithm (NTAA) is developed to solve the tackled optimization problem. Numerical results for test problems from previous research are reported and analyzed to assess the efficiency of the proposed algorithm. Findings The comparison with the best solutions obtained in previous studies, namely: genetic algorithm, simulated annealing, memetic algorithm and the particle swarm optimization for 33 different instances of the problem, demonstrated the superiority of the proposed algorithm in finding for all considered instances, a high-quality solution in a minimum computational time. Research limitations/implications Considering multiple redundancy strategies helps to achieve higher reliability levels but increases the complexity of the obtained solution leading to infeasible systems in term of physical design. Technological constraints must be integrated into the model to provide a more comprehensive and realistic approach. Practical implications Designing high performant systems which meet customer requirements, under different economic and functional constraints is the main challenge faced by the manufacturers. The proposed algorithm aims to provide a superior solution of the reliability optimization problem by considering the possibility to adopt multiple redundancy strategies at the subsystem level in a minimum computational time. Originality/value A NTAA is expanded to the RAP considering multiple redundancy strategies at the subsystem level subject to weight and cost constraints. A procedure based on a penalized objective function is developed to encourage the algorithm to explore toward the feasible solutions area. By outperforming well-known solving technique, the NTAA provides a powerful tool to reliability designers of complex systems where different varieties of redundancies can be considered to achieve high-reliability systems.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle