Home  - Theorems_And_Conjectures - Traveling Salesman Problem

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

81-100 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20

Traveling Salesman Problem:     more books (18)

The Traveling Salesman Problem and Its Variations (Combinatorial Optimization) The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) by David L. Applegate, Robert E. Bixby, et all 2007-01-15 The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization) by E. L. Lawler, Jan Karel Lenstra, et all 1985-09 Simulated Annealing und verwandte Verfahren für das Traveling Salesman Problem: Zur Studie gehört Software, die nur in digitaler Form (CD oder Download) erhältlich ist. (German Edition) by Andy Ruigies, 1995-01-01 Effiziente Heuristiken Fur Das Probabilistische Traveling Salesman Problem by Silke Rosenow, 2002-04 Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem [An article from: European Journal of Operational Research] by L. Bianchi, A.M. Campbell, 2007-01-01 Lösungsverfahren für das 2-dimensionale, euklidische Traveling Salesman Problem unter besonderer Berücksichtigung der Delaunay-Triangulation by Silvia Annette Schiemann, 2005-01-30 The traveling salesman problem as a benchmark test for a Social-Based Genetic Algorithm.(Technical report): An article from: Journal of Computer Science by Nagham Azmi al- Madi, Ahamad Tajudin Khader, 2008-10-01 Self-Optimizing Stochastic Systems: Applications To Stochastic Shortest Path Problem, Stochastic Traveling Salesman Problem, and Queueing by Thusitha Sen Jayawardena, 1990 Aggregation for the probabilistic traveling salesman problem [An article from: Computers and Operations Research] by A.M. Campbell, 2006-09-01 Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms [An article from: European Journal of Operational Research] by L. Bianchi, J. Knowles, et all 2005-04-01 Data structures and ejection chains for solving large-scale traveling salesman problems [An article from: European Journal of Operational Research] by D. Gamboa, C. Rego, et all 2005-01-01 A hybrid scatter search for the probabilistic traveling salesman problem [An article from: Computers and Operations Research] by Y.-H. Liu, 2007-08-01 Implementation analysis of efficient heuristic algorithms for the traveling salesman problem [An article from: Computers and Operations Research] by D. Gamboa, C. Rego, et all 2006-04-01

lists with details

81. The Period Traveling Salesman Problem
    The period traveling salesman problem a new heuristic algorithm. The travelingsalesman problem a guided tour of combinatorial optimization.  
    http://portal.acm.org/citation.cfm?id=635303&dl=GUIDE&coll=GUIDE&CFID=11111111&C

82. Zeal.com - United States - New - Entertainment - Games - Puzzles - Math Puzzles
    A great resource for United States New - Entertainment - Games - Puzzles - MathPuzzles - traveling salesman problem. traveling salesman problem Preview  
    http://zeal.com/category/preview.jhtml?cid=10161837

