|
|
|
|
|
|
|
| Description: |
|
This applet tests the simulated annealing algorithm to solve the travelling salesman's problem. The user finds a route visiting 16 nodes of a random network and the computer finds an optimized route. The distances of both routes are compared.
|
|
|
Browse in Categories:
|
|
|
|
| More information about this material: |
Primary Audience:
College General Ed
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
no
Source Code Available:
yes
Accessiblity Information Available:
no
Copyright:
yes
Creative Commons:
no
|
|
 |
About this material: |
Peer Reviews (not reviewed)
Workflow status (Not triaged)
Comments (none)
Learning Exercises (none)
Personal Collections (1)
Accessibility Info (none)
|
|
|
| |
Add your own: |
|
|
| |
|
|
|
|
| |
| |
|
