Essays about: "Traveling Salesman Problem"

Showing result 6 - 10 of 21 essays containing the words Traveling Salesman Problem.

  1. 6. Bayesian Parameter Tuning of the Ant Colony Optimization Algorithm : Applied to the Asymmetric Traveling Salesman Problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Emmy Yin; Klas Wijk; [2021]
    Keywords : ;

    Abstract : The parameter settings are vital for meta-heuristics to be able to approximate the problems they are applied to. Good parameter settings are difficult to find as there are no general rules for finding them. Hence, they are often manually selected, which is seldom feasible and can give results far from optimal. READ MORE

  3. 7. AI utilization in route planning for delivery trucks within the supply chain

    University essay from Lunds universitet/Institutionen för elektro- och informationsteknik

    Author : André Reis; Sebastian Nordqvist; [2021]
    Keywords : Route optimization; Route planning; NEAT; Genetic algorithm; Key factors; Load planning; Machine learning.; Technology and Engineering;

    Abstract : The supply chain has potential for growth. Many different parts can be optimized, and every possible improvement has not yet been tested. READ MORE

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Jonas Valfridsson; Johan Vikström; [2019]
    Keywords : ;

    Abstract : 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. READ MORE

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Mats Andersson; David Mellin; [2019]
    Keywords : ;

    Abstract : 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). READ MORE

  6. 10. Ant Colony Optimization - Optimal Number of Ants

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Lars Pettersson; Christoffer Lundell Johansson; [2018]
    Keywords : ;

    Abstract : The focus of this thesis paper is to study the impact the number of ants has on the found solution of the Ant Colony Optimization (ACO) metaheuristic when solving the Traveling Salesman Problem. The goal was to find out how the length of the computed tours change for different amounts of ants within a limited number of iterations. READ MORE