Search Results - ii optimization ((method algorithm) OR (((path algorithm) OR (search algorithm))))
Search alternatives:
- method algorithm »
- ii optimization »
- path algorithm »
-
1
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
Get full text
Thesis -
2
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 -
3
Adaptive route optimization for mobile robot navigation using evolutionary algorithm
Published 2021“…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
4
Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm
Published 2025“…The results reveal that our proposed method reduces the mobile robot's travel time by up to 69%, 67%, 72%, and 79% compared to these algorithms, while consistently achieving optimal path lengths. …”
Get full text
Get full text
Get full text
Article -
5
-
6
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 -
7
Meta-Heuristic Algorithms for Learning Path Recommender at MOOC
Published 2021Get full text
Get full text
Article -
8
-
9
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…This mechanism is restricted to search the possible solutions in a critical path. …”
Get full text
Get full text
Get full text
Thesis -
10
Using artificial intelligence search in solving the camera placement problem
Published 2022“…The chapter also carries out an analytical review of three main searching algorithms namely, generate and test, uninformed search, and hill climbing search algorithms. …”
Get full text
Get full text
Book -
11
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…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 -
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
Test case minimization applying firefly algorithm
Published 2018Get full text
Get full text
Get full text
Article -
14
-
15
-
16
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). …”
Get full text
Get full text
Get full text
Article -
18
-
19
Search algorithms for path planning problems in harsh wireless sensor network environment
Published 2017“…This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. …”
Get full text
Get full text
Thesis -
20