Search Results - ((((((path algorithm) OR (ant algorithm))) OR (_ algorithm))) OR (based algorithm))
Search alternatives:
- path algorithm »
- ant algorithm »
-
1
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 -
2
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
3
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
4
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
5
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
6
Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks
Published 2009“…Ants’ algorithm belongs to the Swarm Intelligence (SI), which is proposed to find the shortest path. …”
Get full text
Get full text
Thesis -
7
Minimization of machining process sequence based on ant colony algorithm and conventional method
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Get full text
Article -
8
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
9
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
10
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
11
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…The main goal of this research is to compare the performances between Genetic Algorithm (GA) and Ant Colony Optimization (ACO) algorithm. …”
Get full text
Get full text
Thesis -
12
QoS based fair load-balancing: paradigm to IANRA routing algorithm for wireless networks (WNs)
Published 2008“…In this paper, a new algorithm, Intelligent agent AntNet based Routing Algorithm (IANRA) is proposed to enhance load balancing strategy in Wireless Networks (WNs). …”
Get full text
Get full text
Conference or Workshop Item -
13
AntNet: a robust routing algorithm for data networks
Published 2004“…It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. …”
Get full text
Get full text
Get full text
Article -
14
Analysis of Dijkstra’s and A* algorithm to find the shortest path
Published 2015“…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
15
Multi agent quality of service routing based on scheme ant colony optimization algorithm
Published 2014“…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text
Thesis -
16
High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm
Published 2015“…The objective is to design and develop an evacuation route using shortest path algorithm based on the evacuation map of the building. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Performance analysis of ant colony's algorithm: load-balancing in QoS-based wireless mesh networks routing
Published 2008“…The design of the algorithm is based on: the specific self-organizing behavior of ant colonies, the shortest path discovery, and the related framework of ant colony optimization (ACO). …”
Get full text
Get full text
Get full text
Article -
18
Adaptive route optimization for mobile robot navigation using evolutionary algorithm
Published 2021“…In autonomous robot design, the main problem faced by researchers is the path planning of mobile robot. Various kind of path planning algorithm was introduced in the past, but no algorithm has absolute superior towards the others algorithm. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
19
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019Subjects: Get full text
Get full text
Thesis -
20
Heuristic factors in ant system algorithm for course timetabling problem
Published 2009“…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
Get full text
Get full text
Conference or Workshop Item
