Sökning: "Genetiska algoritmer"

Visar resultat 1 - 5 av 57 uppsatser innehållade orden Genetiska algoritmer.

  1. 1. Designing bus route networks with algorithms

    Master-uppsats, KTH/Optimeringslära och systemteori

    Författare :Philip Svensson; [2020]
    Nyckelord :Optimization; applied mathematics; heuristics; genetic algorithm; transport; Optimering; tillämpad matematik; heuristik; genetiska algoritmer; transport;

    Sammanfattning : The aim of this thesis is to make use of real world travel time and demand data and implement an algorithm which designs bus networks. Consideration is taken to both passenger and bus operator interests. LÄS MER

  2. 2. Strategic optimization of a global bank capital management using statistical methods on open data

    Master-uppsats, KTH/Matematisk statistik

    Författare :Thibaud Barreau; [2020]
    Nyckelord :datascience; regression; genetic algorithms; capital management; statistics; banking; datavetenskap; regression; genetiska algoritmer; kapitalhantering; statistik; bank;

    Sammanfattning : This project is about the optimization of the capital management of a French global bank. Capital management corresponds here to allocating the available capital to the different business units. LÄS MER

  3. 3. Comparing genetic algorithms and tabu search in the order batch picking problem

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS); KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Jonas Valfridsson; Johan Vikström; [2019]
    Nyckelord :;

    Sammanfattning : In this paper genetic algorithms (GA) and tabu search are compared in the order batch picking problem – modelled as a multiple agent traveling salesman problem. The algorithms are evaluated in a simulated warehouse implemented with class based storage in mind. LÄS MER

  4. 4. Monto Carlo Tree Search in Real Time Strategy Games with Applications to Starcraft 2

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Aron Granberg Orrevall; [2019]
    Nyckelord :;

    Sammanfattning : This thesis presents an architecture for an agent that can play the real-time strategy game Starcraft 2 (SC2) by applying Monte Carlo Tree Search (MCTS) together with genetic algorithms and machine learning methods. Together with the MCTS search, a light-weight and accurate combat simulator for SC2 as well as a build order optimizer are presented as independent modules. LÄS MER

  5. 5. Genetic Algorithms : Comparing Evolution With and Without a Simulated Annealing-inspired Selection

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS); KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Mats Andersson; David Mellin; [2019]
    Nyckelord :;

    Sammanfattning : The Genetic Algorithm (GA) is an interesting problem solving algorithm which takes inspiration from evolution in order to self-improve and reach good solutions to problems by reproduction and mutation. This thesis compares a GA with and without a Simulated Annealing (SA) inspired selection when it comes to solving three different instances of the Traveling Salesman Problem (TSP). LÄS MER