1. Traveling Salesman Problem These pages report the history of the TSP and ongoing work to solve large instances. http://www.tsp.gatech.edu/

Traveling Salesman Problem >> QSopt Linear Programming Solver The executable versions of the Concorde TSP code (including the Windows GUI) are built with the QSopt callable library. These pages are devoted to the history of TSP computation and to on-going research towards the solution of large-scale examples of the TSP. The Concorde code is due to David Applegate Robert Bixby , and William Cook Supported by Office of Naval Research (N00014-03-1-0040) and National Science Foundation (DMI-0245609) grants, and by the School of Industrial and Systems Engineering at Georgia Tech. Contact: William Cook (bico@isye.gatech.edu) Last Updated: March 2005 >> Search the TSP Pages with Google.

2. Fractal Instances Of The Traveling Salesman Problem By Pablo Moscato. http://www.ing.unlp.edu.ar/cetad/mos/FRACTAL_TSP_home.html

Fractal Instances of the Traveling Salesman Problem This page contains resources on the evolving field of the generation of instances of combinatorial optimization problems with known optimal solution. There are currently four available papers on this subject. Papers The Euclidean Traveling Salesman Problem and a Space-Filling Curve , M. G. Norman and P. Moscato, Chaos, Solitons and Fractals , Vol. 6, pages 389-397, 1995. Using L-Systems to generate arbitrarily large instances of the Euclidean Traveling Salesman Problem with known optimal tours , A. Mariano, P. Moscato and M.G Norman, ``Anales del XXVII Simposio Brasileiro de Pesquisa Operacional'' , Vitoria, Brazil, 6-8 Nov. 1995. An Analysis of the Performance of Traveling Salesman Heuristics on Infinite-Size Fractal Instances in the Euclidean Plane. P. Moscato and M.G. Norman, first version Oct. 1994, to appear in ORSA Journal on Computing. Arbitrarily large planar ETSP instances with known optimal tours, by A. Mariano, P. Moscato, and M.G. Norman, expanded version of the paper presented at Vitoria, ES, Brazil, 1995. Paper accepted in the journal ``Pesquisa Operacional''. Using L-Systems to generate TSP Instances A software that generate TSP instances in TSPLIB format is available here . Please refer to the following paper Arbitrarily large planar ETSP instances with known optimal tours,

3. ZIP-Method - New Combinatorial Optimum Solution Of TSP (abstract) A new solution algorithm for the TSP. http://www.jochen-pleines.de/sprachen/english.htm

HOME INHALT DOWNLOAD AUTOR ... IMPRESSUM Traveling-Salesman-Problem (TSP) The Traveling-Salesman-Problem (TSP) commonly treated as one of the outstanding combinatorial problems. Optimal solutions of large-scale TSP are special cases of a geografic nature; therefore, they are related to metric spaces. In strict contradiction to this case, optimum solutions for general TSP are only posible by means of a complete enumeration of the n! potential tours; hence, they are not thought to be efficiently soluble. Therefore, we introduce a new separation method (ZIP) that surpasses combinatorically the traditional limit of optimum solutions for general TSP. In principle, the new method may as well be applied to non-symmetric tours. Additional examples contain a multitude of new ideas for further applications. (german) Summary of the new solution About the history of the ZIP-method

4. Traveling Salesman Problem Generator Generates a traveling salesman problem map and data for a given set of US cities. http://www.sju.edu/~sforman/research/usa_tsp.html

TSP Generator Research Sean Forman You Are Here Explanation of traveling salesman problems and methods of solving them When given a set of cities from the United States, this script will generate a map and data necessary to construct a Traveling Salesman Problem for the given set of cities. It determines inter-city great circle distances, and generates a matrix of inter-city distances. It will also apply a series of heuristic techniques to find approximate solutions to the given TSP problem (Repetitive Nearest Neighbor and Cheapest Link). Enter a list of up to 30 cities in the following format: Philadelphia, PA Des Moines, IA Los Angeles, CA List of Cities (City, ST) State Abbreviations AK - Alaska AL - Alabama AR - Arkansas AZ - Arizona CA - California CO - Colorado CT - Connecticut DC - District of Columbia DE - Delaware FL - Florida GA - Georgia HI - Hawaii IA - Iowa ID - Idaho IL - Illinois IN - Indiana KS - Kansas KY - Kentucky LA - Louisiana MA - Massachusetts MD - Maryland ME - Maine MI - Michigan MN - Minnesota MO - Missouri MS - Mississippi MT - Montana NC - North Carolina ND - North Dakota NE - Nebraska NH - New Hampshire NJ - New Jersey NM - New Mexico NV - Nevada NY - New York OH - Ohio OK - Oklahoma OR - Oregon PA - Pennsylvania RI - Rhode Island SC - South Carolina SD - South Dakota TN - Tennessee TX - Texas UT - Utah VA - Virginia VT - Vermont WA - Washington WI - Wisconsin WV - West Virginia WY - Wyoming Size of the Map Small (600 x 400) Medium (720 x 480) Large (1024 x 720) Area Shown by Map As big as needed Lower 48 United States

