Search Results - optimal ((((acs algorithm) OR (ant algorithm))) OR (new algorithm))

Ant colony optimization in dynamic environments by Chen, Fei Huang

“…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text

New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

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

New heuristic function in ant colony system algorithm by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza, Yusof, Yuhanif, Mahmuddin, Massudi, Alobaedy, Mustafa Muwafak

“…NP-hard problem can be solved by Ant Colony System (ACS) algorithm.However, ACS suffers from pheromone stagnation problem, a situation when all ants converge quickly to one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic value to calculate the probability of choosing the next node.However, the heuristic value is not updated throughout the process to reflect new information discovered by the ants.This paper proposes a new heuristic function for the Ant Colony System algorithm that can reflect new information discovered by ants.The credibility of the new function was tested on travelling salesman and grid computing problems.Promising results were obtained when compared to classical ACS algorithm in terms of best tour length for the travelling sales-man problem. …”
Get full text
Get full text
Get full text

Adaptive parameter control strategy for ant-miner classification algorithm by Al-Behadili, Hayder Naser Khraibet, Sagban, Rafid, Ku-Mahamud, Ku Ruhana

“…Pruning is the popular framework for preventing the dilemma of over fitting noisy data. This paper presents a new hybrid Ant-Miner classification algorithm and ant colony system (ACS), called ACS-Ant Miner. …”
Get full text
Get full text
Get full text

Interacted multiple ant colonies optimization framework: An experimental study of the evaluation and the exploration techniques to control the search stagnation by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md. Norwawi, Norita

“…The performance of IMACO was demonstrated by comparing it with the best performing ant algorithms like Ant Colony System (ACS) and Max-Min Ant System (MMAS). …”
Get full text
Get full text
Get full text

Applying DACS3 in the Capacitated Vehicle Routing Problem by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

“…Several versions of Ant Colony Optimization (ACO) algorithms have been proposed which aim to achieve an optimum solution includes Dynamic Ant Colony System with Three Level Updates (DACS3). …”
Get full text
Get full text

Modified ACS centroid memory for data clustering by Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

“…Ant Colony Optimization for Clustering (ACOC) is a swarm algorithm inspired from nature to solve clustering issues as optimization problems. …”
Get full text
Get full text
Get full text

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

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

Balancing exploration and exploitation in ACS algorithms for data clustering by Jabbar, Ayad Mohammed, Sagban, Rafid, Ku-Mahamud, Ku Ruhana

“…Ant colony optimization (ACO) is a swarm algorithm inspired by different behaviors of ants. …”
Get full text
Get full text
Get full text

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

Suitability Factor on the Capacitated Vehicle Routing Problem by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

“…A new variant of algorithm called Dynamic Ant Colony System with Three Level Updates (DACS3) has been developed which focuses on adding individual ant behavior. …”
Get full text
Get full text

Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

“…This research aims to improve the algorithm by embedding individual Malaysian House Red Ant behavior into ACS. …”
Get full text
Get full text

An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

“…The objectives of this study are to explore and evaluate the Ant System (AS) algorithm and Ant Colony System (ACS) algorithm in finding shortest paths. …”
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

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

“…This paper proposes a new generic algorithmic approach that utilized multiple ant colonies with several new interaction techniques. …”
Get full text
Get full text
Get full text

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

“…Swarm intelligence algorithms have been applied in solving these problems including the Ant Colony System (ACS) which is one of the ant colony optimization variants. …”
Get full text
Get full text
Get full text
Get full text

Scheduling jobs in computational grid using hybrid ACS and GA approach by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…Metaheuristics algorithms show very good performance in solving various job scheduling problems in computational grid systems.However, due to the complexity and heterogeneous nature of resources in grid computing, stand-alone algorithm is not capable to find a good quality solution in reasonable time.This study proposes a hybrid algorithm, specifically ant colony system and genetic algorithm to solve the job scheduling problem.The high level hybridization algorithm will keep the identity of each algorithm in performing the scheduling task.The study focuses on static grid computing environment and the metrics for optimization are the makespan and flowtime.Experiment results show that the proposed algorithm outperforms other stand-alone algorithms such as ant system, genetic algorithms, and ant colony system for makespan.However, for flowtime, ant system and genetic algorithm perform better.…”
Get full text
Get full text
Get full text

Analysis of the stagnation behavior of the interacted multiple ant colonies optimization framework by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana

“…Search Stagnation is a common problem that all Ant Colony Optimization (ACO) algorithms suffer from regardless of their application domain. …”
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

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

Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

“…Two well-known algorithms for solving a closely related graph theory problem known as the Travelling Salesman Problem (TSP) are the Ant System (AS) and Ant Colony System (ACS) algorithms. …”
Get full text
Get full text