Towards Automatic Generation of Evolution Rules for Model-Driven Optimisation

Abstract

Over recent years, optimisation and evolutionary search have seen substantial interest in the MDE research community. Many of these techniques require the specification of an optimisation problem to include a set of model transformations for deriving new solution candidates from existing ones. For some problems-for example, planning problems, where the domain only allows specific actions to be taken-this is an appropriate form of problem specification. However, for many optimisation problems there is no such domain constraint. In these cases providing the transformation rules over-specifies the problem. The choice of rules has a substantial impact on the efficiency of the search, and may even cause the search to get stuck in local optima. In this paper, we propose a new approach to specifying optimisation problems in an MDE context without the need to explicitly specify evolution rules. Instead, we demonstrate how these rules can be automatically generated from a problem description that consists of a meta-model for problems and candidate solutions, a list of meta-classes, instances of which describe potential solutions, a set of additional multiplicity constraints to be satisfied by candidate solutions, and a number of objective functions. We show that rules generated in this way lead to optimisation runs that are at least as efficient as those using hand-written rules.1 https://eclipse.org/modeling/emf/ 2 http://moeaframework.org/

We're Not Gonna Break It! Consistency-Preserving Operators for Efficient Product Line Configuration

“…The supported notion of validity is focused on a certain type of multiplicity constraints (closed multiplicities on both sides of a reference). Burdusel et al [57], [58] generalized this approach to support arbitrary multiplicity constraints, albeit without a completeness guarantee. They also applied the generated rules to search-based optimization, in the context of their MDEOptimiser tool [54].…”

Searching for Optimal Models: Comparing Two Encoding Approaches.

“…Class Responsibility Assignment (CRA) The CRA use case [BBL10] stems from the domain of software design and, initiated by the Transformation Tool Contest 2016 (TTC'16) [FTCW16], has been addressed by several works in the last years [FSK17,BZ18,Str17]. A software system is defined by a set of features (methods and attributes) and dependencies.…”

Consistent modelling of hierarchical BPMN collaborations

“…On the other hand, collaboration diagrams can be used to set and deploy distributed systems (e.g. supply chains, inter-organisational collaborations, outsourcing information systems) by applying model-driven engineering techniques (Burdusel and Zschaler, 2018; Li et al. , 2012; de Vasconcelos et al.…”

“…On the other hand, collaboration diagrams can be used to set and deploy distributed systems (e.g. supply chains, inter-organisational collaborations, outsourcing information systems) by applying model-driven engineering techniques (Burdusel and Zschaler, 2018;Li et al, 2012;de Vasconcelos et al, 2012;Aldazabal et al, 2008). However, such automatic derivation requires to include a high degree of details in the model, with a clear representation of message exchanges that are particularly relevant in distributed scenarios.…”