Search Results - (( based solving based algorithm ) OR ( using optimization based algorithm ))
Search alternatives:
-
1
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
2
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text
Thesis -
3
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem
Published 2015“…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems
Published 2022“…To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. …”
Get full text
Get full text
Get full text
Article -
5
-
6
Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems
Published 2020“…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
Finite impulse response optimizers for solving optimization problems
Published 2019“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text
Thesis -
8
Finite impulse response optimizers for solving optimization problems
Published 2019“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text
Thesis -
9
Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems
Published 2011“…Instead of solving the original optimal control problem, the model-based optimal control problem is solved. …”
Get full text
Get full text
Thesis -
10
A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem
Published 2017“…To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
Get full text
Get full text
Get full text
Article -
11
Review of Multi-Objective Swarm Intelligence Optimization Algorithms
Published 2021“…The MOSI algorithms are based on the integration of single objective algorithms and multi-objective optimization (MOO) approach. …”
Get full text
Get full text
Article -
12
A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem
Published 2017“…To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
Get full text
Get full text
Get full text
Article -
13
Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions
Published 2018“…The second technique is to solve bi-objective functions by using the BOBAT algorithm. …”
Get full text
Get full text
Thesis -
14
Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems
Published 2021“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
15
Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
Published 2019“…This paper proposes Opposition-based Whale Optimization Algorithm (OWOA) to optimize solution problem in 0/1 Knapsack. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
A firefly algorithm based hybrid method for structural topology optimization
Published 2020“…In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. …”
Get full text
Get full text
Article -
17
Optimal power flow based on fuzzy linear programming and modified Jaya algorithms
Published 2017“…In addition, two novel Jaya-based methods namely, the modified Jaya (MJaya) algorithm and quasi-oppositional modified Jaya (QOMJaya) algorithm are proposed to solve different MOOPF problems. …”
Get full text
Get full text
Thesis -
18
A Multi-objective Evolutionary Algorithm Based On Decomposition For Continuous Optimization Using A Step-function Technique
Published 2022“…Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) is one of the algorithms that utilize the concepts of decomposition and neighbourhood to solve multi-objective problems. …”
Get full text
Get full text
Thesis -
19
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
Published 2024“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Thesis -
20
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…Although several extensions of the sampling-based algorithms have been proposed for solving each drawback, but the lack of a randomized planner that overcomes abovementioned inefficiencies in a single package is evident and makes the sampling-based path planning less effective for certain purposes. …”
Get full text
Get full text
Thesis
