41. Using Traveling Salesman Problem Algorithms For Evolutionary Tree Construction next Next Introduction Using traveling salesman problem Algorithmsfor Evolutionary Tree Construction. Chantal Korostensky and Gaston http://www.inf.ethz.ch/personal/gonnet/papers/Construction/

Next: Introduction Using Traveling Salesman Problem Algorithms for Evolutionary Tree Construction Chantal Korostensky and Gaston H. Gonnet Institute for Scientific Computing ETH Zurich, Switzerland e-mail: Date: Abstract: We present a new tree construction method that constructs a tree with minimum score for a given set of sequences. To do this, the problem of tree construction is reduced to the Traveling Salesman Problem (TSP). The input for the TSP algorithm are the pairwise distances of the sequences and the output is a circular tour through the optimal, unknown tree plus the minimum score of the tree. The circular order and the score of the optimal tree can be used to construct the topology of the tree in time where n is the number of input sequences. We can guarantee that we reconstruct a correct evolutionary tree if the error for each distance measurement is smaller than , where x is the shortest edge in the tree. For data sets with large errors, a dynamic programming approach is used to reconstruct the tree. Keywords : tree construction, Traveling Salesman, circular order, evolution

42. ScienceDaily News Release: Computer Scientist Solves Old Salesman Problem Washington University, has developed an algorithm that attacks an old problem inthe computing and business worlds known as the traveling salesman problem (TSP http://www.sciencedaily.com/releases/2001/01/010116075125.htm

Search Our Archives Keywords: Order by: date relevance More options Get ad-free access with email updates sign up or log in Text size: A A A Welcome Home page About this site Awards, reviews News Summaries Headlines Topics Shop Our stuff Browse books Magazines Software Contribute Register free Post release Edit profile Review hits Advertise Media kit Traffic stats Contact us Previous Story ... Related Stories Next Story Source: Washington University In St. Louis Date: Computer Scientist Solves Old Salesman Problem It was a combination of things, physical and metaphysical, that killed Arthur Miller's traveling salesman Willie Loman. Now a computer scientist at Washington University in St. Louis has developed and tested an algorithm that might at least have made Loman's road traveled a little easier. Weixiong Zhang, Ph. D., associate professor of computer science at Washington University, has developed an algorithm that attacks an old problem in the computing and business worlds known as the Traveling Salesman Problem (TSP). An algorithm is the backbone of computer operations; it is a step-wise mathematical formula, similar to a recipe, that solves a problem or reaches an otherwise desired end. The Traveling Salesman Problem is actually an umbrella term for a whole host of planning and scheduling problems, often involving routes; a classic one being a postman's route, for instance. Zhang and his collaborator tested his algorithm on four different classes of coin collecting routes, with routes of 100, 316, 1,000, and 3,162 different payphones. Compared with six other algorithms tested, the Zhang algorithm found the shortest, most efficient, or cost-effective route in each case. The algorithm is scalable and robust; it can compute for up to half million "nodes," in this case payphones, and it computed some routes in a matter of seconds.

43. Branch And Cut For The Traveling Salesman Problem Branch Cut and Price Applications traveling salesman problem withthe SYMPHONY distribution. traveling salesman problem Links http://branchandcut.org/TSP/

Branch Cut and Price Applications : Traveling Salesman Problem Home Software Applications FAQ ... SYMPHONY now includes a basic TSP solver. It uses separation subroutines from the CONCORDE TSP Solver of Applegate, Bixby, Chvatal, and Cook. Source code for the basic TSP/VRP solver is available with the SYMPHONY distribution. Traveling Salesman Problem Links Data Sets from TSPLIB Reference Materials This page maintained by Ted Ralphs ( ted@branchandcut.org Last updated August 2, 2002

44. OperationsResearch.com - 'Traveling Salesman Problem (TSP)' Next Prev Top. traveling salesman problem (TSP). Asymmetric TravelingSalesman Problem 1, 2; The traveling salesman problem - 1, 2; http://opsresearch.com/OR-Links/P10.html

Next Prev Top Traveling Salesman Problem (TSP) Asymmetric Traveling Salesman Problem The Traveling Salesman Problem David Neto's TSP reading list TSPLIB ... The Travelling Salesperson Problem

45. CS267. Assignment 4: Traveling Salesman Problem CS267. Assignment 4 traveling salesman problem. Due April 1, 1996. Introduction.You will try to solve the traveling salesman problem (TSP) in parallel. http://www.cs.berkeley.edu/~demmel/cs267/assignment4.html

CS267. Assignment 4: Traveling Salesman Problem Due: April 1, 1996 Introduction You will try to solve the Traveling Salesman Problem (TSP) in parallel. You are given a list of n cities along with the distances between each pair of cities. The goal is to find a tour which starts at the first city, visits each city exactly once and returns to the first city, such that the distance traveled is as small as possible. This problem is known to be NP-complete , i.e. no serial algorithm exists that runs in time polynomial in n, only in time exponential in n, and it is widely believed that no polynomial time algorithm exists. In practice, we want to compute an approximate solution , i.e. a single tour whose length is as short as possible, in a given amount of time. directed , so that an edge (i,j) may only be traversed in the direction from i to j, and edge (j,i) may or may not exist. Similarly, w(i,j) does not necessarily equal w(j,i), if both edges exist. There are a great many algorithms for this important problem, some of which take advantage of special properties like symmetry (edges (i,j) and (j,i) always exist or do not exist simultaneously, and w(i,j) = w(j,i)) and the

46. CS267. Assignment 5: Traveling Salesman Problem CS267. Assignment 5 traveling salesman problem. Due March 21, 1995. Introduction.You will try to solve the traveling salesman problem (TSP) in parallel. http://www.cs.berkeley.edu/~demmel/cs267-1995/assignment5.html

CS267. Assignment 5: Traveling Salesman Problem Due March 21, 1995 Introduction You will try to solve the Traveling Salesman Problem (TSP) in parallel. You are given a list of n cities along with the distances between each pair of cities. The goal is to find a tour which starts at the first city, visits each city exactly once and returns to the first city, such that the distance traveled is as small as possible. This problem is known to be NP-complete , i.e. no serial algorithm exists that runs in time polynomial in n, only in time exponential in n, and it is widely believed that no polynomial time algorithm exists. In practice, we want to compute an approximate solution , i.e. a single tour whose length is as short as possible, in a given amount of time. directed , so that an edge (i,j) may only be traversed in the direction from i to j, and edge (j,i) may or may not exist. Similarly, w(i,j) does not necessarily equal w(j,i), if both edges exist. There are a great many algorithms for this important problem, some of which take advantage of special properties like symmetry (edges (i,j) and (j,i) always exist or do not exist simultaneously, and w(i,j) = w(j,i)) and the

47. The Traveling Salesman Problem On Halin Graphs 8355393 Fax (505)835-5366 math@nmt.edu, The Traveling SalesmanProblem on Halin Graphs. A 4-connected Halin graph is a graph of http://www.nmt.edu/~math/research/curt1.html

New Mexico Tech Socorro, NM 87801 Phone: (505)835-5393 Fax: (505)835-5366 math@nmt.edu The Traveling Salesman Problem on Halin Graphs A 4-connected Halin graph is a graph of vertex connectivity 4 of the form H = S U T U C, where S and T are isomorphic plane trees with common leaves and C is the cycle containing the leaves of S in the order determined by the plane representation of S ot T. A 3-connected Halin graph has a similar form H = T U C. 3-connected Halin graphs have many interesting properties. They are Hamiltonian-connected and 1-Hamiltonian (the vertex deleted subgraphs are Hamiltonian). Furthermore the travelling salesman problem can be solved in linear time on a weighted 3-connected Halin graph. We have worked on the 4-connected Halin graphs and proved the following for an arbitrary 4-connected Halin graph H of order n : (a) H is pancyclic and so is any vertex deleted subgraph (b) H is 2-Hamiltonian (c) The travelling salesman problem can be done in O(n^2) time on H (d) if x and y are vertices of H then H-x-y is Hamiltonian.

48. Traveling Salesman Problem traveling salesman problem. The traveling salesman problem (TSP) is tofind the shortest tour through all the nodes in an undirected graph. http://dollar.biz.uiowa.edu/~fil/Thesis/node27.html

Next: Satisfiability Up: 2. Combinatorial optimization Previous: 2. Combinatorial optimization Traveling salesman problem The traveling salesman problem (TSP) is to find the shortest tour through all the nodes in an undirected graph. The length is given by the sum of the weights of all the edges through the tour. The Euclidean TSP is the special case in which each node corresponds to a point on the plane, connected by edges to all other nodes, and the weight of an edge is given by the Euclidean distance between the two points connected by the edge. We generate a Euclidean TSP instance by distributing points uniformly in the unit square. An agent's genotype represents a tour, i.e., a permutation of the order in which points are to be visited. While no crossover is used, two ad-hoc mutation operators are applied: (i) swapping two random points, (ii) reversing the subtour between two random edges. This operation, called 2-Opt, is a well-known local search strategy for the TSP [ For tournament selection, the tour length is used to compute fitness. For local selection, edges between points represent the shared resources. Every time an agent tests a tour, a usage count associated with each traversed edge is incremented. The agent is then charged an energy cost based on the accumulated usage counts, and receives an energy benefit based on how good (short) the tour is. At replenishment, usage counts are redistributed uniformly across edges and decreased by a constant amount that determines carrying capacity. This model resembles the Ant Colony system [

49. Euclidean Traveling Salesman Problem Definition of Euclidean traveling salesman problem, possibly with links to more informationand implementations. NIST. Euclidean traveling salesman problem. http://www.nist.gov/dads/HTML/euclidntrvls.html

Euclidean traveling salesman problem (classic problem) Definition: Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point. See also traveling salesman spanning tree Note: This can be generalized to higher dimensions, for instance, points in a 3-dimensional space. This problem is a special case of traveling salesman since the cost between points is the planar distance instead of arbitrary weights. Author: PEB Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov). Entry modified Fri Oct 15 10:04:13 1999. HTML page formatted Tue Dec 3 12:14:10 2002. This page's URL is http://www.nist.gov/dads/HTML/euclidntrvls.html

50. Citation Proceedings of the 28th annual conference on Southeast regional conference toc 1990, Genetic algorithm solutions for the traveling salesman problem Authors D http://portal.acm.org/citation.cfm?id=99033&coll=portal&dl=ACM&CFID=11111111&CFT

51. The Angular-Metric Traveling Salesman Problem The AngularMetric traveling salesman problem. Alok Aggarwal, Don Coppersmith,Sanjeev Khanna,Rajeev Motwani, Baruch Schieber. Abstract. http://epubs.siam.org/sam-bin/dbq/article/31272

SIAM Journal on Computing Volume 29, Number 3 pp. 697-711 The Angular-Metric Traveling Salesman Problem Alok Aggarwal, Don Coppersmith, Sanjeev Khanna,Rajeev Motwani, Baruch Schieber Abstract. Motivated by applications in robotics, we formulate the problem of minimizing the total angle cost of a TSP tour for a set of points in Euclidean space, where the angle cost of a tour is the sum of the direction changes at the points. We establish the NP-hardness of both this problem and its relaxation to the cycle cover problem. We then consider the issue of designing approximation algorithms for these problems and show that both problems can be approximated to within a ratio of O (log n ) in polynomial time. We also consider the problem of simultaneously approximating both the angle and the length measure for a TSP tour. In studying the resulting tradeoff, we choose to focus on the sum of the two performance ratios and provide tight bounds on the sum. Finally, we consider the extremal value of the angle measure and obtain essentially tight bounds for it. In this paper we restrict our attention to the planar setting, but all our results are easily extended to higher dimensions.

52. Well-Solvable Special Cases Of The Traveling Salesman Problem: A Survey 496546 © 1998 Society for Industrial and Applied Mathematics. Well-SolvableSpecial Cases of the traveling salesman problem A Survey. http://epubs.siam.org/sam-bin/dbq/article/29751

SIAM Review Volume 40, Number 3 pp. 496-546 Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger Abstract. The Traveling Salesman Problem-A Guided Tour of Combinatorial Optimization , Wiley, Chichester, pp. 87143]. Key words. traveling salesman problem, combinatorial optimization, polynomial time algorithm, computational complexity AMS Subject Classifications PII Retrieve PostScript document ( 29751.ps : 2048696 bytes) Retrieve GNU Compressed PostScript document ( ... Retrieve reference links For additional information contact service@siam.org

53. [cs/0302030] The Traveling Salesman Problem For Cubic Graphs From David Eppstein eppstein@ics.uci.edu Date Thu, 20 Feb 2003 063635GMT (23kb) The traveling salesman problem for cubic graphs. http://arxiv.org/abs/cs.DS/0302030

Computer Science, abstract cs.DS/0302030 The traveling salesman problem for cubic graphs Authors: David Eppstein Comments: 12 pages, 6 figures Subj-class: Data Structures and Algorithms ACM-class: F.2.2 Full-text: PostScript PDF , or Other formats Links to: arXiv cs find abs

54. OPL Model Details: Traveling Salesman Problem traveling salesman problem The traveling salesman problem (TSP) isa classic problem in combinatorial optimization. The goal is http://www2.ilog.com/oplmodels/display.cfm?ID=43

55. Premium Solver Platform For Excel - Alldifferent - Traveling Salesman Problem You can solve problems involving ordering or permutations of choices, like thetraveling salesman problem, with the new 'alldifferent constraint' in the http://www.solver.com/xlsplatform4.htm

solver.com Frontline Systems, Inc. Developers of Your Spreadsheet's Solver Products Solutions Support Pricing ... Login Premium Solver Platform for Excel - Alldifferent - Traveling Salesman Problem In the Premium Solver Platform, you can model problems that involve ordering or permutations of choices easily with an "alldifferent" constraint , which specifies that a set of variables should have integer values from 1 to N, all of them different at the solution. Click on this Add Constraint dialog to see it full size, with "dif" selected to specify an alldifferent constraint. Problems involving ordering or permutations of choices are very difficult to model using conventional constraints, even with integer variables. An example is the famous Traveling Salesman Problem (TSP) , where a salesman must choose the order of cities to visit so as to minimize travel time, and each city must be visited exactly once. In the Premium Solver Platform, you can model this kind of problem easily with an "alldifferent" constraint. (Click on the worksheet below to see it full sise.) All Solver engines in the Premium Solver Platform supports this new type of constraint. The Branch & Bound process used by the LP/Quadratic and GRG nonlinear Solvers is extended to handle "alldifferent" constraints as a native type, and the hybrid Evolutionary / Classical Solver implements these constraints using mutation and crossover operators for permutations.

56. Visualisation Of Genetic Algorithms For The Traveling Salesman Problem In Java Visualisation of Genetic Algorithms for the traveling salesman problemin Java. by Johannes Sarg. The traveling salesman problem (TSP). http://www.apm.tuwien.ac.at/~guenther/tspga/TSPGA.html

Visualisation of Genetic Algorithms for the Traveling Salesman Problem in Java by Johannes Sarg This thesis of diploma has been implemented in Java 1.1 in March 1998. The Traveling Salesman Problem (TSP) Find the shortest trip through n towns where each town must be visited exactly once. In the following we define that from each town all other towns can be visited. The costs to visit a town from another are represented by their euklidic distance. Therefore the costs are reflexive. The Genetic Algorithm (GA) A GA tries to use basic principles of natural evolution. It is especially appropriate for problems with large and complex search-spaces, where the global optimum can't be found within a reasonable amount of time using traditional techniques as e.g. total enumeration or branch and bound. It cannot be guaranteed that the optimum solution is found by the GA. Here are some references for GAs Structure of a GA: procedure GA begin t = 0; initialize(P(t)); evaluate(P(t)); while not termination condition) begin t = t + 1;

57. The Traveling Salesman Problem Monday, July 13. IP3 The traveling salesman problem. 200 PM300PM Chair William H. Cunningham, University of Waterloo, Canada http://www.siam.org/meetings/dm98/ip3.htm

Monday, July 13 The Traveling Salesman Problem 2:00 PM-3:00 PM Chair: William H. Cunningham, University of Waterloo, Canada Room: Earth Science Center Auditorium William Cook Computational and Applied Mathematics Rice University MMD, 3/9/98

58. Traveling Salesman Problem From FOLDOC traveling salesman problem. spelling US spelling of travelling salesmanproblem. (199612-13). Previous transputer, TRANS-USE, trap http://csai03.is.noda.sut.ac.jp/foldoc/foldoc.cgi?traveling salesman problem

59. Benchmark Greedy: The Traveling Salesman Problem benchmark greedy the traveling salesman problem. printable version. The TravelingSalesman Problem (TSP) is recognized as a computationally challenging one. http://www.hp.com/products1/itanium/performance/architecture/greedy.html

Summary of site-wide JavaScript functionality contact hp search: hp Itanium-based platforms all of hp US hp Itanium 2-based platforms performance architecture benchmark greedy: the traveling salesman problem printable version hp Itanium-based platforms home solution resources systems solutions developers reference resources infolibrary white papers analyst reports frequently asked questions ... section map Memory latency is a major factor in the performance of many applications, particularly interactive applications such as mechanical design. The HP zx1 was designed with this as a focal point. The memory latency for a HP zx1–based Intel Itanium 2 processor system is significantly lower than competing systems. The Traveling Salesman Problem (TSP) is recognized as a computationally challenging one. The challenge is one in which the shortest tour through a set number of points (or "cities") must be computed, in which each point on the map is visited only once. The problem size scales dramatically as the number of cities increases, and is extremely computationally intense – compute time for the larger TSP problems can be measured in days, and even more. The code can be distributed for large scale parallelism. This problem does have real world applications – tool routes in manufacturing can be very like TSP problems. X–ray crystallography, printed circuit board manufacture, shipping scheduling software, biological simulation, and many problems relevant to specific applications are TSP–like.

60. Traveling Salesman Problem traveling salesman problem. Approximation Algorithms. This is the infamoustraveling salesman problem (aka TSP) problem (formal defintion). http://valis.cs.uiuc.edu/~sariel/research/CG/applets/tsp/TspAlg.html

Home Bookmarks Search Computational Geometry ... Papers Traveling Salesman Problem Approximation Algorithms Applet By Kreimer Natasha. Problem: A traveling salesman has to travel through a bunch of cities, in such a way that the expenses on traveling are minimized. This is the infamous Traveling Salesman Problem (aka TSP ) problem ( formal defintion ). It belongs to a family of problems, called NP-complete problem. It is conjectured that all those problems requires exponential time to solve them. In our case, this means that to find the optimal solution you have to go through all possible routes, and the numbers of routes increases exponential with the numbers of cities. If you want to get a notion of what numbers we are talking about look at this: the number of routes with 50 cities is (50-2)!, which is An alternative approach would be to compute a solution which is not optimal, but is guarenteed to be close the optimal solution. We present here an applet that implements such an approximation algorithm for the Euclidean TSP problem. In our case we have points in the plane (i.e. cities) and the cost of the traveling between two points is the distance between them. In other words, we have a map with cities, any two of which are connected by a direct straight road (yeh, sure!) and we want to find a shortest tour for our poor traveling salesman, who "wants" to visit every city.

Page 3     41-60 of 93    Back | 1  | 2  | 3  | 4  | 5  | Next 20