https://github.com/apanimesh061/sim-anneal

Simulated Annealing in Racket (Travelling Salesman Problem)
https://github.com/apanimesh061/sim-anneal

Last synced: 8 days ago
JSON representation

Simulated Annealing in Racket (Travelling Salesman Problem)

• Host: GitHub
• URL: https://github.com/apanimesh061/sim-anneal
• Owner: apanimesh061
• Created: 2014-11-19T19:34:13.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2014-11-19T19:42:39.000Z (almost 10 years ago)
• Last Synced: 2024-03-18T14:17:27.811Z (8 months ago)
• Language: Racket
• Size: 129 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
This is a solution for the Travelling Salesman Problem using Simulated Annealing.

It has been programmed in Racket.

We have a file storing the adjacency matrix of a 15 Cities configuration.

Run from DrRacket or from console "racket simAnneal.rkt"