Search Results - (( its relation based algorithm ) OR ( _ application ((colony algorithm) OR (amh algorithm)) ))*

Refine Results
  1. 1

    Ant colony optimization algorithm for rule based classification: Issues and potential by Al-Behadili, Hayder Naser Khraibet, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2018
    “…Nevertheless, ACO also has several drawbacks that may reduce the classification accuracy and the computational time of the algorithm. This paper presents a review of related work of ACO rule classification which emphasizes the types of ACO algorithms and issues. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

    Published 2023
    “…For optimal maintenance scheduling with low cost, high reliability, and low violation, the parameter values of the PACS algorithm were tuned using the Taguchi and Gray Relational Analysis (Taguchi-GRA) method through search-based approach. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Optimization of milling parameters using ant colony optimization by Mohd Saupi, Mohd Sauki

    Published 2008
    “…All the references are taken from related articles, journals and books. An example to apply the Ant Colony Algorithm to the problem has been presented at the end of the paper to give clear picture from the application of the system and its efficiency. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  4. 4

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Ant Colony Optimization for Tourist Route by Meeplat, Nopparat

    Published 2005
    “…The second part of this research involves formulating and applying the ACO algorithms to find the shortest path based on the distance calculated from source to destination cities. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman by Seman, Ali

    Published 2013
    “…The idea was incorporated into a new algorithm called, k-Approximate Modal Haplotypes (&-AMH) algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    A Comparative Performance Analysis of Gaussian Distribution Functions in Ant Swarm Optimized Rough Reducts by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah

    Published 2011
    “…Applying a simple pheromone-guided mechanism of ACO as local search is to handle P ants equal to the number of particles in PSO and generate components of solution vector, which satisfy Gaussian distributions. To describe relative probability of different random variables, PDF and CDF are capable to specify its own characterization of Gaussian distributions. …”
    Get full text
    Get full text
    Article
  9. 9

    Peer to peer trade in HTM5 meta model for agent oriented cloud robotic systems by Nagrath, Vineet, Morel, Olivier, Malik, Aamir Saeed, Mohamad Saad, Mohamad Naufal, Meriaudeau, Fabrice

    Published 2015
    “…Adaptation of cloud computing services for robotic applications is relatively straightforward while adaptation of underlying ideas will require a new design attitude. …”
    Get full text
    Get full text
    Article
  10. 10

    Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

    Published 2010
    “…Ant Colony Optimization (ACO) is a successful application of swarm intelligence. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20