Search Results - (( simulation optimization search algorithm ) OR ( using optimization path algorithm ))*
Search alternatives:
- optimization search »
- optimization path »
- path algorithm »
-
1
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
2
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text
Thesis -
3
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
Get full text
Get full text
Get full text
Article -
4
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012“…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
Get full text
Get full text
Undergraduates Project Papers -
5
The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation
Published 2023“…This paper proposes a new hybrid of nature inspired optimization algorithm (IFDO-WOABAT) based on the latest optimization algorithm namely Improved Fitness Dependent Optimization (IFDO) with Whale-Bat Optimization algorithm (WOABAT). …”
Get full text
Get full text
Get full text
Proceeding -
6
Path control of dexterous robotic hand using genetic algorithm
Published 2023Subjects:Conference paper -
7
Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm
Published 2025“…Through extensive simulations across various static environment maps, we demonstrate that the ABGPSO algorithm outperforms existing state-of-the-art optimization techniques, including Genetic Algorithms (GA), Grey Wolf Optimization (GWO), and modern optimizers like the Sine Cosine Algorithm (SCA), Harris Hawks Optimization (HHO) and Reptile search algorithm (RSA). …”
Get full text
Get full text
Get full text
Article -
8
Modelling of multi-robot system for search and rescue
Published 2023“…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
9
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
Get full text
Get full text
Thesis -
10
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…Finally, an adaptive neuro-fuzzy inference system (ANFIS) was designed which constructs and optimizes a fuzzy logic controller using a given dataset of input/output variables in order to increase the optimality and stability rates of the proposed path planning algorithm. …”
Get full text
Get full text
Thesis -
11
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
Get full text
Get full text
Undergraduates Project Papers -
12
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Thesis -
13
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text
Thesis -
14
Minimization of tool path length of drilling process using particle swarm optimization (PSO)
Published 2020“…For this study, the main purpose is to apply the Particle Swarm Optimization (PSO) algorithm for use in searching for the optimal tool routing path for in simulation of drilling process…”
Get full text
Get full text
Book Section -
15
-
16
Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm
Published 2016“…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 -
17
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 -
18
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 -
19
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 -
20
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item
