Search Results - (( simulation optimization method algorithm ) OR ( based solving method algorithm ))
Search alternatives:
-
1
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
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
Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation
Published 2022“…Besides, the approach's acquired optimized results are also compared against the simulated original OPF-based MOPSO method and the optimal values of the present literature work to authenticate its effectiveness. …”
Get full text
Get full text
Thesis -
4
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 -
5
Opposition- based simulated kalman filters and their application in system identification
Published 2017“…Metaheuristic optimization algorithms are well-established techniques to address those problems which are difficult to solve through traditional optimization methods. …”
Get full text
Get full text
Thesis -
6
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 -
7
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 -
8
Improved particle swarm optimization by fast annealing algorithm
Published 2019“…The proposed algorithm is meant to solve high dimensional optimization problems based on two strategies, which are utilizing the particle swarm optimization to define the global search area and utilizing the fast-simulated annealing to refine the visited search area. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
9
Application of shuffled frog leaping algorithm for economic dispatch with multiple fuel options / Muhammad Akif Abu Bakar
Published 2016“…The proposed method in solving economic dispatch problem combines the evolutionary algorithm with analytical approach is capable in performing much better in directing the search towards the optimal region. …”
Get full text
Get full text
Thesis -
10
Artificial Immune System Based Remainder Method for Multimodal Mathematical Function Optimization
Published 2011“…Artificial immune system (AIS) is one of the nature-inspired algorithm for solving optimization problems. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability compare to other meta-heuristic methods. …”
Get full text
Get full text
Get full text
Article -
11
-
12
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Conference Paper -
13
A modified n-th section line search in conjugate gradient methods for solving unconstrained optimization / Muhammad Imza Fakhri Jinudin
Published 2018“…Generally, bisection method is the easiest method to solve root of a function. …”
Get full text
Get full text
Thesis -
14
Antibody Remainder Method Based Artificial Immune System for Mathematical Function Optimization
Published 2011Get full text
Get full text
Get full text
Conference or Workshop Item -
15
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…Conclusion: This study has explored the most effective heuristic method for solving TSPs based on the intended solution quality. …”
Get full text
Get full text
Get full text
Article -
16
-
17
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 -
18
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004“…Based on the results of these simulations, we compared the number of iterations needed by each algorithm to arrive at the optimal solution and the CPU time taken for each algorithm to execute the search. …”
Get full text
Get full text
Monograph -
19
Genetic Algorithms In Optimizing Membership Function For Fuzzy Logic Controller
Published 2010“…This research proposes a method that may help users to determine the membership function of FLC using the technique of GA optimization for the fastest processing in solving the problems. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
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
