Search Results - (( simulation optimization (problems OR problem) algorithm ) OR ( java applications a algorithm ))
Search alternatives:
- java applications »
- applications a »
- a algorithm »
-
1
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
2
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
3
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
4
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
5
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
6
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…Another type of algorithm is called numerical algorithms. These algorithms were built specifically to address numerical optimization problems. …”
Get full text
Get full text
Thesis -
7
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 -
8
Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems
Published 2016“…However, the SKF is only capable to solve continuous numerical optimization problem. In order to solve discrete optimization problems, the SKF algorithm is combined with an angle modulated approach. …”
Get full text
Get full text
Get full text
Get full text
Article -
9
Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm
Published 2016“…To evaluate the performance of the Simulated Kalman Filter algorithm, it is applied to 30 benchmark functions of CEC 2014 for real-parameter single objective optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems
Published 2018“…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
Get full text
Get full text
Get full text
Get full text
Article -
11
Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems
Published 2018“…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
Get full text
Get full text
Article -
12
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Most metaheuristic algorithms are designed for continuous optimization problem. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Opposition-based learning simulated kalman filter for Numerical optimization problems
Published 2016“…Simulated Kalman Filter (SKF) optimization algorithm is a population-based optimizer operated mainly based on Kalman filtering. …”
Get full text
Get full text
Research Book Profile -
14
Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation
Published 2022“…This thesis proposes and simulates the three novel optimization algorithms to handle DG allocation, different single-objective, and multi-objective OPF problems. …”
Get full text
Get full text
Thesis -
15
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 -
16
-
17
A Kalman Filter Approach for Solving Unimodal Optimization Problems
Published 2015“…In this paper, a new population-based metaheuristic optimization algorithm, named Simulated Kalman Filter (SKF) is introduced. …”
Get full text
Get full text
Get full text
Article -
18
Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management
Published 2017“…After critical assessments of the performances of eleven algorithms consisting of two heuristics (Randomized Insertion Algorithm and the Honey Bee Mating Optimization for the Travelling Salesman’s Problem), two trajectory algorithms (Simulated Annealing and Evolutionary Simulated Annealing) and seven population-based optimization algorithms (Genetic Algorithm, Artificial Bee Colony, African Buffalo Optimization, Bat Algorithm, Particle Swarm Optimization, Ant Colony Optimization and Firefly Algorithm) in solving the 60 popular and complex benchmark symmetric Travelling Salesman’s optimization problems out of the total 118 as well as all the 18 asymmetric Travelling Salesman’s Problems test cases available in TSPLIB91. …”
Get full text
Get full text
Get full text
Article -
19
Distance Evaluated Simulated Kalman Filter for Combinatorial Optimization Problems
Published 2015“…Inspired by the estimation capability of Kalman filter, we have recently introduced a novel estimation-based optimization algorithm called simulated Kalman filter (SKF). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20