Search Results - (( using application ant algorithm ) OR ( java application based algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

    Ant colony optimization in dynamic environments by Chen, Fei Huang

    Published 2010
    “…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

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

    Published 2010
    “…This thesis addresses the issues associated with search stagnation problem that ACO algorithms suffer from. In particular, it proposes the use of multiple interacted ant colonies as a new algorithmic framework. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    An adaptive ant colony optimization algorithm for rule-based classification by Al-Behadili, Hayder Naser Khraibet

    Published 2020
    “…Ant-Miner is a variant of ant colony optimisation and a prominent intelligent algorithm widely use in rules-based classification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13
  14. 14

    An Enhanced Ant Colony Optimisation Algorithm with the Hellinger Distance for Shariah-Compliant Securities Companies Bankruptcy Prediction by Zainol, Annuur Zakiah, Saian, Rizauddin, Teoh, Yeong Kin, Mohd Razali, Muhammad Hasbullah, Abu Bakar, Sumarni

    Published 2024
    “…The application of ant colony optimization (ACO) algorithms has been limited by their performance on imbalanced datasets, particularly within bankruptcy prediction where the some of bankruptcy cases lead to skewed data distributions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    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
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20