제어로봇시스템학회:학술대회논문집

Institute of Control, Robotics and Systems (제어로봇시스템학회)
권호 표지

Search Vector Method for Solution Domain Renewal

  • Toriumi, Fujio (Department of Control and Systems Engineering, of Tokyo Institute of Technology) ;
  • Takayama, Jun-ya (Department of Control and Systems Engineering, of Tokyo Institute of Technology) ;
  • Ohyama, Shinji (Department of Control and Systems Engineering, of Tokyo Institute of Technology) ;
  • Kobayashi, Akira (Department of Control and Systems Engineering, of Tokyo Institute of Technology)
  • Published : 2003.10.22
Download PDF
⟨ Previous Next ⟩

Abstract

A band function model paired comparison method (BMPC method) is a kind of a paired comparison methods. Considering the human ambiguities, the BMPC method expressing the human judgment characteristics as a monotonous increase function with some width. Since function types are not specified in a BMPC method, the solution is obtained from inequalities, and the solution is given as a domain. To solve the simultaneous inequalities, the sequential renew method is used in the previous BMPC method. However, the sequential renew method requires much computational effort and memories. Generally, in BMPC method, it is able to solve only a paired comparison table which has less 12-13 samples. For that purpose, a new fast solution algorithm is required. In this paper, we proposed a new “search vector method” which renews the solution domain without creating new edge vectors. By using the method, it is able to decrease the necessary memory spaces and time to solve. The proposed method makes it able to solve more than 15 samples paired comparison inspections which are impossible to solve by previous method.

Keywords