Search Results - (( its application ant algorithm ) OR ( _ application ((a algorithm) OR (new algorithm)) ))*

Refine Results
  1. 1
  2. 2

    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
  3. 3
  4. 4

    Rule pruning techniques in the ant-miner classification algorithm and its variants: A review by Al-Behadili, Hayder Naser Khraibet, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2018
    “…Rule-based classification is considered an important task of data classification.The ant-mining rule-based classification algorithm, inspired from the ant colony optimization algorithm, shows a comparable performance and outperforms in some application domains to the existing methods in the literature.One problem that often arises in any rule-based classification is the overfitting problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    Modified ACS centroid memory for data clustering by Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2019
    “…Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review by See, Phen Chiak, Wong, Kuan Yew

    Published 2008
    “…This paper is aimed to provide a comprehensive review of the concepts of ACO and its application in solving QAPs. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14
  15. 15

    Gait identification and optimisation for amphi-underwater robot by using ant colony algorithm by Mohd Yusof, Muhammad Syafiq, Toha @ Tohara, Siti Fauziah

    Published 2019
    “…For the optimization, the robot will travel from one specific point to another with the predefined position within optimized gait and fastest time by using Ant Colony Optimization (ACO) technique. The algorithm being compared, between Ant Colony Algorithm (ACO) and the Particle Swarm Optimisation (PSO) in terms of time and distance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…VRPSD finds its application on wide-range of distribution and logisticstransportation sector with the objective is to serve a set of customers at minimum total expected cost. …”
    Get full text
    Get full text
    Monograph
  18. 18
  19. 19
  20. 20