Search Results - optimal ((((((path algorithm) OR (bees algorithm))) OR (means algorithm))) OR (tree algorithm))

Refine Results
  1. 1

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets by Mohd Razali, Muhamad Hasbullah, Saian, Rizauddin, Yap, Bee Wah, Ku-Mahamud, Ku Ruhana

    Published 2021
    “…This study proposed an enhanced algorithm called hellingerant-tree-miner (HATM) which is inspired by ant colony optimization (ACO) metaheuristic for imbalanced learning using decision tree classification algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    “…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    “…The main finding of the study is that the Bees Algorithm found optimal drill path length and minimum machining time comparable to the results of the other algorithms for the 5 × 5, 7 × 7 and 9 × 9 problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A novel swarm-based optimisation algorithm inspired by artificial neural glial network for autonomous robots by Ismail, Amelia Ritahani, Tumian, Afidalina

    Published 2019
    “…The main idea in this algorithm is the indirect communication between the ants which is established by the means of pheromones in finding the shortest path between their nest and food [14]. …”
    Get full text
    Get full text
    Monograph
  8. 8

    Performance Comparison of Parallel Bees Algorithm on Rosenbrock Function by Hammash, Nayif Mohammed

    Published 2012
    “…This thesis presents the parallel Bees Algorithm as a new approach for optimizing the last results for the Bees Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    A near-optimal centroids initialization in K-means algorithm using bees algorithm by Mahmuddin, Massudi, Yusof, Yuhanis

    Published 2009
    “…The K-mean algorithm is one of the popular clustering techniques.The algorithm requires user to state and initialize centroid values of each group in advance. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Data clustering using the bees algorithm by Pham, D.T, Otri, S., Afify, A., Mahmuddin, Massudi, Al-Jabbouli, H.

    Published 2007
    “…The authors’ team have developed a new population based search algorithm called the Bees Algorithm that is capable of locating near optimal solutions efficiently. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11
  12. 12

    Power-efficient wireless coverage using minimum number of uavs by Sawalmeh A., Othman N.S., Liu G., Khreishah A., Alenezi A., Alanazi A.

    Published 2023
    “…Antennas; Disasters; Genetic algorithms; Iterative methods; K-means clustering; Particle swarm optimization (PSO); 3-D placements; Artificial bee colony; Efficient 3d placement; Genetic algorithm; K-means; Particle swarm optimization; Placement algorithm; Power efficient; Unmanned aerial vehicle; Wireless coverage; Unmanned aerial vehicles (UAV); algorithm; animal; bee; Algorithms; Animals; Bees; Unmanned Aerial Devices…”
    Article
  13. 13

    Optimization grid scheduling with priority base and bees algorithm by Ahmed, Mohammed Shihab

    Published 2014
    “…The main aim of this current research to propose an optimization of the initial scheduler for grid computing using the bees algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

    Published 2024
    “…This study aims to evaluate the effectiveness of two optimization algorithms, artificial bee colony (ABC) and spiral dynamic algorithm (SDA), in controlling the position of a flexible-link manipulator. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
  17. 17

    Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm by Ma, Haohao, As’arry, Azizan, Cong, Miaomiao, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi, Wu, Xuping

    Published 2024
    “…This paper discusses different algorithms and finally proposes a fusion of the improved Dung Beetle Optimizer (IDBO) algorithm using chaotic mapping, sinusoidal random mutation, and nonlinear convergence strategies with the bidirectional Rapidly exploring Random Tree (RRT) algorithm to achieve manipulator trajectory planning and minimum jerk optimization trajectory. …”
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2022
    “…The mean path cost generated by the LS algorithm, on the other hand, is 14% higher than that generated by the PRM. …”
    Get full text
    Thesis
  19. 19

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis