Evolving Good Hierarchical Decompositions of Complex Systems

Lutz, Rudi (2001) Evolving Good Hierarchical Decompositions of Complex Systems. Journal of Systems Architecture, 47 (7). pp. 613-634. ISSN 13837621

Full text not available from this repository.


Many application areas represent the architecture of complex systems by means of hierarchical graphs containing basic entities with directed links between them, and showing the decomposition of systems into a hierarchical nested ''module'' structure. An interesting question is then: How best should such a complex system be decomposed into a hierarchical tree of nested ''modules''? This paper describes an interesting complexity measure (based on an information theoretic minimum description length principle) which can be used to compare two such hierarchical decompositions. This is then used as the fitness function for a genetic algorithm (GA) which successfully explores the space of possible hierarchical decompositions of a system. The paper also describes the novel crosssover and mutation operators that are necessary in order to do this, and gives some examples of the system in practice.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: Rudi Lutz
Date Deposited: 06 Feb 2012 19:48
Last Modified: 07 Jun 2012 12:36
URI: http://srodev.sussex.ac.uk/id/eprint/22287
📧 Request an update