https://github.com/marekyggdrasil/ocamltsp

OCaml test project. Simple solver for Travelling Salesman Problem.
https://github.com/marekyggdrasil/ocamltsp

Last synced: about 1 month ago
JSON representation

OCaml test project. Simple solver for Travelling Salesman Problem.

• Host: GitHub
• URL: https://github.com/marekyggdrasil/ocamltsp
• Owner: marekyggdrasil
• Created: 2015-08-12T05:17:32.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2016-06-06T15:16:35.000Z (over 8 years ago)
• Last Synced: 2023-03-03T12:23:05.635Z (over 1 year ago)
• Language: OCaml
• Size: 133 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog

Awesome Lists containing this project

README

        
Example OCaml code,

Program solving Traveling Salesman Problem,

source can be found in `src/tspml.ml`

simply hit `make` to build the project

### Usage

`./tspml.native micro.inst`

solves instance from file `micro.inst`.

If you would like to create your own problem instance,

you can base it on `example.inst` file.

output : `4 3 1 2`

Means that from first city we move to fourth, from second to third,

from third to first and from fourth to second.

Software was tested on instances micro and medium, results were compared

with Concorde TSP solver and matched.

### Explanation

Please have a look at file `reasoning-ocamltsp.pdf` to see the reasoning behind this program.