Essays about: "Travelling Salesman Problem"

Showing result 6 - 10 of 11 essays containing the words Travelling Salesman Problem.

  1. 6. Augmented Reality Framework for Supporting and Monitoring Operators during Maintenance Operations in Industrial Environments

    University essay from Högskolan i Skövde/Institutionen för ingenjörsvetenskap

    Author : Leire Amenabar; Leire Carreras; [2018]
    Keywords : augmented reality; maintenance; travelling salesman problem; expert systems; monitoring; database; QR code;

    Abstract : In an ever-changing and demanding world where short assembly and innovation times are indispensable, it is of paramount importance to ensure that the machinery used throughout the whole process of a product are in their best possible condition. This guarantees that the performance of each machine will be optimal, and hence, the process times will be the shortest possible, while the best quality products are obtained. READ MORE

  3. 7. Winter Road Maintenance Planning-Decision Support Modelling

    University essay from Luleå tekniska universitet/Institutionen för samhällsbyggnad och naturresurser

    Author : Keegan Mbiyana; [2018]
    Keywords : Decision Support System; Winter Road Maintenance; Optimal maintenance Cost; Sensitivity analysis; Road condition; Maintenance framework; Digital representation; Operations research.;

    Abstract : Winter in Northern Sweden comes with very harsh and unpredictable condition associated with large amounts of snowfall covering roadways thereby affecting transportation by roads. When the road conditions i.e. READ MORE

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

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

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

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

  5. 9. The Asymmetric Travelling Salesman Problem : A Linear Programming Solution Approach

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : SOHOF DASTMARD; [2014]
    Keywords : ;

    Abstract : The travelling salesman problem is a well known optimization problem. The goal is to nd theshortest tour that visits each city in a given list exactly once. Despite the simple problem statementit belongs to the class of NP-complete problems. Its importance arises from a plethora of applicationsas well as a theoretical appeal. READ MORE

  6. 10. Optimal Path Searching through Specified Routes using different Algorithms

    University essay from Datateknik

    Author : Farhan Farooq; [2009]
    Keywords : Routing problem; Shortest Path; Greedy Algorithm; Simulated Annealing; Exhaustive Search; Travelling Salesman Problem; Combinatorial Optimization;

    Abstract : To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. READ MORE