52 research outputs found

    Electromagnetic Device Optimization with Stochastic Methods

    Get PDF
    none1Device optimization using metaheuristic methods has been successfully applied to electromagnetic devices since their development in the early 1980s. Some recent examples of the application of metaheuristics in electromagnetic device design include, among others, genetic algorithms [Zaoui2007], evolution strategies [Coelho2007], Tabu search [Cogotti2000], artificial immune systems [Campelo2006], particle swarm optimization (PSO) [Ciuprina2002]. In this chapter the author summarizes some of his experiences in the use of two stochastic optimization techniques which are very suitable to typical electromagnetic devices and systems. First the algorithms are briefly introduced and then their application to typical challenging problems, including Polymer Exchange Membrane Fuel Cells (PEMFC), high- field-uniformity solenoids and Superconducting Magnetic Energy Storage (SMES) systems, is presented.noneP. AlottoAlotto, Piergiorgi

    Application of PSO for optimization of power systems under uncertainty

    Get PDF
    The primary objective of this dissertation is to develop a black box optimization tool. The algorithm should be able to solve complex nonlinear, multimodal, discontinuous and mixed-integer power system optimization problems without any model reduction. Although there are many computational intelligence (CI) based algorithms which can handle these problems, they require intense human intervention in the form of parameter tuning, selection of a suitable algorithm for a given problem etc. The idea here is to develop an algorithm that works relatively well on a variety of problems with minimum human effort. An adaptive particle swarm optimization algorithm (PSO) is presented in this thesis. The algorithm has special features like adaptive swarm size, parameter free update strategies, progressive neighbourhood topologies, self learning parameter free penalty approach etc. The most significant optimization task in the power system operation is the scheduling of various generation resources (Unit Commitment, UC). The current practice used in UC modelling is the binary approach. This modelling results in a high dimension problem. This in turn leads to increased computational effort and decreased efficiency of the algorithm. A duty cycle based modelling proposed in this thesis results in 80 percent reduction in the problem dimension. The stern uptime and downtime requirements are also included in the modelling. Therefore, the search process mostly starts in a feasible solution space. From the investigations on a benchmark problem, it was found that the new modelling results in high quality solutions along with improved convergence. The final focus of this thesis is to investigate the impact of unpredictable nature of demand and renewable generation on the power system operation. These quantities should be treated as a stochastic processes evolving over time. A new PSO based uncertainty modelling technique is used to abolish the restrictions imposed by the conventional modelling algorithms. The stochastic models are able to incorporate the information regarding the uncertainties and generate day ahead UC schedule that are optimal to not just the forecasted scenario for the demand and renewable generation in feed but also to all possible set of scenarios. These models will assist the operator to plan the operation of the power system considering the stochastic nature of the uncertainties. The power system can therefore optimally handle huge penetration of renewable generation to provide economic operation maintaining the same reliability as it was before the introduction of uncertainty

    Identifying preferred solutions for multi-objective aerodynamic design optimization

    Get PDF
     Aerodynamic designers rely on high-fidelity numerical models to approximate, within reasonable accuracy, the flow around complex aerodynamic shapes. The ability to improve the flow field behaviour through shape modifications has led to the use of optimization techniques. A significant challenge to the application of evolutionary algorithms for aerodynamic shape optimization is the often excessive number of expensive computational fluid dynamic evaluations required to identify optimal designs. The computational effort is intensified when considering multiple competing objectives, where a host of trade-off designs are possible. This research focuses on the development of control measures to improve efficiency and incorporate the domain knowledge and experience of the designer to facilitate the optimization process. A multi-objective particle swarm optimization framework is developed, which incorporates designer preferences to provide further guidance in the search. A reference point is projected on the objective landscape to guide the swarm towards solutions of interest. This point reflects the preferred compromise and is used to focus all computing effort on exploiting a preferred region of the Pareto front. Data mining tools are introduced to statistically extract information from the design space and confirm the relative influence of both variables and objectives to the preferred interests of the designer. The framework is assisted by the construction of time-adaptive Kriging models, for the management of high-fidelity problems restricted by a computational budget. A screening criterion to locally update the Kriging models in promising areas of the design space is developed, which ensures the swarm does not deviate from the preferred search trajectory. The successful integration of these design tools is facilitated through the specification of the reference point, which can ideally be based on an existing or target design. The over-arching goal of the developmental effort is to reduce the often prohibitive cost of multi-objective design to the level of practical affordability in aerospace problems. The superiority of the proposed framework over more conventional search methods is conclusively demonstrated via a series of experiments and aerodynamic design problems

    Particle swarm optimization and differential evolution for multi-objective multiple machine scheduling

    Get PDF
    Production scheduling is one of the most important issues in the planning and operation of manufacturing systems. Customers increasingly expect to receive the right product at the right price at the right time. Various problems experienced in manufacturing, for example low machine utilization and excessive work-in-process, can be attributed directly to inadequate scheduling. In this dissertation a production scheduling algorithm is developed for Optimatix, a South African-based company specializing in supply chain optimization. To address the complex requirements of the customer, the problem was modeled as a flexible job shop scheduling problem with sequence-dependent set-up times, auxiliary resources and production down time. The algorithm development process focused on investigating the application of both particle swarm optimization (PSO) and differential evolution (DE) to production scheduling environments characterized by multiple machines and multiple objectives. Alternative problem representations, algorithm variations and multi-objective optimization strategies were evaluated to obtain an algorithm which performs well against both existing rule-based algorithms and an existing complex flexible job shop scheduling solution strategy. Finally, the generality of the priority-based algorithm was evaluated by applying it to the scheduling of production and maintenance activities at Centurion Ice Cream and Sweets. The production environment was modeled as a multi-objective uniform parallel machine shop problem with sequence-dependent set-up times and unavailability intervals. A self-adaptive modified vector evaluated DE algorithm was developed and compared to classical PSO and DE vector evaluated algorithms. Promising results were obtained with respect to the suitability of the algorithms for solving a range of multi-objective multiple machine scheduling problems. CopyrightDissertation (MEng)--University of Pretoria, 2009.Industrial and Systems Engineeringunrestricte

    Swarm intelligence techniques for optimization and management tasks insensor networks

    Get PDF
    The main contributions of this thesis are located in the domain of wireless sensor netorks. More in detail, we introduce energyaware algorithms and protocols in the context of the following topics: self-synchronized duty-cycling in networks with energy harvesting capabilities, distributed graph coloring and minimum energy broadcasting with realistic antennas. In the following, we review the research conducted in each case. We propose a self-synchronized duty-cycling mechanism for sensor networks. This mechanism is based on the working and resting phases of natural ant colonies, which show self-synchronized activity phases. The main goal of duty-cycling methods is to save energy by efficiently alternating between different states. In the case at hand, we considered two different states: the sleep state, where communications are not possible and energy consumption is low; and the active state, where communication result in a higher energy consumption. In order to test the model, we conducted an extensive experimentation with synchronous simulations on mobile networks and static networks, and also considering asynchronous networks. Later, we extended this work by assuming a broader point of view and including a comprehensive study of the parameters. In addition, thanks to a collaboration with the Technical University of Braunschweig, we were able to test our algorithm in the real sensor network simulator Shawn (http://shawn.sf.net). The second part of this thesis is devoted to the desynchronization of wireless sensor nodes and its application to the distributed graph coloring problem. In particular, our research is inspired by the calling behavior of Japanese tree frogs, whose males use their calls to attract females. Interestingly, as female frogs are only able to correctly localize the male frogs when their calls are not too close in time, groups of males that are located nearby each other desynchronize their calls. Based on a model of this behavior from the literature, we propose a novel algorithm with applications to the field of sensor networks. More in detail, we analyzed the ability of the algorithm to desynchronize neighboring nodes. Furthermore, we considered extensions of the original model, hereby improving its desynchronization capabilities.To illustrate the potential benefits of desynchronized networks, we then focused on distributed graph coloring. Later, we analyzed the algorithm more extensively and show its performance on a larger set of benchmark instances. The classical minimum energy broadcast (MEB) problem in wireless ad hoc networks, which is well-studied in the scientific literature, considers an antenna model that allows the adjustment of the transmission power to any desired real value from zero up to the maximum transmission power level. However, when specifically considering sensor networks, a look at the currently available hardware shows that this antenna model is not very realistic. In this work we re-formulate the MEB problem for an antenna model that is realistic for sensor networks. In this antenna model transmission power levels are chosen from a finite set of possible ones. A further contribution concerns the adaptation of an ant colony optimization algorithm --currently being the state of the art for the classical MEB problem-- to the more realistic problem version, the so-called minimum energy broadcast problem with realistic antennas (MEBRA). The obtained results show that the advantage of ant colony optimization over classical heuristics even grows when the number of possible transmission power levels decreases. Finally we build a distributed version of the algorithm, which also compares quite favorably against centralized heuristics from the literature.Las principles contribuciones de esta tesis se encuentran en el domino de las redes de sensores inalámbricas. Más en detalle, introducimos algoritmos y protocolos que intentan minimizar el consumo energético para los siguientes problemas: gestión autosincronizada de encendido y apagado de sensores con capacidad para obtener energía del ambiente, coloreado de grafos distribuido y broadcasting de consumo mínimo en entornos con antenas reales. En primer lugar, proponemos un sistema capaz de autosincronizar los ciclos de encendido y apagado de los nodos de una red de sensores. El mecanismo está basado en las fases de trabajo y reposo de las colonias de hormigas tal y como estas pueden observarse en la naturaleza, es decir, con fases de actividad autosincronizadas. El principal objectivo de este tipo de técnicas es ahorrar energía gracias a alternar estados de forma eficiente. En este caso en concreto, consideramos dos estados diferentes: el estado dormido, en el que los nodos no pueden comunicarse y el consumo energético es bajo; y el estado activo, en el que las comunicaciones propician un consumo energético elevado. Con el objetivo de probar el modelo, se ha llevado a cabo una extensa experimentación que incluye tanto simulaciones síncronas en redes móviles y estáticas, como simulaciones en redes asíncronas. Además, este trabajo se extendió asumiendo un punto de vista más amplio e incluyendo un detallado estudio de los parámetros del algoritmo. Finalmente, gracias a la colaboración con la Technical University of Braunschweig, tuvimos la oportunidad de probar el mecanismo en el simulador realista de redes de sensores, Shawn (http://shawn.sf.net). La segunda parte de esta tesis está dedicada a la desincronización de nodos en redes de sensores y a su aplicación al problema del coloreado de grafos de forma distribuida. En particular, nuestra investigación está inspirada por el canto de las ranas de árbol japonesas, cuyos machos utilizan su canto para atraer a las hembras. Resulta interesante que debido a que las hembras solo son capaces de localizar las ranas macho cuando sus cantos no están demasiado cerca en el tiempo, los grupos de machos que se hallan en una misma región desincronizan sus cantos. Basado en un modelo de este comportamiento que se encuentra en la literatura, proponemos un nuevo algoritmo con aplicaciones al campo de las redes de sensores. Más en detalle, analizamos la habilidad del algoritmo para desincronizar nodos vecinos. Además, consideramos extensiones del modelo original, mejorando su capacidad de desincronización. Para ilustrar los potenciales beneficios de las redes desincronizadas, nos centramos en el problema del coloreado de grafos distribuido que tiene relación con diferentes tareas habituales en redes de sensores. El clásico problema del broadcasting de consumo mínimo en redes ad hoc ha sido bien estudiado en la literatura. El problema considera un modelo de antena que permite transmitir a cualquier potencia elegida (hasta un máximo establecido por el dispositivo). Sin embargo, cuando se trabaja de forma específica con redes de sensores, un vistazo al hardware actualmente disponible muestra que este modelo de antena no es demasiado realista. En este trabajo reformulamos el problema para el modelo de antena más habitual en redes de sensores. En este modelo, los niveles de potencia de transmisión se eligen de un conjunto finito de posibilidades. La siguiente contribución consiste en en la adaptación de un algoritmo de optimización por colonias de hormigas a la versión más realista del problema, también conocida como broadcasting de consumo mínimo con antenas realistas. Los resultados obtenidos muestran que la ventaja de este método sobre heurísticas clásicas incluso crece cuando el número de posibles potencias de transmisión decrece. Además, se ha presentado una versión distribuida del algoritmo, que también se compara de forma bastante favorable contra las heurísticas centralizadas conocidas

    Development and application of an optimisation architecture with adaptive swarm algorithm for airfoil aerodynamic design

    Get PDF
    The research focuses on the aerodynamic design of airfoils for a Multi-Mission Unmanned Aerial Vehicle (MM-UAV). Novel shape design processes using evolutionary algorithms (EA) and a surrogate-based management system are developed to address the identified issues and challenges of solution feasibility and computational efficiency associated with present methods. Feasibility refers to the optimality of the converged solution as a function of the defined objectives and constraints. Computational efficiency is a measure of the number of design iterations needed to achieve convergence to the theoretical optimum. Airfoil design problems are characterised by a multi-modal solution topology. Present gradient-based optimisation methods do not converge to an optimal profile, hence solution feasibility is compromised. Population-based optimisation methods including the Genetic Algorithm (GA) have been used in the literature to address this issue. The GA can achieve solution feasibility, yet it is computationally time-intensive, hence efficiency is compromised. Novel EAs are developed to address the identified shortcomings of present methods. A variant to the original Particle Swarm Optimisation algorithm (PSO) is presented. Novel mutation operators are implemented which facilitate the transition of the search particles toward a global solution. The methodology addresses the limited search performance of the original PSO algorithm for multi-modal problems, while maintaining acceptable computational efficiency for aerodynamic design applications. Demonstration of the developed principles confirmed the merits of the proposed design approach. Airfoil optimisation for a low-speed flight profile achieved drag performance improvement that is lower than a off-the-shelf shape designed for the intent role. Acceptable computational efficiency is achieved by restricting the optimisation phase to promising solution regions through the development of a novel, design variable search space mapping structure. The merit of the optimisation framework is further confirmed by transonic airfoil design for high-speed missions. The wave drag of the established optima is lower than the identified, off-the-shelf benchmark. Concurrently significant computational time-savings are achieved relative to the design methodologies present in the literature. A novel surrogate-assisted optimisation framework by the definition of an Artificial Neural Network with a pattern recognition model is developed to further improve the computational efficiency. This has the potential of enhancing the aerodynamic shape design process. The measure of computational efficiency is critical in the development of an optimisation algorithm. Airfoil design simulations presented required 80\% fewer design iterations to achieve convergence than the GA. Computational time-savings spanning days was achieved by the innovative algorithms developed relative to the GA. Hence, computational efficiency of the developed processes is confirmed. Aircraft shape design simulations involve three-dimensional configurations which require excessive computational effort due to the use of high-fidelity solvers for flow analysis in the optimisation process. It is anticipated that the confirmed computational efficiency performance of the design structure presented on two-dimensional cases will be transferable to three-dimensional shape design problems. It is further expected that the novel principles will be applicable for analysis within a multidisciplinary design structure for the development of a MM-UAV

    Management, Technology and Learning for Individuals, Organisations and Society in Turbulent Environments

    Get PDF
    This book presents the collection of fifty papers which were presented in the Second International Conference on BUSINESS SUSTAINABILITY 2011 - Management, Technology and Learning for Individuals, Organisations and Society in Turbulent Environments , held in Póvoa de Varzim, Portugal, from 22ndto 24thof June, 2011.The main motive of the meeting was growing awareness of the importance of the sustainability issue. This importance had emerged from the growing uncertainty of the market behaviour that leads to the characterization of the market, i.e. environment, as turbulent. Actually, the characterization of the environment as uncertain and turbulent reflects the fact that the traditional technocratic and/or socio-technical approaches cannot effectively and efficiently lead with the present situation. In other words, the rise of the sustainability issue means the quest for new instruments to deal with uncertainty and/or turbulence. The sustainability issue has a complex nature and solutions are sought in a wide range of domains and instruments to achieve and manage it. The domains range from environmental sustainability (referring to natural environment) through organisational and business sustainability towards social sustainability. Concerning the instruments for sustainability, they range from traditional engineering and management methodologies towards “soft” instruments such as knowledge, learning, and creativity. The papers in this book address virtually whole sustainability problems space in a greater or lesser extent. However, although the uncertainty and/or turbulence, or in other words the dynamic properties, come from coupling of management, technology, learning, individuals, organisations and society, meaning that everything is at the same time effect and cause, we wanted to put the emphasis on business with the intention to address primarily companies and their businesses. Due to this reason, the main title of the book is “Business Sustainability 2.0” but with the approach of coupling Management, Technology and Learning for individuals, organisations and society in Turbulent Environments. Also, the notation“2.0” is to promote the publication as a step further from our previous publication – “Business Sustainability I” – as would be for a new version of software. Concerning the Second International Conference on BUSINESS SUSTAINABILITY, its particularity was that it had served primarily as a learning environment in which the papers published in this book were the ground for further individual and collective growth in understanding and perception of sustainability and capacity for building new instruments for business sustainability. In that respect, the methodology of the conference work was basically dialogical, meaning promoting dialog on the papers, but also including formal paper presentations. In this way, the conference presented a rich space for satisfying different authors’ and participants’ needs. Additionally, promoting the widest and global learning environment and participation, in accordance with the Conference's assumed mission to promote Proactive Generative Collaborative Learning, the Conference Organisation shares/puts open to the community the papers presented in this book, as well as the papers presented on the previous Conference(s). These papers can be accessed from the conference webpage (http://labve.dps.uminho.pt/bs11). In these terms, this book could also be understood as a complementary instrument to the Conference authors’ and participants’, but also to the wider readerships’ interested in the sustainability issues. The book brought together 107 authors from 11 countries, namely from Australia, Belgium, Brazil, Canada, France, Germany, Italy, Portugal, Serbia, Switzerland, and United States of America. The authors “ranged” from senior and renowned scientists to young researchers providing a rich and learning environment. At the end, the editors hope, and would like, that this book to be useful, meeting the expectation of the authors and wider readership and serving for enhancing the individual and collective learning, and to incentive further scientific development and creation of new papers. Also, the editors would use this opportunity to announce the intention to continue with new editions of the conference and subsequent editions of accompanying books on the subject of BUSINESS SUSTAINABILITY, the third of which is planned for year 2013.info:eu-repo/semantics/publishedVersio

    Globally convergent evolution strategies with application to Earth imaging problem in geophysics

    Get PDF
    Au cours des dernières années, s’est développé un intérêt tout particulier pour l’optimisation sans dérivée. Ce domaine de recherche se divise en deux catégories: une déterministe et l’autre stochastique. Bien qu’il s’agisse du même domaine, peu de liens ont déjà été établis entre ces deux branches. Cette thèse a pour objectif de combler cette lacune, en montrant comment les techniques issues de l’optimisation déterministe peuvent améliorer la performance des stratégies évolutionnaires, qui font partie des meilleures méthodes en optimisation stochastique. Sous certaines hypothèses, les modifications réalisées assurent une forme de convergence globale, c’est-à-dire une convergence vers un point stationnaire de premier ordre indépendamment du point de départ choisi. On propose ensuite d’adapter notre algorithme afin qu’il puisse traiter des problèmes avec des contraintes générales. On montrera également comment améliorer les performances numériques des stratégies évolutionnaires en incorporant un pas de recherche au début de chaque itération, dans laquelle on construira alors un modèle quadratique utilisant les points où la fonction coût a déjà été évaluée. Grâce aux récents progrès techniques dans le domaine du calcul parallèle, et à la nature parallélisable des stratégies évolutionnaires, on propose d’appliquer notre algorithme pour résoudre un problème inverse d’imagerie sismique. Les résultats obtenus ont permis d’améliorer la résolution de ce problème. ABSTRACT : In recent years, there has been significant and growing interest in Derivative-Free Optimization (DFO). This field can be divided into two categories: deterministic and stochastic. Despite addressing the same problem domain, only few interactions between the two DFO categories were established in the existing literature. In this thesis, we attempt to bridge this gap by showing how ideas from deterministic DFO can improve the efficiency and the rigorousness of one of the most successful class of stochastic algorithms, known as Evolution Strategies (ES’s). We propose to equip a class of ES’s with known techniques from deterministic DFO. The modified ES’s achieve rigorously a form of global convergence under reasonable assumptions. By global convergence, we mean convergence to first-order stationary points independently of the starting point. The modified ES’s are extended to handle general constrained optimization problems. Furthermore, we show how to significantly improve the numerical performance of ES’s by incorporating a search step at the beginning of each iteration. In this step, we build a quadratic model using the points where the objective function has been previously evaluated. Motivated by the recent growth of high performance computing resources and the parallel nature of ES’s, an application of our modified ES’s to Earth imaging Geophysics problem is proposed. The obtained results provide a great improvement for the problem resolution

    Earthquake Engineering

    Get PDF
    The book Earthquake Engineering - From Engineering Seismology to Optimal Seismic Design of Engineering Structures contains fifteen chapters written by researchers and experts in the fields of earthquake and structural engineering. This book provides the state-of-the-art on recent progress in the field of seimology, earthquake engineering and structural engineering. The book should be useful to graduate students, researchers and practicing structural engineers. It deals with seismicity, seismic hazard assessment and system oriented emergency response for abrupt earthquake disaster, the nature and the components of strong ground motions and several other interesting topics, such as dam-induced earthquakes, seismic stability of slopes and landslides. The book also tackles the dynamic response of underground pipes to blast loads, the optimal seismic design of RC multi-storey buildings, the finite-element analysis of cable-stayed bridges under strong ground motions and the acute psychiatric trauma intervention due to earthquakes
    corecore