Multi-objective genetic algorithm for solving N-version program design problem

Hidemi Yamachi

doi:10.1016/j.ress.2005.11.045

Multi-objective genetic algorithm for solving N-version program design problem

2006-09-01

19

PRE

AI

DOI：10.1016/j.ress.2005.11.045

原文链接

原文求助

摘要

En 中文

N-version programming (N-VP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost. (C) 2005 Elsevier Ltd. All rights reserved.

Keyword:

fault tolerant software

N-version program

multi-objective genetic algorithm

Pareto solutions

distance-based selection

Multi-objective genetic algorithm for solving N-version program design problem

摘要

AI总结

期刊

机构

引用论文