Search Results - (( _ evaluation a algorithm ) OR ( colony optimization based algorithm ))

Refine Results
  1. 1

    Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2008
    “…The new algorithm is based on the ant colony system and utilizes average and maximum pheromone evaluation mechanisms. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    A new multiple ant colonies optimization algorithm utilizing average pheromone evaluation mechanism by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2008
    “…Multiple ant colonies optimization is an extension of the Ant Colony Optimization framework It offers a good opportunity to improve the ant colony optimization algorithms by encouraging the exploration of a wide area of the search space without losing the chance of exploiting the history of the search.This paper proposes a new multiple ant colonies optimization algorithm that is based on ant colony system and utilizes ave rage pheromone evaluation mechanism.The new algorithm divides the ants’ populations into multiple ant colonies and can be used to tackle large volume combinatorial optimization problems effectively. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

    Published 2024
    “…Focusing on routing optimization, the study evaluates Ant-Colony Optimization (ACO) and Genetic Algorithm (GA) in Mobile Robot Planning. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    An evaluation of network load balancing through Ant Colony Optimization (ACO) based technique / Muhammad Nur Zikri Mohamad Hafizan by Mohamad Hafizan, Muhammad Nur Zikri

    Published 2020
    “…This project works on developing an efficient network load balancing mechanism based on the Ant Colony Optimization (ACO) algorithm. …”
    Get full text
    Get full text
    Student Project
  5. 5

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    “…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Hybrid ant colony optimization algorithm for container loading problem by Yap, Ching Nei

    Published 2012
    “…The proposed algorithm is tested on two standard benchmark data sets to evaluate the performance and to determine the effectiveness of the algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Multiobjective optimization using weighted sum Artificial Bee Colony algorithm for Load Frequency Control by Naidu, K., Mokhlis, Hazlie, Bakar, Ab Halim Abu

    Published 2014
    “…This paper presents the implementation of multiobjective based optimization of Artificial Bee Colony (ABC) algorithm for Load Frequency Control (LFC) on a two area interconnected reheat thermal power system. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13
  14. 14
  15. 15

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The main goal of this research is to compare the performances between Genetic Algorithm (GA) and Ant Colony Optimization (ACO) algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Improved cuckoo search based neural network learning algorithms for data classification by Abdullah, Abdullah

    Published 2014
    “…On the other hand, LM algorithms which are derivative based algorithms still face a risk of getting stuck in local minima. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

    Published 2011
    “…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  20. 20

    An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing by Saufi, Bukhari

    Published 2020
    “…Ant colony system (ACS), a variant of ant colony optimization (ACO), is one of the promising algorithms for fault tolerance due to its ability to adapt to both static and dynamic combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis