Multiple Target Exploration Approach for Design Exploration Using a Swarm Intelligence and Clustering

2019 ◽  
Vol 141 (9) ◽  
Author(s):  
Hyeongmin Han ◽  
Sehyun Chang ◽  
Harrison Kim
Keyword(s):  
Design Problem ◽  
Optimization Problems ◽  
Complete Solution ◽  
Solution Space ◽  
Analytical Models ◽  
Target Point ◽  
Design Exploration ◽  
Exploration Process ◽  
Engineering Design Problems

In engineering design problems, performance functions evaluate the quality of designs. Among the designs, some of them are classified as good designs if responses from performance functions satisfy a target point or range. An infinite set of good designs in the design space is defined as a solution space of the design problem. In practice, since the performance functions are analytical models or black-box simulations which are computationally expensive, it is difficult to obtain a complete solution space. In this paper, a method that finds a finite set of good designs, which is included in a solution space, is proposed. The method formulates the problem as optimization problems and utilizes gray wolf optimizer (GWO) in the way of design exploration. Target points of the exploration process are defined by clustering intermediate solutions for every iteration. The method is tested with a simple two-dimensional problem and an automotive vehicle design problem to validate and check the quality of solution points.

scholarly journals An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems

2022 ◽  
Vol 19 (1) ◽  
pp. 473-512
Author(s):  
Rong Zheng ◽  
◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Heuristic Method ◽  
Population Diversity ◽  
Test Functions ◽  
Design Problems ◽  
Local Optima ◽  
Switching Mechanism ◽  
Engineering Design Problems

<abstract> <p>Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (<italic>RMOP</italic>) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.</p> </abstract>

An Alternative Formulation of Collaborative Optimization Based on Geometric Analysis

2011 ◽  
Vol 133 (5) ◽  
Author(s):  
Xiang Li ◽  
Changan Liu ◽  
Weiji Li ◽  
Teng Long
Keyword(s):  
Design Problem ◽  
Optimization Problems ◽  
Geometric Analysis ◽  
Equality Constraints ◽  
Collaborative Optimization ◽  
System Level ◽  
Alternative Formulation ◽  
Linear Approximations ◽  
Engineering Design Problems ◽  
Level Problem

Collaborative optimization (CO) is a multidisciplinary design optimization (MDO) method with bilevel computational structure, which decomposes the original optimization problem into one system-level problem and several subsystem problems. The strategy of decomposition in CO is a useful way for solving large engineering design problems. However, the computational difficulties caused by the system-level consistency equality constraints hinder the development of CO. In this paper, an alternative formulation of CO called CO with combination of linear approximations (CLA-CO) is presented based on the geometric analysis of CO, which is more intuitive and direct than the previous algebraic analysis. In CLA-CO, the consistency equality constraints in CO are replaced by linear approximations to the subsystem responses. As the iterative process goes on, more linear approximations are added into the system level. Consequently, the combination of these linear approximations makes the system-level problem gradually approximate the original problem. In CLA-CO, the advantages of the decomposition strategy are maintained while the computational difficulties of the conventional CO are avoided. However, there are still difficulties in applying the presented CLA-CO to problems with nonconvex constraints. The application of CLA-CO to three optimization problems, a numerical test problem, a composite beam design problem, and a gear reducer design problem, illustrates the capabilities and limitations of CLA-CO.

scholarly journals A New Approach to Enhanced Swarm Intelligence Applied to Video Target Tracking

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1903
Author(s):  
Edwards Cerqueira de Castro ◽  
Evandro Ottoni Teatini Salles ◽  
Patrick Marques Ciarelli
Keyword(s):  
Success Rate ◽  
Swarm Intelligence ◽  
Processing Time ◽  
Optimization Problems ◽  
Solution Space ◽  
Dynamic Optimization Problems ◽  
Shuffled Frog Leaping Algorithm ◽  
New Approach ◽  
Shuffled Frog Leaping

