@inproceedings{48840, abstract = {{Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs.}}, author = {{Bossek, Jakob and Grimme, Christian and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-6111-8}}, keywords = {{biased mutation, combinatorial optimization, minimum spanning tree, multi-objective optimization}}, pages = {{516–523}}, publisher = {{Association for Computing Machinery}}, title = {{{On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}}}, doi = {{10.1145/3321707.3321818}}, year = {{2019}}, } @phdthesis{10000, abstract = {{Ultraschall wird zur Effizienzsteigerung in verfahrenstechnischen Prozessen eingesetzt. Die Betriebsparamter der Ultraschallsysteme werden empirisch ermittelt, da derzeit keine systematische Analyse der Wechselwirkung zwischen Ultraschallwandler und Schallfeld sowie kein Verfahren zur Messung der Kavitationsaktivität ohne zusätzlichen Sensor existieren. Auf Basis einer experimentellen Analyse des betrachteten sonochemischen Reaktors wird ein Finite-Elemente-Modell aufgebaut, das die Wechselwirkung zwischen Schallfeld und Ultraschallwandler berücksichtigt. Die modellbasierte Analyse zeigt, dass wegen der akustischen Eigenschaften des Autoklavs nur direkt an der Sonotrode Kavitation entsteht. Die Wechselwirkung zwischen Ultraschallwandler und Schallfeld ermöglicht Aussagen über das Schallfeld und die Kavitationsaktivität auf Basis der Rückwirkung auf den Ultraschallwandler. Die lineare Schalldruckverteilung ermöglicht eine Prognose über die Verteilung von Kavitationszonen. Das beschriebene Modell liefert wertvolle Erkenntnisse für die Auslegung, Analyse und Skalierung sonochemischer Reaktoren. Auf Grund der rauen Prozessrandbedingungen ist die Applikation von Sensoren zur Überwachung der Kavitationsaktivität in vielen sonochemischen Prozessen nicht möglich. Zur prozessbegleitenden Messung der Kavitationsaktivität wird ein Verfahren entwickelt, das die Bewertung der Kavitationsaktivität durch Auswertung der Rückwirkung auf den Ultraschallwandler erlaubt. Das Messverfahren ermöglicht eine vorhersagbare und reproduzierbare Durchführung kavitationsbasierter Prozesse und stellt eine wichtige Erweiterung für bestehende und neue Ultraschallsysteme dar.}}, author = {{Bornmann, Peter}}, keywords = {{Sonochemie, Akustische Kavitation, Kavitationsmessung, Kavitationsdetektion, FEM-Simulation Ultraschallwandler, Prozessüberwachung, FEM-Simulation Schallfeld, Self-Sensing, Piezoelektrische Ultraschallwandler, Ultraschallreinigung}}, publisher = {{Shaker}}, title = {{{Modellierung und experimentelle Charakterisierung der Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen}}}, year = {{2019}}, } @inproceedings{1163, abstract = {{In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system. }}, author = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}}, keywords = {{Topological Self-stabilization, Supervised Overlay, Publish-Subscribe System}}, location = {{Vancouver}}, publisher = {{IEEE}}, title = {{{Self-Stabilizing Supervised Publish-Subscribe Systems}}}, doi = {{10.1109/IPDPS.2018.00114}}, year = {{2018}}, } @inproceedings{5675, abstract = {{When responding to natural disasters, professional relief units are often supported by many volunteers which are not affiliated to humanitarian organizations. The effective coordination of these volunteers is crucial to leverage their capabilities and to avoid conflicts with professional relief units. In this paper, we empirically identify key requirements that professional relief units pose on this coordination. Based on these requirements, we suggest a decision model. We computationally solve a real-world instance of the model and empirically validate the computed solution in interviews with practitioners. Our results show that the suggested model allows for solving volunteer coordination tasks of realistic size near-optimally within short time, with the determined solution being well accepted by practitioners. We also describe in this article how the suggested decision support model is integrated in the volunteer coordination system which we develop in joint cooperation with a disaster management authority and a software development company.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, booktitle = {{Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management}}, keywords = {{Coordination of spontaneous volunteers, volunteer coordination system, decision support, scheduling optimization model, linear programming}}, location = {{Rochester, NY, USA}}, title = {{{Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief}}}, year = {{2018}}, } @inproceedings{4411, abstract = {{While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact. In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table. Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses. We show how to maintain the structure in a self-stabilizing way. Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.}}, author = {{Knollmann, Till and Scheideler, Christian}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, editor = {{Izumi, Taisuke and Kuznetsov, Petr}}, keywords = {{Self-Stabilizing, Prefix Search, Distributed Data Structure}}, location = {{Tokyo}}, publisher = {{Springer, Cham}}, title = {{{A Self-Stabilizing Hashed Patricia Trie}}}, doi = {{10.1007/978-3-030-03232-6_1}}, volume = {{11201}}, year = {{2018}}, } @inproceedings{9999, abstract = {{Ultrasonic wire bonding is an indispensable process in the industrial manufacturing of semiconductor devices. Copper wire is increasingly replacing the well-established aluminium wire because of its superior electrical, thermal and mechanical properties. Copper wire processes differ significantly from aluminium processes and are more sensitive to disturbances, which reduces the range of parameter values suitable for a stable process. Disturbances can be compensated by an adaption of process parameters, but finding suitable parameters manually is difficult and time-consuming. This paper presents a physical model of the ultrasonic wire bonding process including the friction contact between tool and wire. This model yields novel insights into the process. A prototype of a multi-objective optimizing bonding machine (MOBM) is presented. It uses multi-objective optimization, based on the complete process model, to automatically select the best operating point as a compromise of concurrent objectives.}}, author = {{Unger, Andreas and Hunstig, Matthias and Meyer, Tobias and Brökelmann, Michael and Sextro, Walter}}, booktitle = {{In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018}}, keywords = {{wire bonding, multi-objective optimization, process model, copper wire, self-optimization}}, title = {{{Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges}}}, doi = {{10.4071/2380-4505-2018.1.000572}}, volume = {{Vol. 2018, No. 1, pp. 000572-000577.}}, year = {{2018}}, } @article{32158, abstract = {{Sociogenesis addresses a pervasive problem in psychology given by Cartesian dualism that assigns the mental an inner locus apart from material activity. Aligning ourselves to the ongoing critical discussions of interiorization in psychology, we explore the crucial notion of space by highlighting language as sociocultural and dialogical activity performed by other-oriented individuals. We discuss space in terms of the “language spacetime”, a symbolic, embodied formation of mutually positioned speaking and listening selves. This leads beyond the “inside-outside” container metaphor and allows for a reformulation of interiorization. Interiorization is conceptualized as a continuous series of different, though mutually related movements between self and other and self and self that lead to and are supported by specific formations in language activity: reversion, transposition, and decoupling. Along a short passage of a video-based interview, we trace the reversion of dialogical positions within the addressivity constellation of the two interlocutors, their interactive creation of a heterotopic spacetime, and the decoupling of one speaker's psychological activity from the concrete here-and-now and the present other by moving and acting into this new sphere. Interiorization appears as a movement at the border of past, present, and possible future(s).}}, author = {{Bertau, Marie-Cécile and Karsten, Andrea}}, issn = {{0732-118X}}, journal = {{New Ideas in Psychology}}, keywords = {{Interiorization, Dialogical self, Language activity, Voice, Vygotsky, Heterotopia, Video-confrontation}}, pages = {{7--17}}, publisher = {{Elsevier BV}}, title = {{{Reconsidering interiorization: Self moving across language spacetimes}}}, doi = {{10.1016/j.newideapsych.2017.12.001}}, volume = {{49}}, year = {{2018}}, } @inproceedings{48839, abstract = {{We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem with a single vehicle while the two conflicting objectives are minimization of travel time and maximization of the number of visited customer locations. Experiments are based on a large set of specifically designed problem instances with different characteristics and it is shown that local search techniques focusing on one of the objectives only improve the performance of the evolutionary algorithm in terms of both objectives. The analysis also shows that local search techniques are capable of sending locally optimal solutions to foremost fronts of the multi-objective optimization process, and that these solutions then become the leading factors of the evolutionary process.}}, author = {{Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-5618-3}}, keywords = {{combinatorial optimization, metaheuristics, multi-objective optimization, orienteering, transportation}}, pages = {{585–592}}, publisher = {{Association for Computing Machinery}}, title = {{{Local Search Effects in Bi-Objective Orienteering}}}, doi = {{10.1145/3205455.3205548}}, year = {{2018}}, } @inproceedings{48867, abstract = {{Assessing the performance of stochastic optimization algorithms in the field of multi-objective optimization is of utmost importance. Besides the visual comparison of the obtained approximation sets, more sophisticated methods have been proposed in the last decade, e. g., a variety of quantitative performance indicators or statistical tests. In this paper, we present tools implemented in the R package ecr, which assist in performing comprehensive and sound comparison and evaluation of multi-objective evolutionary algorithms following recommendations from the literature.}}, author = {{Bossek, Jakob}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, isbn = {{978-1-4503-5764-7}}, keywords = {{evolutionary optimization, performance assessment, software-tools}}, pages = {{1350–1356}}, publisher = {{Association for Computing Machinery}}, title = {{{Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr}}}, doi = {{10.1145/3205651.3208312}}, year = {{2018}}, } @inproceedings{48885, abstract = {{Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms.}}, author = {{Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, isbn = {{978-1-4503-5764-7}}, keywords = {{algorithm selection, optimization, performance measures, transportation, travelling salesperson problem}}, pages = {{1737–1744}}, publisher = {{Association for Computing Machinery}}, title = {{{Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}}}, doi = {{10.1145/3205651.3208233}}, year = {{2018}}, } @article{4419, abstract = {{Research on entrepreneurial learning highlights the importance of experience and prior knowledge to entrepreneurial success. However, a conundrum remains and we are still seeking answers as to why some novice entrepreneurs learn successfully from their experiences and succeed, while some experienced entrepreneurs fail with their ventures. In order to advance the discussion about the role of experience during entrepreneurial learning, our critical reflection aims to (1) highlight some of the shortcomings of experiential learning theory (ELT) and (2) illustrate how alternative theoretical perspectives have the potential to advance our conceptual understanding of entrepreneurial learning processes. We argue for an explanation of entrepreneurial learning as a dynamic and self-regulated process that relies on planning, monitoring, and self-reflection.}}, author = {{Fust, Alexander Paul and Jenert, Tobias and Winkler, Christoph}}, journal = {{Entrepreneurship Research Journal}}, keywords = {{entrepreneurial learning, experiential learning, self-regulated learning}}, number = {{2}}, pages = {{1--11}}, publisher = {{de @Gruyter}}, title = {{{Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes}}}, volume = {{8}}, year = {{2018}}, } @phdthesis{9994, abstract = {{Reliability-adaptive systems allow an adaptation of system behavior based on current system reliability. They can extend their lifetime at the cost of lowered performance or vice versa. This can be used to adapt failure behavior according to a maintenance plan, thus increasing availability while using up system capability fully. To facilitate setup, a control algorithm independent of a degradation model is desired. A closed loop control technique for reliability based on a health index, a measure for system degradation, is introduced. It uses self-optimization as means to implement behavior adaptation. This is based on selecting the priorities of objectives that the system pursues. Possible working points are computed beforehand using model-based multiobjective optimization techniques. The controller selects the priorities of objectives and this way balances reliability and performance. As exemplary application, an automatically actuated single plate dry clutch is introduced. The entire reliability control is setup and lifetime experiments are conducted. Results show that the variance of time to failure is reduced greatly, making the failure behavior more predictable. At the same time, the desired usable lifetime can be extended at the cost of system performance to allow for changed maintenance intervals. Together, these possibilities allow for greater system usage and better planning of maintenance.}}, author = {{Meyer, Tobias}}, keywords = {{dependability, reliability, behavior adaptation, self-optimization, multiobjective optimization, optimal control, automotive drivetrain, clutch system, reliability-adaptive system}}, publisher = {{Shaker}}, title = {{{Optimization-based reliability control of mechatronic systems}}}, year = {{2018}}, } @article{64054, abstract = {{In this work, the preparation of porous hybrid particle-based films by core-shell particle design and convenient film preparation is reported. Monodisperse core particles consisting of poly(methyl methacrylate‑co‑allyl methacrylate) (P(MMA‑co‑ALMA)) were synthesized by starved-feed emulsion polymerization followed by the introduction of an initiator-containing monomer (inimer) for subsequent atom transfer radical polymerization (ATRP). The inimer shell allowed for the introduction of allylhydrido polycarbosilane (SMP-10) under ATRP conditions by grafting to the core particles. The functionalization of the prepared core-shell particles was investigated by IR spectroscopy (FTIR), scanning transmission electron microscopy (STEM) and solid-state NMR combined with dynamic nuclear polarization (DNP). The obtained hard core/soft preceramic shell particles were subjected to the melt-shear organization technique, enabling a convenient alignment into a colloidal crystal structure in one single step without the presence of a dispersion medium or solvent for the designed particles. Moreover, the hybrid particle-based films were converted into a porous ceramic structure upon thermal treatment. As a result, freestanding ceramic porous films have been obtained after degradation of the organic template core particles. Noteworthy, the conversion of the matrix material consisting of SMP-10 into the ceramic occurred with preservation of the pristine colloidal crystal template structure. Herein, the first example of core-shell particle preparation by combining different polymerization methodologies and application of the convenient melt-shear organization technique is shown, paving a new way to ceramic materials with tailored morphology and porosity.}}, author = {{Vowinkel, Steffen and Boehm, Anna and Schäfer, Timmy and Gutmann, Torsten and Ionescu, Emanuel and Gallei, Markus}}, journal = {{Materials & Design}}, keywords = {{emulsion polymerization, self-assembly, ATRP, Colloidal crystal, Hybrid film, Particle processing}}, pages = {{926–935}}, title = {{{Preceramic core-shell particles for the preparation of hybrid colloidal crystal films by melt-shear organization and conversion into porous ceramics}}}, doi = {{10.1016/j.matdes.2018.10.032}}, volume = {{160}}, year = {{2018}}, } @article{9862, abstract = {{In order to improve the credibility of modern simulation tools, uncertainties of different kinds have to be considered. This work is focused on epistemic uncertainties in the framework of continuum mechanics, which are taken into account by fuzzy analysis. The underlying min-max optimization problem of the extension principle is approximated by α-discretization, resulting in a separation of minimum and maximum problems. To become more universal, so-called quantities of interest are employed, which allow a general formulation for the target problem of interest. In this way, the relation to parameter identification problems based on least-squares functions is highlighted. The solutions of the related optimization problems with simple constraints are obtained with a gradient-based scheme, which is derived from a sensitvity analysis for the target problem by means of a variational formulation. Two numerical examples for the fuzzy analysis of material parameters are concerned with a necking problem at large strain elastoplasticity and a perforated strip at large strain hyperelasticity to demonstrate the versatility of the proposed variational formulation. }}, author = {{Mahnken, Rolf}}, issn = {{ 2325-3444}}, journal = {{Mathematics and Mechanics of complex systems}}, keywords = {{fuzzy analysis, α-level optimization, quantities of interest, optimization with simple constraints, large strain elasticity, large strain elastoplasticity}}, number = {{3-4}}, title = {{{"A variational formulation for fuzzy analysis in continuum mechanics"}}}, volume = {{5}}, year = {{2017}}, } @article{9976, abstract = {{State-of-the-art mechatronic systems offer inherent intelligence that enables them to autonomously adapt their behavior to current environmental conditions and to their own system state. This autonomous behavior adaptation is made possible by software in combination with complex sensor and actuator systems and by sophisticated information processing, all of which make these systems increasingly complex. This increasing complexity makes the design process a challenging task and brings new complex possibilities for operation and maintenance. However, with the risk of increased system complexity also comes the chance to adapt system behavior based on current reliability, which in turn increases reliability. The development of such an adaption strategy requires appropriate methods to evaluate reliability based on currently selected system behavior. A common approach to implement such adaptivity is to base system behavior on different working points that are obtained using multiobjective optimization. During operation, selection among these allows a changed operating strategy. To allow for multiobjective optimization, an accurate system model including system reliability is required. This model is repeatedly evaluated by the optimization algorithm. At present, modeling of system reliability and synchronization of the models of behavior and reliability is a laborious manual task and thus very error-prone. Since system behavior is crucial for system reliability, an integrated model is introduced that integrates system behavior and system reliability. The proposed approach is used to formulate reliability-related objective functions for a clutch test rig that are used to compute feasible working points using multiobjective optimization.}}, author = {{Kaul, Thorben and Meyer, Tobias and Sextro, Walter}}, journal = {{SAGE Journals}}, keywords = {{Integrated model, reliability, system behavior, Bayesian network, multiobjective optimization}}, pages = {{390 -- 399}}, title = {{{Formulation of reliability-related objective functions for design of intelligent mechatronic systems}}}, doi = {{10.1177/1748006X17709376}}, volume = {{Vol. 231(4)}}, year = {{2017}}, } @inproceedings{9978, abstract = {{Piezoelectric transducers are used in a wide range of applications. Reliability of these transducers is an important aspect in their application. Prognostics, which involve continuous monitoring of the health of technical systems and using this information to estimate the current health state and consequently predict the remaining useful lifetime (RUL), can be used to increase the reliability, safety, and availability of the transducers. This is achieved by utilizing the health state and RUL predictions to adaptively control the usage of the components or to schedule appropriate maintenance without interrupting operation. In this work, a prognostic approach utilizing self-sensing, where electric signals of a piezoelectric transducer are used as the condition monitoring data, is proposed. The approach involves training machine learning algorithms to model the degradation of the transducers through a health index and the use of the learned model to estimate the health index of similar transducers. The current health index is then used to estimate RUL of test components. The feasibility of the approach is demonstrated using piezoelectric bimorphs and the results show that the method is accurate in predicting the health index and RUL.}}, author = {{Kimotho, James Kuria and Sextro, Walter and Hemsel, Tobias}}, booktitle = {{IEEE Transactions on Reliability}}, keywords = {{Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing}}, pages = {{1 -- 10}}, title = {{{Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing}}}, doi = {{10.1109/TR.2017.2710260}}, year = {{2017}}, } @inproceedings{10676, author = {{Ho, Nam and Kaufmann, Paul and Platzner, Marco}}, booktitle = {{2017 International Conference on Field Programmable Technology (ICFPT)}}, keywords = {{Linux, cache storage, microprocessor chips, multiprocessing systems, LEON3-Linux based multicore processor, MiBench suite, block sizes, cache adaptation, evolvable caches, memory-to-cache-index mapping function, processor caches, reconfigurable cache mapping optimization, reconfigurable hardware technology, replacement strategies, standard Linux OS, time a complete hardware implementation, Hardware, Indexes, Linux, Measurement, Multicore processing, Optimization, Training}}, pages = {{215--218}}, title = {{{Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor}}}, doi = {{10.1109/FPT.2017.8280144}}, year = {{2017}}, } @inproceedings{10780, author = {{Guettatfi, Zakarya and Hübner, Philipp and Platzner, Marco and Rinner, Bernhard}}, booktitle = {{12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)}}, keywords = {{embedded systems, image sensors, power aware computing, wireless sensor networks, Zynq-based VSN node prototype, computational self-awareness, design approach, platform levels, power consumption, visual sensor networks, visual sensor nodes, Cameras, Hardware, Middleware, Multicore processing, Operating systems, Runtime, Reconfigurable platforms, distributed embedded systems, performance-resource trade-off, self-awareness, visual sensor nodes}}, pages = {{1--8}}, title = {{{Computational self-awareness as design approach for visual sensor nodes}}}, doi = {{10.1109/ReCoSoC.2017.8016147}}, year = {{2017}}, } @inproceedings{48863, abstract = {{The novel R package ecr (version 2), short for Evolutionary Computation in R, provides a comprehensive collection of building blocks for constructing powerful evolutionary algorithms for single- and multi-objective continuous and combinatorial optimization problems. It allows to solve standard optimization tasks with few lines of code using a black-box approach. Moreover, rapid prototyping of non-standard ideas is possible via an explicit, white-box approach. This paper describes the design principles of the package and gives some introductory examples on how to use the package in practise.}}, author = {{Bossek, Jakob}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, isbn = {{978-1-4503-4939-0}}, keywords = {{evolutionary optimization, software-tools}}, pages = {{1187–1193}}, publisher = {{Association for Computing Machinery}}, title = {{{Ecr 2.0: A Modular Framework for Evolutionary Computation in R}}}, doi = {{10.1145/3067695.3082470}}, year = {{2017}}, } @inproceedings{48857, abstract = {{While finding minimum-cost spanning trees (MST) in undirected graphs is solvable in polynomial time, the multi-criteria minimum spanning tree problem (mcMST) is NP-hard. Interestingly, the mcMST problem has not been in focus of evolutionary computation research for a long period of time, although, its relevance for real world problems is easy to see. The available and most notable approaches by Zhou and Gen as well as by Knowles and Corne concentrate on solution encoding and on fairly dated selection mechanisms. In this work, we revisit the mcMST and focus on the mutation operators as exploratory components of evolutionary algorithms neglected so far. We investigate optimal solution characteristics to discuss current mutation strategies, identify shortcomings of these operators, and propose a sub-tree based operator which offers what we term Pareto-beneficial behavior: ensuring convergence and diversity at the same time. The operator is empirically evaluated inside modern standard evolutionary meta-heuristics for multi-criteria optimization and compared to hitherto applied mutation operators in the context of mcMST.}}, author = {{Bossek, Jakob and Grimme, Christian}}, booktitle = {{2017 IEEE Symposium Series on Computational Intelligence (SSCI)}}, keywords = {{Convergence, Encoding, Euclidean distance, Evolutionary computation, Heating systems, Optimization, Standards}}, pages = {{1–8}}, title = {{{A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem}}}, doi = {{10.1109/SSCI.2017.8285183}}, year = {{2017}}, }