Search Results - (( time evaluation path algorithm ) OR ( data distribution from algorithm ))*
Search alternatives:
- data distribution »
- distribution from »
- time evaluation »
- evaluation path »
- path algorithm »
- from algorithm »
-
1
Traffic management algorithms for LEO satellite networks
Published 2016“…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
Get full text
Get full text
Get full text
Thesis -
2
Ant system with heuristics for capacitated vehicle routing problem
Published 2013“…As a result, the ASH algorithm is a viable alternative for addressing the CVRP with satisfactory solution quality and run time.…”
Get full text
Get full text
Thesis -
3
An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network
Published 2019“…Currently, the data transmission from sensor nodes to the cluster head uses a single hop which consumes more energy; thus, in this paper the enhancement of previous algorithm, which is MAP, the data transmission will use several paths to reach the cluster head. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
-
5
A Hybrid Metaheuristic Technique Based on Grey Wolf Optimisation, Symbiotic Organism Search, and Ant Colony Optimisation for Solving Multi-Objective Vehicle Routing Problems
Published 2025“…The results were followed by actual shipment data from PT Pos Indonesia’s Boyolali to evaluate its consistency, computational efficiency, and solution quality. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach
Published 2024“…Additionally, a simplified path node strategy is also designed to shorten paths and reduce steering times. …”
Get full text
Get full text
Get full text
Article -
7
Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm
Published 2023“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”
Article -
8
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
Shortest Path Trajectory System Based on Dijkstra Algorithm
Published 2012“…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
Get full text
Get full text
Thesis -
11
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
12
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
Get full text
Get full text
Thesis -
13
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…The evaluation focused on three key performance metrics: computational efficiency, path smoothness, and the number of turns. …”
Get full text
Get full text
Get full text
Article -
14
Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak
Published 2018“…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
Get full text
Get full text
Thesis -
15
Balanced femtocell model to enhance indoor coverage in LTE cellular network / Izwah Ismail
Published 2017“…The walk test performance is evaluated in real time network scenarios, including realistic macro network layouts in homogeneous spatial traffic distributions. …”
Get full text
Get full text
Thesis -
16
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…For test data generation, the existing search-based techniques (SBTs) have been applied to satisfy only one OCL constraint by time. In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text
Thesis -
17
Balanced femtocell model to enhance indoor coverage in LTE cellular network / Izwah Ismail
Published 2018“…The walk test performance is evaluated in real time network scenarios, including realistic macro network layouts in homogeneous spatial traffic distributions. …”
Get full text
Get full text
Book Section -
18
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”
thesis::doctoral thesis -
19
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
Get full text
Get full text
Thesis -
20
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). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text
Thesis