Paper Info
Title
Pareto Distance-based MOGA for Solving Bi-objective N -Version Program Design Problem
Abstract
N-version Program (NVP) is a programming approach to fault tolerant software systems. It employs functionally equivalent, yet independently developed software components. We formulate the optimal design problem of NVP system to a biobjective optimization model, i.e., maximizing the system reliability and minimizing the system total cost. We use a Multi-Objective Genetic Algorithm (MOGA) to solve multi-objective optimization problems, however, it requires an appropriate mechanism to search Pareto solutions evenly along the Pareto frontier as many as possible. In our MOGA, we employ the random-key representation and the elitism and Pareto-insertion based on distance between Pareto solutions in the selection process. The proposed MOGA will obtain many Pareto solutions along the Pareto frontier evenly
Year
DOI
Venue
2005
10.1007/3-540-32391-0_48
WSTST
Keywords
Field
DocType
fault tolerant,software systems,software component,n version programming,optimal design
Mathematical optimization,Software fault tolerance,Optimal design,Program Design Language,Component-based software engineering,Total cost,Optimization problem,Pareto principle,Genetic algorithm,Mathematics
Conference
Citations 
PageRank 
References 
2
0.79
2
Authors
3
Name
Order
Citations
PageRank
Hidemi Yamachi1135.21
Yasuhiro Tsujimura28014.26
Hisashi Yamamoto392.93