Optimization methodologies are particularly relevant nowadays due to the ever-increasing power of computers and the enhancement of mathematical models to better capture reality. These computational methods are used in many different fields and some of them, such as metaheuristics, have often been found helpful and efficient for the resolution of practical applications where finding optimal solutions is not straightforward. Many practical applications are multi-objective optimization problems: there is more than one objective to optimize and the solutions found represent trade-offs between the competing objectives. In the last couple of decades, several metaheuristics approaches have been developed and applied to practical problems and multi-objective versions of the main single-objective approaches were created. The Alliance Algorithm (AA) is a recently developed single-objective optimization algorithm based on the metaphorical idea that several tribes, with certain skills and resource needs, try to conquer an environment for their survival and try to ally together to improve the likelihood of conquest. The AA method has yielded reasonable results in several fields to which it has been applied, thus the development in this thesis of a multi-objective variant to handle a wider range of problems is a natural extension. The first challenge in the development of the Multi-objective Alliance Algorithm (MOAA) was acquiring an understanding of the modifications needed for this generalization. The initial version was followed by other versions with the aim of improving MOAA performance to enable its use in solving real-world problems: the most relevant variations, which led to the final version of the approach, have been presented. The second major contribution in this research was the development and combination of features or the appropriate modification of methodologies from the literature to fit within the MOAA and enhance its potential and performance. An analysis of the features in the final version of the algorithm was performed to better understand and verify their behavior and relevance within the algorithm. The third contribution was the testing of the algorithm on a test-bed of problems. The results were compared with those obtained using well-known baseline algorithms. Moreover, the last version of the MOAA was also applied to a number of real-world problems and the results, compared against those given by baseline approaches, are discussed. Overall, the results have shown that the MOAA is a competitive approach which can be used `out-of-the-box' on problems with different mathematical characteristics and in a wide range of applications. Finally, a summary of the objectives achieved, the current status of the research and the work that can be done in future to further improve the performance of the algorithm is provided.

In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights according to the Tchebycheff distance function. Some seed solutions at initial population and a crowding measure also help to achieve satisfactory results. In order to test the performance of our evolutionary algorithm, we use some continuous and combinatorial problems. The continuous test problems taken from the literature have special difficulties that an evolutionary algorithm has to deal with. Experimental results of our algorithm on these problems are provided. One of the combinatorial problems we address is the multi-objective knapsack problem. We carry out experiments on test data for this problem given in the literature. We work on two bi-criteria p-hub location problems and propose an evolutionary algorithm to approximate the Pareto frontiers of these problems. We test the performance of our algorithm on Turkish Postal System (PTT) data set (TPDS), AP (Australian Post) and CAB (US Civil Aeronautics Board) data sets. The main contribution of this thesis is in the field of developing a multi-objective evolutionary algorithm and applying it to a number of multi-objective continuous and combinatorial optimization problems.

Conceptual design optimization (CDO) is a technique proposed for the structured evaluation of different design concepts. Design grammars provide a flexible modular modelling architecture. The model is generated by a compiler based on predefined components and rules. The rules describe the composition of the model; thus, different models can be optimized by the CDO in one run. This allows considering a mission design including the mission analysis and the system design. The combination of a CDO approach with a model based on design grammars is shown for the concept study of a near-Earth asteroid mission. The mission objective is to investigate two asteroids of different kinds. The CDO reveals that a mission concept using two identical spacecrafts flying to one target each is better than a mission concept with one spacecraft flying to two asteroids consecutively.

Submitted by Aelson Maciera (aelsoncm@terra.com.br) on 2017-06-08T18:50:10Z No. of bitstreams: 1 DissGDAA.pdf: 2724824 bytes, checksum: 6fd66731c51c75a18c506fe7ab991ec4 (MD5) / Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-06-13T19:33:47Z (GMT) No. of bitstreams: 1 DissGDAA.pdf: 2724824 bytes, checksum: 6fd66731c51c75a18c506fe7ab991ec4 (MD5) / Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-06-13T19:33:53Z (GMT) No. of bitstreams: 1 DissGDAA.pdf: 2724824 bytes, checksum: 6fd66731c51c75a18c506fe7ab991ec4 (MD5) / Made available in DSpace on 2017-06-13T19:37:52Z (GMT). No. of bitstreams: 1 DissGDAA.pdf: 2724824 bytes, checksum: 6fd66731c51c75a18c506fe7ab991ec4 (MD5) Previous issue date: 2016-08-19 / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / The companies today are looking for ways to expand their competitive advantages, optimizing their production, and in this context, they found solutions in activities of production scheduling. The production scheduling of the type job-shop, results in one of the most complex problems of combination, the Job-shop Scheduling Problem (JSP), which deterministic resolution is not feasible in polynomial computational time. The Flexible Job-shop Scheduling Problem (FJSP) is a classic extension of the JSP and has been widely reported in the literature. Thus, optimization algorithms have been developed and evaluated in the last decades, in order to provide more efficient production planning, with emphasis to artificial intelligence algorithms of the swarm type, that the latest research presented favorable results. The FJSP allows an operation to be processed for any machine arising from a set of machines along different routes. This problem is commonly dismembered into two sub-problems, the assignment of machines for operations, which is called routing, and operation scheduling. In the FJSP context, this research presents the resolution of the FJSP multi-objective, using a hierarchical approach that divides the problem into two subproblems, being the Particle Swarm Optimization (PSO), responsible for resolving the routing sub-problem, and tasking three local search algorithms, Random Restart Hill Climbing (RRHC), Simulated Annealing (SA) and Tabu Search (TS), for the resolution of scheduling sub-problem. The implementation of the proposed algorithm has new strategies in the population initialization, displacement of particles, stochastic allocation of operations, and management of scenarios partially flexible. Experimental results using technical benchmarks problems are conducted, and proved the effectiveness of the hybridization, and the advantage of RRHC algorithm compared to others in the resolution of the scheduling subproblem. / As empresas atualmente buscam meios de ampliarem suas vantagens competitivas, otimizando sua produção, e neste contexto, encontraram soluções nas atividades de programação da produção. A programação da produção do tipo job-shop, resulta em um dos problemas mais complexos de combinação, o Job-shop Scheduling Problem (JSP), cuja resolução determinística é inviável em tempo computacional polinomial. O Flexible Job-shop Scheduling Problem (FJSP) é uma extensão do clássico JSP e tem sido amplamente relatado na literatura. Desta forma, algoritmos de otimização têm sido desenvolvidos e avaliados nas últimas décadas, com o intuito de fornecer planejamentos de produção mais eficientes, com destaque para os algoritmos de inteligência artificial do tipo enxame, que nas pesquisas mais recentes obtiveram resultados satisfatórios. O FJSP permite que uma operação seja processada por qualquer recurso produtivo advindo de um conjunto de recursos ao longo de diferentes roteiros. Este problema é comumente desmembrado em dois subproblemas, a atribuição de recursos para as operações, que é chamado de roteamento, e programação das operações. No contexto do FJSP, a proposta dessa pesquisa apresenta a resolução do FJSP em caráter multiobjetivo, utilizando a abordagem hierárquica, que divide o problema em dois subproblemas, sendo o Enxame de Partículas (PSO), responsável pela resolução do subproblema de roteamento e incumbindo três algoritmos de busca local, Reinício Aleatório de Subida de Colina (RRHC), Arrefecimento Simulado (SA) e Busca Tabu (TS), para a resolução do subproblema de programação. A implementação do algoritmo proposto, dispõe de novas estratégias na inicialização da população, deslocamento das partículas, alocação estocástica das operações e tratamento de cenários parcialmente flexíveis. Resultados experimentais obtidos em base de testes comumente usada, comprovam a eficácia da hibridização proposta, e a vantagem do algoritmo RRHC em relação aos outros na resolução do subproblema de programação.

Submitted by SBI Biblioteca Digital (sbi.bibliotecadigital@puc-campinas.edu.br) on 2017-08-10T11:55:42Z No. of bitstreams: 1 FABIANA DA SILVA PODELESKI.pdf: 1801192 bytes, checksum: 27ac2ce1c17ed0cdfce39e602146bdc7 (MD5) / Made available in DSpace on 2017-08-10T11:55:42Z (GMT). No. of bitstreams: 1 FABIANA DA SILVA PODELESKI.pdf: 1801192 bytes, checksum: 27ac2ce1c17ed0cdfce39e602146bdc7 (MD5) Previous issue date: 2017-06-29 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior - CAPES / This document proposes a new approach for the restoration of electric power distribution systems by optimal current flow model (OCF). The importance of working with proposals for restoration using OCF is to allow analyzing the problem of restoration by a multiobjective mathematical programming model with linear or quadratic objective function and constraints that represent the network structure of the distribution system. Two objectives are evaluated for the restoration, losses reduction and recomposition time, resulting in a multiobjective programming problem. The proposed restoration action consists of opening and closing of branches in order to transfer loads to areas that are affected by interrupting the power supply. The proposition is directed to the primary distribution networks, characterized by presenting a radial topology and being in a restorative state, when there is a permanent fault. It is also suitable for systems with distributed generation (DG) when the power flow in the branches is no longer unidirectional. The resolution of the problem starts from the prior knowledge of the distribution system (topology and operational levels), the affected region and the possible recomposition resources for restoring the network through OCF model. The objective function of losses can be represented by a linear or a quadratic function. The linear representation results in a problem with linear equations and inequalities, that is, in a linear programming problem. The use of a quadratic objective function (minimization of losses) implies a more complex model for execution, since it results in a set of linear and non-linear equations and inequalities, when it is a multiobjective problem. The quadratic model may become unsuitable for applications in smart grid technologies due to longer algorithm execution time. The results attested the importance of applying a multiobjective proposal, because when individually evaluated the criteria of loss minimization and shorter recomposition time, different recomposition options were obtained. / O presente documento prop?e um novo enfoque para a recomposi??o de sistemas de distribui??o de energia el?trica resolvido por modelo de Fluxo de Corrente ?timo (FCO). A import?ncia de se trabalhar com propostas para recomposi??o utilizando FCO ? possibilitar a an?lise do problema de recomposi??o por um modelo de programa??o matem?tica multiobjetivo, com fun??o objetivo linear ou quadr?tica e restri??es que representem a estrutura da rede do sistema de distribui??o. S?o avaliados dois objetivos para a recomposi??o, minimiza??o de perdas e menor tempo de recomposi??o, resultando em um problema de programa??o multiobjetivo. A a??o de recomposi??o proposta compreende manobras para transfer?ncia de carga ?s ?reas que se encontram ilhadas devido ? interrup??o de fornecimento de energia. A proposi??o est? dirigida ?s redes prim?rias de distribui??o, caracterizadas por apresentarem topologia radial e se encontrarem em um estado restaurativo, quando h? presen?a de uma falha permanente. Tamb?m ? adequada a sistemas com gera??o distribu?da (GD) quando os fluxos nos ramos deixam de ser unidirecionais. A resolu??o do problema parte do conhecimento pr?vio do sistema de distribui??o (topologia e n?veis operacionais), da regi?o afetada e dos poss?veis recursos restauradores para restaura??o da rede por meio de FCO. A fun??o objetivo pode ser representada por uma fun??o linear ou quadr?tica para as perdas. A representa??o linear resulta em um problema com equa??es e inequa??es lineares, ou seja, em um problema de programa??o linear. A utiliza??o de uma fun??o objetivo quadr?tica (minimiza??o de perdas) implica em um modelo mais complexo para execu??o, uma vez que re?ne um conjunto de equa??es e inequa??es lineares e n?o lineares, quando se tratar de um problema multiobjetivo. O modelo quadr?tico pode se tornar impr?prio para aplica??es em tecnologias de redes inteligentes devido ao maior tempo de execu??o de algoritmo. Os resultados atestaram a import?ncia de aplica??o de uma proposta multiobjetivo, pois quando avaliados individualmente os crit?rios de minimiza??o de perdas e de menor tempo de recomposi??o, foram obtidas diferentes op??es de recomposi??o.

Tato dizertační práce se zabývá vývojem optimalizačního nástroje, který je založen na metodě Particle swarm optimization a je poté aplikován na dva typy oběžných kol radiálních čerpadel.

Wasserwirtschaftliche Speichersysteme sind unverzichtbar, um weltweit die Trinkwasserversorgung, Nahrungsmittelproduktion und Energieversorgung sicherzustellen. Die multikriterielle simulationsbasierte Optimierung (MK-SBO) ist eine leistungsfähige Methodik, um für Mehrzweck-Talsperrenverbundsysteme (MZ-TVS) eine Pareto-optimale Menge an Kompromisslösungen zwischen konträren Zielen bereitzustellen. Der rechentechnische Aufwand steigt jedoch linear mit der Länge des Simulationszeitraums der Talsperrenbewirtschaftung an. Folglich begrenzen sich MK-SBO-Studien bisher auf Simulationszeiträume von wenigen Jahrzehnten. Diese Zeiträume sind i.d.R. unzureichend, um Unsicherheiten, die aus der stochastischen Natur der Zuflüsse resultieren, adäquat zu beschreiben. Bewirtschaftungsoptimierungen von MZ-TVS hinsichtlich ihrer Zuverlässigkeit, z.B. durch die Maximierung von Versorgungssicherheiten, können sich als wenig belastbar und ermittelte Steuerungsstrategien als wenig robust erweisen. Um diesen Herausforderungen zu begegnen, wird ein neues modulares Framework zur multikriteriellen simulationsbasierten Bewirtschaftungsoptimierung von MZ-TVS (Frams-BoT) entwickelt. Eine Informationserweiterung zu stochastischen Zuflussprozessen erfolgt über ein weiterentwickeltes Zeitreihenmodell mittels generierter Zeitreihen von mehreren Tausend Jahren Länge. Eine neue Methode zur Monte-Carlo-Rekombination von Zeitreihen ermöglicht dann die Nutzung dieser Informationen in der MK-SBO in wesentlich kürzeren Simulationszeiträumen. Weitere Rechenzeit wird durch Parallelisierung und eine fortgeschrittene Kodierung von Entscheidungsvariablen eingespart. Die Simulation von Zuflussdargeboten für multikriterielle Klimafolgenanalysen erfolgt durch ein prozessorientiertes Wasserhaushaltsmodell. Level-Diagramme (Blasco et al., 2008) unterstützten den komplexen Prozess der Entscheidungsfindung. Die Wirksamkeit und Flexibilität des Frameworks wurden in zwei Fallstudien gezeigt. In einer ersten Fallstudie konnten in einer Klimafolgenanalyse Versorgungssicherheiten von über 99% als ein Ziel eines multikriteriellen Optimierungsproblems maximiert werden, um die Verlässlichkeit der Bewirtschaftung eines MZ-TVS in Sachsen (Deutschland) zu steigern. Eine zweite Fallstudie befasste sich mit der Maximierung der Leistungsfähigkeit eines MZ-TVS in Äthiopien unter verschiedenen Problemformulierungen. In beiden Fallstudien erwiesen sich die erzielten Pareto-Fronten und Steuerungsstrategien gegenüber 10 000-jährigen Zeiträumen als robust. Die benötigten Rechenzeiten der MK-SBO ließen sich durch das Framework massiv senken. / Water resources systems are worldwide essential for a secure supply of potable water, food and energy production. Simulation-based multi-objective optimization (SB-MOO) is a powerful method to provide a set of Pareto-optimal compromise solutions between various contrary goals of multi-purpose multi-reservoir systems (MP-MRS). However, the computational costs increases with the length of the time period in which the reservoir management is simulated. Consequently, MK-SBO studies are currently restricted to simulation periods of several decades. These time periods are normally insufficient to describe the stochastic nature of the inflows and the consequent hydrological uncertainties. Therefore, an optimization of the reliability of management of MP-MRS, e.g. through the maximization of the security of supply, may not be resilient. Obtained management strategies may not prove robust. To address these challenges, a new modular framework for simulation-based multiobjective optimization of the reservoir management of multi-purpose multi-reservoir systems (Frams-BoT) is developed. A refined time series model provides time series of several thousand years to extend the available information about the stochastic inflow processes. Then, a new Monte-Carlo recombination method allows for the exploitation of the extended information in the SB-MOO on significantly shorter time periods. Further computational time is saved by parallelization and an advanced coding of decision variables. A processoriented water balance model is used to simulate inflows for multi-objective climate impact analysis. Level-Diagrams [Blasco et al., 2008] are used to support the complex process of decision-making. The effectiveness and flexibility of the framework is presented in two case studies. In the first case study about a MP-MRS in Germany, high securities of supply over 99% where maximized as part of a multi-objective optimization problem in order to improve the reliability of the reservoir management. A second case study addressed the maximization of the performance of a MP-MRS in Ethiopia under different formulations of the optimization problem. In both case studies, the obtained Pareto-Fronts and management strategies proved robust compared to 10 000 year time periods. The required computational times of the SB-MOO could be reduced considerably.

No description available.

In the building automation domain, there are gaps among various tasks related to design engineering. As a result created system designs must be adapted to the given requirements on system functionality, which is related to increased costs and engineering effort than planned. For this reason standards are prepared to enable a coordination among these tasks by providing guidelines and unified artifacts for the design. Moreover, a huge variety of prefabricated devices offered from different manufacturers on the market for building automation that realize building automation functions by preprogrammed software components. Current methods for design creation do not consider this variety and design solution is limited to product lines of a few manufacturers and expertise of system integrators. Correspondingly, this results in design solutions of a limited quality. Thus, a great optimization potential of the quality of design solutions and coordination of tasks related to design engineering arises. For given design requirements, the existence of a high number of devices that realize required functions leads to a combinatorial explosion of design alternatives at different price and quality levels. Finding optimal design alternatives is a hard problem to which a new solution method is proposed based on heuristical approaches. By integrating problem specific knowledge into algorithms based on heuristics, a promisingly high optimization performance is achieved. Further, optimization algorithms are conceived to consider a set of flexibly defined quality criteria specified by users and achieve system design solutions of high quality. In order to realize this idea, optimization algorithms are proposed in this thesis based on goal-oriented operations that achieve a balanced convergence and exploration behavior for a search in the design space applied in different strategies. Further, a component model is proposed that enables a seamless integration of design engineering tasks according to the related standards and application of optimization algorithms.:1 Introduction 17 1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 1.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 1.3 Goals and Use of the Thesis . . . . . . . . . . . . . . . . . . . . . 21 1.4 Solution Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . 22 1.5 Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . 24 2 Design Creation for Building Automation Systems 25 2.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 2.2 Engineering of Building Automation Systems . . . . . . . . . . . 29 2.3 Network Protocols of Building Automation Systems . . . . . . . 33 2.4 Existing Solutions for Design Creation . . . . . . . . . . . . . . . 34 2.5 The Device Interoperability Problem . . . . . . . . . . . . . . . . 37 2.6 Guidelines for Planning of Room Automation Systems . . . . . . 38 2.7 Quality Requirements on BAS . . . . . . . . . . . . . . . . . . . 41 2.8 Quality Requirements on Design . . . . . . . . . . . . . . . . . . 42 2.8.1 Quality Requirements Related to Project Planning . . . . 42 2.8.2 Quality Requirements Related to Project Implementation 43 2.9 Quality Requirements on Methods . . . . . . . . . . . . . . . . . 44 2.10 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 3 The Design Creation Task 47 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 3.2 System Design Composition Model . . . . . . . . . . . . . . . . . 49 3.2.1 Abstract and Detailed Design Model . . . . . . . . . . . . 49 3.2.2 Mapping Model . . . . . . . . . . . . . . . . . . . . . . . . 51 3.3 Formulation of the Problem . . . . . . . . . . . . . . . . . . . . . 53 3.3.1 Problem properties . . . . . . . . . . . . . . . . . . . . . . 54 3.3.2 Requirements on Algorithms . . . . . . . . . . . . . . . . 56 3.4 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 4 Solution Methods for Design Generation and Optimization 59 4.1 Combinatorial Optimization . . . . . . . . . . . . . . . . . . . . . 59 4.2 Metaheuristics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 4.3 Examples for Metaheuristics . . . . . . . . . . . . . . . . . . . . . 62 4.3.1 Simulated Annealing . . . . . . . . . . . . . . . . . . . . . 62 4.3.2 Tabu Search . . . . . . . . . . . . . . . . . . . . . . . . . 63 4.3.3 Ant Colony Optimization . . . . . . . . . . . . . . . . . . 65 4.3.4 Evolutionary Computation . . . . . . . . . . . . . . . . . 66 4.4 Choice of the Solver Algorithm . . . . . . . . . . . . . . . . . . . 69 4.5 Specialized Methods for Diversity Preservation . . . . . . . . . . 70 4.6 Approaches for Real World Problems . . . . . . . . . . . . . . . . 71 4.6.1 Component-Based Mapping Problems . . . . . . . . . . . 71 4.6.2 Network Design Problems . . . . . . . . . . . . . . . . . . 73 4.6.3 Comparison of Solution Methods . . . . . . . . . . . . . . 74 4.7 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77 5 Automated Creation of Optimized Designs 79 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 5.2 Design Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 79 5.3 Component Model . . . . . . . . . . . . . . . . . . . . . . . . . . 81 5.3.1 Presumptions . . . . . . . . . . . . . . . . . . . . . . . . . 85 5.3.2 Integration of Component Model . . . . . . . . . . . . . . 87 5.4 Design Generation . . . . . . . . . . . . . . . . . . . . . . . . . . 87 5.4.1 Component Search . . . . . . . . . . . . . . . . . . . . . . 88 5.4.2 Generation Approaches . . . . . . . . . . . . . . . . . . . 100 5.5 Design Improvement . . . . . . . . . . . . . . . . . . . . . . . . . 107 5.5.1 Problems and Requirements . . . . . . . . . . . . . . . . . 107 5.5.2 Variations . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 5.5.3 Application Strategies . . . . . . . . . . . . . . . . . . . . 121 5.6 Realization of the Approach . . . . . . . . . . . . . . . . . . . . . 122 5.6.1 Objective Functions . . . . . . . . . . . . . . . . . . . . . 122 5.6.2 Individual Representation . . . . . . . . . . . . . . . . . . 123 5.7 Automated Design Creation For A Building . . . . . . . . . . . . 124 5.7.1 Room Spanning Control . . . . . . . . . . . . . . . . . . . 124 5.7.2 Flexible Rooms . . . . . . . . . . . . . . . . . . . . . . . . 125 5.7.3 Technology Spanning Designs . . . . . . . . . . . . . . . . 129 5.7.4 Preferences for Mapping of Function Blocks to Devices . . 132 5.8 Further Uses and Applicability of the Approach . . . . . . . . . . 133 5.9 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 6 Validation and Performance Analysis 137 6.1 Validation Method . . . . . . . . . . . . . . . . . . . . . . . . . . 137 6.2 Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . . . 137 6.3 Example Abstract Designs and Performance Tests . . . . . . . . 139 6.3.1 Criteria for Choosing Example Abstract Designs . . . . . 139 6.3.2 Example Abstract Designs . . . . . . . . . . . . . . . . . . 140 6.3.3 Performance Tests . . . . . . . . . . . . . . . . . . . . . . 142 6.3.4 Population Size P - Analysis . . . . . . . . . . . . . . . . 151 6.3.5 Cross-Over Probability pC - Analysis . . . . . . . . . . . 157 6.3.6 Mutation Probability pM - Analysis . . . . . . . . . . . . 162 6.3.7 Discussion for Optimization Results and Example Designs 168 6.3.8 Resource Consumption . . . . . . . . . . . . . . . . . . . . 171 6.3.9 Parallelism . . . . . . . . . . . . . . . . . . . . . . . . . . 172 6.4 Optimization Framework . . . . . . . . . . . . . . . . . . . . . . . 172 6.5 Framework Design . . . . . . . . . . . . . . . . . . . . . . . . . . 174 6.5.1 Components and Interfaces . . . . . . . . . . . . . . . . . 174 6.5.2 Workflow Model . . . . . . . . . . . . . . . . . . . . . . . 177 6.5.3 Optimization Control By Graphical User Interface . . . . 180 6.6 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183 7 Conclusions 185 A Appendix of Designs 189 Bibliography 201 Index 211