Travelling Salesman Problem an unfinished story...

Slides:

Advertisements

Similar presentations

CS6800 Advanced Theory of Computation

Advertisements

Carthagène A brief introduction to combinatorial optimization: The Traveling Salesman Problem Simon de Givry.

Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.

Reducibility Class of problems A can be reduced to the class of problems B Take any instance of problem A Show how you can construct an instance of problem.

Ant colonies for the traveling salesman problem Eliran Natan Seminar in Bioinformatics (236818) – Spring 2013 Computer Science Department Technion - Israel.

Vehicle Routing & Scheduling: Part 1

Rohit Ray ESE 251. The goal of the Traveling Salesman Problem (TSP) is to find the most economical way to tour of a select number of “cities” with the.

Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.

Math443/543 Mathematical Modeling and Optimization

Vehicle Routing & Scheduling

Evolutionary Computing and the Traveling Salesman

A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting.

EAs for Combinatorial Optimization Problems BLG 602E.

1 Efficiency of Algorithms. 2  Two main issues related to the efficiency of algorithms:  Speed of algorithm  Efficient memory allocation  We will.

The Traveling Salesperson Problem

Network Optimization Problems: Models and Algorithms

Solution methods for Discrete Optimization Problems.

1 Discrete Optimization. 2 The relationship between counting techniques/graph theory and discrete optimization Adding a goal (objective function) to a.

Ch. 11: Optimization and Search Stephen Marsland, Machine Learning: An Algorithmic Perspective. CRC 2009 some slides from Stephen Marsland, some images.

The Travelling Salesman Problem (TSP)

GAlib A C++ Library of Genetic Algorithm Components Vanessa Herves Gómez Department of Computer Architecture and Technology,

The Traveling Salesperson Problem Algorithms and Networks.

The Traveling Salesman Problem Approximation

1 1 1-to-Many Distribution Vehicle Routing John H. Vande Vate Spring, 2005.

COSC 4426 Topics in Computer Science II Discrete Optimization Good results with problems that are too big for people or computers to solve completely

UC San Diego / VLSI CAD Laboratory Incremental Multiple-Scan Chain Ordering for ECO Flip-Flop Insertion Andrew B. Kahng, Ilgweon Kang and Siddhartha Nath.

Combinatorial Optimization Chapter 1. Problems and Algorithms  1.1 Two Problems (representative problems)  The Traveling Salesman Problem 47 drilling.

Search Methods An Annotated Overview Edward Tsang.

6.1 Hamilton Circuits and Paths: Hamilton Circuits and Paths: Hamilton Path: Travels to each vertex once and only once… Hamilton Path: Travels to each.

Spring 2015 Mathematics in Management Science Traveling Salesman Problem Approximate solutions for TSP NNA, RNN, SEA Greedy Heuristic Algorithms.

Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.

Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.

Doshisha Univ., Kyoto, Japan CEC2003 Adaptive Temperature Schedule Determined by Genetic Algorithm for Parallel Simulated Annealing Doshisha University,

Metaheuristic – Threshold Acceptance (TA). 2 Outlines ▪ Measuring Computational Efficiency ▪ Construction Heuristics ▪ Local Search Algorithms ▪ Metaheuristic.

Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.

Evolution Programs (insert catchy subtitle here).

The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach by John Silberholz, University of Maryland Bruce Golden, University of Maryland.

Traveling Salesman Problem IEOR 4405 Production Scheduling Professor Stein Sally Kim James Tsai April 30, 2009.

Traveling Salesman Problem (TSP)

TSP – Upper Bounds and Lower Bounds Initial problem : Upper Bound A salesman based in Stockton needs to visit shops based in Darlington, Billingham, Middlesbrough,

Presenter: Leo, Shih-Chang, Lin Advisor: Frank, Yeong-Sung, Lin /12/16.

Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07.

CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.

Analysis of the Traveling Salesman Problem and current approaches for solving it. Rishi B. Jethwa and Mayank Agarwal. CSE Department. University of Texas.

March 7, Using Pattern Recognition Techniques to Derive a Formal Analysis of Why Heuristic Functions Work B. John Oommen A Joint Work with Luis.

By: Christophe Dufour Chrishon Adams Mischael Joseph.

Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.

Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.

Retail Distribution Inside a City or small Region.

Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.

11/30/2006 Travelling Salesman Problem Sebastian Dittmann COSC 6111 Advanced Design and Analysis of Algorithms.

Solving Complex Problems

Routing Through Networks - 1

Nuffield Free-Standing Mathematics Activity

Local Container Truck Routing Problem with its Operational Flexibility Kyungsoo Jeong, Ph.D. Candidate University of California, Irvine Local container.

Unsolvable Problems December 4, 2017.

1 The Travelling Salesman Problem (TSP) H.P. Williams Professor of Operational Research London School of Economics.

Ant colonies for traveling salesman problem

Genetic Algorithms and TSP

metaheuristic methods and their applications

Fine-Grained Complexity Analysis of Improving Traveling Salesman Tours

Heuristic Algorithms via VBA

Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?

Planning the transportation of elderly to a daycare center

traveling salesman problem

Heuristic Algorithms via VBA

Heuristic Algorithms via VBA

Vehicle Routing John H. Vande Vate Fall,

Solution methods for NP-hard Discrete Optimization Problems

The Travelling Salesman

Presentation transcript:

Travelling Salesman Problem an unfinished story...

Contents Description of the problem History Sample Algorithms Performance Comparison TSP with Parallel Computing Conclusion

Description of the Problem Given a number of cities and the costs of travelling from any city to any other city, what is the least-cost round-trip route that visits each city exactly once and then returns to the starting city?

History The origins of the travelling salesman problem are unclear. A handbook for travelling salesmen from 1832 mentions the problem and includes example tours through Germany and Switzerland, but contains no mathematical treatment.

Sample Algorithms Constructive Heuristics – Nearest Neighbour (Greedy) – Insertion Heuristics 2-OPT 3-OPT Genetic Algoritms Simulated Annealing Neural Network

Performance Comparison

continued...

TSP with Parallel Computing Time (sec.) NPNP

TSP with Parallel Computing

Conclusion For small-size TSP (n < 50), improved greedy 2-opt algorithm is recommended. For medium-size TSP ( 50 < n < 100), improved 2-opt algorithm and neural network are recommended for their optimality and efficiency. For large-size problem (100 < n < 500), the improved genetic algorithm is recommended. For any problem-size, if the computational time is not a constraint, the improved neural network is always recommended.