A graph-based framework for model-driven optimization facilitating impact analysis of mutation operator properties

• Published in: Software and systems modeling Vol. 22; no. 4; pp. 1281 - 1318
• Main Authors: John, Stefan, Kosiol, Jens, Lambers, Leen, Taentzer, Gabriele
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2023; Springer Nature B.V
• Subjects: Compilers; Computer Science; Evolutionary algorithms; Genetic algorithms; Heuristic methods; Impact analysis; Information Systems Applications (incl.Internet); Interpreters; IT in Business; Mutation; Operators; Optimization; Programming Languages; Programming Techniques; Regular Paper; Software Engineering; Software Engineering/Programming and Operating Systems; Subject specialists; Search-Based Software Engineering; Evolutionary Computation; Model-Driven Engineering
• ISSN: 1619-1366; 1619-1374
• DOI: 10.1007/s10270-022-01078-x

Optimization problems in software engineering typically deal with structures as they occur in the design and maintenance of software systems. In model-driven optimization (MDO), domain-specific models are used to represent these structures while evolutionary algorithms are often used to solve optimization problems. However, designing appropriate models and evolutionary algorithms to represent and evolve structures is not always straightforward. Domain experts often need deep knowledge of how to configure an evolutionary algorithm. This makes the use of model-driven meta-heuristic search difficult and expensive. We present a graph-based framework for MDO that identifies and clarifies core concepts and relies on mutation operators to specify evolutionary change. This framework is intended to help domain experts develop and study evolutionary algorithms based on domain-specific models and operators. In addition, it can help in clarifying the critical factors for conducting reproducible experiments in MDO. Based on the framework, we are able to take a first step toward identifying and studying important properties of evolutionary operators in the context of MDO. As a showcase, we investigate the impact of soundness and completeness at the level of mutation operator sets on the effectiveness and efficiency of evolutionary algorithms.