Search Results - (( colony optimization problem algorithm ) OR ( java application testing algorithm ))

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

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

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

“…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text

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

“…The new algorithm can effectively be used to tackle large scale optimization problems.Computational tests show promises of the new algorithm.…”
Get full text
Get full text
Get full text

A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem by Lee, Wei Wen, Hashim, Mohd Ruzaini

“…This algorithm synergizes the ABC algorithm and Artificial Rabbits Optimization (ARO) algorithm. …”
Get full text
Get full text
Get full text

Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

“…The proposed algorithmic framework has been experimentally tested on two different NP-hard combinatorial optimization problems, namely the travelling salesman problem and the single machine total weighted tardiness problem. …”
Get full text
Get full text
Get full text

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

“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. 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

Formulation of metaheuristic algorithms based on artificial bee colony for engineering problems by Lee, Wei Wen

“…The Artificial Bee Colony (ABC) algorithm is a powerful metaheuristic optimization technique inspired by the honeybee foraging behaviour. …”
Get full text
Get full text
Get full text
Get full text

An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

Subjects: “…Ant colony optimization…”

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

“…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

Ant colony optimization in dynamic environments by Chen, Fei Huang

“…Apart from the size of the optimization problem, how the swapping interval affects the dynamic optimization by the ant algorithms is also investigated. …”
Get full text
Get full text
Get full text

Interacted multiple ant colonies optimization approach to enhance the performance of ant colony optimization algorithms by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md. Norwawi, Norita

“…These colonies work together to collectively solve an optimization problem. …”
Get full text
Get full text
Get full text

The design and applications of the african buffalo algorithm for general optimization problems by Odili, Julius Beneoluchi

“…Some of the successfully designed stochastic algorithms include Simulated Annealing, Genetic Algorithm, Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, Artificial Bee Colony Optimization, Firefly Optimization etc. …”
Get full text
Get full text

Congestion management based optimization technique using bee colony by Rahim M.A., Musirin I., Abidin I.Z., Othman M.M., Joshi D.

“…The study involved the development of bee colony algorithm in addressing congestion management, considering cost optimization as the objective function. …”

Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management by Julius, Beneoluchi Odili, M. N. M., Kahar, Noraziah, Ahmad, M., Zarina, Riaz, Ul Haq

“…After critical assessments of the performances of eleven algorithms consisting of two heuristics (Randomized Insertion Algorithm and the Honey Bee Mating Optimization for the Travelling Salesman’s Problem), two trajectory algorithms (Simulated Annealing and Evolutionary Simulated Annealing) and seven population-based optimization algorithms (Genetic Algorithm, Artificial Bee Colony, African Buffalo Optimization, Bat Algorithm, Particle Swarm Optimization, Ant Colony Optimization and Firefly Algorithm) in solving the 60 popular and complex benchmark symmetric Travelling Salesman’s optimization problems out of the total 118 as well as all the 18 asymmetric Travelling Salesman’s Problems test cases available in TSPLIB91. …”
Get full text
Get full text
Get full text

Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem by Tuani Ibrahim, Ahamed Fayeez, Keedwell, Edward, Collett, Matthew

“…The majority of optimization algorithms require proper parameter tuning to achieve the best performance. …”
Get full text
Get full text
Get full text
Get full text

Artificial bee colony algorithm for solving optimal power flow problem by Le Dinh, L., Vo Ngoc, D., Vasant, P.

“…This paper proposes an artificial bee colony (ABC) algorithm for solving optimal power flow (OPF) problem. …”
Get full text
Get full text

Ant Colony Optimization With Look Forward Ant In Solving Assembly Line Balancing Problem by Sulaiman, Mohd Nor Irman, Choo, Yun Huoy, Chong, Kuan Eng

“…This work presents an approach based on the ant colony optimization technique to address the assembly line balancing problem. …”
Get full text
Get full text
Get full text

Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network by SALLIM, JAMALUDIN

“…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
Get full text
Get full text

Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network by Sallim, Jamaludin

“…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
Get full text
Get full text