Search Results - (( solution using ((acs algorithm) OR (ant algorithm)) ) OR ( java implication force algorithm ))

Search alternatives:

Refine Results
  1. 1
    Embedding Malaysian House Red Ant Behavior into an Ant Colony System

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  2. 2
    DACS3:Embedding Individual Ant Behavior in Ant Colony System

    DACS3:Embedding Individual Ant Behavior in Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Their ability as a colony, to find paths to food sources has inspired the development of algorithms known as Ant Colony Systems (ACS). The principle of cooperation forms the backbone of such algorithms, commonly used to find solutions to problems such as the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Improvement DACS3 Searching Performance using Local Search

    Improvement DACS3 Searching Performance using Local Search by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2009
    “…Several versions of metaheuristic ACOs’ have been developed through several improvement processes to produce better algorithm. Past research has proposed a Dynamic Ant Colony System with Three Level Updates (DACS3) algorithm that embedding a Malaysian House Red Ant behavior into current ACS. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    New heuristic function in ant colony system for the travelling salesman problem

    New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…Ant Colony System (ACS) is one of the best algorithms to solve NP-hard problems.However, ACS suffers from pheromone stagnation problem when all ants converge quickly on one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic values to calculate the probability of choosing the next node. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    DACS3: Embedding Malaysian Individual Ant Behavior in Ant Colony System

    DACS3: Embedding Malaysian Individual Ant Behavior in Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2009
    “…Their ability as a colony, to find paths to food sources has inspired the development of algorithms known as Ant Colony Systems (ACS). The principle of cooperation forms the backbone of such algorithms, commonly used to find solutions to problems such as the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  6. 6
    Balancing exploration and exploitation in ACS algorithms for data clustering

    Balancing exploration and exploitation in ACS algorithms for data clustering by Jabbar, Ayad Mohammed, Sagban, Rafid, Ku-Mahamud, Ku Ruhana

    Published 2019
    “…ACO for clustering (ACOC) is an ant colony system (ACS) algorithm inspired by the foraging behavior of ants for clustering tasks. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing

    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing by Alobaedy, Mustafa Muwafak Theab

    Published 2015
    “…The algorithms are ACS(GA), ACS+GA, ACS(TS), and ACS+TS. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…The objectives of this study are to explore and evaluate the Ant System (AS) algorithm and Ant Colony System (ACS) algorithm in finding shortest paths. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Scheduling jobs in computational grid using hybrid ACS and GA approach

    Scheduling jobs in computational grid using hybrid ACS and GA approach by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2014
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).

    Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP). by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2007
    “…Thus, this new level of pheromone updates which manipulating and empowering the searching experiences of individual ants can improve the current ACS algorithm. Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Low and high level hybridization of ant colony system and genetic algorithm for job scheduling in grid computing

    Low and high level hybridization of ant colony system and genetic algorithm for job scheduling in grid computing by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2015
    “…Hybrid metaheuristic algorithms have the ability to produce better solution than stand-alone approach and no algorithm could be concluded as the best algorithm for scheduling algorithm or in general, for combinatorial problems.This study presents the low and high level hybridization of ant colony system and genetic algorithm in solving the job scheduling in grid computing.Two hybrid algorithms namely ACS(GA) as a low level and ACS+GA as a high level are proposed.The proposed algorithms were evaluated using static benchmarks problems known as expected time to compute model. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Ant colony optimization in dynamic environments

    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
    Save to List
    Saved in:
  13. 13
    Strategies DACS3 Increasing its Performances

    Strategies DACS3 Increasing its Performances by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2009
    “…Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  14. 14
    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION

    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION by Nor Akmal, Abdul Aziz

    Published 2005
    “…Specifically. this thesis is intended to develop a system that can display the shortest path by the used of two algorithm in ACO which were Ant System (AS) and Ant Colony System (ACS). …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  15. 15
    Modified ACS centroid memory for data clustering

    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
    Save to List
    Saved in:
  16. 16
    Ant colony optimization for solving solid waste collection scheduling problems

    Ant colony optimization for solving solid waste collection scheduling problems by Ismail, Zuhaimy, Loh, S. L.

    Published 2009
    “…But the percentage deviations of averages from the associated best cost are 0.1322 and 0.7064 for ACS and SA. The results indicated that for all demand ranges, proposed ACO algorithm showed better performance than SA algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems

    Ant Colony Optimization for Solving Solid Waste Collection Scheduling Problems by Ismail, Zuhaimy, Loh, Ser Lee

    Published 2009
    “…But the percentage deviations of averages from the associated best cost are 0.1322 and 0.7064 for ACS and SA. The results indicated that for all demand ranges, proposed ACO algorithm showed better performance than SA algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    An Efficient Improvement Of Ant Colony System Algorithm For Handling Capacity Vehicle Routing Problem

    An Efficient Improvement Of Ant Colony System Algorithm For Handling Capacity Vehicle Routing Problem by Modhi Lafta Mutar, Mohd Aboobaider, Burhanuddin, Asaad Shakir Hameed, Yusof, Norzihani, Hussein Jameel Mutashar

    Published 2020
    “…The proposed study seeks to find the best solution of CVRP by using improvement ACS with the accompanying targets: (1) To decrease the distance as long distances negatively affect the course of the process since it consumes a great time to visit all customers. (2) To implement the improvement of ACS algorithm on new data from the database of CVRP. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    An improved ACS algorithm for data clustering

    An improved ACS algorithm for data clustering by Mohammed Jabbar, Ayad, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2020
    “…However, ACOC suffers from high diversification in which the algorithm cannot search for best solutions in the local neighbourhood. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Suitability Factor on the Capacitated Vehicle Routing Problem

    Suitability Factor on the Capacitated Vehicle Routing Problem by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2010
    “…One of the most popular solutions is using Ant Colony System (ACS) algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: