Search Results - (( based evaluation colony algorithm ) OR ( time simulation modified 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

    1D Multigrid Solver For Finite Element Method by Azhar, Mohamad Amiruddin

    Published 2022
    “…The new algorithm also has been tested using time simulation. …”
    Get full text
    Get full text
    Monograph
  4. 4

    Leaf lesion classification (LLC) algorithm based on artificial bee colony (ABC) by Ahmad, Faudziah, Ku-Mahamud, Ku Ruhana, Sainin, Mohd Shamrie, Airuddin, Ahmad

    Published 2015
    “…Results showed that the Leaf Lesion Classification (LLC) algorithm based on Artificial Bee colony (ABC) produced an average 96.83% of accuracy and average 1.66 milliseconds of processing time, indicating that LLC algorithm is better than algorithm such as Otsu, Canny, Roberts and Sobel. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

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

    Feature extraction and selection algorithm based on self adaptive ant colony system for sky image classification by Petwan, Montha

    Published 2023
    “…The performance of FESSIC was evaluated against ten benchmark image classification algorithms and six classifiers on four ground-based sky image datasets. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Adaptive beamforming algorithm based on Simulated Kalman Filter by Kelvin Lazarus, Lazarus

    Published 2017
    “…Some of the metaheuristic algorithms have been modified from the original algorithms to improve the algorithms performance in adaptive beamforming application. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…In order to obtain the optimum number of clusters and at the same time could deal with correlated variables in huge data, modified k-means algorithm was proposed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Hybridization of enhanced ant colony system and Tabu search algorithm for packet routing in wireless sensor network by Husna, Jamal Abdul Nasir

    Published 2020
    “…Better performances were also achieved for success rate, throughput, and latency when compared to other hybrid routing algorithms such as Fish Swarm Ant Colony Optimization (FSACO), Cuckoo Search-based Clustering Algorithm (ICSCA), and BeeSensor-C. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Improving on the network lifetime of clustered-based wireless sensor network using modified leach algorithm by Zeni, Saltihie

    Published 2012
    “…This document is a study about LEACH algorithm where the implementation was done using OMNeT++ network simulator to study the performance of this algorithm in term of network lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

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

    Published 2017
    “…Selecting a successor is used subjective criteria to evaluate in higher learning of successor based on the following factors. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Dynamic obstacle handling in multi-robot coverage by Tay, Wing Le

    Published 2024
    “…The impacts of the modified algorithm’s parameters on simulation results were also studied to determine the optimal parameters for achieving better performance. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  15. 15

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

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

    Hybrid meta-heuristic algorithm for solving multi-objective aggregate production planning in fuzzy environment by Kalaf, Kalaf, Bayda Atiya

    Published 2017
    “…During the course of the present work, two fuzzy methods (modified Zimmermanns approach and modified angelovs approach ) and fourmeta-heuristics and hybrid meta heuristics including; simulated annealing (SA), modified simulated annealing (MSA), hybrid modified simulated annealing and simplex downhill (MSASD), hybrid modified simulated annealing and modified particle swarm optimization (MSAPSO) were proposed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis