Sökning: "Dynamiska Handelsresandeproblemet"

Hittade 1 uppsats innehållade orden Dynamiska Handelsresandeproblemet.

  1. 1. 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