The Travelling Salesman

Slides:



Advertisements
Similar presentations
CS6800 Advanced Theory of Computation
Advertisements

Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.
Traveling Salesman Problem By Susan Ott for 252. Overview of Presentation Brief review of TSP Examples of simple Heuristics Better than Brute Force Algorithm.
Copyright, 1996 © Dale Carnegie & Associates, Inc. Presentation Guidelines.
Vehicle Routing & Scheduling: Part 1
TESC Effective Presentations PlanPractice PreparePresent.
MAE 552 – Heuristic Optimization Lecture 27 April 3, 2002
Nature’s Algorithms David C. Uhrig Tiffany Sharrard CS 477R – Fall 2007 Dr. George Bebis.
Vehicle Routing & Scheduling
Travelling Salesman Problem an unfinished story...
EAs for Combinatorial Optimization Problems BLG 602E.
MAE 552 – Heuristic Optimization Lecture 5 February 1, 2002.
Selling Your Ideas BA 3750 SALES MANAGEMENT Copyright © Dale Carnegie & Associates, Inc.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
Combinatorial Optimization Chapter 1. Problems and Algorithms  1.1 Two Problems (representative problems)  The Traveling Salesman Problem 47 drilling.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
Traveling Salesman Problem (TSP)
Princess Nora University Artificial Intelligence Chapter (4) Informed search algorithms 1.
Analysis of the Traveling Salesman Problem and current approaches for solving it. Rishi B. Jethwa and Mayank Agarwal. CSE Department. University of Texas.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
Retail Distribution Inside a City or small Region.
Copyright, 1996 © Dale Carnegie & Associates, Inc. Selling Your Ideas TIP For additional advice see Dale Carnegie Training® Presentation Guidelines.
Traveling Salesman Problem DongChul Kim HwangRyol Ryu.
Hamilton Paths and Hamilton Circuits
Data Structures Lab Algorithm Animation.
Part 2 The Volunteer Code of Ethics
Routing Through Networks - 1
Week 11 - Monday CS221.
Example: Applying EC to the TSP Problem
Nutritional Wellness ANTIOXIDANTS 9/18/2018 Lydia Kokline, CFC, CPTS
Chapter 2: Business Efficiency Lesson Plan
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Copyright © Dale Carnegie & Associates, Inc.
The Continuous Development of Student Writing
Hurricaneville: The Source For Hurricane Information
Laurie Fogleman Kenwood High School
-POLAR BEAR DEFENSE- MULTIPLE COVERAGE PHILOSPHY
Chapter 2: Business Efficiency Lesson Plan
Budget & Checking Project
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
Heuristics Definition – a heuristic is an inexact algorithm that is based on intuitive and plausible arguments which are “likely” to lead to reasonable.
EVA MOLNAR, TRANSPORT SECTOR MANAGER
Example: Applying EC to the TSP Problem
GOALTENDING 1966 MAHA GOALTENDING 11/27/2018.
Government Response to Monopoly
GOALTENDING 1966 MAHA GOALTENDING 11/30/2018.
Can you trust Statistics?
Chapter 2: Business Efficiency Business Efficiency
Example: Applying EC to the TSP Problem
Heuristic Algorithms via VBA
RET is funded by the National Science Foundation, grant # EEC
BA 293 Applied Software Management
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Paul Apolinario English Department Bishop Alemany High School
More on Search: A* and Optimization
Dr. Elsa Fourie North West University SOUTH AFRICA
The Traveling Salesperson Problem
Heuristic Algorithms via VBA
Heuristic Algorithms via VBA
Artificial Intelligence CIS 342
Yahoo Search Technologies, Yahoo, Inc. – ROC June 2004
Spanning Trees Lecture 20 CS2110 – Spring 2015.
Lecture 2 Geometric Algorithms.
Approximation Algorithms
Government Response to Monopoly
II PAHO-DOTA Workshop on Quality of Care of Diabetes Care
Copyright-2003 © RAZORLAND55
Early Mitigation Funding
Presentation transcript:

The Travelling Salesman Selling your ideas is challenging. First, you must get your listeners to agree with you in principle. Then, you must move them to action. Use the Dale Carnegie Training® Evidence – Action – Benefit formula, and you will deliver a motivational, action-oriented presentation. Marietjie Venter IOI training camp 18-20 June

