Earticle

초록

영어

This paper focuses on the approach to solve the immune evolution optimization with interval number judgment matrix weight vector. In light of the features of interval number judgment matrix, we transform the solution problem of weights into the optimization one of nonlinear with restriction, design immune evolution algorithm on the base of immune mechanism, and use the convergence ability of immune system to search the optimal access to get interval numbers from matrix weight vector. Moreover, we construct immune operator and form vaccine and optimization strategies by priori knowledge of target problem, by which we can keep individual diversity and elite individuals and abandon useless individuals as soon as possible. In the evolution process, search can be dramatically improved by overcoming the problems of earliness and degradation during global search. Simulation results of experiments show the advantages of this algorithm in accuracy, convergence, convergence rate and so on.

목차

Abstract
 1. Introduction
 2. Classic ahp to Solve Judgment Matrix Weight
  2.1. Judgment Matrix and its Scale Selection
  2.2. Acquisition of Weight Vector
 3. Optimization Model and Immune Evolution Algorithm of Solving Interval Number Weight Vector
  3.1. Demonstration of Interval Number of Judgment Matrix and its Weight Vector
  3.2 Optimization Model of Immune Evolution
 4. Design of Algorithm
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Jianming Sun [ School of computer and information engineering, Harbin University of Commerce, Harbin Postal 150028,China ]
• Jing Wu [ School of Experiment, Harbin University of Commerce Harbin Postal 150028,China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605