Search Results - (( developing selection path algorithm ) OR ( using simulation optimization algorithm ))
Search alternatives:
- developing selection »
- selection path »
- path algorithm »
-
1
Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization
Published 2015“…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
Get full text
Get full text
Get full text
Article -
2
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. …”
Get full text
Get full text
Thesis -
3
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
Get full text
Get full text
Thesis -
4
Levy slime mould algorithm for solving numerical and engineering optimization problems
Published 2022“…Therefore, for solving the SMA algorithm local optima problem, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network
Published 2020“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text
Thesis -
6
Predetermined path of mobile data gathering in wireless sensor networks based on network layout
Published 2014“…Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. …”
Get full text
Get full text
Article -
7
Efficient relay placement algorithm using landscape aware routing (erpalar)
Published 2011“…GA is an optimization algorithm that simulates natural selection process as found in nature. …”
Get full text
Get full text
Thesis -
8
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
Published 2012“…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
Get full text
Get full text
Thesis -
9
Reliable Path Selection Packet Forwarding Routing Protocol for Vehicular Adhoc Networks
Published 2019“…Then, a novel routing scheme called a Reliable Path Selection Packet Forwarding Routing Protocol (RPSPF) is proposed. …”
Get full text
Get full text
Get full text
Thesis -
10
Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks
Published 2016“…As a result, this thesis proposes a centralized on-demand channel reservation scheme (AODV-MRCR) that provides an efficient way of utilizing the multiradio and multi-channel resources to establish high throughput path for the gateway traffic. To ensure high throughput path, AODV-MRCR uses path optimization as an intelligent mechanism to select a path with least interference and eliminate the intra-flow interference. …”
Get full text
Get full text
Thesis -
11
Enhanced Mobility Solution In Mobile Ipv6 Network
Published 2008“…A framework based on policy based routing protocol was proposed for handling both the inbound and the outbound traffic on a mobile network, under specified policies which consider packet characteristics, current network situation and user preferences. The interface selection algorithm was based on NEMO implementation structure using a technique of mutihoming which was extended to MIPv6 concepts The outcome of this research work are: a designed policy protocol for policy messages communication between the Mobile Router and the Home Agent, the framework is simulated using Network Simulator (NS2) with an extension of mobiwan, the result shows the end to end delay, average end to end delay, overhead, optimal routing path, average inter-packet latency and throughput of the developed system. …”
Get full text
Get full text
Thesis -
12
Automated path testing using the negative selection algorithm
Published 2017“…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
Get full text
Get full text
Indexed Article -
13
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
thesis::doctoral thesis -
14
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
Get full text
Get full text
Thesis -
15
The effect of GA parameters on the performance of GA-based QoS routing algorithm
Published 2023“…In the previous work, a GA-based QoS routing algorithm for solving the multiconstrained path (MCP) problem has been developed. …”
Conference paper -
16
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text
Thesis -
17
A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions
Published 2021“…The process starts with random points selection along the path. Specific random points will be selected through which the curve should pass through. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
AUTOMATIC ROUTE FINDER FOR NEW VISITORS
Published 2006“…Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. …”
Get full text
Get full text
Final Year Project -
19
A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance
Published 2022“…The algorithm will select the minimum path from the candidate points to target while avoiding obstacles. …”
Get full text
Get full text
Get full text
Get full text
Article -
20
Development of low power viterbi decoder on complex programmable logic device platform
Published 2018“…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
Get full text
Get full text
Get full text
Thesis