Search Results - (( based solution using algorithm ) OR ( simulation optimization path algorithm ))
Search alternatives:
- optimization path »
- using algorithm »
- based solution »
- solution using »
- path algorithm »
-
1
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 -
2
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
3
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
4
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
-
6
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text
Article -
7
An adaptive relay selection scheme for enhancing network stability in VANETs
Published 2020“…In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. …”
Get full text
Get full text
Get full text
Article -
8
Optimised multi-robot path planning via smooth trajectory generation
Published 2024“…A MPSO algorithm, without path smoothening, is used for comparison. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
9
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
10
-
11
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
Published 2011“…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
Get full text
Get full text
Get full text
Monograph -
13
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. …”
Get full text
Get full text
Get full text
Article -
14
Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system
Published 2019“…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
Get full text
Get full text
Article -
15
-
16
Accurate range free localization in multi-hop wireless sensor networks
Published 2019“…The performance is evaluated in terms of RMSE in terms of three algorithms WLS, CRLR, and GMSDP based on using the Monte Carlo simulation with account the number of anchors that varying from anchor=4 to anchor =20. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm
Published 2015“…Developing an exploration algorithm based on spanning tree is the main contribution. …”
Get full text
Get full text
Thesis -
18
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 -
19
Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network
Published 2020“…The statistical framework based on QoS requirements is introduced for optimal solutions. …”
Get full text
Get full text
Thesis -
20
Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller
Published 2010“…The contribution of this work is to optimize the base of Fuzzy membership function of the APFLC by using GA technique. …”
Get full text
Thesis
