Search Results - (( using simulation method algorithm ) OR ( wolf optimization path algorithm ))

Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

“…Through extensive simulations across various static environment maps, we demonstrate that the ABGPSO algorithm outperforms existing state-of-the-art optimization techniques, including Genetic Algorithms (GA), Grey Wolf Optimization (GWO), and modern optimizers like the Sine Cosine Algorithm (SCA), Harris Hawks Optimization (HHO) and Reptile search algorithm (RSA). …”
Get full text
Get full text
Get full text

Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking by Shen, Jiazheng, Hong, Tang Sai, Fan, Luxin, Zhao, Ruixin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text

Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

“…Based on a geometrical analysis, feasible postures of a self-motion are mapped into an interval so that there will be an angle domain boundary and a redundancy resolution to track the desired path lies within this boundary. To choose a best solution among many possible solutions, meta-heuristic optimizations, namely, a Genetic Algorithm (GA), a Particle Swarm Optimization (PSO), and a Grey Wolf Optimizer (GWO) will be employed with an optimization objective to minimize a joint angle travelling distance. …”
Get full text
Get full text

Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

“…Based on a geometrical analysis, feasible postures of a self-motion are mapped into an interval so that there will be an angle domain boundary and a redundancy resolution to track the desired path lies within this boundary. To choose a best solution among many possible solutions, meta-heuristic optimizations, namely, a Genetic Algorithm (GA), a Particle Swarm Optimization (PSO), and a Grey Wolf Optimizer (GWO) will be employed with an optimization objective to minimize a joint angle travelling distance. …”
Get full text
Get full text

Energy-efficient routing using novel optimization with Tabu techniques for Wireless Sensor Network by Ahmed Hamza, Manar, Hassan Abdalla Hashim, Aisha, H. Elkamchouchi, Dalia, Nemri, Nadhem, S. Alzahrani, Jaber, Sayed A. Aziz, Amira, Ahmed Ibrahim, Mnahel, Motwakel, Abdelwahed

“…In the proposed method, a novel Grey Wolf Improved Particle Swarm Optimization with Tabu Search Techniques (GW-IPSO-TS) was used. …”
Get full text
Get full text
Get full text

Cybernetics approaches in intelligent systems for crops disease detection with the aid of IoT by Rathinam R., Kasinathan P., Govindarajan U., Ramachandaramurthy V.K., Subramaniam U., Garrido S.

1D Multigrid Solver For Finite Element Method by Azhar, Mohamad Amiruddin

“…The new algorithm also has been tested using time simulation. …”
Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text

Simulation Of Path Optimisation Algorithms by Sim, Choon Yeee

“…Likewise, when comparing between Bidirectional Searching with Replanning and Unidirectional Searching with Replanning, a decrease of 41.08%, 25.57% and 14.41% on algorithm total time can be seen. Thus, in this final year project, the optimum algorithm to use is A* algorithm with Bidirectional Searching method and Replanning method included during the searching process. …”
Get full text
Get full text

The use of a partially simulated exothermic reactor to test nonlinear algorithms by Hussain, Mohd Azlan, Kittisupakorn, Paisan, Kershenbaum, L.

“…These methods have been found to be useful in dealing with difficult-to-control nonlinear systems, especially in simulated systems. …”
Get full text
Get full text

Power Delivery Network Modeling And Simulation By Using Delaunay-Voronoi Triangulation And The Latency Insertion Method by Chin, Wei Chun

“…The research is focused into the analysis of PDN by modeling and simulation of the power plane. In the project, power plane is modeled using Delaunay-Voronoi algorithm and for simulation, a fast transient simulation algorithm which is latency insertion method (LIM) is applied. …”
Get full text
Get full text

Incorporating the range-based method into GridSim for modeling task and resource heterogeneity by Eng, Kailun, Muhammed, Abdullah, Mohamed, Mohamad Afendee, Hasan, Sazlinah

“…GridSim simulator has become a very popular simulation tool and has been widely used by Grid researchers to test and evaluate the performance of their proposed scheduling algorithms. …”
Get full text
Get full text
Get full text

New Fast Block Matching Algorithm Using New Hybrid Search Pattern And Strategy To Improve Motion Estimation Process In Video Coding Technique by Hamid, Nurul 'Atiqah

Get full text
Get full text
Get full text
Get full text

Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

“…Conventionally, the numerical simulations for such devices are obtained by using the commercial simulation packages based on the Finite Element Methods (FEM). …”
Get full text
Get full text

Adaptive beamforming algorithm based on Simulated Kalman Filter by Kelvin Lazarus, Lazarus

“…There are many methods to perform adaptive beamforming and one of the method is to use metaheuristic algorithm, to estimate the weights for individual elements in an array. …”
Get full text
Get full text

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
Get full text
Get full text

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
Get full text
Get full text

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
Get full text
Get full text

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
Get full text
Get full text