Search Results - (( its optimization problems algorithm ) OR ( simulation optimization path 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

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

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

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

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

Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…Simulated Kalman Filter (SKF) solves optimization problems by finding the estimate of the optimum solution. …”
Get full text
Get full text
Get full text
Get full text

Revolutionizing crowd safety: A breakthrough hybrid whale-bat chaotic algorithm (WOABCM) for optimized evacuation simulations by Hamizan, Sharbini, Mohamad Shukor, Talib, Noorfa Haszlinna, Mustaffa, Habibollah, Haron

“…This groundbreaking approach to crowd evacuation simulation demonstrates how chaos theory-inspired algorithms can be used to solve practical problems.…”
Get full text
Get full text
Get full text
Get full text

Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

“…The ST itself is a conceptual framework that examines, reframes the problem and finds the solution. 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

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text

Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

“…Among various works inspired by ant colonies, the Ant Colony Optimization (ACO) metaheuristic algorithms are the most successful and popular, e.g., AntNet, Multiple Ant Colony Optimization (MACO) and AntHocNet. …”
Get full text
Get full text

Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method by Permal, Navinesshani, Osman, Miszaina, Mohd Ariffin, Azrul, Boopalan, Navaamsini, Ab Kadir, Mohd Zainal Abidin

“…This paper presents the results of optimization for substation grounding systems using the Simulated Annealing (SA) algorithm in different soil conditions which conforms to the safety requirements of the grounding system. …”
Get full text
Get full text

Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method by Permal N., Osman M., Ariffin A.M., Boopalan N., Abidin Ab Kadir M.Z.

Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

“…Thus this paper studies multiple constraints routing problem for path cost minimization over WMN. However, this problem is NP-complete, hence, this paper proposes fast convergent Differential Evolution metaheuristic algorithm with bandwidth and delay constraints for minimum routing cost. …”
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

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

Three-dimensional coverage control for multi-unmanned aerial vehicle by Siow, Wen Hao

“…The performance of the transitioned 3D algorithm is evaluated against the original 2D MBC algorithm in terms of computational load, convergence analysis, path length, coverage quality, and scalability. …”
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

Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text

Optimization algorithms for multipath transfer over asymmetric paths using concurrent multipath transfer stream control transmission protocol by Abass, Abdulridha Hanash

Get full text
Get full text
Get full text

Courier delivery services visualisor (CDSV) with an integration of genetic algorithm and A* engine by Jalaluddin, Mohammad Fariduddin, Kamaru-Zaman, Ezzatul Akmal, Abdul Rahman, Shuzlina, Mutalib, Sofianita

“…This study developed Courier Delivery Services Visualisor (CDSV) that is able to visualize the best route to be taken by distributor, so that the courier service can arrive on time.CDSV employed Genetic Algorithm (GA) and Astar Algorithm (A*) that integrates with Geographical Information System (GIS) data.A graphical user interface in the form of simulation map that suggests the best route and the optimal distance are displayed for easier courier service distribution references.…”
Get full text
Get full text
Get full text

Efficient deployment of multi-uavs in massively crowded events� by Sawalmeh A., Othman N.S., Shakhatreh H.