Search Results - (( using ant utilizing algorithm ) OR ( evolution optimization based algorithm ))

Search alternatives:

Refine Results
  1. 1

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

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

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

    Published 2012
    “…It was showed that the proposed HACO algorithm has the capability in solving the CLP.…”
    Get full text
    Get full text
    Thesis
  4. 4

    Reliably optimal PMU placement using disparity evolution-based genetic algorithm by Matsukawa, Yoshiaki, Othman, Mohammad Lutfi, Watanabe, Masayuki, Mitani, Yasunori

    Published 2017
    “…In this paper, Disparity Evolution-type Genetic Algorithm (DEGA) based on disparity theory of evolution is applied. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…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 other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
  6. 6

    A refined differential evolution algorithm for improving the performance of optimization process by A. R., Yusoff, Nafrizuan, Mat Yahya

    Published 2011
    “…DE is developed based on an improved Genetic Algorithm and come with different strategies for faster optimization. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8

    A new modified differential evolution algorithm scheme-based linear frequency modulation radar signal de-noising by Al-Dabbagh, Mohanad Dawood, Al-Dabbagh, Rawaa Dawoud, Raja Abdullah, Raja Syamsul Azmir, Hashim, Fazirulhisyam

    Published 2015
    “…The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. …”
    Get full text
    Get full text
    Article
  9. 9

    Stagnation control using interacted multiple ant colonies by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2009
    “…Stagnation is a common problem that all ant algorithms suffer from regardless of their application domain.This paper proposes a new algorithmic approach that can effectively be used to tackle combinatorial optimization problems with a good chance to control the stagnation. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Application of swarm intelligence optimization on bio-process problems / Mohamad Zihin Mohd Zain by Mohamad Zihin , Mohd Zain

    Published 2018
    “…BSA gave the best overall performance by showing improved solutions and more robust convergence in comparison with various metaheuristics used in this work. Multi-objective optimization problems are also addressed by proposing a modified multi-criterion optimization algorithm based on a Pareto-based Particle Swarm Optimization (PSO) algorithm called Multi-Objective Particle Swarm Optimization (MOPSO). …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Big data clustering using grid computing and ant-based algorithm by Ku-Mahamud, Ku Ruhana

    Published 2013
    “…This paper presents a framework for big data clustering which utilizes grid technology and ant-based algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

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

    Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

    Published 2020
    “…In this study, the BSCCH algorithm has been coupled with Differential Evolution algorithm as a proof of concept because it is found to be an efficient algorithm in the literature for constrained optimization problems. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Power line faults classification by neural network train by Ant Colony Optimization by Nasirudin, Mohd Syafiq

    Published 2017
    “…The characteristic of ACO algorithms is their explicit use of elements of previous solutions. …”
    Get full text
    Get full text
    Student Project
  17. 17

    New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

    Published 2012
    “…Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a 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 paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Enhanced ant colony optimization for grid load balancing by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Abdul Nasir, Husna Jamal

    Published 2011
    “…A simulation environment was developed to test the performance of the algorithm against another ant based algorithm in terms of resource utilization and to determine how different values of evaporation rate resource utilization. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Crossover-first differential evolution for improved global optimization in non-uniform search landscapes by Teo, Jason Tze Wi, Mohd Hanafi Ahmad Hijazi, Hui, Keng Lau, Salmah Fattah, Aslina Baharum

    Published 2015
    “…The differential evolution (DE) algorithm is currently one of the most widely used evolutionary-based optimizers for global optimization due to its simplicity, robustness and efficiency. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20