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
Adaptive multi-tracker optimization algorithm for global optimization problems: emphasis on applications in chemical engineering
TL;DR: Applying this algorithm to several unconstrained and constrained general benchmarks along with several chemical engineering optimization problems reveal that AMTOA outperforms other well-known methods such as genetic algorithm (GA), particle swarm optimization (PSO), gray wolf optimizer (GWO), whale optimization algorithm (WOA), and conventional MTOA.
An efficient improved African vultures optimization algorithm with dimension learning hunting for traveling salesman and large‐scale optimization applications
TL;DR: In this paper , a novel dimension learning hunting (DLHAV) algorithm is proposed to resolve highly complex continuous and discrete applications, which helps in improving the balance amid global and local and sustains diversity.
A generally modified cuckoo optimization algorithm for crack detection in cantilever Euler-Bernoulli beams
TL;DR: In this paper, a new and generally modified Cuckoo Optimization Algorithm (GMCOA) for solving the problem of detecting and estimating open-edge cracks in cantilever Euler-Bernoulli beams is proposed.
Metaheuristic-designed systems for simultaneous simulation of thermal loads of building
Chang Lin,Junsong Wang +1 more
TL;DR: This study employs the Water Cycle Algorithm to optimize a neural network for simultaneous prediction of heating and cooling loads in residential buildings, outperforming five benchmark optimizers with larger accuracy and providing an explicit predictive formula.
Hybridizing sine–cosine algorithm with harmony search strategy for optimization design problems
Narinder Singh,Jaspreet Kaur +1 more
- 19 May 2021
TL;DR: Experimental solutions reveal that the hybrid approach is able to finding the superior quality of optimal goal (or solution) of the optimize functions in most cases in comparison with others.
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.