2,192 research outputs found
Improved dynamical particle swarm optimization method for structural dynamics
A methodology to the multiobjective structural design of buildings based on an improved particle swarm optimization algorithm is presented, which has proved to be very efficient and robust in nonlinear problems and when the optimization objectives are in conflict. In particular, the behaviour of the particle swarm optimization (PSO) classical algorithm is improved by dynamically adding autoadaptive mechanisms that enhance the exploration/exploitation trade-off and diversity of the proposed algorithm, avoiding getting trapped in local minima. A novel integrated optimization system was developed, called DI-PSO, to solve this problem which is able to control and even improve the structural behaviour under seismic excitations. In order to demonstrate the effectiveness of the proposed approach, the methodology is tested against some benchmark problems. Then a 3-story-building model is optimized under different objective cases, concluding that the improved multiobjective optimization methodology using DI-PSO is more efficient as compared with those designs obtained using single optimization.Peer ReviewedPostprint (published version
Hybridization of multi-objective deterministic particle swarm with derivative-free local searches
The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts
Multiobjective optimization of electromagnetic structures based on self-organizing migration
Práce se zabĂ˝vá popisem novĂ©ho stochastickĂ©ho vĂcekriteriálnĂho optimalizaÄŤnĂho algoritmu MOSOMA (Multiobjective Self-Organizing Migrating Algorithm). Je zde ukázáno, Ĺľe algoritmus je schopen Ĺ™ešit nejrĹŻznÄ›jšà typy optimalizaÄŤnĂch Ăşloh (s jakĂ˝mkoli poÄŤtem kritĂ©riĂ, s i bez omezujĂcĂch podmĂnek, se spojitĂ˝m i diskrĂ©tnĂm stavovĂ˝m prostorem). VĂ˝sledky algoritmu jsou srovnány s dalšĂmi běžnÄ› pouĹľĂvanĂ˝mi metodami pro vĂcekriteriálnĂ optimalizaci na velkĂ© sadÄ› testovacĂch Ăşloh. Uvedli jsme novou techniku pro vĂ˝poÄŤet metriky rozprostĹ™enĂ (spread) zaloĹľenĂ© na hledánĂ minimálnĂ kostry grafu (Minimum Spanning Tree) pro problĂ©my majĂcĂ vĂce neĹľ dvÄ› kritĂ©ria. DoporuÄŤenĂ© hodnoty pro parametry Ĺ™ĂdĂcĂ bÄ›h algoritmu byly urÄŤeny na základÄ› vĂ˝sledkĹŻ jejich citlivostnĂ analĂ˝zy. Algoritmus MOSOMA je dále ĂşspěšnÄ› pouĹľit pro Ĺ™ešenĂ rĹŻznĂ˝ch návrhovĂ˝ch Ăşloh z oblasti elektromagnetismu (návrh Yagi-Uda antĂ©ny a dielektrickĂ˝ch filtrĹŻ, adaptivnĂ Ĺ™ĂzenĂ vyzaĹ™ovanĂ©ho svazku v ÄŤasovĂ© oblasti…).This thesis describes a novel stochastic multi-objective optimization algorithm called MOSOMA (Multi-Objective Self-Organizing Migrating Algorithm). It is shown that MOSOMA is able to solve various types of multi-objective optimization problems (with any number of objectives, unconstrained or constrained problems, with continuous or discrete decision space). The efficiency of MOSOMA is compared with other commonly used optimization techniques on a large suite of test problems. The new procedure based on finding of minimum spanning tree for computing the spread metric for problems with more than two objectives is proposed. Recommended values of parameters controlling the run of MOSOMA are derived according to their sensitivity analysis. The ability of MOSOMA to solve real-life problems from electromagnetics is shown in a few examples (Yagi-Uda and dielectric filters design, adaptive beam forming in time domain…).
Modified differential evolution based on global competitive ranking for engineering design optimization problems
Engineering design optimization problems are formulated as large-scale mathematical programming problems with nonlinear objective function and constraints. Global optimization finds a solution while satisfying the constraints. Differential evolution is a population-based heuristic approach that is shown to be very efficient to solve global optimization problems with simple bounds. In this paper, we propose a modified differential evolution introducing self-adaptive control parameters, modified mutation, inversion operation and modified selection for obtaining global optimization. To handle constraints effectively, in modified selection we incorporate global competitive ranking which strikes the right balance between the objective function and the constraint violation. Sixteen well-known engineering design optimization problems are considered and the results compared with other solution methods. It is shown that our method is competitive when solving these problems.Fundação para a Ciência e a Tecnologia (FCT
A convergence and diversity guided leader selection strategy for many-objective particle swarm optimization
Recently, particle swarm optimizer (PSO) is extended to solve many-objective optimization problems (MaOPs) and becomes a hot research topic in the field of evolutionary computation. Particularly, the leader particle selection (LPS) and the search direction used in a velocity update strategy are two crucial factors in PSOs. However, the LPS strategies for most existing PSOs are not so efficient in high-dimensional objective space, mainly due to the lack of convergence pressure or loss of diversity. In order to address these two issues and improve the performance of PSO in high-dimensional objective space, this paper proposes a convergence and diversity guided leader selection strategy for PSO, denoted as CDLS, in which different leader particles are adaptively selected for each particle based on its corresponding situation of convergence and diversity. In this way, a good tradeoff between the convergence and diversity can be achieved by CDLS. To verify the effectiveness of CDLS, it is embedded into the PSO search process of three well-known PSOs. Furthermore, a new variant of PSO combining with the CDLS strategy, namely PSO/CDLS, is also presented. The experimental results validate the superiority of our proposed CDLS strategy and the effectiveness of PSO/CDLS, when solving numerous MaOPs with regular and irregular Pareto fronts (PFs)
Using Optimality Theory and Reference Points to Improve the Diversity and Convergence of a Fuzzy-Adaptive Multi-Objective Particle Swarm Optimizer
Particle Swarm Optimization (PSO) has received increasing attention from the evolutionary optimization research community in the last twenty years. PSO is a metaheuristic approach based on collective intelligence obtained by emulating the swarming behavior of bees. A number of multi-objective variants of the original PSO algorithm that extend its applicability to optimization problems with conflicting objectives have also been developed; these multi-objective PSO (MOPSO) algorithms demonstrate comparable performance to other state-of-the-art metaheuristics. The existence of multiple optimal solutions (Pareto-optimal set) in optimization problems with conflicting objectives is not the only challenge posed to an optimizer, as the latter needs to be able to identify and preserve a well-distributed set of solutions during the search of the decision variable space. Recent attempts by evolutionary optimization researchers to incorporate mathematical convergence conditions into genetic algorithm optimizers have led to the derivation of a point-wise proximity measure, which is based on the solution of the achievement scalarizing function (ASF) optimization problem with a complementary slackness condition that quantifies the violation of the Karush-Kuhn-Tucker necessary conditions of optimality. In this work, the aforementioned KKT proximity measure is incorporated into the original Adaptive Coevolutionary Multi-Objective Swarm Optimizer (ACMOPSO) in order to monitor the convergence of the sub-swarms towards the Pareto-optimal front and provide feedback to Mamdani-type fuzzy logic controllers (FLCs) that are utilized for online adaptation of the algorithmic parameters. The proposed Fuzzy-Adaptive Multi-Objective Optimization Algorithm with the KKT proximity measure (FAMOPSOkkt) utilizes a set of reference points to cluster the computed nondominated solutions. These clusters interact with their corresponding sub-swarms to provide the swarm leaders and are also utilized to manage the external archive of nondominated solutions. The performance of the proposed algorithm is evaluated on benchmark problems chosen from the multi-objective optimization literature and compared to the performance of state-of-the-art multi-objective optimization algorithms with similar features
A competitive mechanism based multi-objective particle swarm optimizer with fast convergence
In the past two decades, multi-objective optimization has attracted increasing
interests in the evolutionary computation community, and a variety
of multi-objective optimization algorithms have been proposed on the
basis of different population based meta-heuristics, where the family of
multi-objective particle swarm optimization is among the most representative
ones. While the performance of most existing multi-objective particle
swarm optimization algorithms largely depends on the global or personal
best particles stored in an external archive, in this paper, we propose
a competitive mechanism based multi-objective particle swarm optimizer,
where the particles are updated on the basis of the pairwise competitions
performed in the current swarm at each generation. The performance
of the proposed competitive multi-objective particle swarm optimizer is
verified by benchmark comparisons with several state-of-the-art multiobjective
optimizers, including three multi-objective particle swarm optimization
algorithms and three multi-objective evolutionary algorithms.
Experimental results demonstrate the promising performance of the proposed
algorithm in terms of both optimization quality and convergence
speed
Bat Algorithm for Multi-objective Optimisation
Engineering optimization is typically multiobjective and multidisciplinary
with complex constraints, and the solution of such complex problems requires
efficient optimization algorithms. Recently, Xin-She Yang proposed a
bat-inspired algorithm for solving nonlinear, global optimisation problems. In
this paper, we extend this algorithm to solve multiobjective optimisation
problems. The proposed multiobjective bat algorithm (MOBA) is first validated
against a subset of test functions, and then applied to solve multiobjective
design problems such as welded beam design. Simulation results suggest that the
proposed algorithm works efficiently.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1004.417
- …