Large-scale 0–1 fuzzy goal programming and its application to reliability optimization problem
Computers and Industrial Engineering
A tabu search heuristic for the vehicle routing problem
Management Science
Penalty guided genetic search for reliability design optimization
Computers and Industrial Engineering
Tabu Search
A linear approximation for redundant reliability problems with multiple component choices
Computers and Industrial Engineering
The Universal Generating Function in Reliability Analysis and Optimization (Springer Series in Reliability Engineering)
On the computational complexity of reliability redundancy allocation in a series system
Operations Research Letters
Evolutionary algorithms for base station placement in mobile networks
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
Computers and Operations Research
Journal of Intelligent Manufacturing
Hi-index | 0.01 |
This paper develops an efficient heuristic to solve two typical combinatorial optimization problems frequently met when designing highly reliable systems. The first one is the redundancy allocation problem (RAP) of series-parallel binary-state systems. The design goal of the RAP is to select the optimal combination of elements and redundancy levels to maximize system reliability subject to the system budget and to the system weight. The second problem is the expansion-scheduling problem (ESP) of multi-state series-parallel systems. In this problem, the study period is divided into several stages. At each stage, the demand is represented as a piecewise cumulative load curve. During the system lifetime, the demand can increase and the total productivity may become insufficient to assume the demand. To increase the total system productivity, elements are added to the existing system. The objective in the ESP is to minimize the sum of costs of the investments over the study period while satisfying availability constraints at each stage. The heuristic approach developed to solve the RAP and the ESP is based on a combination of space partitioning, genetic algorithms (GA) and tabu search (TS). After dividing the search space into a set of disjoint subsets, this approach uses GA to select the subspaces, and applies TS to each selected subspace. Numerical results for the test problems from previous research are reported and compared. The results show the advantages of the proposed approach for solving both problems.