Search Results - (( solution simulation approach algorithm ) OR ( java application learning algorithm ))
Search alternatives:
- application learning »
- solution simulation »
- learning algorithm »
- java application »
-
1
-
2
A multiobjective simulated Kalman filter optimization algorithm
Published 2018“…A synergy between SKF and Non-dominated Solution (NS) approach is introduced to formulate the multiobjective type algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
A branch and bound and simulated annealing approach for job shop scheduling
Published 2004“…This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. …”
Get full text
Get full text
Article -
4
Simulated annealing algorithm for scheduling divisible load in large scale data grids.
Published 2009“…SA algorithm is integrated with DLT model and compared with the previous approaches. …”
Get full text
Get full text
Article -
5
Single-Solution Simulated Kalman Filter Algorithm for Global Optimisation Problems
Published 2016“…This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisa- tion algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. …”
Get full text
Get full text
Article -
6
Simulated annealing algorithm for scheduling divisible load in large scale data grids
Published 2008“…SA algorithm is integrated with DLT model and compared with the previous approaches. …”
Get full text
Get full text
Conference or Workshop Item -
7
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text
Thesis -
8
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
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 -
10
Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation
Published 2022“…And optimal results for single, two, and three DG allocation cases are obtained. The simulated results from the proposed DG-based SMA approach are also matched with the calculated solutions of the biogeography-based optimization (BBO) approach. …”
Get full text
Get full text
Thesis -
11
Single-solution Simulated Kalman Filter algorithm for global optimisation problems
Published 2018“…This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisation algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. …”
Get full text
Get full text
Article -
12
Single-solution Simulated Kalman Filter algorithm for global optimisation problems
Published 2018“…This paper introduces single-solution Simulated Kalman Filter (ssSKF), a new single-agent optimisation algorithm inspired by Kalman Filter, for solving real-valued numerical optimisation problems. …”
Get full text
Get full text
Article -
13
A New Approach To The Solution Of Economic Dispatch Using Genetic Algorithm
Published 2016“…The main idea of this paper focuses on the application of genetic algorithm in order to identify the best solution to an economic dispatch problem by using a new approach depending on Bmn coefficients and arithmetic crossover of the genetic algorithm. …”
Get full text
Get full text
Get full text
Article -
14
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text
Thesis -
15
Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm
Published 2016“…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
Conference or Workshop Item -
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
An improved tabu search for solving symmetric traveling salesman problems
Published 2011“…The proposed algorithm is an integration of two heuristic approaches which are TS and simulated annealing (SA). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Simulated annealing algorithm for solving chambering student-case assignment problem
Published 2015“…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20
Relative motion and autonomous rendezvous in Keplerian elliptic orbits
Published 2010“…Autonomous guidance algorithms to approach, to flyaround, and to depart from a target vehicle in elliptic orbits are exploited based on that solution. …”
Get full text
Get full text
Get full text
Proceeding Paper
