Search Results - (( simulation optimization path algorithm ) OR ( problem application testing algorithm ))

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…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

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

“…It has been applied in many practical applications. 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

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

“…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

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

“…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

Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

“…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

Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

“…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

A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

“…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

Application of Genetic Algorithm in solving Tourist Routing Problem by Yusof, Siti Sarah

“…To support this, simulation and experiments will be conducted to evaluate the performance and speedup of the algorithm. …”
Get full text
Get full text

New robot navigation algorithm for arbitrary unknown dynamic environments based on future prediction and priority behavior by Tang, Sai Hong, Kamil, Farah, Zulkifli, Norzima, Ahmad, Siti Azfanizam, Khaksar, Weria, Moghrabiah, Mohammed Yasser

Get full text
Get full text
Get full text

Articulated robots motion planning using foraging ant strategy by Mohamad, Mohd. Murtadha

“…An alternative search approach using ant behaviour in a robotics application is applied. 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

Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

“…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
Get full text
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text

The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

“…Therefore, the IE algorithm exhibits significant potential for UAV path planning optimization…”
Get full text
Get full text

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
Get full text
Get full text

Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

Get full text
Get full text

Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

Subjects:

New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…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

Simulation of identifying shortest path walkway using particle swarm optimization (PSO) by Kae Shin, Yong

“…The purpose of this research is to present the development of the system of Simulation of Identifying Shortest Path Walkway using Particle Swarm Optimization(PSO). …”
Get full text
Get full text