IOI training camp 18-20 June The Setting A salesman wants to sell his product in a number of cities. He wants to visit each city exactly once and then return to the city where he started off. The cities can be visited in any order. Open your presentation with an attention-getting incident. Choose an incident your audience relates to. The incidence is the evidence that supports the action and proves the benefit. Beginning with a motivational incident prepares your audience for the action step that follows. IOI training camp 18-20 June

IOI training camp 18-20 June The Problem Find the order in which the salesman has to visit the cities so that the total travelling distance is a minimum, called the optimal tour. Very simple  Next, state the action step. Make your action step specific, clear and brief. Be sure you can visualize your audience taking the action. If you can’t, they can’t either. Be confident when you state the action step, and you will be more likely to motivate the audience to action. IOI training camp 18-20 June

IOI training camp 18-20 June The Solution Not so simple  Optimal solution is of O(n^x) Optimization problem: Find the best solution you can in the given time, even though it might not be the optimal solution. Next, state the action step. Make your action step specific, clear and brief. Be sure you can visualize your audience taking the action. If you can’t, they can’t either. Be confident when you state the action step, and you will be more likely to motivate the audience to action. IOI training camp 18-20 June

IOI training camp 18-20 June Always Remember Keep track of the best solution so far. Keep track runtime so far (if there is a time limit) Give the best solution so far when time runs out. Next, state the action step. Make your action step specific, clear and brief. Be sure you can visualize your audience taking the action. If you can’t, they can’t either. Be confident when you state the action step, and you will be more likely to motivate the audience to action. IOI training camp 18-20 June

IOI training camp 18-20 June Possible Approaches Good old random! Generate random solutions. Keep track of the best solution so far. Give the best solution so far when time runs out. Techniques can be used to improve the solution (discussed later). Next, state the action step. Make your action step specific, clear and brief. Be sure you can visualize your audience taking the action. If you can’t, they can’t either. Be confident when you state the action step, and you will be more likely to motivate the audience to action. IOI training camp 18-20 June

IOI training camp 18-20 June Nearest Neighbour Construct the tour by going from each city to the closest unvisited city until all the cities have been visited. Some cities can be “forgotten” only to have to be inserted later at high cost to the solution. (Greedy algorithm) To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

IOI training camp 18-20 June Insertion Heuristics Start with a subtour. Keep adding cities until all the cities are included. Things to consider: Choice of starting subtour. How to choose the next node (city) to insert in the tour. Where to insert it. Next, state the action step. Make your action step specific, clear and brief. Be sure you can visualize your audience taking the action. If you can’t, they can’t either. Be confident when you state the action step, and you will be more likely to motivate the audience to action. IOI training camp 18-20 June

IOI training camp 18-20 June Choice of Subtour Typically 3 cities, e.g. the 3 cities that form the largest triangle. Very good option: the tour that forms the convex hull of all the nodes (cities). To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

IOI training camp 18-20 June Convex Hull Each dot represents a city. Red “ring” illustrates the convex hull. Tour is convex. All the cities fall inside the ring. As if you wrap an elastic band around all the cities. To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

IOI training camp 18-20 June Cheapest Insertion Each time insert the city which causes the lowest increase in total distance. ((dist AC + dist CB) – dist AB) is a minimum. (Greedy algorithm) To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

IOI training camp 18-20 June Farthest Insertion Insert the city of which its closest distance to the existing tour is a maximum. The idea is to fix the overall layout of the tour as soon as possible. To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

IOI training camp 18-20 June Improving Solutions Exchange: change the order in which 2 cities occur in the tour and check if this decreases the total distance. To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

IOI training camp 18-20 June Improving Solutions Genetic Programming: Mutation Randomly alter the tour to see if a better one can be found. Selective “breeding” Take two good solutions and combine them to see if a better one can be constructed. To complete the Dale Carnegie Training® Evidence – Action – Benefit formula, follow the action step with the benefits to the audience. Consider their interests, needs, and preferences. Support the benefits with evidence; i.e., statistics, demonstrations, testimonials, incidents, analogies, and exhibits and you will build credibility. IOI training camp 18-20 June

The Travelling Salesman Nearest Neighbour Insertion Heuristics Convex hull Cheapest insertion Farthest insertion Improving solutions To close, restate the action step followed by the benefits. Speak with conviction and confidence, and you will sell your ideas. IOI training camp 18-20 June