Search Results - (( simulation optimization path algorithm ) OR ( based application testing algorithm ))
Search alternatives:
- application testing »
- optimization path »
- based application »
- testing algorithm »
- 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
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Therefore, the IE algorithm exhibits significant potential for UAV path planning optimization…”
Get full text
Get full text
Thesis -
3
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 -
4
Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization
Published 2025“…In recent years, Automated Mobile Robots (AMRs) have gained significant attention in industry and research applications, requiring efficient path-planning algorithms to optimize task performance. …”
Get full text
Get full text
Get full text
Get full text
Article -
5
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…To generate test cases that satisfy MC/DC criterion, many researchers adopt neighborhood based meta-heuristics algorithms (including that of Simulated Annealing and Hill Climbing) as the problem itself is neighborhood based. …”
Get full text
Get full text
Thesis -
6
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…In the OSM-based scenarios, both algorithms yielded paths of identical length. …”
Get full text
Get full text
Get full text
Article -
7
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 -
8
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 -
9
-
10
-
11
Simulation of spline based NC- manufacturing of plastic optical components
Published 2011Get full text
Get full text
Conference or Workshop Item -
12
Ant system with heuristics for capacitated vehicle routing problem
Published 2013“…The aim of this research is to develop an Ant Colony Optimization (ACO) for solving the CVRP where it simulates the behavior of real ants that always find the shortest path between their nest and a food source through an indirect form of communication, namely pheromone trail. …”
Get full text
Get full text
Thesis -
13
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 -
14
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 -
15
A collaborated genetic with lion optimization algorithms for improving the quality of forwarding in a vehicular ad-hoc network
Published 2023“…An enhanced genetic algorithm (EGA) is employed here to find the best possible path for data transmission which leads to meeting the QoF. …”
Get full text
Get full text
Get full text
Article -
16
A collaborated genetic with lion optimization algorithms for improving the quality of forwarding in a vehicular ad-hoc network
Published 2023“…An enhanced genetic algorithm (EGA) is employed here to find the best possible path for data transmission which leads to meeting the QoF. …”
Get full text
Get full text
Get full text
Article -
17
A collaborated genetic with lion optimization algorithms for improving the quality of forwarding in a vehicular ad-hoc network
Published 2023“…An enhanced genetic algorithm (EGA) is employed here to find the best possible path for data transmission which leads to meeting the QoF. …”
Get full text
Get full text
Get full text
Article -
18
A collaborated genetic with lion optimization algorithms for improving the quality of forwarding in a vehicular ad-hoc network
Published 2023“…An enhanced genetic algorithm (EGA) is employed here to find the best possible path for data transmission which leads to meeting the QoF. …”
Get full text
Get full text
Get full text
Article -
19
A collaborated genetic with lion optimization algorithms for improving the quality of forwarding in a vehicular ad-hoc network
Published 2023“…An enhanced genetic algorithm (EGA) is employed here to find the best possible path for data transmission which leads to meeting the QoF. …”
Get full text
Get full text
Get full text
Article -
20
A collaborated genetic with lion optimization algorithms for improving the quality of forwarding in a vehicular ad-hoc network
Published 2023“…An enhanced genetic algorithm (EGA) is employed here to find the best possible path for data transmission which leads to meeting the QoF. …”
Get full text
Get full text
Get full text
Article
