earticle

논문검색

Optimization Study on Interval Number Judgment Matrix Weight Vector Based on Immune Evolution Algorithm

원문정보

초록

영어

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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.