Search Results - (( based optimization problems algorithm ) OR ( simulation optimization path algorithm ))
Search alternatives:
- optimization path »
- path algorithm »
- problems »
-
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
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
Get full text
Get full text
Get full text
Article -
3
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012“…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
Get full text
Get full text
Undergraduates Project Papers -
4
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 -
5
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 -
6
Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article
Published 2012“…This will cause disadvantages in the performance and speed level of the Smith-Waterman Algorithm. Thus, based on other researchers there was various kind of method being use in order to overcome this problem. …”
Get full text
Get full text
Article -
7
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
Get full text
Thesis -
8
The effect of GA parameters on the performance of GA-based QoS routing algorithm
Published 2023Subjects:Conference paper -
9
Path optimization using genetic algorithm in laser scanning system
Published 2008“…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”
Get full text
Get full text
Conference or Workshop Item -
10
Path optimization using genetic algorithm in laser scanning system
Published 2023Subjects:Conference paper -
11
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Most metaheuristic algorithms are designed for continuous optimization problem. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
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). …”
Get full text
Get full text
Thesis -
13
Modelling of multi-robot system for search and rescue
Published 2023“…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
14
Transmission path optimization Based on Efficiency Communication System
Published 2022“…This paper points out the research focus of the wireless sensor network transmission path and discusses the optimization problem of the transmission based on grid model. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
15
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 -
16
-
17
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Simulated Kalman Filter (SKF) solves optimization problems by finding the estimate of the optimum solution. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
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 -
19
Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks
Published 2009“…In this research, Intelligent AntNet based Routing Algorithm (IANRA) is presented for routing in WMNs and MANET to find optimum and near-optimum paths for data packet routing. …”
Get full text
Get full text
Thesis -
20
On network flow problems with convex cost
Published 2004“…To address this problem, we derive the optimality conditions for minimising convex and differentiable cost functions, and devise an algorithm based on the primal-dual algorithm commonly used in linear programming. …”
Get full text
Get full text
Get full text
Article
