By Topic

A solution method employing a multi-objective genetic algorithm to search for pareto solutions of series-parallel system component allocation problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hidemi Yamachi ; Nippon Institute of Technology and Tokyo Metropolitan University, Japan ; Hisashi Yamamoto ; Yasuhiro Tsujimura ; Yasushi Kambayashi

We discuss the optimal system component allocation problem for series-parallel systems with interchangeable elements. A series-parallel system consists of subsystems that are connected in series and each subsystem consists of components in parallel. There are some heuristic methods to obtain quasi optimal solutions for the component allocation problem of series-parallel systems. Because this problem is one of the NP-complete problems, it is difficult to obtain the exact solutions for large scale problems. We had formulated this problem as a multi-objective optimization problem minimizing the system cost and maximizing the system reliability, and proposed an algorithm that obtains the exact solutions of the problems in an efficient way. The algorithm utilized the depth-first search method to eliminate useless searches and employs the branch-and-bound method to obtain the Pareto solutions. According to the results of our numerical experiments, the algorithm searches the Pareto solutions in practical time for not so large problems. In order to solve larger problems, in this paper, we propose a Multi-Objective Genetic Algorithm (MOGA). In comparison with the exact solution method we had proposed and the MOGA method, we assure the MOGA method produces the best compromised solutions and the later can solve large scale problems. We have conducted experiments for reasonably large scale problems and have demonstrated reasonably good performance of our method.

Published in:

2007 IEEE Congress on Evolutionary Computation

Date of Conference:

25-28 Sept. 2007