Search Results - (( using implementation path algorithm ) OR ( simulation optimization method algorithm ))
Search alternatives:
- using implementation »
- implementation path »
- method algorithm »
- path algorithm »
-
1
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
2
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
Get full text
Thesis -
3
New algorithm for autonomous dynamic path planning in real-time intelligent robot car
Published 2017“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text
Article -
4
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
5
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
6
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
7
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
8
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
9
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 -
10
Minimization of machining process sequence based on ant colony algorithm and conventional method
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Get full text
Article -
11
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
12
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
13
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
14
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 -
15
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
Get full text
Get full text
Thesis -
16
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text
Article -
17
A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree
Published 2022“…The rough path is optimized by applying the cubic spline interpolation method to solve the problem that the path cannot be applied to the actual vehicle driving task. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
18
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 -
19
Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method
Published 2021“…This paper presents the results of optimization for substation grounding systems using the Simulated Annealing (SA) algorithm in different soil conditions which conforms to the safety requirements of the grounding system. …”
Get full text
Get full text
Article -
20
Robotic path planning using rapidly-exploring random trees
Published 2013“…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
Get full text
Get full text
Get full text
Thesis
