A Dialectical Approach to Solve Inventive Problems Using Genetic Algorithms and TRIZ: Searching for a Computer Aided Innovation Shell

DS 58-6: Proceedings of ICED 09, the 17th International Conference on Engineering Design, Vol. 6, Design Methods and Tools (pt. 2), Palo Alto, CA, USA, 24.-27.08.2009

Year: 2009
Editor: Norell Bergendahl, M.; Grimheden, M.; Leifer, L.; Skogstad, P.; Lindemann, U.
Author: Duran-Novoa, Roberto Alejandro; Leon-Rovira, Noel; Uresti, Eduardo
Series: ICED
Section: Design Methods and Tools
Page(s): 415-426


Inventive problems need creativity to be solved, which is usually believed to be beyond comprehension and, thus, methodology. TRIZ and Genetic Algorithms (GAs) have shown that this is at least debatable. TRIZ (Russian acronym for Theory of Inventive Problem Solving) has proven its usefulness as a problem-solving method, as shown in the many practical applications and publications that have increased its presence in the product innovation process. With regard to GAs, these mimic the laws of natural selection to optimize technical systems. With the patentable results using GAs that some researchers have been able to generate, expectations about their possible contribution to enhance and accelerate the product innovation process are on the rise. This article offers an analysis of the possibility of how both tools (TRIZ and GAs) may converge under the Laws of Dialectics, creating a new conceptual computational framework for aiding and enhancing problem solving and, thus, innovation. Relevant studies and potential opportunities are analyzed for the purpose of proposing a research approach towards a Computer-aided Innovation Shell.

Keywords: Innovation, optimization, dialectics, Triz, genetic algorithms


Please sign in to your account

This site uses cookies and other tracking technologies to assist with navigation and your ability to provide feedback, analyse your use of our products and services, assist with our promotional and marketing efforts, and provide content from third parties. Privacy Policy.