Essays about: "ant colony optimization"
Showing result 16 - 20 of 23 essays containing the words ant colony optimization.
-
16. Ant Colony Optimization Algorithms : Pheromone Techniques for TSP
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : Ant Colony Optimization (ACO) uses behaviour observed in real-life ant colonies in order to solve shortest path problems. Short paths are found with the use of pheromones, which allow ants to communicate indirectly. READ MORE
-
17. Utilizing Swarm Intelligence Algorithms for Pathfinding in Games
University essay from Högskolan i Skövde/Institutionen för informationsteknologiAbstract : The Ant Colony Optimization and Particle Swarm Optimization are two Swarm Intelligence algorithms often utilized for optimization. Swarm Intelligence relies on agents that possess fragmented knowledge, a concept not often utilized in games. READ MORE
-
18. Evaluating pheromone intensities and 2-opt local search for the Ant System applied to the Dynamic Travelling Salesman Problem
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : Ant Colony Optimization (ACO) algorithms have been successful in solving a wide variety of NPhard optimization problems. The Traveling Salesman Problem (TSP) has served as a benchmarking problem for many novel ACO algorithms. READ MORE
-
19. Protein Folding Implementation of Stochastic and Deterministic Algorithms using the two-dimensionalHP Model for Computer Simulation of the Protein Folding Process
University essay from Göteborgs universitet/Institutionen för data- och informationsteknikAbstract : In nature, proteins are often found to instantly fold into the con guration with the lowest amount of free energy. Due to the complexity of this process, it is today still unknown exactly how it occurs. Since proteins have crucial roles in essentially all biological processes, this is an important problem within structural biology. READ MORE
-
20. Parameter Tuning Experiments of Population-based Algorithms
University essay from Institutionen för informationsteknologi och medierAbstract : In this study, three different algorithms are implemented to solve thecapacitated vehicle routing problem with and without time windows:ant colony optimization, a genetic algorithm and a genetic algorithmwith self-organizing map. For the capacitated vehicle routing problemthe Augerat et al’s benchmark problems were used and for the capaci-tated vehicle routing problem with time windows the Solomon’sbenchmark problems. READ MORE