Essays about: "Traveling Salesman Problem"

Showing result 1 - 5 of 18 essays containing the words Traveling Salesman Problem.

  1. 1. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem

    University essay from Blekinge Tekniska Högskola

    Author : Hatem Mohi El Din; [2021]
    Keywords : Ant colony optimization; genetic algorithm; metaheuristics; javascript; python; C#;

    Abstract : Metaheuristics is a term for optimization procedures/algorithms that can be applied to a wide range of problems. These problems for which metaheuristics are used usually fall in the NP-hard category, meaning that they cannot be solved in polynomial time. This means that as the input dataset gets larger the time to solve increases exponentially. READ MORE

  2. 2. A BINARY SPACE PARTITIONED ANT COLONY OPTIMIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM

    University essay from Mälardalens högskola/Akademin för innovation, design och teknik

    Author : Niclas Ståhlbom; [2021]
    Keywords : ant colony optimization; ACO; aco; binary space partitioning; BSP; bsp; algorithm; optimization;

    Abstract : A common type of problems that exist in both industrial and scientific spaces are optimization problems. These problems can be found in among other things manufacturing, pathfinding, network routing and more. Because of the wide area of application, optimization is well a studied area. READ MORE

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

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

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS); 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