14 research outputs found
Porcellio scaber algorithm (PSA) for solving constrained optimization problems
In this paper, we extend a bio-inspired algorithm called the porcellio scaber
algorithm (PSA) to solve constrained optimization problems, including a
constrained mixed discrete-continuous nonlinear optimization problem. Our
extensive experiment results based on benchmark optimization problems show that
the PSA has a better performance than many existing methods or algorithms. The
results indicate that the PSA is a promising algorithm for constrained
optimization.Comment: 6 pages, 1 figur
Structural optimization with uncertainty and its relation to performance based design
Structural optimization plays certain role from concept development, numerical algorithm to practical solution in the performance and life-cycle based structural engineering. This presentation briefly reviews the history of structural optimization and its application in civil engineering. Structural topology optimization and surrogate model-based optimization approach together with metaheuristic algorithms is discussed in more detail. The relation of structural optimization with performance based and life-cycle based structural design is illustrated through some of our research work on reliability-based design optimization and damage-reduction optimum deign of structural system. These works provide some optimization methodology, design concept and numerical algorithms, which may facilitate the performance based and life-cycle based structural engineering
Design Optimization of a Speed Reducer Using Deterministic Techniques
The optimal design problem of minimizing the total weight of a speed reducer under constraints is a generalized geometric programming problem. Since the metaheuristic approaches cannot guarantee to find the global optimum of a generalized geometric programming problem, this paper applies an efficient deterministic approach to globally solve speed reducer design problems. The original problem is converted by variable transformations and piecewise linearization techniques. The reformulated problem is a convex mixed-integer nonlinear programming problem solvable to reach an approximate global solution within an acceptable error. Experiment results from solving a practical speed reducer design problem indicate that this study obtains a better solution comparing with the other existing methods
Flower pollination algorithm: a novel approach for multiobjective optimization
Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this article, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multiobjective test functions and two bi-objective design benchmarks, and a comparison of the proposed algorithm with other algorithms has been made, which shows that the FPA is efficient with a good convergence rate. Finally, the importance for further parametric studies and theoretical analysis is highlighted and discussed
Flower pollination algorithm: a novel approach for multiobjective optimization
Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this article, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multiobjective test functions and two bi-objective design benchmarks, and a comparison of the proposed algorithm with other algorithms has been made, which shows that the FPA is efficient with a good convergence rate. Finally, the importance for further parametric studies and theoretical analysis is highlighted and discussed
Benchmarking for Metaheuristic Black-Box Optimization: Perspectives and Open Challenges
Research on new optimization algorithms is often funded based on the
motivation that such algorithms might improve the capabilities to deal with
real-world and industrially relevant optimization challenges. Besides a huge
variety of different evolutionary and metaheuristic optimization algorithms,
also a large number of test problems and benchmark suites have been developed
and used for comparative assessments of algorithms, in the context of global,
continuous, and black-box optimization. For many of the commonly used synthetic
benchmark problems or artificial fitness landscapes, there are however, no
methods available, to relate the resulting algorithm performance assessments to
technologically relevant real-world optimization problems, or vice versa. Also,
from a theoretical perspective, many of the commonly used benchmark problems
and approaches have little to no generalization value. Based on a mini-review
of publications with critical comments, advice, and new approaches, this
communication aims to give a constructive perspective on several open
challenges and prospective research directions related to systematic and
generalizable benchmarking for black-box optimization
A spring search algorithm applied to engineering optimization problems
At present, optimization algorithms are used extensively. One particular type of such algorithms includes random-based heuristic population optimization algorithms, which may be created by modeling scientific phenomena, like, for example, physical processes. The present article proposes a novel optimization algorithm based on Hooke’s law, called the spring search algorithm (SSA), which aims to solve single-objective constrained optimization problems. In the SSA, search agents are weights joined through springs, which, as Hooke’s law states, possess a force that corresponds to its length. The mathematics behind the algorithm are presented in the text. In order to test its functionality, it is executed on 38 established benchmark test functions and weighed against eight other optimization algorithms: a genetic algorithm (GA), a gravitational search algorithm (GSA), a grasshopper optimization algorithm (GOA), particle swarm optimization (PSO), teaching–learning-based optimization (TLBO), a grey wolf optimizer (GWO), a spotted hyena optimizer (SHO), as well as an emperor penguin optimizer (EPO). To test the SSA’s usability, it is employed on five engineering optimization problems. The SSA delivered better fitting results than the other algorithms in unimodal objective function, multimodal objective functions, CEC 2015, in addition to the optimization problems in engineering
Improved PSO algorithm for shape and sizing optimization of truss structure
In order to overcome the premature convergence defect of the basic particle swarm optimization (PSO) algorithm and provide an effective method for shape and sizing optimization of truss structure, an improved PSO was proposed. The random direction method was employed to produce high-quality initial population, the fuzzy system was applied in the dynamic adaptive adjustment of parameters of the PSO, and the Metropolis criteria were used to improve the performance of PSO. Then, the improved PSO was introduced to the truss structure shape and sizing optimization design. Engineering practice and comparison with the other optimization algorithms show that the algorithm has good convergence and global searching capability. The study provides a promising algorithm for the structural optimization