This work proposes a new approach to improve swarm intelligence algorithms for dynamic optimization problems by promoting a balance between the transfer of knowledge and the diversity of particles. The proposed method was designed to be applied to the problem of video tracking targets in environments with almost constant lighting. This approach also delimits the solution space for a more efficient search. A robust version to outliers of the double exponential smoothing (DES) model is used to predict the target position in the frame delimiting the solution space in a more promising region for target tracking. To assess the quality of the proposed approach, an appropriate tracker for a discrete solution space was implemented using the meta-heuristic Shuffled Frog Leaping Algorithm (SFLA) adapted to dynamic optimization problems, named the Dynamic Shuffled Frog Leaping Algorithm (DSFLA). The DSFLA was compared with other classic and current trackers whose algorithms are based on swarm intelligence. The trackers were compared in terms of the average processing time per frame and the area under curve of the success rate per Pascal metric. For the experiment, we used a random sample of videos obtained from the public Hanyang visual tracker benchmark. The experimental results suggest that the DSFLA has an efficient processing time and higher quality of tracking compared with the other competing trackers analyzed in this work. The success rate of the DSFLA tracker is about 7.2 to 76.6% higher on average when comparing the success rate of its competitors. The average processing time per frame is about at least 10% faster than competing trackers, except one that was about 26% faster than the DSFLA tracker. The results also show that the predictions of the robust DES model are quite accurate.

scholarly journals Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms

2019 ◽  
Author(s):  
Miguel Terra-Neves ◽  
Inês Lynce ◽  
Vasco Manquinho
Keyword(s):  
Evolutionary Algorithms ◽  
Optimization Problems ◽  
State Of The Art ◽  
Solution Space ◽  
Problem Instance ◽  
Multi Objective ◽  
Constraint Reasoning ◽  
Problem Instances ◽  
Quality Of The Population

Constraint-based reasoning methods thrive in solving problem instances with a tight solution space. On the other hand, evolutionary algorithms are usually effective when it is not hard to satisfy the problem constraints. This dichotomy has been observed in many optimization problems. In the particular case of Multi-Objective Combinatorial Optimization (MOCO), new recently proposed constraint-based algorithms have been shown to outperform more established evolutionary approaches when a given problem instance is hard to satisfy. In this paper, we propose the integration of constraint-based procedures in evolutionary algorithms for solving MOCO. First, a new core-based smart mutation operator is applied to individuals that do not satisfy all problem constraints. Additionally, a new smart improvement operator based on Minimal Correction Subsets is used to improve the quality of the population. Experimental results clearly show that the integration of these operators greatly improves multi-objective evolutionary algorithms MOEA/D and NSGAII. Moreover, even on problem instances with a tight solution space, the newly proposed algorithms outperform the state-of-the-art constraint-based approaches for MOCO.

Software suite for determining the tilts of tower-type structures according to terrestrial laser scanning

2020 ◽  
Vol 961 (7) ◽  
pp. 2-7
Author(s):  
A.V. Zubov ◽  
N.N. Eliseeva
Keyword(s):  
Laser Scanning ◽  
Optimization Problems ◽  
Optimization Methods ◽  
User Participation ◽  
Software Suite ◽  
Current State ◽  
Visual Basic For Applications ◽  
Operational Data ◽  
Theoretical Developments

The authors describe a software suite for determining tilt degrees of tower-type structures according to ground laser scanning indication. Defining the tilt of the pipe is carried out with a set of measured data through approximating the sections by circumferences. They are constructed using one of the simplest search engine optimization methods (evolutionary algorithm). Automatic filtering the scan of the current section from distorting data is performed by the method of assessing the quality of models constructed with that of least squares. The software was designed using Visual Basic for Applications. It contains several blocks (subprograms), with each of them performing a specific task. The developed complex enables obtaining operational data on the current state of the object with minimal user participation in the calculation process. The software suite is the result of practical implementing theoretical developments on the possibilities of using search methods at solving optimization problems in geodetic practice.

scholarly journals Multi-Task Optimization and Multi-Task Evolutionary Computation in the Past Five Years: A Brief Review

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 864
Author(s):  
Qingzheng Xu ◽  
Na Wang ◽  
Lei Wang ◽  
Wei Li ◽  
Qian Sun
Keyword(s):  
Evolutionary Computation ◽  
Explicit Knowledge ◽  
Optimization Problems ◽  
Effective Means ◽  
Typical Application ◽  
The Past ◽  
Current State ◽  
Evolution Algorithms ◽  
Application Fields

