Search Results - (( evolution optimization using algorithm ) OR ( using ant problem algorithm ))
Search alternatives:
- evolution optimization »
- problem algorithm »
- using algorithm »
- ant problem »
- using ant »
-
1
Seed disperser ant algorithm for optimization / Chang Wen Liang
Published 2018“…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
Get full text
Get full text
Get full text
Thesis -
2
Improving Ant Swarm Optimization With Embedded Vaccination For Optimum Reducts Generation
Published 2011“…This paper proposes a hybrid ant swarm optimization algorithm by using immunity to discover better fitness value in optimizing rough reducts set. …”
Get full text
Get full text
Conference or Workshop Item -
3
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
Published 2023“…The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
-
5
Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem
Published 2008“…Future, area that may be explored include the used of Ant Colony Optimization (ACO) which exploits the nature phenomenon of ants. …”
Get full text
Get full text
Monograph -
6
Sensitivity analysis of GA parameters for ECED problem
Published 2023“…Besides the conventional method by using the Lagrange Multiplier several evolutionary computation techniques such as Genetic Algorithm, Particle Swarm Optimisation, Ant Colony and Differential Evolution have been gaining popularity in solving general economic dispatch problems due to their desirable characteristics such as non-gradient dependent and ability to search for global optima. …”
Conference paper -
7
-
8
Task scheduling in cloud computing using hybrid genetic algorithm and bald eagle search (GA-BES)
Published 2022“…The natural evolution optimization algorithm which is genetic algorithm can be improve by combining the nature meta-heuristic algorithms which is bald eagle search to improve the makespan of genetic algorithm using cloudsim that need to be implement on the eclipse platform. …”
Get full text
Get full text
Get full text
Academic Exercise -
9
Dynamic smart grid communication parameters based cognitive radio network
Published 2023“…A differential evolution algorithm is used to select the optimal transmission parameters for given communication modes based on a fitness function that combines multiple objectives based on appropriate weights. …”
Article -
10
A hybrid optimization technique for solving economic emission load dispatch problems
Published 2023text::Final Year Project -
11
-
12
Ant colony optimization and genetic algorithm models for suspended sediment discharge estimation for gorgan-river, Iran
Published 2011“…New models based on artificial intelligence models, namely; Ant Colony Optimization (ACO) and Genetic Algorithm (GA) are now being used more frequently to solve optimization problems. …”
Get full text
Get full text
Thesis -
13
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text
Thesis -
14
Comparison between ant colony and genetic algorithm using traveling salesman problem
Published 2013“…In ant colony algorithm each individual ant constructs a part of the solution using an artificial pheromone which reflects its experience accumulated while solving the problem and heuristic information dependent on the problem. …”
Get full text
Get full text
Get full text
Article -
15
Ant colony optimization in dynamic environments
Published 2010“…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
Thesis -
16
Interacted Multiple Ant Colonies for Search Stagnation Problem
Published 2010“…This thesis addresses the issues associated with search stagnation problem that ACO algorithms suffer from. In particular, it proposes the use of multiple interacted ant colonies as a new algorithmic framework. …”
Get full text
Get full text
Get full text
Thesis -
17
Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique
Published 2008“…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
Article -
18
A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules
Published 2013“…In the first proposed algorithm, SA is used to optimize the rule's discovery activity by an ant. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Heuristic factors in ant system algorithm for course timetabling problem
Published 2009“…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
Get full text
Get full text
Conference or Workshop Item -
20
New heuristic function in ant colony system for the travelling salesman problem
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
