Measurements, Models, Systems and Design

531 s.

Comparison of Direct Multiobjective Optimization Methods for the Design of Electric Vehicles

"System design oriented methodologies" are discussed in this paper through the comparison of multiobjective optimization methods applied to heterogeneous devices in electrical engineering. Avoiding criteria function derivatives, direct optimization algorithms are used. In particular, deterministic geometric methods such as the Hooke & Jeeves heuristic approach are compared with stochastic evolutionary algorithms (Pareto genetic algorithms). Different issues relative to convergence rapidity and robustness on mixed (continuous/discrete), constrained and multiobjective problems are discussed. A typical electrical engineering heterogeneous and multidisciplinary system is considered as a case study: the motor drive of an electric vehicle. Some results emphasize the capacity of each approach to facilitate system analysis and particularly to display couplings between optimization parameters, constraints, objectives and the driving mission

Comparison of Geometric Optimization Methods with Multiobjective Genetic Algorithms for Solving Integrated Optimal Design Problems

In this paper, system design methodologies for optimizing heterogenous power devices in electrical engineering are investigated. The concept of Integrated Optimal Design (IOD) is presented and a simplified but typical example is given. It consists in finding Pareto-optimal configurations for the motor drive of an electric vehicle. For that purpose, a geometric optimization method (i.e the Hooke and Jeeves minimization procedure) associated with an objective weighting sum and a Multiobjective Genetic Algorithm (i.e. the NSGA-II) are compared. Several performance issues are discussed such as the accuracy in the determination of Pareto-optimal configurations and the capability to well spread these solutions in the objective space

Design and Optimization of Power Delivery and Distribution Systems Using Evolutionary Computation Techniques

Nowadays computing platforms consist of a very large number of components that require to be supplied with diferent voltage levels and power requirements. Even a very small platform, like a handheld computer, may contain more than twenty diferent loads and voltage regulators. The power delivery designers of these systems are required to provide, in a very short time, the right power architecture that optimizes the performance, meets electrical specifications plus cost and size targets. The appropriate selection of the architecture and converters directly defines the performance of a given solution. Therefore, the designer needs to be able to evaluate a significant number of options in order to know with good certainty whether the selected solutions meet the size, energy eficiency and cost targets. The design dificulties of selecting the right solution arise due to the wide range of power conversion products provided by diferent manufacturers. These products range from discrete components (to build converters) to complete power conversion modules that employ diferent manufacturing technologies. Consequently, in most cases it is not possible to analyze all the alternatives (combinations of power architectures and converters) that can be built. The designer has to select a limited number of converters in order to simplify the analysis. In this thesis, in order to overcome the mentioned dificulties, a new design methodology for power supply systems is proposed. This methodology integrates evolutionary computation techniques in order to make possible analyzing a large number of possibilities. This exhaustive analysis helps the designer to quickly define a set of feasible solutions and select the best trade-off in performance according to each application. The proposed approach consists of two key steps, one for the automatic generation of architectures and other for the optimized selection of components. In this thesis are detailed the implementation of these two steps. The usefulness of the methodology is corroborated by contrasting the results using real problems and experiments designed to test the limits of the algorithms

Adaptive particle swarm optimization

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity

A design tool for high-resolution high-frequency cascade continuous- time Σ∆ modulators

Event: Microtechnologies for the New Millennium, 2007, Maspalomas, Gran Canaria, SpainThis paper introduces a CAD methodology to assist the de signer in the implementation of continuous-time (CT) cas- cade Σ∆ modulators. The salient features of this methodology ar e: (a) flexible behavioral modeling for optimum accuracy- efficiency trade-offs at different stages of the top-down synthesis process; (b) direct synthesis in the continuous-time domain for minimum circuit complexity and sensitivity; a nd (c) mixed knowledge-based and optimization-based architec- tural exploration and specification transmission for enhanced circuit performance. The applicability of this methodology will be illustrated via the design of a 12 bit 20 MHz CT Σ∆ modulator in a 1.2V 130nm CMOS technology.Ministerio de Ciencia y Educación TEC2004-01752/MICMinisterio de Industria, Turismo y Comercio FIT-330100-2006-134 SPIRIT Projec

Power Conversion Modeling Methodology Based on Building Block Models

Power systems modeling tools used to analyze static and dynamic characteristics usually rely on detailed and complex models, thus taking a long simulation time. Due to the acceleration of time to market of today's computing platforms, it is required to arrive at feasible solution options in a short amount of time to meet cost and time targets. Specifically, the areas of power conversion and power management traditionally rely on experimental verification and are lacking in computer design methodologies. In this paper, a modeling methodology based on fundamental building block models for power delivery systems is presented to address the aspects of energy efficiency optimization, area occupied by the power delivery solution and the cost associated with power conversion

Fast architecture generation and evaluation techniques for the design of large power systems

This paper presents a methodology used to simplify the design of power supply systems based on high level of abstraction simulation models. This approach allows the designer to make decisions concerning the power system architecture and its components. This paper is focused on the techniques to identify topology candidates that can be built with available voltage regulator technologies and find the solution with best trade-off among energy efficiency, size and cost. In order to solve the problem when the number of possible options is very large, metaheuristic algorithms are used