Search Results - (( using computing path algorithm ) OR ( simulation optimization search algorithm ))
Search alternatives:
- optimization search »
- using computing »
- computing path »
- path algorithm »
-
1
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
Get full text
Get full text
Thesis -
2
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
3
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 -
4
The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation
Published 2023“…This paper proposes a new hybrid of nature inspired optimization algorithm (IFDO-WOABAT) based on the latest optimization algorithm namely Improved Fitness Dependent Optimization (IFDO) with Whale-Bat Optimization algorithm (WOABAT). …”
Get full text
Get full text
Get full text
Proceeding -
5
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012Get full text
Get full text
Undergraduates Project Papers -
6
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text
Thesis -
7
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
Get full text
Get full text
Get full text
Thesis -
8
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 -
9
Minimization of tool path length of drilling process using particle swarm optimization (PSO)
Published 2020“…For this study, the main purpose is to apply the Particle Swarm Optimization (PSO) algorithm for use in searching for the optimal tool routing path for in simulation of drilling process…”
Get full text
Get full text
Book Section -
10
Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm
Published 2016“…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…The purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS).Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs.The algorithms were tested on five chosen benchmark problems. …”
Get full text
Get full text
Get full text
Article -
12
Articulated robots motion planning using foraging ant strategy
Published 2008“…This paper proposes a novel search technique, the F-Ant algorithm, in order to find a reliable path between the initial configuration and the goal configuration of the articulated robot. …”
Get full text
Get full text
Article -
13
Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system
Published 2019“…The performance of the proposed algorithm is evaluated through simulation in different motion planning queries. …”
Get full text
Get full text
Article -
14
A Kalman Filter Approach to PCB Drill Path Optimization Problem
Published 2017“…Drill path optimization problem is an important problem in holes drilling with computer numerically controlled (CNC) machine. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
15
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 -
16
-
17
Efficient multi-UAV coordination via rl: joint path planning and task scheduling for post-disaster UAV-assisted MEC systems
Published 2025“…Meanwhile, task scheduling is optimized using a greedy algorithm to reduce computational complexity, and UAVs cooperate through information sharing to achieve robust performance. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Design of A unmanned aerial vehicles assisted search and rescue collaboration architecture for emergency communication systems / Abdu Ahmed Saif Ahmed
Published 2022“…Simulation results indicate that the proposed algorithms can significantly reduce the outage probability and energy consumption. …”
Get full text
Get full text
Get full text
Thesis -
19
Process Planning Optimization In Reconfigurable Manufacturing Systems
Published 2008“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text
Thesis -
20
Pressure vessel design simulation using hybrid harmony search algorithm
Published 2019“…Recently the development of optimization algorithm is rapidly increased. Among several optimization algorithms, Harmony Search (HS) has been recently proposed for solving engineering optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item
