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

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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
    “…The capability of DACS3 is measured based on quality of solution, time taken to reach the solution and algorithm performance. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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
    “…The performance of the proposed algorithm is compared with that of several common clustering algorithms using real-world datasets. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    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:
  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
    “…Shortest path is one of the optimization problems that are difficult to solve. There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    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:
  11. 11
    A Modified Approach For Load Flow Analysis Of Integrated AC-DC Power Systems

    A Modified Approach For Load Flow Analysis Of Integrated AC-DC Power Systems by Mustafa, M.W., Abd Kadir, Aida Fazliana

    Published 2000
    “…An algorithm has been developed to solve the HVDC link power system loadflow and the algorithm has been tested on the IEEE test system …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    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:
  14. 14
    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
    “…For comparison purposes, Simulated Annealing (SA) was used to generate the solution under the same condition. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Energy efficiency mechanism using mobile-based fermat's spiral in wireless sensor networks

    Energy efficiency mechanism using mobile-based fermat's spiral in wireless sensor networks by Mantoro, Teddy, Shaukat Ali, Haroon, Ayu, Media Anugerah, Usino, Wendi

    Published 2011
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  16. 16
    A New Near Optimal Harmonics Elimination PWM Algorithm For AC Traction Drives

    A New Near Optimal Harmonics Elimination PWM Algorithm For AC Traction Drives by Salam, Zainal, Chew, Tit Lynn

    Published 2002
    “…The paper presents an algorithm to calculate near optimal switching angles, which will permit a fast and efficient realization using a microprocessor. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…Specifically, these algorithms require extensive tuning before optimal solution can be obtained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: