Inventive problem solving based on dialectical negation, using evolutionary algorithms and TRIZ heuristics

36Citations
Citations of this article
63Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The ability to solve inventive problems is at the core of the innovation process; however, the standard procedure to deal with them is to utilize random trial and error, despite the existence of several theories and methods. TRIZ and evolutionary algorithms (EA) have shown results that support the idea that inventiveness can be understood and developed systematically. This article presents a strategy based on dialectical negation in which both approaches converge, creating a new conceptual framework for enhancing computer-aided problem solving. Two basic ideas presented are the inversion of the traditional EA selection ("survival of the fittest"), and the incorporation of new dialectical negation operators in evolutionary algorithms based on TRIZ principles. Two case studies are the starting point to discuss what kind of results can be expected using this "Dialectical Negation Algorithm" (DNA). © 2010 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Duran-Novoa, R., Leon-Rovira, N., Aguayo-Tellez, H., & Said, D. (2011). Inventive problem solving based on dialectical negation, using evolutionary algorithms and TRIZ heuristics. Computers in Industry, 62(4), 437–445. https://doi.org/10.1016/j.compind.2010.12.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free