Published September 2006 | Version v1
Journal article

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

  • 1. Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan) and Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)
  • 2. Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)
  • 3. Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)

Description

N-version programming (NVP) 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

Additional details

Identifiers

DOI
10.1016/j.ress.2005.11.045;
PII
S0951-8320(05)00208-5;

Publishing Information

Journal Title
Reliability Engineering and System Safety
Journal Volume
91
Journal Issue
9
Journal Page Range
p. 1083-1094
ISSN
0951-8320
CODEN
RESSEP

INIS

Country of Publication
United Kingdom
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
38013132
Subject category
S42: ENGINEERING;
Descriptors DEI
ALGORITHMS; COMPUTER CODES; COST; DESIGN; MATHEMATICAL SOLUTIONS; NONLINEAR PROBLEMS; OPTIMIZATION; PERFORMANCE; PROGRAMMING; RANDOMNESS; RELIABILITY
Descriptors DEC
MATHEMATICAL LOGIC

Optional Information

Copyright
Copyright (c) 2005 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.