Traditional evolution algorithms tend to start the search from scratch. However, real-world problems seldom exist in isolation and humans effectively manage and execute multiple tasks at the same time. Inspired by this concept, the paradigm of multi-task evolutionary computation (MTEC) has recently emerged as an effective means of facilitating implicit or explicit knowledge transfer across optimization tasks, thereby potentially accelerating convergence and improving the quality of solutions for multi-task optimization problems. An increasing number of works have thus been proposed since 2016. The authors collect the abundant specialized literature related to this novel optimization paradigm that was published in the past five years. The quantity of papers, the nationality of authors, and the important professional publications are analyzed by a statistical method. As a survey on state-of-the-art of research on this topic, this review article covers basic concepts, theoretical foundation, basic implementation approaches of MTEC, related extension issues of MTEC, and typical application fields in science and engineering. In particular, several approaches of chromosome encoding and decoding, intro-population reproduction, inter-population reproduction, and evaluation and selection are reviewed when developing an effective MTEC algorithm. A number of open challenges to date, along with promising directions that can be undertaken to help move it forward in the future, are also discussed according to the current state. The principal purpose is to provide a comprehensive review and examination of MTEC for researchers in this community, as well as promote more practitioners working in the related fields to be involved in this fascinating territory.

scholarly journals ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov
Keyword(s):  
Decision Making ◽  
Knapsack Problem ◽  
Propositional Logic ◽  
Optimization Problems ◽  
Real Life ◽  
Combinatorial Optimization Problems ◽  
Intuitionistic Fuzzy ◽  
Life Problems ◽  
Multiple Constraint

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.

scholarly journals A Multimodal Smart Quantum Particle Swarm Optimization for Electromagnetic Design Optimization Problems

Energies ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4613
Author(s):  
Shah Fahad ◽  
Shiyou Yang ◽  
Rehan Ali Khan ◽  
Shafiullah Khan ◽  
Shoaib Ahmed Khan
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Quantum Particle ◽  
Particle Swarm ◽  
Continuous Variables ◽  
Design Problems ◽  
Swarm Optimization ◽  
Electromagnetic Design ◽  
Quantum Particle Swarm Optimization ◽  
Engineering Design Problems

Electromagnetic design problems are generally formulated as nonlinear programming problems with multimodal objective functions and continuous variables. These can be solved by either a deterministic or a stochastic optimization algorithm. Recently, many intelligent optimization algorithms, such as particle swarm optimization (PSO), genetic algorithm (GA) and artificial bee colony (ABC), have been proposed and applied to electromagnetic design problems with promising results. However, there is no universal algorithm which can be used to solve engineering design problems. In this paper, a stochastic smart quantum particle swarm optimization (SQPSO) algorithm is introduced. In the proposed SQPSO, to tackle the premature convergence problem in order to improve the global search ability, a smart particle and a memory archive are adopted instead of mutation operations. Moreover, to enhance the exploration searching ability, a new set of random numbers and control parameters are introduced. Experimental results validate that the adopted control policy in this work can achieve a good balance between exploration and exploitation. Finally, the SQPSO has been tested on well-known optimization benchmark functions and implemented on the electromagnetic TEAM workshop problem 22. The simulation result shows an outstanding capability of the proposed algorithm in speeding convergence compared to other algorithms.

Socio-Technical Modeling to Manage Power Distribution for Microgrid Systems with Limited Production Capacity

2021 ◽  
pp. 1-38
Author(s):  
Hailie Suk ◽  
Ayushi Sharma ◽  
Anand Balu Nellippallil ◽  
Ashok Das ◽  
John Hall
Keyword(s):  
Rural Communities ◽  
Power Distribution ◽  
Production Capacity ◽  
Solution Space ◽  
Decision Makers ◽  
Safety Education ◽  
Water Safety ◽  
Water Safety Education ◽  
Water Pumps

Abstract The quality of life (QOL) in rural communities is improved through electrification. Microgrids can provide electricity in areas where grid access to electricity is infeasible. Still, insufficient power capacity hinders the very progress that microgrids promote. Therefore, we propose a decision-making framework to manage power distribution based on its impact on the rural QOL. Parameters are examined in this paper to represent the QOL pertaining to water, safety, education, and leisure/social activities. Each parameter is evaluated based on condition, community importance, and energy dependence. A solution for power allocation is developed by executing the compromise decision support problem (cDSP) and exploring the solution space. Energy loads, such as those required for powering water pumps, streetlamps, and household devices are prioritized in the context of the QOL. The technique also allows decision-makers to update the power distribution scheme as the dynamics between energy production and demand change over time. In this paper, we propose a framework for connecting QOL and power management. The flexibility of the approach is demonstrated using a problem with varying scenarios that may be time-dependent. The work enables sustainable energy solutions that can evolve with community development.

Sign in / Sign up

Export Citation Format

Share Document