Search Results - (( using simulation search algorithm ) OR ( using optimization method algorithm ))
Search alternatives:
- method algorithm »
- search »
-
1
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
Get full text
Get full text
Thesis -
2
Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem
Published 2008“…Genetic Algorithm as population-based methods are better identifying promising areas in the search space, while Tabu Search and Simulated Annealing as trajectory methods are better in exploring promising areas in search space. …”
Get full text
Get full text
Monograph -
3
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text
Thesis -
4
Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions
Published 2018“…In addition, the simulation random data for were used to solve single and bi-objective optimization PP and Sch.P to improve the validation and verify the performance of the proposed algorithms. …”
Get full text
Get full text
Thesis -
5
Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems
Published 2017“…The invasive weed optimization (IWO) algorithm, on the other hand, is effective in accurate global search, but not in local search. …”
Get full text
Get full text
Get full text
Article -
6
A Hybrid Method Based on Cuckoo Search Algorithm for Global Optimization Problems
Published 2018“…However, it undergoes the premature convergence problem for high dimensional problems because the algorithm converges rapidly. Therefore, we proposed a robust approach to solve this issue by hybridizing optimization algorithm, which is a combination of Cuckoo search algorithm and Hill climbing called CSAHC discovers many local optimum traps by using local and global searches, although the local search method is trapped at the local minimum point. …”
Get full text
Get full text
Get full text
Article -
7
Optimization of Grading Ring Design for Metal Oxide Arrester Using Gravitational Search Algorithm
Published 2023Conference Paper -
8
Short-Term Electricity Price Forecasting via Hybrid Backtracking Search Algorithm and ANFIS Approach
Published 2019“…In addition, to prove the superiority of the proposed hybrid forecasting method the simulation results obtained using ANN and ANFIS models optimized by other well-known optimization methods have been compared with that of proposed method. © 2019 IEEE.…”
Get full text
Get full text
Article -
9
-
10
-
11
Improved cuckoo search based neural network learning algorithms for data classification
Published 2014“…In the proposed HACPSO algorithm, initially accelerated particle swarm optimization (APSO) algorithm searches within the search space and finds the best sub-search space, and then the CS selects the best nest by traversing the sub-search space. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
-
13
-
14
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
Get full text
Get full text
Thesis -
15
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
Get full text
Thesis -
16
-
17
Four Different Methods to Hybrid Simulated Kalman Filter (SKF) with Gravitational Search Algorithm (GSA)
Published 2016“…The performance of the hybrid SKF-GSA algorithms is compared against the original SKF using CEC2014 benchmark dataset for continuous numerical optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
Published 2011“…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
Get full text
Get full text
Get full text
Monograph -
19
An improved particle swarm optimization based on lévy flight and simulated annealing for high dimensional optimization problem
Published 2022“…The proposed algorithm uses two strategies to address high-dimensional problems: hybrid PSO to define the global search area and fast simulated annealing to refine the visited search region. …”
Get full text
Get full text
Get full text
Article -
20