83. ZIP-Methode: Neue Kombinatorische Optimal-Lösung Für TSP (Traveling-Salesman-P
    Mit der ZIPMethode ist es m¶glich, alle Rundreisen auf eine minimale Anzahl von Grundformen - im Vergleich zur Anzahl der m¶glichen Rundreisen - zur¼ckzuf¼hren.  
    http://jochen.pleines.bei.t-online.de/

84. Traveling Salesman
    Definition of traveling salesman, possibly with links to more information and implementations. traveling salesman. ( classic problem See alsobottleneck traveling salesman, Hamiltonian cycle  
    http://www.nist.gov/dads/HTML/travelingSalesman.html
    
    Extractions: (classic problem) Definition: Find a path through a weighted graph which starts and ends at the same vertex , includes every other vertex exactly once, and minimizes the total cost of edges Also known as TSP. See also bottleneck traveling salesman Hamiltonian cycle optimization problem Christofides algorithm , similar problems: all pairs shortest path minimum spanning tree vehicle routing problem Note: Less formally, find a path for a salesman to visit every listed city at the lowest total cost. The above described path is always a Hamiltonian cycle , or tour, however a Hamiltonian cycle need not be optimal. The problem is an optimization problem, that is, to find the shortest tour. The corresponding decision problem asks if there is a tour with a cost less than some given amount. See [CLR90, page 969] If the triangle inequality does not hold, that is d ik ij + d jk for some i, j, k, there is no possible polynomial time algorithm which guarantees near-optimal result (unless P=NP). If the triangle inequality holds, you can quickly get a near-optimal solution by finding the minimum spanning tree . Convert the tree to a path by traversing the tree, say by

85. Traveling-Salesman-Problem
    Translate this page Das traveling-salesman-problem (TSP) gilt als eines der klassischen kombinatorischenprobleme. Optimale Lösungen für TSP mit großer  
    http://jochen.pleines.bei.t-online.de/german/1_tsp.htm
    
    Extractions: 1. Das Traveling-Salesman-Problem (TSP) Das Traveling-Salesman-Problem (TSP), auch als Rundreiseproblem oder Problem des Handelsreisenden (bzw. Handlungsreisenden) bezeichnet, ist eines der berühmtesten Probleme in der kombinatorischen Optimierung. In der Regel unterscheidet man zwischen nicht-symmetrischen TSP und dem sehr häufig auftretenden Fall von symmetrischen TSP. Dabei sind die Wege, eine Lösung für TSP zu finden, oft von der räumlichen Vorstellung einer Rundreise geprägt. Der Weltrekord Untersucht man bekannte Optimallösungen von symmetrischen TSP mit vielen Orten Anders verhält es sich für den allgemeinen Fall von symmetrischen TSP, bei denen keine zusätzlichen Merkmale für die Lösung herangezogen werden und die Ausprägungen des interessierenden Merkmals beliebige positive und negative Werte annehmen können. Alle bekannten Verfahren zur Ermittlung einer Optimallösung laufen auf eine vollständige Analyse der n! möglichen Rundreisen hinaus. Bis heute ist noch kein Algorithmus bekannt, der weniger als exponentiellen Zeitaufwand (bezogen auf die Anzahl der Orte) benötigt, um eine optimale Rundreise zu ermitteln. So sind nach herrschender Ansicht für symmetrische TSP strikt kombinatorische Lösungsansätze wie die enumerative Berechnung von symmetrischen Rundreisen mit 25 Orten nicht möglich.

86. Travelling Salesman Problem From FOLDOC
    Free Online Dictionary of Computing. travelling salesman problem. algorithm, complexity (TSP or shortest path , US traveling  
    http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?travelling salesman problem

87. LookSmart - Directory - Traveling Salesman Math Problem
    YOU ARE HERE Home Sciences Mathematics Math Puzzles travelingsalesman problem. traveling salesman Math problem Offers  
    http://search.looksmart.com/p/browse/us1/us317914/us328800/us281829/us10161837/

88. Travelling Salesman Problem Definition Of Travelling Salesman Problem In Computi
    Travelling salesman problem. (algorithm, complexity), travelling salesman problem (TSP or shortest path , US traveling ) Given a set of towns and the  
    http://computing-dictionary.thefreedictionary.com/travelling salesman problem
    
    Extractions: Dictionaries: General Computing Medical Legal Encyclopedia Word: Word Starts with Ends with Definition (algorithm, complexity) travelling salesman problem - (TSP or "shortest path", US: "traveling") Given a set of towns and the distances between them, determine the shortest path starting from a given town, passing through all the other towns and returning to the first town. This is a famous problem with a variety of solutions of varying complexity and efficiency. The simplest solution (the brute force approach) generates all possible routes and takes the shortest. This becomes impractical as the number of towns, N, increases since the number of possible routes is !(N-1). A more intelligent algorithm (similar to iterative deepening ) considers the shortest path to each town which can be reached in one hop, then two hops, and so on until all towns have been visited. At each stage the algorithm maintains a "frontier" of reachable towns along with the shortest route to each. It then expands this frontier by one hop each time.

89. Traveling Salesman Heuristics
    Welcome. This applet implements some simple, but effective heuristics for the TravelingSalesman problem with Euclidian distances ie in a 2D plane. Directions.  
    http://riot.ieor.berkeley.edu/~cander/cs270/
    
    Extractions: This applet implements some simple, but effective heuristics for the Traveling Salesman Problem with Euclidian distances - i.e. in a 2D plane. In the applet below, add points to the graph by clicking anywhere besides where the buttons are. You must enter three or more points. When you are done entering points, click on a button to solve the TSP problem.

90. The Code Project - Genetic Algorithms And The Traveling Salesman Problem Using C
    All Topics, C , .NET C Programming General Genetic Algorithms and the TravelingSalesman problem using C and ATL COM By Kalyan S Dontharaju An article  
    http://www.codeproject.com/csharp/gatsp.asp
    
    Extractions: 3 members have rated this article. Result: Popularity: 2.27 . Rating: out of 5. This project is about an application used by the Traveling Salesman, given a finite number of 'cities'(I have choosen cities from 1 to a finite number) along with the distance of travel (distance between two cities is randomly choosen) between each pair of them, The aim is to find the cheapest distance of visiting all the cities and returning to the starting point. Using GA we can get an optimal solution to solve this problem. This is only an example to look at calling COM Components and accessing SAFEARRAY in C#. I don't know many things about genetic algorithm and please don't take take this code as demonstrating a problem to solve using only genetic algorithms (GA). This is just one approach. The C++ code for GA I got from the Internet.

91. Travelling Salesman Problem From FOLDOC
    travelling salesman problem. algorithm, complexity (TSP or shortestpath , US traveling ) Given a set of towns and the distances  
    http://www.swif.uniba.it/lei/foldop/foldoc.cgi?travelling salesman problem

92. Travelling Salesman Problem From FOLDOC
    travelling salesman problem. algorithm, complexity (TSP or shortestpath , US traveling ) Given a set of towns and the distances  
    http://www.instantweb.com/D/dictionary/foldoc.cgi?travelling salesman problem

93. The Travelling Salesman Problem
    Some of what I say might be out of date. The Travelling salesman problem (TSP)is a deceptively simple combinatorial problem. It can be stated very simply  
    http://www.pcug.org.au/~dakin/tsp.htm
    
    Extractions: Introduction Caveat This has been very much an occasional hobby over recent years, and I have not had the time to keep abreast of the literature. Some of what I say might be out of date. The Travelling Salesman Problem (TSP) is a deceptively simple combinatorial problem. It can be stated very simply: A salesman spends his time visiting n cities (or nodes) cyclically. In one tour he visits each city just once, and finishes up where he started. In what order should he visit them to minimise the distance travelled? Many TSP's are symmetric - that is, for any two cities A and B, the distance from A to B is the same as that from B to A. In this case you will get exactly the same tour length if you reverse the order in which they are visited - so there is no need to distinguish between a tour and its reverse, and you can leave off the arrows on the tour diagram. If there are only 2 cities then the problem is trivial, since only one tour is possible. For the symmetric case a 3 city TSP is also trivial. If all links are present then there are (n-1)! different tours for an n city asymmetric TSP. To see why this is so, pick any city as the first - then there are n-1 choices for the second city visited, n-2 choices for the third, and so on. For the symmetric case there are half as many distinct solutions - (n-1)!/2 for an n city TSP. In either case the number of solutions becomes extremely large for large n, so that an exhaustive search is impractible. The problem has some direct importance, since quite a lot of practical applications can be put in this form. It also has a theoretical importance in complexity theory, since the TSP is one of the class of "NP Complete" combinatorial problems. NP Complete problems have intractable in the sense that no one has found any really efficient way of solving them for large n. They are also known to be more or less equivalent to each other; if you knew how to solve one kind of NP Complete problem you could solve the lot.

94. Travelling Salesman Problem
    Travelling salesman problem. CLICK inside to stop; CLICK again to resetand start. Left Side Legend Red path should be the shortest  
    http://www.patol.com/java/TSP/
    
    Extractions: A-B% where A is the town number, B is the percent respect all trains that this town has been presented to the network. A-B% where A is the neuron number and B is the percentage respect all trains that this neuron has been chosed as reference. Right Side: Legend: still to implement. Books Enter keywords... The main idea of Kohonen Neuronal Networks is to leave the network organise himself. To do this we have to present patterns continuously and randomly until a stability is reached. Such of networks are composed by two groups of neurons.

95. TravellingSalesman
    Travelling salesman problem Torsten Reil torsten.reil@zoology.oxford.ac.uk Thisprogram utilises a genetic algorithm to find solutions for the Travelling  
    http://users.ox.ac.uk/~quee0818/ts/ts.html

96. The Travelling Salesman Problem
    So far, nobody was able to come up with an algorithm for solving the travelingsalesman problem that does not show an exponential growth of run time with a  
    http://www.uni-kl.de/AG-AvenhausMadlener/tsp-eng.html
    
    Extractions: The travelling salesman problem is quite simple: a travelling salesman has to visit customers in several towns, exactly one customer in each town. Since he is interested in not being too long on the road, he wants to take the shortest tour. He knows the distance between each two towns he wants to visit. So far, nobody was able to come up with an algorithm for solving the traveling salesman problem that does not show an exponential growth of run time with a growing number of cities. There is a strong belief that there is no algorithm that will not show this behaviour, but no one was able to prove this (yet). But one was able to prove that the traveling salesman problem is a kind of prototypical problem for a big class of problems (the famous class NP) that show this exponential behaviour. This is the reason why many reasearch groups are interested in the traveling salesman problem, since techniques developed for this problem can be transfered to other problems of this class. Follow the links to the teamwork main page the start page of the guided tour

97. TSP Problem.
    The TSP Example. EXAMPLE Heuristic algorithm for the traveling SalesmanProblem (TSP) . This is one of the most known problems  
    http://students.ceid.upatras.gr/~papagel/project/tspprobl.htm
    
    Extractions: EXAMPLE: Heuristic algorithm for the Traveling Salesman Problem (T.S.P) This is one of the most known problems ,and is often called as a difficult problem.A salesman must visit n cities, passing through each city only once,beginning from one of them which is considered as his base,and returning to it.The cost of the transportation among the cities (whichever combination possible) is given.The program of the journey is requested,that is the order of visiting the cities in such a way that the cost is the minimum. Let's number the cities from 1 to n ,and let city 1 be the city-base of the salesman.Also let's assume that c (i,j) is the visiting cost from i to j .There can be c (i,j) (j,i) Apparently all the possible solutions are (n-1)! .Someone could probably determine them systematically,find the cost for each and everyone of these solutions and finally keep the one with the minimum cost.These requires at least (n-1)! steps. If for example there were 21 cities the steps required are (n-1)!=(21-1)!=20! steps.If every step required a

98. TSP Algorithms In Action Animated Examples Of Heuristic Algorithms
    Stephan Mertens. Abstract The travelling salesman problem (TSP) probablyis the most prominent problem in combinatorial optimization.  
    http://itp.nat.uni-magdeburg.de/~mertens/TSP/TSP.html
    
    Extractions: Animated Examples of Heuristic Algorithms Stephan Mertens The travelling salesman problem (TSP) probably is the most prominent problem in combinatorial optimization. Its simple definition along with its notorious difficulty has stimulated (and still stimulates) many efforts to find an efficient algorithm. Due to the NP-completeness of the TSP, only approximate solutions can be expected. This contribution presents animated, graphical Java-Applets of some approximate algorithms for the TSP. The applets allow to watch the algorithms in action and to play around with them.

99. Dictionary.com/travelling Salesman Problem
    Get the Top 10 Most Popular Sites for travelling salesman problem . 1 entryfound for travelling salesman problem. travelling salesman problem.  
    http://dictionary.reference.com/search?q=travelling salesman problem

100. TRAVELLING SALESMAN PROBLEM - Meaning And Definition Of The Word
     Search Dictionary TRAVELLING salesman problem Dictionary Entryand Meaning. Computing Dictionary. Definition (TSP or shortest  
     http://www.hyperdictionary.com/computing/travelling salesman problem
     
     Extractions: Search Dictionary: Computing Dictionary Definition: (TSP or "shortest path", US: "traveling") Given a set of towns and the distances between them, determine the shortest path starting from a given town, passing through all the other towns and returning to the first town. This is a famous problem with a variety of solutions of varying complexity and efficiency. The simplest solution (the brute force approach) generates all possible routes and takes the shortest. This becomes impractical as the number of towns, N, increases since the number of possible routes is !(N-1). A more intelligent algorithm (similar to iterative deepening ) considers the shortest path to each town which can be reached in one hop, then two hops, and so on until all towns have been visited. At each stage the algorithm maintains a "frontier" of reachable towns along with the shortest route to each. It then expands this frontier by one hop each time. Pablo Moscato's TSP bibliography Fractals and the TSP See Also: algorithm complexity HOME ABOUT HYPERDICTIONARY

81-100 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20