Journal Article10.1007/S40997-016-0066-9
Multi-tracker Optimization Algorithm: A General Algorithm for Solving Engineering Optimization Problems
39
TL;DR: This new algorithm, which is named as “multi-tracker optimization algorithm,” due to a multi-level structure of trackers within it, has some unique features, such as increasing the accuracy of the optimal point and continuous local search after convergence in order to escape from local minima simultaneously.
read more
Abstract: In this paper, a new computational population-based optimization algorithm, which is designed based on the advantages and disadvantages of other evolutionary optimization algorithms introduced so far, is proposed. This new algorithm, which is named as “multi-tracker optimization algorithm,” due to a multi-level structure of trackers within it, has some unique features, such as increasing the accuracy of the optimal point and continuous local search after convergence in order to escape from local minima simultaneously. Another important advantage of this algorithm is optimizing time-varying dynamical problems and tracking the optimal point. These characteristics make the algorithm very efficient for optimization problems, especially in the field of engineering. For a thorough investigation and comparison of this algorithm with other efficient optimization algorithms, different optimization problems such as static, dynamic, unconstrained and constrained, each of which has different challenges, are considered. The results of applying this algorithm on the abovementioned basic problems show the superiority of this algorithm over other efficient evolutionary algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
SSC: A hybrid nature-inspired meta-heuristic optimization algorithm for engineering applications
TL;DR: Experimental results based on IEEE CEC’17 and six real-life engineering problems demonstrate the robustness, effectiveness, efficiency, and convergence analysis of the proposed SSC algorithm in comparison with other competitor approaches.
112
Predicting Compressive Strength of Manufactured-Sand Concrete Using Conventional and Metaheuristic-Tuned Artificial Neural Network
TL;DR: Wang et al. as mentioned in this paper implemented two ANN-based scenarios to approximate the uniaxial compressive strength of manufactured-sand concrete, and two improved ANNs were created with metaheuristic algorithms, namely biogeography-based optimization (BBO) and multi-tracker optimization algorithm (MTOA).
90
Optimal design of nonlinear model predictive controller based on new modified multitracker optimization algorithm
Mahmoud Elsisi,Mahmoud Elsisi +1 more
TL;DR: An optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA), which improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum.
72
SChoA: a newly fusion of sine and cosine with chimp optimization algorithm for HLS of datapaths in digital filters and engineering applications
TL;DR: The sine–cosine functions have been applied to update the equations of chimps during the search process for reducing the several drawbacks of the ChoA algorithm such as slow convergence rate, locating local minima rather than global minima, and low balance amid exploitation and exploration.
66
Optimal interval type-2 fuzzy fractional order super twisting algorithm: A second order sliding mode controller for fully-actuated and under-actuated nonlinear systems
TL;DR: The simulation and experimental results demonstrate the superiority of the IT2FFOSTA in reducing the amount of chattering, tracking error, and control effort compared to those of the other control methods.
61
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
Particle swarm optimization
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
44.1K
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces
Rainer Storn,Kenneth Price +1 more
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
A new optimizer using particle swarm theory
Russell C. Eberhart,James Kennedy +1 more
- 04 Oct 1995
TL;DR: The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
16.4K
Ant system: optimization by a colony of cooperating agents
Marco Dorigo,Vittorio Maniezzo,Alberto Colorni +2 more
- 01 Feb 1996
TL;DR: It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.