Abstract
In model-driven optimization (MDO), domain-specific models are used to define and solve optimization problems with evolutionary algorithms. Models are typically evolved using mutations, which can be formally specified as graph transformations. So far, only mutations have been used in MDO to generate new solutions from existing ones; a crossover mechanism has not yet been elaborated. In this paper, we present a generic crossover construction for graph-like structures that can be used to implement crossover operators in MDO. We prove basic properties of our construction and show how it can be used to implement a whole set of crossover operators that have been proposed for specific problems and situations on graphs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abdeen, H., et al.: Multi-objective optimization in rule-based design space exploration. In: Crnkovic, I., Chechik, M., Grünbacher, P. (eds.) ACM/IEEE International Conference on Automated Software Engineering, ASE 2014, Vasteras, Sweden - 15–19 September 2014, pp. 289–300. ACM (2014). https://doi.org/10.1145/2642937.2643005
Atkinson, T., Plump, D., Stepney, S.: Horizontal gene transfer for recombining graphs. Genet. Program. Evolvable Mach. 21(3), 321–347 (2020). https://doi.org/10.1007/s10710-020-09378-1
Awodey, S.: Category Theory, Oxford Logic Guides, 2nd edn. vol. 52. Oxford University Press, Oxford (2010)
Bill, R., Fleck, M., Troya, J., Mayerhofer, T., Wimmer, M.: A local and global tour on MOMoT. Softw. Syst. Model. 18(2), 1017–1046 (2019). https://doi.org/10.1007/s10270-017-0644-3
Boussaïd, I., Siarry, P., Ahmed-Nacer, M.: A survey on search-based model-driven engineering. Autom. Softw. Eng. 24(2), 233–294 (2017). https://doi.org/10.1007/s10515-017-0215-4
Bowman, M., Briand, L.C., Labiche, Y.: Solving the class responsibility assignment problem in object-oriented analysis with multi-objective genetic algorithms. IEEE Trans. Softw. Eng. 36(6), 817–837 (2010). https://doi.org/10.1109/TSE.2010.70
Burdusel, A., Zschaler, S., John, S.: Automatic generation of atomic multiplicity-preserving search operators for search-based model engineering. Softw. Syst. Model. 20(6), 1857–1887 (2021). https://doi.org/10.1007/s10270-021-00914-w
Burton, F.R., Paige, R.F., Rose, L.M., Kolovos, D.S., Poulding, S., Smith, S.: Solving acquisition problems using model-driven engineering. In: Vallecillo, A., Tolvanen, J.-P., Kindler, E., Störrle, H., Kolovos, D. (eds.) ECMFA 2012. LNCS, vol. 7349, pp. 428–443. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31491-9_32
Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425, 17–33 (2012). https://doi.org/10.1016/j.tcs.2010.10.035
Downey, C., Zhang, M., Browne, W.N.: New crossover operators in linear genetic programming for multiclass object classification. In: Pelikan, M., Branke, J. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2010, Portland, Oregon, USA, 7–11 July 2010. pp. 885–892. ACM (2010). https://doi.org/10.1145/1830483.1830644
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science, Springer, Heidelberg (2006).https://doi.org/10.1007/3-540-31188-2
Ehrig, H., Ermel, C., Golas, U., Hermann, F.: Graph and model transformation - general framework and applications. In: Monographs. in Theoretical Computer Science. An EATCS Series, Springer (2015). https://doi.org/10.1007/978-3-662-47980-3
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. NCS, Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-44874-8
Fritsche, L., Kosiol, J., Schürr, A., Taentzer, G.: Short-cut rules. In: Mazzara, M., Ober, I., Salaün, G. (eds.) STAF 2018. LNCS, vol. 11176, pp. 415–430. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04771-9_30
Garner, R., Lack, S.: On the axioms for adhesive and quasiadhesive categories. Theory Appl. Categor. 27(3), 27–46 (2012), https://www.emis.de/journals/TAC/volumes/27/3/27-03abs.html
Harman, M., Jones, B.F.: Search-based software engineering. Inf. Softw. Technol. 43(14), 833–839 (2001). https://doi.org/10.1016/S0950-5849(01)00189-6
Harman, M., Mansouri, S.A., Zhang, Y.: Search-based software engineering: trends, techniques and applications. ACM Comput. Surv. 45(1), 11:1–11:61 (2012). https://doi.org/10.1145/2379776.2379787
Heindel, T.: Adhesivity with partial maps instead of spans. Fundam. Informaticae 118(1-2), 1–33 (2012). https://doi.org/10.3233/FI-2012-704
Husa, J., Kalkreuth, R.: A comparative study on crossover in cartesian genetic programming. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., García-Sánchez, P. (eds.) EuroGP 2018. LNCS, vol. 10781, pp. 203–219. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77553-1_13
John, S., Alexandru Burdusel, R.B., Strüber, D., Taentzer, G., Zschaler, S., Wimmer, M.: Searching for optimal models: comparing two encoding approaches. J. Obj. Technol. 18(3), 6:1–22 (2019). https://doi.org/10.5381/jot.2019.18.3.a6
Kalkreuth, R., Rudolph, G., Droschinsky, A.: A new subgraph crossover for Cartesian genetic programming. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., García-Sánchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 294–310. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55696-3_19
Kantschik, W., Banzhaf, W.: Linear-graph GP - a new GP structure. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 83–92. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45984-7_8
Kosiol, J., Fritsche, L., Schürr, A., Taentzer, G.: Double-pushout-rewriting in S-cartesian functor categories: rewriting theory and application to partial triple graphs. J. Log. Algebraic Methods Program. 115, 100565 (2020). https://doi.org/10.1016/j.jlamp.2020.100565
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Complex Adaptive Systems (1992)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. RAIRO Theor. Informat. Appl. 39(3), 511–545 (2005). https://doi.org/10.1051/ita:2005028
Machado, P., Nunes, H., Romero, J.: Graph-based evolution of visual languages. In: Di Chio, C., Brabazon, A., Di Caro, G.A., Ebner, M., Farooq, M., Fink, A., Grahl, J., Greenfield, G., Machado, P., O’Neill, M., Tarantino, E., Urquhart, N. (eds.) EvoApplications 2010. LNCS, vol. 6025, pp. 271–280. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12242-2_28
Niehaus, J.: Graphbasierte Genetische Programmierung. Ph.D. thesis, Technical University of Dortmund (2003). http://hdl.handle.net/2003/2744
Nobile, M.S., Besozzi, D., Cazzaniga, P., Mauri, G.: The foundation of evolutionary Petri Nets. In: Balbo, G., Heiner, M. (eds.) Proceedings of the International Workshop on Biological Processes & Petri Nets, Milano, Italy, CEUR 24 June 2013. http://ceur-ws.org/Vol-988/paper6.pdf
Pereira, F.B., Machado, P., Costa, E., Cardoso, A.: Graph based crossover - a case study with the busy beaver problem. In: Banzhaf, W., Daida, J.M., Eiben, A.E., Garzon, M.H., Honavar, V. (eds.) Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, GECCO 1999, Vol. 2, pp. 1149–1155. Morgan Kaufmann Publishers Inc., San Francisco (1999)
Plump, D.: Termination of graph rewriting is undecidable. Fundam. Informaticae 33(2), 201–209 (1998). https://doi.org/10.3233/FI-1998-33204
Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, pp. 3–61. World Scientific (1999). https://doi.org/10.1142/9789812815149_0001
Zschaler, S., Mandow, L.: Towards model-based Optimisation: using domain knowledge explicitly. In: Milazzo, P., Varró, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 317–329. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-50230-4_24
Acknowledgements
This work has been partially supported by the German Research Foundation (DFG), grant no. TA 294/19-1. We thank the anonymous reviewers for their insightful comments.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
A Proofs
A Proofs
The following lemma is the central ingredient for the proof of Proposition 1 and also used in the one of Theorem 3. For adhesive categories, it has already been stated in the extended version of [14]. Here, we present it in the more general context of \(\mathcal {M}\)-adhesive categories. Because of that, we need to additionally assume the existence of \(\mathcal {M}\)-effective unions.
Lemma 2 (Pullbacks as pushouts)
In an \(\mathcal {M}\)-adhesive category \((\mathcal {C},\mathcal {M})\) with \(\mathcal {M}\)-effective unions, let \((e_1,e_2): L_1, L_2 \hookrightarrow E\) be a pair of jointly epimorphic \(\mathcal {M}\)-morphisms. Then the pullback of \((e_1,e_2)\) is also a pushout.
Proof
Given the diagram below, where P arises as pullback of \((e_1,e_2)\), Q as pushout of \((p_1,p_2)\), and the morphism h from the universal property of Q, we show that h is an isomorphism.
First, since \(e_1,e_2\) are \(\mathcal {M}\)-morphisms, the morphism h is an \(\mathcal {M}\)-morphism, assuming \(\mathcal {M}\)-effective unions. This means that h is a regular monomorphism (compare [25, Lemma 4.8], which is easily seen to also hold in \(\mathcal {M}\)-adhesive categories).
Secondly, given two morphisms \(f,g: E \rightarrow X\) with \(f \circ h = g \circ h\), it follows that \(f \circ h \circ q_1 = g \circ h \circ q_1\) which implies \(f \circ e_1 = g \circ e_1\); analogously, \(f \circ e_2 = g \circ e_2\) holds. Since \(e_1,e_2\) are jointly epimorphic, it follows that \(f=g\), and h is an epimorphism. Thus, h is epi and regular mono and therefore an isomorphism. \(\square \)
Proof
(of Proposition 1). Given a solution split as depicted in Fig. 5, it is straightforward to realize this split via the split construction. One just chooses the already given morphisms \(s^1\) and \(s^2\). As the bottom square in Fig. 5 is a pushout, \(s^1\) and \(s^2\) are jointly epimorphic. Moreover, in an \(\mathcal {M}\)-adhesive category that square is also a pullback because \(E^I\hookrightarrow E^1\) (or, equally, \(E^I\hookrightarrow E^2\)) \(\in \mathcal {M}\).
To show that the construction always computes a solution split, we have to show that it produces a commuting cube of \(\mathcal {M}\)-morphisms (with isomorphisms at the top) such that the bottom square is a pushout and the four vertical squares constitute ce-morphisms (i.e., are also pullbacks and are compatible with typing). It is well-known that, in every category, in a cube that is computed via pullbacks as stipulated by our construction, all squares are pullbacks; see, e.g., [3, 5.7 Exercises, 2. (b)]. By closedness of \(\mathcal {M}\)-morphism under pullbacks, this in turn implies that all morphisms are \(\mathcal {M}\)-morphisms (because e, \(s^1\), and \(s^2\) are). The two morphisms at the front of the top square are isomorphisms by assumption; the other two become isomorphisms by closedness of isomorphisms under pullback. Finally, in an \(\mathcal {M}\)-adhesive category with \(\mathcal {M}\)-effective unions, the pullback of jointly epimorphic \(\mathcal {M}\)-morphisms is always a pushout (see Lemma 2 above). Therefore, the bottom square (computed as pullback of the jointly epic \(\mathcal {M}\)-morphisms \(s^1\) and \(s^2\)) is a pushout as desired. The typing of \(\overline{E^1}\) and \(\overline{E^2}\) is compatible with the typing of \(\overline{E}\) by definition; moreover, the squares obtained from the typing morphisms are pullbacks by pullback composition.
For the last statement, it suffices to observe that \(E^2\) can always be chosen as E, embedded via the identity morphism (which then leads to \(E^I\cong E^1\)). \(\square \)
Proof
(of Lemma 1). To prove the statement, we have to show that there exists a ce-morphism \((a_P,a)\) from \(\overline{ CP }:= (id: PI _P\hookrightarrow PI _P,t_{ PI _P}, tp \circ t_{ PI _P})\) to \(\overline{E^I}\) such that \(a_P\) is an isomorphism and \(a \in \mathcal {M}\); the analogous statement for \(\overline{F^I}\) is proved in exactly the same way.
We define such a ce-morphism using the isomorphism \(a_P\) with \(t_{E^I_P} \circ a_P = t_{ PI _P}\) that exists since \(\overline{E^I}\) is an element of the search space of \(\overline{ PI }\). Figure 15 depicts this. The square commutes and \(a,e^I \circ a \in \mathcal {M}\) by closedness of \(\mathcal {M}\) under isomorphisms and composition. Moreover, using the fact that \(e^I\) is a monomorphism, it is also easy to check that the square constitutes a pullback. Finally, using \(t_{E^I_P} \circ a_P = t_{ PI _P}\) we compute
which shows \((a_P, e^I \circ a_P)\) to be type-compatible. \(\square \)
Proof
(of Proposition 2). First, in an \(\mathcal {M}\)-adhesive category, pushouts along \(\mathcal {M}\)-morphisms exist. This means that, given two solution splits and a crossover point, crossover is always applicable. Since isomorphisms are closed under pushout, the top squares in the construction consist of isomorphisms only. In particular, \((E^1F^2)_P\cong PI _P\cong (E^2F^1)_P\) (because \(E^1_P\cong PI _P\cong E^2_P\) by assumption).
By definition, \(o_1\) is the unique morphism such that
where \((a_P,a)\) and \((b_P,b)\) denote the ce-morphisms from \(e^1\) and \(f^2\) to \(o_1\) (see Fig. 8). A standard diagram chase (using the facts that the top squares in Fig. 8 consist of isomorphisms only and that diagrams remain commutative if one replaces isomorphisms by their inverses) then shows that \(a \circ e^1 \circ a_P^{-1}\) (or, equally, \(b \circ f^2 \circ b_P^{-1}\)) exhibits this universal property. Therefore, \(o_1 = a \circ e^1 \circ a_P^{-1} \in \mathcal {M}\) as composition of \(\mathcal {M}\)-morphisms. Again, this uses the fact that \(\mathcal {M}\) contains all isomorphisms.
Finally, that the typing morphisms of \(\overline{O_1}\) induce even a pullback square over \( tp \) (and not merely a commuting one) follows exactly as in the proof of Lemma 2.2 in [15], using the facts that the ambient category \(\mathcal {C}\) is \(\mathcal {M}\)-adhesive and \( tp \in \mathcal {M}\). \(\square \)
Proof
(of Proposition 3). Let solution \(\overline{O}\) be computed via a crossover from \(\overline{E}\) and \(\overline{F}\). It is immediately clear from the construction that there exist the two required ce-morphisms \(\bar{i}\) and \(\bar{j}\) such that i, j are jointly epic \(\mathcal {M}\)-morphisms because the projections of a pushout are jointly epi and \(\mathcal {M}\)-morphisms are closed under pushout.
For the converse direction, O is jointly covered by \(E^1\) and \(F^2\), which stem from subsolutions \(\overline{E^1}\) and \(\overline{F^1}\) of \(\overline{E}\) and \(\overline{F}\) by assumption. If the underlying category has \(\mathcal {M}\)-effective unions, pulling these morphisms back results in a pushout. Let \(\overline{ CP }\) be the object resulting from that pullback (exactly as in the proof of Proposition 1). We merely have to show that there exist solution splits of \(\overline{E}\) and \(\overline{F}\) that split up \(\overline{E}\) into \(\overline{E^1}\) and some suitable subsolution \(\overline{E^2}\) of \(\overline{E}\) and \(\overline{F}\) into \(\overline{F^2}\) and some suitable subsolution \(\overline{F^1}\) of \(\overline{F}\) for which \(\overline{ CP }\) can serve as a crossover point. As in (the proof of) the second part of Proposition 1, we can use \(\overline{E}\) as \(\overline{E^2}\) and, because of the symmetric nature of a solution split, \(\overline{F}\) as \(\overline{F^1}\) and obtain splits of \(\overline{E}\) and \(\overline{F}\) with \(\overline{E^I}= \overline{E^1}\) and \(\overline{F^I}= \overline{F^2}\). Hence, \(\overline{ CP }\), together with the morphisms that stem from its computation as a pullback, can serve as a crossover point for these splits, and applying the crossover construction computes the given solution \(\overline{O}\). \(\square \)
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Taentzer, G., John, S., Kosiol, J. (2022). A Generic Construction for Crossovers of Graph-Like Structures. In: Behr, N., Strüber, D. (eds) Graph Transformation. ICGT 2022. Lecture Notes in Computer Science, vol 13349. Springer, Cham. https://doi.org/10.1007/978-3-031-09843-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-09843-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09842-0
Online ISBN: 978-3-031-09843-7
eBook Packages: Computer ScienceComputer Science (R0)