Search Results - (( evolution optimization clustering algorithm ) OR ( using normalization path algorithm ))

Refine Results
  1. 1

    A novel clustering based genetic algorithm for route optimization by Aibinu, Abiodun Musa, Salau, Habeeb Bello, Najeeb, Athaur Rahman, Nwohu, Mark Ndubuka, Akachukwu, Chichebe

    Published 2016
    “…It was also observed that the introduction of clustering based selection algorithm guaranteed the selection of cluster with the optimal solution in every generation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Cluster head selection optimization in wireless sensor network via genetic-based evolutionary algorithm by Vincent Chung, Hamzarul Alif Hamzah, Norah Tuah, Kit, Guan Lim, Min, Keng Tan, Kenneth Tze Kin Teo

    Published 2020
    “…Genetic-based evolutionary algorithms such as Genetic Algorithm (GA) and Differential Evolution (DE) have been popularly used to optimize cluster head selection in WSN to improve energy efficiency for the extension of network lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

    Published 2020
    “…In this study, the BSCCH algorithm has been coupled with Differential Evolution algorithm as a proof of concept because it is found to be an efficient algorithm in the literature for constrained optimization problems. …”
    Get full text
    Get full text
    Article
  4. 4

    Balancing Exploitation And Exploration Search Behavior On Nature-Inspired Clustering Algorithms by Alswaitti, Mohammed Y. T.

    Published 2018
    “…Nature-inspired optimization-based clustering techniques are powerful, robust and more sophisticated than the conventional clustering methods due to their stochastic and heuristic characteristics. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The optimal results obtained for constrained engineering problems as well as data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…It was found that the number of populations set to 75 and dynamically adjusts the value of inertial weight, the cognitive and social parameter provides the best performance in terms of shortest path length and execution time. In conclusion, this project shows that the MPSO algorithm is capable of generating a better path compared to the normal PSO algorithm in terms of average path length and execution time, making it a promising algorithm for multi-robot path planning in dynamic environments.…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…This project is to design and analysis the sequence generator module using Eulerian Path algorithm for DNA fragment assembly. …”
    Get full text
    Get full text
    Student Project
  8. 8

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…In relation to that, A* algorithm was used as a path finding technique to plan a collision-free-path journey from one location to another. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…Euler Path Algorithm is used since it has better assembling ability especially in assembling long sequence. …”
    Get full text
    Get full text
    Article
  10. 10

    Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network by Sama, Najm Us

    Published 2019
    “…Further evolution of the ELEC routing protocol is presented to evaluate the impact of incremental cluster iv heads on the performance of WSN. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13
  14. 14

    GPS boundary navigation of DrosoBots using MATLAB simulation by Zainal Abidin, Zulkifli, Ngah , Vmi Kalthum, Arshad, Mohd Rizal, Kok , Chee Hou

    Published 2010
    “…To implement this, region recognition and several path planning algorithms have been utilized. Besides that, pixilation of path is also used to estimate the coverage of the path planning. …”
    Get full text
    Get full text
    Proceeding Paper
  15. 15
  16. 16

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Enhancing clustering algorithm with initial centroids in tool wear region recognition by Kasim, Nur Adilla, Nuawi, Mohd Zaki, Abdul Ghani, Jaharah, Ngatiman, Nor Azazi, Che Haron, Che Hassan, Muhammad Rizal

    Published 2020
    “…Autonomous manufacturing allows the system to distinguish between a mild, normal and total failure in tool condition. K-means clustering has become the most applied algorithm in discovering classes in an unsupervised scenario. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Adaptive route optimization for mobile robot navigation using evolutionary algorithm by Kit Guan Lim, Guan Lim, Yoong Hean Lee, Hean Lee, Min Keng Tan, Keng Tan, Hou, Pin Yoong, Tienlei, Wang, Tze, Kenneth Kin Teo

    Published 2021
    “…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  19. 19

    An adaptive HMM based approach for improving e-Learning methods by Deeb B., Hassan Z., Beseiso M.

    Published 2023
    “…This adaptive algorithm can thus be applied to any e-learning platform for optimal content delivery to its users in real-time. © 2014 IEEE.…”
    Conference Paper
  20. 20

    Scheduling tight deadlines for scientific workflows in the cloud by Bajaher, Awadh Salem Saleh

    Published 2018
    “…This article will evaluate the performance of the Proportional Deadline Constrained (PDC) algorithm using Cloudsim and compare it with the Deadline Constrained Critical Path (DCCP) scheduling algorithm. …”
    Get full text
    Get full text
    Thesis