Search Results - (( simulation optimization path algorithm ) OR ( using solution using algorithm ))
Search alternatives:
- optimization path »
- using algorithm »
- path algorithm »
- using solution »
- solution using »
-
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
An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town
Published 2005“…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
Get full text
Get full text
Get full text
Thesis -
3
Optimization of drilling path using the bees algorithm
Published 2021“…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
Get full text
Get full text
Get full text
Article -
4
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
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 -
7
Single-solution simulated Kalman Filter algorithm for routing in printed circuit board drilling process
Published 2018“…It uses only a single agent to solve optimization process by finding the estimate of the optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Book Chapter -
8
-
9
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. …”
Get full text
Get full text
Get full text
Article -
10
Optimised multi-robot path planning via smooth trajectory generation
Published 2024“…A MPSO algorithm, without path smoothening, is used for comparison. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
11
Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm
Published 2016“…The ST itself is a conceptual framework that examines, reframes the problem and finds the solution. Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
An adaptive relay selection scheme for enhancing network stability in VANETs
Published 2020“…Simulation experiments using the network simulator are presented to demonstrate the effectiveness of our solution. …”
Get full text
Get full text
Get full text
Article -
13
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
14
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 -
15
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
-
17
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. …”
Get full text
Get full text
Get full text
Article -
18
A Kalman Filter Approach to PCB Drill Path Optimization Problem
Published 2017“…This paper presents a Kalman Filter approach in solving printed circuit board (PCB) routing problem by using the Simulated Kalman Filter (SKF) algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Designated Path Routing Algorithm For Dense Wireless Sensor Network
Published 2021“…The results have shown better network performance and energy consumption can be achieved using the proposed algorithm when compared to the others…”
Get full text
Get full text
Get full text
Get full text
Article -
20
