Non-preference based pruning algorithm for multi-objective redundancy allocation problem
Journal article
Authors/Editors
Strategic Research Themes
No matching items found.
Publication Details
Author list: Sooktip T., Wattanapongsakorn N., Srakaew S.
Publisher: Springer Science Business Media
Publication year: 2015
Journal: Lecture Notes in Electrical Engineering (1876-1100)
Volume number: 339
Start page: 793
End page: 800
Number of pages: 8
ISSN: 1876-1100
Languages: English-Great Britain (EN-GB)
Abstract
A non-preference based pruning algorithm is proposed to rank the Pareto-optimal solutions according to the cost and reliability trade-off for solving multi-objective redundancy allocation problem. The proposed method demonstrates on multi-objective redundancy allocation problem with mixing of non-identical component types in each subsystem. The objectives of system design are to maximize system reliability and minimize system cost simultaneously while satisfying system requirement constraints. Non-dominated sorting genetic algorithm-II (NSGA-II) finds an approximation of Paretooptimal solutions. After obtaining the approximation of Pareto-optimal solutions by NSGA-II, K-means clustering is used to cluster the approximation of Pareto-optimal solutions in to some trade-off regions. Thereafter, the Paretooptimal solutions are ranked based on the cost and reliability trade-off compare to the centroid solution of each cluster. The results show that the proposed method is able to identify the most-compromised solution. ฉ Springer-Verlag Berlin Heidelberg 2015.
Keywords
Non-preference based, Redundancy allocation problem pruning algorithm
Contact Information