Search

This paper describes the application of a novel multiobjective self-adaptive differential evolution (MOSADE) algorithm for the simultaneous optimization of component sizing and control strategy in parallel hybrid electric vehicles (HEVs). Based on an electric assist control strategy, the HEV optimal design problem is formulated as a nonlinear constrained multiobjective problem with competing and noncommensurable objectives of fuel consumption and emissions. The driving performance requirements are considered constraints. The proposed MOSADE approach adopts an external elitist archive to retain nondominated solutions that are found during the evolutionary process. To preserve the diversity of Pareto optimal solutions, a progressive comparison truncation operator based on the normalized nearest neighbor distance is proposed. Moreover, a fuzzy set theory is employed to extract the best compromise solution. Finally, the optimization is performed over the following three typical driving cycles that are currently used in the U.S. and European communities: 1) the file transfer protocol; 2) ECE +EUDC; and 3) Urban Dynamometer Driving Schedule. The results demonstrate the capability of the proposed approach to generate well-distributed Pareto optimal solutions of the HEV multiobjective optimization design problem. The comparison with the reported results of genetic-algorithm-based weighting sum approaches and Nondominated Sorting Genetic Algorithm II reveals the superiority of the proposed approach and confirms its potential for optimal HEV design. [ABSTRACT FROM PUBLISHER]

A linear time-varying aggregate traffic flow model can be used to develop traffic flow management strategies using optimization algorithms. However, there are few methods available in the literature to translate these aggregate solutions into practical control actions involving individual aircraft. In this paper, a computationally efficient disaggregation algorithm is proposed by employing a series of linear program and mixed integer linear program methods, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate traffic flow management schedules for a typical day in the U.S. National Airspace System. [ABSTRACT FROM AUTHOR]

Abstract: Wind is one of the most promising sources of alternative energy. The construction of wind farms is destined to grow in the U.S., possibly twenty-fold by the year 2030. To maximize the wind energy capture, this paper presents a model for wind turbine placement based on the wind distribution. The model considers wake loss, which can be calculated based on wind turbine locations, and wind direction. Since the turbine layout design is a constrained optimization problem, for ease of solving it, the constraints are transformed into a second objective function. Then a multi-objective evolutionary strategy algorithm is developed to solve the transformed bi-criteria optimization problem, which maximizes the expected energy output, as well as minimizes the constraint violations. The presented model is illustrated with examples as well as an industrial application. [Copyright &y& Elsevier]

The equilibrium network design problem can be formulated as a mathematical program with variational inequality constraints. We know this problem is nonconvex; hence, it is difficult to solve for a globally optimal solution. In this paper we propose a simulated annealing algorithm for the equilibrium network design problem. We demonstrate the ability of this algorithm to determine a globally optimal solution for two different networks. One of these describes an actual city in the midwestern United States. [ABSTRACT FROM AUTHOR]

In this article, we analyze performance and energy consumption of five OpenMP runtime systems over a non-uniform memory access (NUMA) platform. We also selected three CPU-level optimizations or techniques to evaluate their impact on the runtime systems: processors features Turbo Boost and C-States, and CPU Dynamic Voltage and Frequency Scaling through Linux CPUFreq governors. We present an experimental study to characterize OpenMP runtime systems on the three main kernels in dense linear algebra algorithms (Cholesky, LU, and QR) in terms of performance and energy consumption. Our experimental results suggest that OpenMP runtime systems can be considered as a new energy leverage, and Turbo Boost, as well as C-States, impacted significantly performance and energy. CPUFreq governors had more impact with Turbo Boost disabled, since both optimizations reduced performance due to CPU thermal limits. An LU factorization with concurrent-write extension from libKOMP achieved up to 63% of performance gain and 29% of energy decrease over original PLASMA algorithm using GNU C compiler (GCC) libGOMP runtime. [ABSTRACT FROM AUTHOR]

The current Weather Surveillance Radar-1988 Doppler (WSR-88D) radar network is approaching 20 years of age, leading researchers to begin exploring new opportunities for a next-generation network in the United States. With a vast list of requirements for a new weather radar network, research has provided various approaches to the design and fabrication of such a network. Additionally, new weather radar networks in other countries, as well as networks on smaller scales, must balance a large number of variables in order to operate in the most effective way possible. To offer network designers an objective analysis tool for such decisions, a coverage optimization technique, utilizing a genetic algorithm with a focus on low-level coverage, is presented. Optimization is achieved using a variety of variables and methods, including the use of climatology, population density, and attenuation due to average precipitation conditions. A method to account for terrain blockage in mountainous regions is also presented. Various combinations of multifrequency radar networks are explored, and results are presented in the form of a coverage-based cost-benefit analysis, with considerations for total network lifetime cost. [ABSTRACT FROM AUTHOR]

The article focuses on the development and implementation of the Mathematical Sorting Hat automated procedure in the U.S. college system. The authors mentions that the procedure uses weighted biopartite graph in capturing the preferences of students, as well as college constraints, with the help of a Hungarian algorithm. They also explain the modeling process of the conversion of the problem into a classical optimization problem.

One of the primary design requirements of automotive generation systems is maximizing power density subject to the constraint of minimizing the overall system cost. However, with the progress made in the reduction of automotive drive train noise, the torque ripple of the generator has been found to be a dominant noise source under idle conditions at high electrical loads. Thus, an added design constraint is the minimization of the torque ripple produced by the machine. In order to evaluate alternative machine designs (and select an optimal), numerical tools are typically applied. In this research, a focus is placed on the creation of numerical tools that can be used to effectively search for an optimal design. A primary tool is an evolutionary algorithm (EA) that has been integrated within a customized magnetic equivalent circuit (MEC) model of the machine. The selection of an EA that is most likely to converge to an optimal solution in the least amount of time is described along with its use in selecting an optimal rotor-pole geometry. [ABSTRACT FROM AUTHOR]

The article presents a solution to a large-scale traveling-salesman problem which shows that a certain tour of 49 cities, one in each of the 48 states and Washington, D.C., has the shortest road distance. A brief history of the problem is provided. A city in each state including the District of Columbia was selected to try the optimal path method on a large problem. The devices in obtaining solutions include the use of undirected tours, the imposition of linear conditions to characterize the tours, the speeding up of the iterative process and the use of a combinatorial approach.