VA++ - The Next Generation of Value Analysis in TRIZ

Abstract

Around twenty years ago, two methods relevant for systematic innovation and improvement - TRIZ and Value Analysis - have been merged in a specific way, which was then incorporated in software packages about innovation and became part of certified TRIZ education as well. An intended key purpose of this nowadays established method of Value Analysis in TRIZ is to identify system components of low ideality - or value, respectively -, i.e. parts of the system, that do not give a satisfactory functional contribution in relation to their cost. Hence, Value Analysis should point out the sweet spots for subsequent improvement, innovation or even patent circumvention activities. Unfortunately, the commonly used standard approach for Value Analyis in TRIZ, which is based on a function ranking algorithm, leads to results, that are inconsistent and not trustworthy in general. This work illustrates these shortcomings and explains their origins. Derived from key requirements necessary for a meaningful concept, VA++, a new advanced approach for Value Analysis in TRIZ, is presented and validated.

Appendix: Function Ranking and Function Values

According to Step 1 of standard VA in TRIZ, the functional value of each useful function is derived from an empirical function ranking algorithm, which is summarized here in short ([8, 9], also cf. [6]): Each main function gets the highest function rank denoted as basic, B. Any other function acting on the same object as a main function is considered to be basic, too. Each function acting on a component, which itself performs a basic function, is of rank A₁, the second highest function rank. Each remaining function acting on a supersystem component is also of rank A₁. For all the remaining functions, which are system internal only, the function rank is A_n+1 if they act on a component, which itself performs a function of rank A_n. Thus, this procedure works stepwise, and eventually attaches the function ranks B, A₁, …, A_M in descending order to all of the involved functions. Here, M is a natural number which generally depends on the concrete functional pattern between the components of the system. Finally, function values are assigned to the functions, starting with the lowest function rank: A_M $\to$ 1, A_M-1 $\to$ 2, …, until A₁ $\to$ M. Since basic functions are supposed to be especially valuable, they get the function value B $\to$ M + 2.