Search Results - (( some applications path algorithm ) OR ( _ application ant algorithm ))*

Refine Results
  1. 1
  2. 2

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    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
  4. 4
  5. 5
  6. 6

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Cloud-Mobi Framework using hybrid AHP-ACO method for Social Interaction and Travel Planning by Peh, Perly Thai Ee, Choo, Yun Huoy, Mohd Aboobaider, Burhanuddin

    Published 2013
    “…We also enhance the framework by hybrid the AHP with ACO route optimization algorithm from our previous research to suggest an optimum itinerary and travelling path. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    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
  10. 10
  11. 11

    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
  12. 12

    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
  13. 13

    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
  14. 14
  15. 15
  16. 16
  17. 17

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