Wolfram Research

Mathematica MathWorld Wolfram Science More »

Traveling Salesman Problem


	The traveling salesman problem asks for the shortest route by which a salesman can visit a set of locations and return home. A choice of heuristics to attempt to solve this problem is provided by Mathematica. Drag the points to change the locations the salesman visits to see how the route changes. Change the method to see which finds the best route for the choice of points. Alt+Click to add additional points to be toured.


	Contributed by: Jon McLoone Based on a program by: Stephen Wolfram After work by: Stan Wagon

Traveling Salesman Problem (Wolfram MathWorld)

"Traveling Salesman Problem" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/TravelingSalesmanProblem/

Contributed by: Jon McLoone

Based on a program by: Stephen Wolfram

After work by: Stan Wagon

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+