Sökning: "ant colony algorithm"

Visar resultat 16 - 20 av 21 uppsatser innehållade orden ant colony algorithm.

1. 16. Utilizing Swarm Intelligence Algorithms for Pathfinding in Games

   Kandidat-uppsats, Högskolan i Skövde/Institutionen för informationsteknologi

   Författare :Alexander Kelman; [2017]
   Nyckelord :Swarm Intelligence; Pathfinding; Ant Colony Optimization; Particle Swarm Optimization; A*;

   Sammanfattning : 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. LÄS MER

3. 17. Evaluating pheromone intensities and 2-opt local search for the Ant System applied to the Dynamic Travelling Salesman Problem

   Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :Erik R. Svensson; Klas Lagerqvist; [2017]
   Nyckelord :ACO; Ant System; Traveling Salesman Problem; Dynamic Traveling Salesman Problem; 2-opt local search; Handelsresandeproblemet; Dynamiska Handelsresandeproblemet;

   Sammanfattning : 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. LÄS MER

4. 18. Parameter Tuning Experiments of Population-based Algorithms

   Kandidat-uppsats, Institutionen för informationsteknologi och medier

   Författare :Mikael Nilsson; [2011]
   Nyckelord :Artificial Intelligence; Ant Colony Optimization; Genetic Algorithm; Self-Organizing Map; Capacitated Vehicle Routing Problem; Capacitated Vehicle Routing Problem with Time Windows; SPOT; ParamILS.;

   Sammanfattning : 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. LÄS MER

5. 19. Ant colony for TSP

   Kandidat-uppsats, Datateknik

   Författare :Yinda Feng; [2010]
   Nyckelord :TSP; ant colony; pheromone; combinatorial optimization;

   Sammanfattning : The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. LÄS MER

7. 20. Task assignment optimization in SAP Extended WarehouseManagement

   Master-uppsats, Datateknik

   Författare :Akos Monori; [2008]
   Nyckelord :Warehouse management; task assignment; generalized assignment problem; SAP; EWM;

   Sammanfattning : Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex and difficult taskregarding to the different processes and factors in a usual warehouse when we want tominimize the labor costs. LÄS MER