Search Results - (( problem application testing algorithm ) OR ( using optimization path algorithm ))
Search alternatives:
- problem application »
- application testing »
- testing algorithm »
- optimization path »
- path algorithm »
-
1
Optimization of multi-holes drilling path using particle swarm optimization
Published 2022“…The algorithm was tested on 15 test problems where between 10 to 150 holes were randomly generated. …”
Get full text
Get full text
Thesis -
2
MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM
Published 2019“…Many algorithms have been done by researchers to solve the fast energy consumption problem. …”
Get full text
Get full text
Get full text
Final Year Project Report / IMRAD -
3
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text
Thesis -
4
Mobile robot path planning using hybrid genetic algorithm and traversability vectors method
Published 2004“…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
Get full text
Get full text
Get full text
Article -
5
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 -
6
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
7
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 -
8
The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement
Published 2025“…In the past few decades, there have been multiple algorithms proposed for the purpose of solving optimization problems including Machine Learning (ML) applications. …”
Article -
9
Modelling and Optimization of Asymmetric Vehicle Routing Problem Using Particle Swarm Optimization Algorithm
Published 2021“…The computational experiment was conducted using five test problems with different sizes. The optimization results indicated that this algorithm able to offer good solutions with the best answer for the practical problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
-
11
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
Get full text
Get full text
Get full text
Article -
12
Optimization of multi-holes drilling toolpath using tiki-taka algorithm
Published 2024“…A computational experiment was conducted on 12 test problems across small, medium, and large problem categories using the TTA, then compared with Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Crayfish Optimization Algorithm (COA), and Geometric Mean Optimizer (GMO). …”
Get full text
Get full text
Thesis -
13
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 -
14
Improvement and application of particle swarm optimization algorithm
Published 2025“…This method combines CPTD with the Genetic Algorithm and PSO (GAPSO), resulting in an effective strategy for dynamic formation reconfiguration and path optimization. …”
Get full text
Get full text
Article -
15
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 -
16
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
17
Novel algorithm for mobile robot path planning in constrained environment
Published 2021“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
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. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text
Thesis -
19
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…Results: The analysis of computational results showed that the modified RTS algorithm provided a better solution quality in terms of minimizing the objective function of TSPs, while the SA algorithm was useful for obtaining instant solutions for TSPs with a large number of cities. …”
Get full text
Get full text
Get full text
Article -
20