5. The Travelling Salesman Problem The Travelling Salesman Problem (TSP) is a deceptively simple combinatorial problem. It can be stated very simply http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

6. Concorde Home Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. The code is written in the http://www.tsp.gatech.edu/concorde.html

Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. The code is written in the ANSI C programming language and it is available for academic research use; for other uses, contact William Cook for licensing options. Concorde's TSP solver has been used to obtain the optimal solutions to 106 of the 110 TSPLIB instances; the largest having 15,112 cities The Concorde callable library includes over 700 functions permitting users to create specialized codes for TSP-like problems. All Concorde functions are thread-safe for programming in shared-memory parallel environments; the main TSP solver includes code for running over networks of UNIX workstations. Concorde now supports the QSopt linear programming solver. Executable versions of concorde with qsopt for Linux and Solaris are now available Hans Mittelmann has created a NEOS Server for Concorde , allowing users to solve TSP instances online.

7. Traveling Salesman Problem traveling salesman problem traveling salesman problem http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

8. Euphoria Programming Categorized program downloads, screenshots utilities, graphic effects, libraries, example of how to combine EuGL and Exotica, traveling salesman problem solver. http://www.cyd.liu.se/~micol972/site/euphoria.htm

Programs: Utilities: Forth compiler Bitmap tool (color reduction, dithering..) Interactive hiragana/katakana teacher Sample generator ... WAV editor Various graphic effects: Blurry Particles RotoZoomer Waving Flag Wormhole ... Voxel Other: Master System emulator NES emulator 3D Tetris clone An example of how to combine EuGL with Exotica ... Not Quite Assembly compiler Libraries: DirectX wrapper for Euphoria LZSS codec OpenGL wrapper for Euphoria CxImage wrapper for Euphoria ... WinAmp input-plugin wrapper Get the latest version of Euphoria

9. The Traveling Salesman Problem This page has moved to http//www.cs.concordia.ca/~chvatal/tsp. .. http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

10. Traveling Salesman Problem -- From MathWorld Solution to the traveling salesman problem is implemented in Mathematica Skiena, SS traveling salesman problem. §8.5.4 in The Algorithm Design Manual. http://mathworld.wolfram.com/TravelingSalesmanProblem.html

INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index DESTINATIONS About MathWorld About the Author Headline News ... Random Entry CONTACT Contribute an Entry Send a Message to the Team MATHWORLD - IN PRINT Order book from Amazon Discrete Mathematics Graph Theory Circuits ... Unsolved Problems Traveling Salesman Problem A problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian circuit a salesman can take through each of cities. No general method of solution is known, and the problem is NP-hard . Solution to the traveling salesman problem is implemented in Mathematica as TravelingSalesman g ] in the Mathematica add-on package DiscreteMath`Combinatorica` (which can be loaded with the command SEE ALSO: Ant Colony Algorithm Chinese Postman Problem Dendrite Hamiltonian Circuit ... [Pages Linking Here] REFERENCES: Applegate, D.; Bixby, R.; Chvatal, V.; and Cook, W. "Finding Cuts in the TSP (a Preliminary Report)." Technical Report 95-05, DIMACS. Piscataway NJ: Rutgers University, 1995. Applegate, D.; Bixby, R.; Chvatal, V.; and Cook, W. "Solving Traveling Salesman Problems."

11. Travelling Salesman Problem Using Genetic Algorithms A fast unique solution for the travelling salesman problem using genetic algorithms. http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

12. TSPBIB Home Page Fractal Instances of the traveling salesman problem, by Pablo Moscato. Analysis of the HeldKarp Heuristic for the traveling salesman problem, http://www.densis.fee.unicamp.br/~moscato/TSPBIB_home.html

TSPBIB Home Page This page intends to be a comprehensive listing of papers, source code, preprints, technical reports, etc, available on the Internet about the Traveling Salesman Problem (TSP) and some associated problems. Please send us information about any other work you consider it should be included in this page. Pablo Moscato email: moscato@cacr.caltech.edu email: moscato@densis.fee.unicamp.br The picture above shows an instance of the Euclidean, Planar TSP and the optimal curve among the set of cities. This instance has been named MNPeano Order 2. Do you like challenges ? The 8th DIMACS Implementation Challenge is on the way, and the TSP is its subject ! The material in this page is solely aimed for academic research purposes and we encourage the readers to contact the authors of the papers included to correctly cite their papers. To make contributions for papers, preprints, technical reports, etc., let us know the authors of the paper, its title, a very short abstract (such that we could find out what topic this paper belongs to), and, if you wish to, its current status. If you plan to leave a paper for public domain access and wish to include in our list, please leave the paper as a postscript file in compressed or uncompressed form in a public directory, and let us know the complete address of the file there such that we set a link to the file. Other pages related to TSPBIB The Hamiltonian Page , by Gregory Gutin and Pablo Moscato.

13. Diane Elizabeth Vaughan Information about the author's research activities, including stochastic processes, the traveling salesman problem, simultaneous generalized hill climbing algorithms, ergodic theory, and simulated annealing. http://filebox.vt.edu/users/dvaughn/

Dr. Diane Elizabeth Vaughan Post Doctorate Research Associate Department of Mechanical and Industrial Engineering University of Illinois at Urbana-Champaign 1206 West Green Street, MC-244 vaughand@vt.edu (540) 626 5741 (Home) (540) 231-3838 (Office) Formal Curriculum Vitae pdf Research Activities ( Want to know more?) Projection Pursuit The objective of this project is to study the problem of finding an optimal projection of data contained in a high dimensional space to a lower dimensional space. The Bayes Classifier is used to classify the data in the low dimensional space. Hybrid Local Search Algorithms This research creates hybrid algorithms that combine heuristic procedures that guarantee long term convergence (globally optimal solutions) with heuristic procedures that guarantee reasonable finite-time performance (locally optimal solutions). Formulating the Meta-Heuristic Tabu Search The goal of this project is to mathematically formulate probabilistic tabu search to be used in conjunction with other heuristics (i.e., simulated annealing), in such a way that the heuristic can be easily modeled as a nonstationary Markov Chain. Discrete Manufacturing Process Design Optimization This research is motivated by the Air Force’s interest in identifying optimal manufacturing process designs, where the finished unit (e.g., a titanium integrated blade rotor) meets certain geometric and microstructural specifications, and is produced at minimum cost.

14. Travelling Salesman The Problem. In the travelling salesman problem, you have to find the shortest round trip visiting every town exactly once. http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

15. TSPBIB Home Page Asymmetric traveling salesman problem A study of complexity transitions on the asymmetric traveling salesman problem , by W. Zhang and R.E. Korf. http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

16. Fractal Instances Of The Traveling Salesman Problem Fractal Instances of the traveling salesman problem http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

17. TSPBIB Home Page Fractal Instances of the traveling salesman problem, by Pablo Moscato. Sensitivity Analysis for the Euclidean traveling salesman problem, by Chris Jones http://www.ing.unlp.edu.ar/cetad/mos/TSPBIB_home.html

TSPBIB Home Page This page intends to be a comprehensive listing of papers, source code, preprints, technical reports, etc, available on the Internet about the Traveling Salesman Problem (TSP) and some associated problems. Please send us information about any other work you consider it should be included in this page. Pablo Moscato email: moscato@cacr.caltech.edu email: moscato@densis.fee.unicamp.br The picture above shows an instance of the Euclidean, Planar TSP and the optimal curve among the set of cities. This instance has been named MNPeano Order 2. The material in this page is solely aimed for academic research purposes and we encourage the readers to contact the authors of the papers included to correctly cite their papers. To make contributions for papers, preprints, technical reports, etc., let us know the authors of the paper, its title, a very short abstract (such that we could find out what topic this paper belongs to), and, if you wish to, its current status. If you plan to leave a paper for public domain access and wish to include in our list, please leave the paper as a postscript file in compressed or uncompressed form in a public directory, and let us know the complete address of the file there such that we set a link to the file. Other pages related to TSPBIB The Hamiltonian Page , by Gregory Gutin and Pablo Moscato.

18. BBC News SCI/TECH Artificial Ants Solve Network Problems Internet links Marco Dorigo Ecal 2001 traveling salesman problem samples traveling salesman problem Instances The BBC is not http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

19. TSP Example Introduction to genetic algorithms, travelling salesman problem example http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

20. TSPLIB Symmetric traveling salesman problem (TSP) Given a set of n nodes and distances for each pair of nodes, find a roundtrip of minimal total length http://tmsyn.wc.ask.com/r?t=an&s=hb&uid=24312681243126812&sid=343126

Page 1     1-20 of 104    1  | 2  | 3  | 4  | 5  | 6  | Next 20