Skip to main content
SpringerLink
Log in

Pareto Distance-based MOGA for Solving Bi-objective N-Version Program Design Problem

  • Conference paper
Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avizienis, A. and Chen, L. (1997) “On the Imple mentation of N-version Programming for Software Fault-tolerance During Program Execution, Proceedings of COMPSAC 77: 149–155.

    Google Scholar 

  2. Tsujimura, Y., Yamamoto, H., Takeno, T. and Yamazaki, G. (2004) “A Genetic Algorithm for Designing N-version Program”, Proceedings of the Fifth Asia-Pacific Industrial Engineering and Management Systems Conference (CD-ROM), Gold Coast, Australia.

    Google Scholar 

  3. Deb, K. (2001) “Multi-objective Optimization Using Evolutionary Algorithm”, Wiley.

    Google Scholar 

  4. Bean, J. C. (1994) “Genetic Algorithms and Random Keys for Sequencing and Optimization”, ORSA Journal of Computing, Vol. 6, No. 2.

    Google Scholar 

  5. Gen, M. and Cheng, R. W. (2000) “Genetic Algorithms & Engineering Optimization”, Wiley.

    Google Scholar 

  6. Levitin, G. (to appear) “Optimal Version Sequencing in Fault-tolerant Programs”, Asia Pacific Journal of Operations Research.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama, 345-8501, Japan

    Hidemi Yamachi & Yasuhiro Tsujimura

  2. Department of Production and Information System Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo, 191-0065, Japan

    Hidemi Yamachi & Hisashi Yamamoto

Authors
  1. Hidemi Yamachi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasuhiro Tsujimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hisashi Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Oklahoma State University, North Greenwood Avenue 700, 74106, Tulsa, USA

    Ajith Abraham

  2. Dept. of Computer Science and Systems Engineering, Muroran Institute of Technology, Mizumoto-cho 27-1, 050-8585, Muroran, Hokkaido, Japan

    Yasuhiko Dote

  3. Dept. of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Nagoya, Aichi-ken, Japan

    Takeshi Furuhashi

  4. Institut für Sicherheits-/Prüftechnik, Fraunhofer IPK Berlin, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

  5. Division of Complex Systems Technology Graduate School of Engineering, University of Hokkaido, N-13, W-8 060 KITA-KU, Sapporo, Japan

    Azuma Ohuchi

  6. PRESTO Japan Science & Technology Corp. GSSM, University of Tsukuba, 3-29-1 Otsuka, Bunkyo-ku, 12-0012, Tokyo, Japan

    Yukio Ohsawa

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamachi, H., Tsujimura, Y., Yamamoto, H. (2005). Pareto Distance-based MOGA for Solving Bi-objective N-Version Program Design Problem. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25055-5

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation