Search Results - (( time evaluation ((path algorithm) OR (based algorithm)) ) OR ( data distribution a algorithm ))*
Search alternatives:
- data distribution »
- time evaluation »
- path algorithm »
- distribution a »
- a algorithm »
-
1
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 -
2
Adaptive Algorithm for Optimal Route Configuration in Multi-Hop Wireless Sensor Network
Published 2017“…This paper proposes an optimal route configuration technique based on an adaptive genetic algorithm in which the architecture of multi-hop wireless sensor network is considered as a distributed computing infrastructure. …”
Get full text
Get full text
Get full text
Article -
3
An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network
Published 2019“…The best path uses a small amount of energy and will take a short time for packet delivery. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
Enhancing quality of service in Multi-Radio Multi-Channel Wireless Mesh Networks
Published 2023“…The COngestion Reduction Routing Algorithm (CORRA) tackles this challenge by evaluating link quality and interference to find optimal data paths. …”
Get full text
Get full text
Get full text
Thesis -
5
Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network
Published 2019“…In the proposed work, the focused problem is how to reduce the communication energy consumption and to avoid the routing hole problem by optimized routing algorithms. First, a routing hole detection algorithm is proposed prior to designing the routing protocol which decreases about 30 percent energy consumption rate, detection time and detection overhead. …”
Get full text
Get full text
Thesis -
6
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
Get full text
Get full text
Thesis -
7
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 -
8
Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad
Published 2017“…Eventually, the workflow is executed. The second algorithm is a variation in first algorithm in which data parallelism is introduced in each partition. …”
Get full text
Get full text
Get full text
Thesis -
9
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
10
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“…For objective two, three routing strategies were evaluated. Based on a single-vehicle optimal route, the algorithm provided the shortest distance, 91.74 km. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
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 -
12
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 -
13
Shortest Path Trajectory System Based on Dijkstra Algorithm
Published 2012“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
14
Replica Creation Algorithm for Data Grids
Published 2012“…This thesis presents a new replication algorithm that improves data access performance in data grids by distributing relevant data copies around the grid. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
15
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…Subsequently, both algorithms were applied to the test environments. Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
Get full text
Get full text
Thesis -
16
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text
Thesis -
17
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…In the OSM-based scenarios, both algorithms yielded paths of identical length. …”
Get full text
Get full text
Get full text
Article -
18
Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah
Published 2015“…Based on the identified statistical parameters, a new Time Based Policing and Shaping algorithm is developed and simulated. …”
Get full text
Get full text
Article -
19
Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems
Published 2014“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
Get full text
Get full text
Thesis -
20
Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah
Published 2015“…Based on the identified statistical parameters, a new Time Based Policing and Shaping algorithm is developed and simulated. …”
Get full text
Get full text
Thesis