Essays about: "Traveling Salesman Problem"

Showing result 16 - 20 of 21 essays containing the words Traveling Salesman Problem.

  1. 16. AI Planning-Based Service Modeling for the Internet of Things

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Quentin Bahers; [2015]
    Keywords : Internet of Things; Artificial Intelligence;

    Abstract : It is estimated that by 2020, more than 50 billion devices will be interconnected, to form what is called the Internet of Things. Those devices range from consumer electronics to utility meters, including vehicles. READ MORE

  3. 17. The Asymmetric Traveling Salesman Problem

    University essay from Matematiska institutionen

    Author : Per Mattsson; [2010]
    Keywords : atsp; asymmetric traveling salesman problem; approximation algorithms; computational complexity;

    Abstract : This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the ATSP we are given a set of cities and a function that gives the cost of travelingbetween any pair of cities. The cost function must satisfy the triangle inequality, i.e. READ MORE

  4. 18. Ant colony for TSP

    University essay from Datateknik

    Author : Yinda Feng; [2010]
    Keywords : TSP; ant colony; pheromone; combinatorial optimization;

    Abstract : The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. READ MORE

  5. 19. Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

    University essay from Datateknik

    Author : Muhammad Umair KHAN; [2010]
    Keywords : Multilevel Graph Partitioning;

    Abstract : The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. READ MORE

  6. 20. Computation of Mileage Limits for Traveling Salesmen by Means of Optimization Techniques

    University essay from Matematiska institutionen

    Author : Johan Torstensson; [2008]
    Keywords : period traveling salesman problem; periodic; traveling salesman problem; ptsp; tsp; heuristic algorithm; mileage limit; business trips; travel expenses compensation;

    Abstract : Many companies have traveling salesmen that market and sell their products.This results in much traveling by car due to the daily customer visits. Thiscauses costs for the company, in form of travel expenses compensation, and environmentaleffects, in form of carbon dioxide pollution. READ MORE