7,824 research outputs found

    State-of-the-art in aerodynamic shape optimisation methods

    Get PDF
    Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners

    A MULTI-OBJECTIVE MODEL FOR TIME–COST–QUALITY–RISK TRADE-OFF PROBLEMS IN PROJECT MANAGEMENT

    Get PDF
    This study presents a weighted four-dimensional time-cost-quality-risk trade-off problem to assist decision-makers in planning the best possible use of resources. The proposed model aims to minimize time and cost while maximizing quality and safety and to ensure that the project is completed as required. The critical path method was used to calculate the completion time, the analytical hierarchy process method was used to determine the weights of the quality parameters, and the 3T risk assessment method was used to calculate the risk values. The algorithm was coded in GAMS and optimized using CPLEX. A construction project with a deadline of 310 days, a budget of 5,250,000 ₺, 88% quality and a safety index (SI) of 77% was selected to analyze the accuracy of the model. The model achieved a solution with a completion time of 310 days, costs amounting to 5,247,775 ₺, 88.036% quality, and 77.338% SI

    Conceptual Design of Wind Farms Through Novel Multi-Objective Swarm Optimization

    Get PDF
    Wind is one of the major sources of clean and renewable energy, and global wind energy has been experiencing a steady annual growth rate of more than 20% over the past decade. In the U.S. energy market, although wind energy is one of the fastest increasing sources of electricity generation (by annual installed capacity addition), and is expected to play an important role in the future energy demographics of this country, it has also been plagued by project underperformance and concept-to-installation delays. There are various factors affecting the quality of a wind energy project, and most of these factors are strongly coupled in their influence on the socio-economic, production, and environmental objectives of a wind energy project. To develop wind farms that are profitable, reliable, and meet community acceptance, it is critical to accomplish balance between these objectives, and therefore a clean understanding of how different design and natural factors jointly impact these objectives is much needed. In this research, a Multi-objective Wind Farm Design (MOWFD) methodology is developed, which analyzes and integrates the impact of various factors on the conceptual design of wind farms. This methodology contributes three major advancements to the wind farm design paradigm: (I) provides a new understanding of the impact of key factors on the wind farm performance under the use of different wake models; (II) explores the crucial tradeoffs between energy production, cost of energy, and the quantitative role of land usage in wind farm layout optimization (WFLO); and (III) makes novel advancements on mixed-discrete particle swarm optimization algorithm through a multi-domain diversity preservation concept, to solve complex multi-objective optimization (MOO) problems. A comprehensive sensitivity analysis of the wind farm power generation is performed to understand and compare the impact of land configuration, installed capacity decisions, incoming wind speed, and ambient turbulence on the performance of conventional array layouts and optimized wind farm layouts. For array-like wind farms, the relative importance of each factor was found to vary significantly with the choice of wake models, i.e., appreciable differences in the sensitivity indices (of up to 70%) were observed across the different wake models. In contrast, for optimized wind farm layouts, the choice of wake models was observed to have no significant impact on the sensitivity indices. The MOWFD methodology is designed to explore the tradeoffs between the concerned performance objectives and simultaneously optimize the location of turbines, the type of turbines, and the land usage. More importantly, it facilitates WFLO without prescribed conditions (e.g., fixed wind farm boundaries and number of turbines), thereby allowing a more flexible exploration of the feasible layout solutions than is possible with other existing WFLO methodologies. In addition, a novel parameterization of the Pareto is performed to quantitatively explore how the best tradeoffs between energy production and land usage vary with the installed capacity decisions. The key to the various complex MO-WFLOs performed here is the unique set of capabilities offered by the new Multi-Objective Mixed-Discrete Particle Swarm Optimization (MO-MDPSO) algorithm, developed, tested and extensively used in this dissertation. The MO-MDPSO algorithm is capable of dealing with a plethora of problem complexities, namely: multiple highly nonlinear objectives, constraints, high design space dimensionality, and a mixture of continuous and discrete design variables. Prior to applying MO-MDPSO to effectively solve complex WFLO problems, this new algorithm was tested on a large and diverse suite of popular benchmark problems; the convergence and Pareto coverage offered by this algorithm was found to be competitive with some of the most popular MOO algorithms (e.g., GAs). The unique potential of the MO-MDPSO algorithm is further established through application to the following complex practical engineering problems: (I) a disc brake design problem, (II) a multi-objective wind farm layout optimization problem, simultaneously optimizing the location of turbines, the selection of turbine types, and the site orientation, and (III) simultaneously minimizing land usage and maximizing capacity factors under varying land plot availability

    Optimal analog wavelet bases construction using hybrid optimization algorithm

    Get PDF
    An approach for the construction of optimal analog wavelet bases is presented. First, the definition of an analog wavelet is given. Based on the definition and the least-squares error criterion, a general framework for designing optimal analog wavelet bases is established, which is one of difficult nonlinear constrained optimization problems. Then, to solve this problem, a hybrid algorithm by combining chaotic map particle swarm optimization (CPSO) with local sequential quadratic programming (SQP) is proposed. CPSO is an improved PSO in which the saw tooth chaotic map is used to raise its global search ability. CPSO is a global optimizer to search the estimates of the global solution, while the SQP is employed for the local search and refining the estimates. Benefiting from good global search ability of CPSO and powerful local search ability of SQP, a high-precision global optimum in this problem can be gained. Finally, a series of optimal analog wavelet bases are constructed using the hybrid algorithm. The proposed method is tested for various wavelet bases and the improved performance is compared with previous works.Peer reviewedFinal Published versio

    Intelligent power system operation in an uncertain environment

    Get PDF
    This dissertation presents some challenging problems in power system operations. The efficacy of a heuristic method, namely, modified discrete particle swarm optimization (MDPSO) algorithm is illustrated and compared with other methods by solving the reliability based generator maintenance scheduling (GMS) optimization problem of a practical hydrothermal power system. The concept of multiple swarms is incorporated into the MDPSO algorithm to form a robust multiple swarms-modified particle swarm optimization (MS-MDPSO) algorithm and applied to solving the GMS problem on two power systems. Heuristic methods are proposed to circumvent the problems of imposed non-smooth assumptions common with the classical approaches in solving the challenging dynamic economic dispatch problem. The multi-objective combined economic and emission dispatch (MO-CEED) optimization problem for a wind-hydrothermal power system is formulated and solved in this dissertation. This MO-CEED problem formulation becomes a challenging problem because of the presence of uncertainty in wind power. A family of distributed optimal Pareto fronts for the MO-CEED problem has been generated for different scenarios of capacity credit of wind power. A real-time (RT) network stability index is formulated for determining a power system\u27s ability to continue to provide service (electric energy) in a RT manner in case of an unforeseen catastrophic contingency. Cascading stages of fuzzy inference system is applied to combine non real-time (NRT) and RT power system assessments. NRT analysis involves eigenvalue and transient energy analysis. RT analysis involves angle, voltage and frequency stability indices. RT Network status index is implemented in real-time on a practical power system --Abstract, page iv

    Time-Cost Optimization of Large-Scale Construction Projects Using Constraint Programming

    Get PDF
    Optimization of time and cost in construction projects has been subject to extensive research since the development of the Critical Path Method (CPM). Many researchers have investigated various versions of the well-known Time-Cost Trade-off (TCT) problem including linear, convex, concave, and also the discrete (DTCT) version. Traditional methods in the literature for optimizing time and cost of construction projects range from mathematical methods to evolutionary-based ones, such as genetic algorithms, particle swarm, ant-colony, and leap frog optimization. However, none of the existing research studies has dealt with the optimization of large-scale projects in which any small saving would be significant. Traditional approaches have all been applied to projects of less than 100 activities which are far less than what exists in real-world construction projects. The objective of this study is to utilize recent developments in computation technology and novel optimization techniques such as Constraint Programming (CP) to improve the current limitations in solving large-scale DTCT problems. Throughout the first part of this research, an Excel-based TCT model has been developed to investigate the performance of traditional optimization methods, such as mathematical programming and genetic algorithms, for solving large TCT problems. The result of several experimentations confirms the inefficiency of traditional methods for optimizing large TCT problems. Subsequently, a TCT model has been developed using Optimization Programming Language (OPL) to implement the Constraint Programming (CP) technique. CP Optimizer of IBM ILOG Optimization Studio has been used to solve the model and to successfully optimize several projects ranging from a small project of 18 activities to very large projects consisting of more than 10,000 activities. Constraint programming proved to be very efficient in solving large-scale TCT problems, generating substantially better results in terms of solution quality and processing speed. While traditional optimization methods have been used to optimize projects consisting of less than one hundred activities, constraint programming demonstrated its capability of solving TCT problems comprising of thousands of activities. As such, the developed model represents a significant improvement in optimization of time and cost of large-scale construction projects and can greatly enhance the level of planning and control in such projects
    • …
    corecore