Search Results - (( java _ optimization algorithm ) OR ( using modification (problems OR problem) algorithm ))
Search alternatives:
- using modification »
-
1
-
2
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004“…This study succeeded in overcoming the problem of slow convergence and with the modifications, the new algorithms become more efficient in solving the optimal control problems.…”
Get full text
Get full text
Monograph -
3
-
4
An analysis of the parameter modifications in varieties of harmony search algorithm
Published 2014“…A Harmony Search (HS) algorithm is a population based-meta-heuristics approach that is superior in solving diversified and large scale optimization problems. …”
Get full text
Get full text
Article -
5
-
6
Modification of particle swarm optimization algorithm for optimization of discrete values
Published 2011“…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. …”
Get full text
Get full text
Research Reports -
7
A new variant of black hole algorithm based on multi population and levy flight for clustering problem
Published 2020“…Furthermore, the results revealed a high convergence rate, upon which the algorithm’s performance was subjected to data clustering problems and investigated using six real datasets. …”
Get full text
Get full text
Thesis -
8
Multi-state PSO GSA for solving discrete combinatorial optimization problems
Published 2016“…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
Get full text
Get full text
Thesis -
9
Bio-inspired computation: Recent development on the modifications of the cuckoo search algorithm
Published 2017“…It is found that the population reduction and usage of biased random walk are the most frequently used modifications. This study can be used by both expert and novice researchers for outlining directions for future development, and to find the best modifications, together with the corresponding optimal setting of parameters for specific problems. …”
Get full text
Get full text
Get full text
Get full text
Article -
10
An analysis of the parameter modifications in varieties of harmony search algorithm
Published 2014“…A Harmony Search (HS) algorithm is a population based-meta-heuristics approach that is superior in solving diversified and large scale optimization problems. …”
Get full text
Get full text
Article -
11
Bats echolocation-inspired algorithms for global optimisation problems
Published 2016“…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
Get full text
Get full text
Thesis -
12
1D Multigrid Solver For Finite Element Method
Published 2022“…The new algorithm also has been tested using time simulation. …”
Get full text
Get full text
Monograph -
13
Harmony annealing algorithm for curriculum-based course timetabling problem
Published 2012“…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Branch and bound algorithm for finding the maximum clique problem
Published 2018“…We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. …”
Get full text
Get full text
Conference or Workshop Item -
15
An algorithm for positive solution of boundary value problems of nonlinear fractional differential equations by Adomian decomposition method
Published 2016“…In this paper, an algorithm based on a new modification, developed by Duan and Rach, for the Adomian decomposition method (ADM) is generalized to find positive solutions for boundary value problems involving nonlinear fractional ordinary differential equations. …”
Get full text
Get full text
Get full text
Article -
16
-
17
Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems
Published 2023“…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
Get full text
Get full text
Get full text
Article -
18
Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems
Published 2018“…At present, there are three modifications to the original SKF algorithm in solving combinatorial optimization problems. …”
Get full text
Get full text
Article -
19
Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem
Published 2022“…Multidimensional Knapsack Problem (MKP) has been widely used to model real-life combinatorial problems. …”
Get full text
Get full text
Get full text
Thesis -
20
Accelerating learning performance of back propagation algorithm by using adaptive gain together with adaptive momentum and adaptive learning rate on classification problems
Published 2011“…We use two common benchmark classification problems to illustrate the improvement in convergence time.…”
Get full text
Get full text
Get full text
Article