Search Results - (( time optimization path algorithm ) OR ( using solution using algorithm ))
Search alternatives:
- time optimization »
- optimization path »
- using algorithm »
- path algorithm »
- using solution »
- solution using »
-
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
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text
Article -
3
Optimization of multi-holes drilling path using particle swarm optimization
Published 2022“…This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
Get full text
Get full text
Thesis -
4
Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization
Published 2011“…In this research, the Genetic Algorithms (GA) is used to optimize the word length of FFT coefficients to maintain the SNR value and reduce the SA at the same time. …”
Get full text
Get full text
Thesis -
5
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 -
6
Application of the Bees Algorithm to find optimal drill path sequence
Published 2024“…The Bees Algorithm was run using R Software. The results found are compared with the results of other algorithms in terms of the drill path length and machining time. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
7
Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming
Published 2016“…Cooperative path planning fuses information from all agents to plan an optimal path. …”
Get full text
Get full text
Article -
8
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
9
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
10
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 -
11
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text
Thesis -
12
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
13
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 -
14
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). …”
Get full text
Get full text
Get full text
Article -
15
Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems
Published 2014“…The algorithm generates an integrated scheduling and detail paths route while optimizing makespan, AGV travel time, mean flow time and penalty cost due to jobs tardiness and delay as a result of conflict avoidance. …”
Get full text
Get full text
Thesis -
16
-
17
Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman
Published 2020“…Unity Engine provide its own pathfinding solution using A* algorithm with Navigation Mesh (NavMesh) map representation. …”
Get full text
Get full text
Thesis -
18
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
Get full text
Get full text
Get full text
Article -
19
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 -
20
Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments
Published 2013“…The recent development of its variant: RRT* is considered as a major breakthrough as it makes it possible to achieve optimality in paths planning. However, its limitations include the infinite time it takes to reach the optimal solution and a very slow rate of convergence. …”
Get full text
Get full text
Get full text
Article
