Search Results - (( problem implementation graph algorithm ) OR ( evolution optimization path algorithm ))
Search alternatives:
- problem implementation »
- evolution optimization »
- implementation graph »
- optimization path »
- graph algorithm »
- path algorithm »
-
1
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text
Thesis -
2
Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking
Published 2024“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text
Article -
3
-
4
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 -
5
Differential evolution optimization for constrained routing in Wireless Mesh Networks
Published 2014“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text
Proceeding Paper -
6
An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
Published 2010“…The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.…”
Get full text
Get full text
Conference or Workshop Item -
7
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
Get full text
Get full text
Thesis -
8
An enumerative algorithm for the maximum clique problem
Published 2019“…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
Get full text
Get full text
Conference or Workshop Item -
9
Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri
Published 2021“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text
Student Project -
10
Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri
Published 2022“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text
Research Reports -
11
A hybrid algorithm for finding shortest path in network routing.
Published 2009“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text
Article -
12
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text
Thesis -
13
A quantum algorithm for minimal spanning tree
Published 2008“…Quantum computing algorithms are considered for several problems in graph theory. …”
Get full text
Get full text
Conference or Workshop Item -
14
Bipartite graph approach to course timetabling problems / Hafizah A Razak
Published 2009“…Future research also can be carried out on the timetabling problems implementing other approaches.…”
Get full text
Get full text
Thesis -
15
-
16
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017Get full text
Get full text
Final Year Project -
17
Literature Review of Optimization Techniques for Chatter Suppression In Machining
Published 2011“…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
Get full text
Get full text
Get full text
Article -
18
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text
Thesis -
19
Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators
Published 2024“…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
Get full text
Get full text
Get full text
Article -
20
Partial examination assignment approaches for solving examination timetabling problems
Published 2016“…The entire process runs until all of the examinations are assigned successfully. We have implemented partial graph heuristic with hill climbing (PGH-HC) and partial graph heuristic with modified great deluge algorithm (PGH-mGD) into solving the examination timetabling. …”
Get full text
Get full text
Thesis
