Ant system for reliability optimization of a series system with multiple-choice and budget constraints

A Hybrid Parallel Genetic Algorithm for Reliability Optimization

“…An exact optimal solution is obtained by branchand-bound algorithm (Djerdjour & Rekab, 2001;Sung & Cho, 1999). Meta-heuristics such as neural network (Nourelfath & Nahas, 2003), simulated annealing (Kim et al, 2004;Kim et al, 2008), tabu search (Kim et al, 2008), and ant colony optimization (Nahas & Nourelfath, 2005) have been introduced to solve the RAPCC. Also, Kim et al (2008) solved the largescale examples by using a reoptimization procedure with tabu search and simulated annealing.…”

“…After 10 runs using HPGA in examples 14, the experimental results including maximum, average and standard deviation values were compared with existing meta-heuristics such as ACO (Nahas & Nourelfath, 2005), SA (Kim et al, 2004), and TS (Kim et al, 2008). The comparison of meta-heuristics and the suggested algorithm is shown in Table 10.…”

An efficient heuristic for reliability design optimization problems

“…For example, the authors of [5] in their use of GA observed that better final feasible solutions could be found by permitting the exploration of the infeasible region, but by penalizing those solutions on the basis of the infeasibility degree. This idea is also used in [14,17,20] for solving the RAP of series-parallel binary-state systems with other meta-heuristics, in [19] for reliability optimization of a series system with multiple-choice and budget constraints, and in [24] for solving the RAP of series-parallel multistate systems with TS. In TS, allowing infeasible solutions is a wellknown idea [9,11,12].…”

Optimal Redundancy Allocation in Hierarchical Series-Parallel Systems Using Mixed Integer Programming

“…Shelokar et al [7] applied an ACO algorithm for single and multi-objective reliability optimization problems. Nahas and Nourelfath [8] examined applying an ant system to reliability optimization of a series system with multiple-choice and budget constraints. An ACO algorithm with a multi-objective formulation was developed by Zhao et al [2] in order to solve the redundancy apportionment problem of seriesparallel k-out-of-n G: subsystems (denoted by ACSRAP).…”