Reliability optimization of a series system with multiple-choice and budget constraints using an efficient ant colony approach

Authors:
Fardin Ahmadizar;Hiresh Soltanpanah
Affiliations:
Department of Industrial Engineering, University of Kurdistan, Pasdaran Boulvard, Sanandaj, Iran;Department of Industrial Engineering, Islamic Azad University, Sanandaj Branch, Sanandaj, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 5
Cited 2

A linear approximation for redundant reliability problems with multiple component choices

Computers and Industrial Engineering
An efficient heuristic for series-parallel redundant reliability problems

Computers and Operations Research
A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems

Expert Systems with Applications: An International Journal
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization

Expert Systems with Applications: An International Journal
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method

Computers and Operations Research

Quantified Score

Hi-index	12.05

Visualization

Abstract

This paper deals with a reliability optimization problem for a series system with multiple-choice and budget constraints. The objective is to choose one technology for each subsystem in order to maximize the reliability of the whole system subject to the available budget. This problem is NP-hard and could be formulated as a binary integer programming problem with a nonlinear objective function. In this paper, an efficient ant colony optimization (ACO) approach is developed for the problem. In the approach, a solution is generated by an ant based on both pheromone trails modified by previous ants and heuristic information considered as a fuzzy set. Constructed solutions are not guaranteed to be feasible; consequently, applying an appropriate procedure, an infeasible solution is replaced by a feasible one. Then, feasible solutions are improved by a local search. The proposed approach is compared with the existing metaheuristic available in the literature. Computational results demonstrate that the approach serves to be a better performance for large problems.