caa a22 4500 445842458 CHVBK 20180317145348.0 cr unu---uuuuu 170323e20110301xx s 000 0 eng 10.1007/s11047-010-9209-x doi (NATIONALLICENCE)springer-10.1007/s11047-010-9209-x Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions [Elektronische Daten] [Fabio Vieira, Valmir Barbosa] The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whose study may give insight into the natural processes through which elementary objects self-assemble into more complex ones. One of the main problems of algorithmic self-assembly is the minimum tile set problem, which in the extended formulation we consider, here referred to as MTSP, asks for a collection of types of elementary objects (called tiles) to be found for the self-assembly of an object having a pre-established shape. Such a collection is to be as concise as possible, thus minimizing supply diversity, while satisfying a set of stringent constraints having to do with important properties of the self-assembly process from its tile types. We present a study of what, to the best of our knowledge, is the first practical approach to MTSP. Our study starts with the introduction of an evolutionary heuristic to tackle MTSP and includes selected results from extensive experimentation with the heuristic on the self-assembly of simple objects in two and three dimensions, including the possibility of tile rotation. The heuristic we introduce combines classic elements from the field of evolutionary computation with a problem-specific variant of Pareto dominance into a multi-objective approach to MTSP. Springer Science+Business Media B.V., 2010 Algorithmic self-assembly nationallicence Minimum tile set problem nationallicence Multi-objective evolutionary algorithms nationallicence MTSP : Minimum tile set problem in the Unique Shape Model nationallicence 2D : Two-dimensional nationallicence 2DR : Two-dimensional with rotation nationallicence 3DR : Three-dimensional with rotation nationallicence Vieira Fabio Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972, Rio de Janeiro, RJ, Brazil aut Barbosa Valmir Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972, Rio de Janeiro, RJ, Brazil aut Natural Computing Springer Netherlands 10/1(2011-03-01), 551-581 1567-7818 10:1<551 2011 10 11047 https://doi.org/10.1007/s11047-010-9209-x text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11047-010-9209-x text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Vieira Fabio Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972, Rio de Janeiro, RJ, Brazil aut NATIONALLICENCE 700 1- Barbosa Valmir Programa de Engenharia de Sistemas e Computação, COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972, Rio de Janeiro, RJ, Brazil aut NATIONALLICENCE 773 0- Natural Computing Springer Netherlands 10/1(2011-03-01), 551-581 1567-7818 10:1<551 2011 10 11047 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer