Spelling suggestions: "subject:" enetic algorithm"" "subject:" benetic algorithm""
221 |
Efficient structure optimization methods for large systems and their applications to problems of heterogeneous catalysisNiedziela, Andrzej 28 April 2016 (has links)
Die vorliegende Arbeit behandelt die Entwicklung des genetischen Starrkörper-Algorithmus (rigid body genetic algorithm, RGBA), und seine Anwendung zur Untersuchung der Kohlenwasserstoff-Adsorption auf der MgO (001) Oberfläche. Die RBGA Methode ist ein modifizierter hybrid-genetischer Algorithmus mit Starrkörper-Optimierung im lokalen Optimierungsschritt. Diese Modifikation führt zu einer großen Vereinfachung des Optimierungsproblems und ermöglicht damit, eine große Anzahl von möglichen Konfigurationen zu analysieren. Die zentrale Annahme der Methode ist, dass die einzelnen Teile des Systems (starrer Körper) während der gesamten globalen Optimierung nicht ihre interne Konfiguration ändern. Daher ist diese Methode ein geeignetes Werkzeug, um Phänomene wie Adsorption zu studieren, in dem alle Teilsysteme - Oberfläche und einzelne Moleküle - ihre interne Struktur bewahren. Der Algorithmus ermöglicht das Auffinden der globalen Minima für die Starrkörper, die dann im nächsten Schritt vollständig optimiert („relaxiert“) werden, um Verformungen aufgrund der Entspannung der Oberfläche und des Adsorbats auszumachen. / The present work was concentrated on developing the Rigid Body Genetic Algorithm (RBGA), and applying it to investigate the hydrocarbon adsorption on the MgO(001) surface. The RBGA method is a modified hybrid genetic algorithm with rigid body optimization at the local optimization step. The modification allows for a vast simplification of the optimization problem, and, in turn, to search a large number of possible configuration. The key assumption of the method is that individual parts of the system (rigid bodies) do not change their internal configuration throughout the global optimization. Therefore, this method is a perfect tool to study phenomena like adsorption, where all the subsystems – surface and individual molecules – preserve their internal structure. The algorithm allows to obtain global minima, which then can be fully optimized and to account for deformations due to the relaxation of the surface and adsorbate molecules.
|
222 |
Optimization of Pile Groups : A practical study using Genetic Algorithm and Direct Search with four different objective functionsBengtlars, Ann, Väljamets, Erik January 2014 (has links)
Piling is expensive but often necessary when building large structures, for example bridges. Some pile types, such as steel core piles, are very costly and it is therefore of great interest to keep the number piles in a pile group to a minimum. This thesis deals with optimization of pile groups with respect to placement, batter and angle of rotation in order to minimize the number of piles. A program has been developed, where two optimization algorithms named Genetic Algorithm and Direct Search, and four objective functions have been used. These have been tested and compared to find the most suitable for pile group optimization. Three real cases, two bridge supports and one culvert, have been studied, using the program. It has been difficult to draw any clear conclusions since the results have been ambiguous. This is probably because only three cases have been tested and the results are very problemdependent.The outcome depends, for example, on the starting guess and settings for the optimization. However, the results show that the Genetic Algorithm is somewhat more robust in its ability to remove piles than Direct Search and is therefore to prefer in pile group optimization.
|
223 |
[pt] OTIMIZAÇÃO DE RECURSOS PARA PROCEDIMENTOS CIRÚRGICOS ELETIVOS UTILIZANDO ALGORITMOS GENÉTICOS COM INSPIRAÇÃO QUÂNTICA / [en] RESOURCE OPTIMIZATION FOR ELECTIVE SURGICAL PROCEDURES USING QUANTUM-INSPIRED GENETIC ALGORITHMSRENE GONZALEZ HERNANDEZ 29 March 2019 (has links)
[pt] Atualmente as Unidades de Saúde, em um grande número de países do mundo, apresentam demandas de serviços que superam suas capacidades reais. Por esta razão, o surgimento das listas de espera é inevitável. Preparar o planejamento das mesmas, de modo otimizado resulta, portanto, em um grande desafio, devido à quantidade de recursos que devem ser considerados. O caso particular dos procedimentos cirúrgicos é particularmente crítico pela quantidade de recursos que se precisam para a realização do mesmo. Poucos projetos têm sido desenvolvidos para a gestão completa dessas listas. O trabalho desenvolvido nesta Dissertação propõe o uso de um modelo, baseado em algoritmos genéticos com inspiração quântica, para a automatização e otimização do planejamento de procedimentos cirúrgicos eletivos. Este modelo, denominado Algoritmo Evolucionário com Inspiração Quântica para a Área de Saúde (AEIQ-AS), além de alocar os pacientes e os recursos necessários para que o processo cirúrgico seja exitoso, procura reduzir o tempo total para que todas as cirurgias sejam realizadas. Este trabalho apresenta também uma ferramenta que permite a modelagem, de modo simplificado, de uma Unidade Cirúrgica de Saúde. Esta ferramenta possibilita a realização de simulações com o objetivo de ver o efeito de diferentes configurações dos recursos nas Unidades de Saúde. Para a validação do modelo proposto foi criada, de modo artificial e fazendo uso da ferramenta de simulação, uma lista de espera de 2000 cirurgias. Caso as cirurgias fossem realizadas seguindo a ordem de chegada, seriam necessárias pouco mais de 37 semanas e teria 1066 operações fora do prazo. Foram feitos vários experimentos onde se buscava a otimização destes valores. Esta busca foi feita, primeiramente, tomando em consideração só um dos parâmetros e a continuação eles em conjunto. Na primeira abordagem o AEIQ-AS consegue a realização das mesmas cirurgias em aproximadamente 31 semanas. Assim, observa se que há uma redução de aproximadamente 16,25 porcento do tempo. O número de operações fora do prazo, por sua vez, foi reduzido pelo modelo para 927 (13,04 porcento). Na abordagem simultânea, o AEIQ-AS, consegue uma diminuição do tempo total de alocação em 16,22 porcento e o número de operações fora do prazo em 9,76 porcento. Foram feitas, também, várias simulações da Unidade de Saúde mantendo as caraterísticas da lista de cirurgias para ver seu efeito no tempo total de alocação de todos os processos cirúrgicos. / [en] Currently, Health Units in a large number of countries in the world present service demand that exceed their real capacities. For this reason, is inevitable the emergence of the waiting lists. To prepare the planning of this in an optimized manner results in a substantial challenge due to the number of resources that should be considered. The case of chirurgical procedures is particularly critical by the number of resources needed for their realization. A small quantity of projects has been developed to fully manage these lists. The work developed in this Dissertation proposes the use of a model based on evolutionary algorithms with quantum inspiration for the automation and optimization of the planning of elective chirurgical procedures. This model, denominated Evolutionary Algorithm with Quantum Inspiration for the Health Field (AEIQ-AS), beyond patients and necessary resources for the successful completion of the chirurgical procedure allocation, pursue the reduction of the total time of realization of all the surgeries.
The work presents also a tool that allows the modeling, in a simplified manner, of a Chirurgical Health Unit. This tool enables the realization of simulations with the objective of seeing the effect of different configurations of the resources in the Health Units. To validate the proposed model was created, in artificial mode and employing the simulation tool, a waiting list of 2000 surgeries. In case that the
surgeries were realized following the arrival order, will be needed a little more than 37 weeks and will have 1066 surgeries out of time. Several experiments were conducted in order to optimize these values. This search was executed, firstly, considering only one of the parameters and, in continuation, all together. In the first approach, the AEIQ-AS obtains the realization of the same surgeries in approximately 16,25 percent of the time. The number of operations out of time was reduced by the model to 927 (13,04 percent). In the simultaneous approach, the AEIQAS achieves a decrease of the allocation total time in 16,22 percent and the number of operations out of time in 9,76 percent. It were done, also, several simulations of the Health Unit maintaining the characteristics of the surgeries list in order to look the effect in the allocation total time of all the chirurgical procedures.
|
224 |
Game theoretic optimization for product line evolutionSong, Ruoyu 07 January 2016 (has links)
Product line planning aims at optimal planning of product variety. In addition, the traditional product line planning problem develops new product lines based on product attributes without considering existing product lines. However, in reality, almost all new product lines evolve from existing product lines, which leads to the product line evolution problem. Product line evolution involves trade-offs between the marketing perspective and engineering perspective. The marketing concern focuses on maximizing utility for customers; the engineering concern focuses on minimizing engineering cost. Utility represents satisfaction experienced by the customers of a product. Engineering cost is the total cost involved in the process of the development of a product line. These two goals are in conflict since the high utility requires high-end product attributes which could increase the engineering cost and vice versa. Rather than aggregating both problems as one single level optimization problem, the marketing and engineering concerns entail a non-collaborative game per se. This research investigates a game-theoretic approach to the product line evolution problem. A leader-follower joint optimization model is developed to leverage conflicting goals of marketing and engineering concerns within a coherent framework of game theoretic optimization. To solve the joint optimization model efficiently, a bi-level nested genetic algorithm is developed. A case study of smart watch product line evolution is reported to illustrate the feasibility and potential of the proposed approach.
|
225 |
Investigation of voltage- and light-sensitive ion channelsFromme, Ulrich 29 February 2016 (has links)
No description available.
|
226 |
EFFICIENT MANAGEMENT AND CONTROL OF TELEMETRY RESOURCESCowart, Alan E., Baldonado, Michelle 10 1900 (has links)
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada / In recent years the telemetry community has encountered a growing demand for bandwidth from users and a corresponding loss of spectrum. The Advanced Range Telemetry (ARTM) Program has responded to this situation with an initiative to develop, demonstrate, and improve the management and control of telemetry resources using demand assigned multiple access (DAMA) techniques. This initiative has proceeded along two paths. The first path is in the development of an expert system to facilitate the scheduling of telemetry missions and the deconfliction of their frequencies. This system emphasizes the graphical manipulation of mission data and uses a genetic algorithm to search for an optimal set of mission frequencies. The second path is the development of a bidirectional command and control link to remotely control and configure the frequency of a telemetry link. This link uses the simple network management protocol (SNMP) over a wireless Internet Protocol (IP) network implemented with Digital Communications Network System (DCNS) units.
|
227 |
The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutionsMaqsood, Shahid January 2012 (has links)
This thesis aims to review and analyze the scheduling problem in general and Job Shop Scheduling Problem (JSSP) in particular and the solution techniques applied to these problems. The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the past sixty years, an enormous amount of research has been carried out to solve these problems. The literature review showed the inherent shortcomings of solutions to scheduling problems. This has directed researchers to develop hybrid approaches, as no single technique for scheduling has yet been successful in providing optimal solutions to these difficult problems, with much potential for improvements in the existing techniques. The hybrid approach complements and compensates for the limitations of each individual solution technique for better performance and improves results in solving both static and dynamic production scheduling environments. Over the past years, hybrid approaches have generally outperformed simple Genetic Algorithms (GAs). Therefore, two novel priority heuristic rules are developed: Index Based Heuristic and Hybrid Heuristic. These rules are applied to benchmark JSSP and compared with popular traditional rules. The results show that these new heuristic rules have outperformed the traditional heuristic rules over a wide range of benchmark JSSPs. Furthermore, a hybrid GA is developed as an alternate scheduling approach. The hybrid GA uses the novel heuristic rules in its key steps. The hybrid GA is applied to benchmark JSSPs. The hybrid GA is also tested on benchmark flow shop scheduling problems and industrial case studies. The hybrid GA successfully found solutions to JSSPs and is not problem dependent. The hybrid GA performance across the case studies has proved that the developed scheduling model can be applied to any real-world scheduling problem for achieving optimal or near-optimal solutions. This shows the effectiveness of the hybrid GA in real-world scheduling problems. In conclusion, all the research objectives are achieved. Finaly, the future work for the developed heuristic rules and the hybrid GA are discussed and recommendations are made on the basis of the results.
|
228 |
3-D antenna array analysis using the induced EMF methodAbdul Malek, Norun F. January 2013 (has links)
The effect of mutual coupling between elements plays a crucial role to the performance of the antenna arrays. The radiation patterns of antenna arrays will be altered by the coupling effect from the adjacent elements thus reducing the accuracy and resolution in direction finding application. This research developed and validated the novel 3-D Algorithm to calculate the far-field pattern of dipole arrays arranged in three dimensions and in any configuration (both in straight and slanted position). The effect of mutual coupling has been accounted using the Induced EMF method. The computation is performed on 2x2 parallel dipoles and 12 dipoles arranged at the edge of a cube. The results are validated with other electromagnetic techniques such as Method of Moment (MoM) and Finite Difference Time-Domain (FDTD). Then, a 2x2 dipole array is chosen for beam steering and experiment validation due to its ease of implementation and feeding network. The array optimisation to control the pattern is performed using a genetic algorithm. The far-field pattern computed using the 3-D algorithm might be less accurate than other 3-D electromagnetic techniques but its array optimisation is faster and efficient. The simulation and measurement results are in good agreement with each other confirmed the validity of the 3-D algorithm.
|
229 |
An intelligent manufacturing system for heat treatment schedulingAl-Kanhal, Tawfeeq January 2010 (has links)
This research is focused on the integration problem of process planning and scheduling in steel heat treatment operations environment using artificial intelligent techniques that are capable of dealing with such problems. This work addresses the issues involved in developing a suitable methodology for scheduling heat treatment operations of steel. Several intelligent algorithms have been developed for these propose namely, Genetic Algorithm (GA), Sexual Genetic Algorithm (SGA), Genetic Algorithm with Chromosome differentiation (GACD), Age Genetic Algorithm (AGA), and Mimetic Genetic Algorithm (MGA). These algorithms have been employed to develop an efficient intelligent algorithm using Algorithm Portfolio methodology. After that all the algorithms have been tested on two types of scheduling benchmarks. To apply these algorithms on heat treatment scheduling, a furnace model is developed for optimisation proposes. Furthermore, a system that is capable of selecting the optimal heat treatment regime is developed so the required metal properties can be achieved with the least energy consumption and the shortest time using Neuro-Fuzzy (NF) and Particle Swarm Optimisation (PSO) methodologies. Based on this system, PSO is used to optimise the heat treatment process by selecting different heat treatment conditions. The selected conditions are evaluated so the best selection can be identified. This work addresses the issues involved in developing a suitable methodology for developing an NF system and PSO for mechanical properties of the steel. Using the optimisers, furnace model and heat treatment system model, the intelligent system model is developed and implemented successfully. The results of this system were exciting and the optimisers were working correctly.
|
230 |
Automated system design optimisationAstapenko, D. January 2010 (has links)
The focus of this thesis is to develop a generic approach for solving reliability design optimisation problems which could be applicable to a diverse range of real engineering systems. The basic problem in optimal reliability design of a system is to explore the means of improving the system reliability within the bounds of available resources. Improving the reliability reduces the likelihood of system failure. The consequences of system failure can vary from minor inconvenience and cost to significant economic loss and personal injury. However any improvements made to the system are subject to the availability of resources, which are very often limited. The objective of the design optimisation problem analysed in this thesis is to minimise system unavailability (or unreliability if an unrepairable system is analysed) through the manipulation and assessment of all possible design alterations available, which are subject to constraints on resources and/or system performance requirements. This thesis describes a genetic algorithm-based technique developed to solve the optimisation problem. Since an explicit mathematical form can not be formulated to evaluate the objective function, the system unavailability (unreliability) is assessed using the fault tree method. Central to the optimisation algorithm are newly developed fault tree modification patterns (FTMPs). They are employed here to construct one fault tree representing all possible designs investigated, from the initial system design specified along with the design choices. This is then altered to represent the individual designs in question during the optimisation process. Failure probabilities for specified design cases are quantified by employing Binary Decision Diagrams (BDDs). A computer programme has been developed to automate the application of the optimisation approach to standard engineering safety systems. Its practicality is demonstrated through the consideration of two systems of increasing complexity; first a High Integrity Protection System (HIPS) followed by a Fire Water Deluge System (FWDS). The technique is then further-developed and applied to solve problems of multi-phased mission systems. Two systems are considered; first an unmanned aerial vehicle (UAV) and secondly a military vessel. The final part of this thesis focuses on continuing the development process by adapting the method to solve design optimisation problems for multiple multi-phased mission systems. Its application is demonstrated by considering an advanced UAV system involving multiple multi-phased flight missions. The applications discussed prove that the technique progressively developed in this thesis enables design optimisation problems to be solved for systems with different levels of complexity. A key contribution of this thesis is the development of a novel generic optimisation technique, embedding newly developed FTMPs, which is capable of optimising the reliability design for potentially any engineering system. Another key and novel contribution of this work is the capability to analyse and provide optimal design solutions for multiple multi-phase mission systems. Keywords: optimisation, system design, multi-phased mission system, reliability, genetic algorithm, fault tree, binary decision diagram
|
Page generated in 0.0571 seconds