Henri Thölke
ABSTRACT
Evolutionary algorithms usually explore a search space of solutions by means of crossover and mutation. While a mutation consists of a small, local modification of a solution, crossover mixes the genetic information of two solutions to compute a new one. For model-driven optimization (MDO), where models directly serve as possible solutions (instead of first transforming them into another representation), only recently a generic crossover operator has been developed. Using graphs as a formal foundation for models, we further refine this operator in such a way that additional well-formedness constraints are preserved: We prove that, given two models that satisfy a given set of multiplicity constraints as input, our refined crossover operator computes two new models as output that also satisfy the set of constraints.
- Hani Abdeen, Dániel Varrò, Houari A. Sahraoui, András Szabolcs Nagy, Csaba Debreceni, Ábel Hegedüs, and Ákos Horváth. 2014. Multi-objective optimization in rule-based design space exploration. In Proceedings of ASE '14. 289--300. Google Scholar
Digital Library
- Ameni ben Fadhel, Marouane Kessentini, Philip Langer, and Manuel Wimmer. 2012. Search-based detection of high-level model changes. In Proceedings of ICSM 2012. IEEE Computer Society, 212--221. Google ScholarDigital Library
- Enrico Biermann, Claudia Ermel, and Gabriele Taentzer. 2012. Formal foundation of consistent EMF model transformations by algebraic graph transformation. Softw. Syst. Model. 11, 2 (2012), 227--250. Google ScholarDigital Library
- Robert Bill, Martin Fleck, Javier Troya, Tanja Mayerhofer, and Manuel Wimmer. 2019. A local and global tour on MOMoT. Softw. Syst. Model. 18, 2 (2019), 1017--1046. Google ScholarDigital Library
- Alexandru Burdusel, Steffen Zschaler, and Stefan John. 2021. Automatic generation of atomic multiplicity-preserving search operators for search-based model engineering. Softw. Syst. Model. 20, 6 (2021), 1857--1887. Google ScholarDigital Library
- Frank R. Burton, Richard F. Paige, Louis M. Rose, Dimitrios S. Kolovos, Simon M. Poulding, and Simon Smith. 2012. Solving Acquisition Problems Using Model-Driven Engineering. In Proceedings of ECMFA 2012 (Lecture Notes in Computer Science, Vol. 7349), Antonio Vallecillo, Juha-Pekka Tolvanen, Ekkart Kindler, Harald Störrle, and Dimitrios S. Kolovos (Eds.). Springer, 428--443. Google ScholarDigital Library
- Frank R. Burton and Simon M. Poulding. 2013. Complementing metaheuristic search with higher abstraction techniques. In CMSBSE@ICSE 2013, Richard F. Paige, Mark Harman, and James R. Williams (Eds.). IEEE Computer Society, 45--48. Google ScholarCross Ref
- Carlos A. Coello Coello. 2010. Constraint-handling techniques used with evolutionary algorithms. In Companion Material GECCO 2010, Martin Pelikan and Jürgen Branke (Eds.). ACM, 2603--2624. Google ScholarDigital Library
- Eclipse. 2022. Eclipse Modeling Framework (EMF). http://www.eclipse.org/emfGoogle Scholar
- Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, and Gabriele Taentzer. 2006. Fundamentals of Algebraic Graph Transformation. Springer. Google ScholarCross Ref
- A. E. Eiben and James E. Smith. 2015. Introduction to Evolutionary Computing (2 ed.). Springer. Google ScholarCross Ref
- Martin Fleck, Javier Troya, Marouane Kessentini, Manuel Wimmer, and Bader Alkhazi. 2017. Model Transformation Modularization as a Many-Objective Optimization Problem. IEEE Trans. Software Eng. 43, 11 (2017), 1009--1032. Google ScholarDigital Library
- Martin Fleck, Javier Troya, and Manuel Wimmer. 2016. The Class Responsibility Assignment Case. In Proceedings of TTC 2016 (CEUR Workshop Proceedings, Vol. 1758), Antonio García-Domínguez, Filip Krikava, and Louis M. Rose (Eds.). CEUR-WS.org, 1--8. http://ceur-ws.org/Vol-1758/paper1.pdfGoogle Scholar
- Al Globus, John Lawton, and Todd Wipke. 2000. JavaGenes: Evolving Graphs with Crossover. Technical Report. NASA Advanced Supercomputing (NAS) Division. https://www.nas.nasa.gov/assets/pdf/techreports/2000/nas-00-018.pdfGoogle Scholar
- Annegret Habel and Karl-Heinz Pennemann. 2009. Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19, 2 (2009), 245--296. Google ScholarCross Ref
- Ábel Hegedüs, Ákos Horváth, and Dániel Varrò. 2015. A model-driven framework for guided design space exploration. Autom. Softw. Eng. 22, 3 (2015), 399--436. Google ScholarDigital Library
- Jose Miguel Horcas, Daniel Strüber, Alexandru Burdusel, Jabier Martinez, and Steffen Zschaler. 2022. We're Not Gonna Break It! Consistency-Preserving Operators for Efficient Product Line Configuration. IEEE Transactions on Software Engineering (2022). online first. Google ScholarDigital Library
- Stefan John, Alexandru Burdusel, Robert Bill, Daniel Strüber, Gabriele Taentzer, Steffen Zschaler, and Manuel Wimmer. 2019. Searching for Optimal Models: Comparing Two Encoding Approaches. J. Object Technol. 18, 3 (2019), 6:1--22. Google ScholarCross Ref
- Stefan John, Jens Kosiol, Leen Lambers, and Gabriele Taentzer. 2022. A Graph-Based Framework for Model-Driven Optimization Facilitating Impact Analysis of Mutation Operator Properties. (2022). under review.Google Scholar
- Stefan John, Jens Kosiol, and Gabriele Taentzer. 2022. Towards a Configurable Crossover Operator for Model-Driven Optimization. In MDE Intelligence, Lola Burgueño, Dominik Bork, Phuong Nguyen, and Steffen Zschaler (Eds.). to appear.Google Scholar
- Penousal Machado, Henrique Nunes, and Juan Romero. 2010. Graph-Based Evolution of Visual Languages. In Proceedings of EvoApplications 2010, Part II (Lecture Notes in Computer Science, Vol. 6025), Cecilia Di Chio, Anthony Brabazon, Gianni A. Di Caro, Marc Ebner, Muddassar Farooq, Andreas Fink, Jörn Grahl, Gary Greenfield, Penousal Machado, Michael O'Neill, Ernesto Tarantino, and Neil Urquhart (Eds.). Springer, 271--280. Google ScholarDigital Library
- Zbigniew Michalewicz. 1995. A Survey of Constraint Handling Techniques in Evolutionary Computation Methods. In Proceedings of EP 1995, John R. McDonnell, Robert G. Reynolds, and David B. Fogel (Eds.). A Bradford Book, MIT Press. Cambridge, Massachusetts., 135--155.Google Scholar
- Jens Niehaus. 2004. Graphbasierte Genetische Programmierung (Graph-based Genetic Programming). Ph.D. Dissertation. Technical University of Dortmund, Dortmund, Germany. Google ScholarCross Ref
- Jean-Yves Potvin. 1996. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63, 3 (1996), 337--370. Google ScholarCross Ref
- Gabriele Taentzer, Stefan John, and Jens Kosiol. 2022. A Generic Construction for Crossovers of Graph-Like Structures. In Proceedings of ICGT 2022 (Lecture Notes in Computer Science, Vol. 13349), Nicolas Behr and Daniel Strüber (Eds.). Springer, 97--117. Google ScholarDigital Library
- Gabriele Taentzer and Arend Rensink. 2005. Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. In Proceedings of FASE 2005 (Lecture Notes in Computer Science, Vol. 3442), Maura Cerioli (Ed.). Springer, 64--79. Google ScholarDigital Library
- Henri Thölke and Jens Kosiol. 2022. A multiplicity-preserving crossover operator on graphs. Extended version. (2022). Google ScholarCross Ref
- Steffen Zschaler and Lawrence Mandow. 2016. Towards Model-Based Optimisation: Using Domain Knowledge Explicitly. In Revised Selected Papers of STAF 2016 Collocated Workshops (Lecture Notes in Computer Science, Vol. 9946), Paolo Milazzo, Dániel Varrò, and Manuel Wimmer (Eds.). Springer, 317--329. Google ScholarCross Ref
Index Terms
- A multiplicity-preserving crossover operator on graphs
Recommendations
Adding Crossover to Extinction-Based Evolutionary Algorithms
ICCEE '09: Proceedings of the 2009 Second International Conference on Computer and Electrical Engineering - Volume 02Extinction-based Evolutionary Algorithms (EEA) have been recently developed as the solutions for the problem of early convergence in multimodal optimization tasks. The reproduction of EEAs is done only by mutation. Moreover, according to recent studies, ...
Towards a configurable crossover operator for model-driven optimization
MODELS '22: Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems: Companion ProceedingsIn evolutionary algorithms, mutation and crossover are used to explore a search space for solutions. For the model-based approach to model-driven optimization, where models are used to represent solutions, no crossover operator has been introduced yet. ...
An experimental analysis of a new two-stage crossover operator for multiobjective optimization
Evolutionary algorithms for multiobjective problems utilize three types of operations for progressing toward the higher fitness regions of the search space. Each type of operator contributes in a different way toward the achievement of the common goal. ...
Comments