Finds (or at least tries) near-optimal solutions for traveling salesman problem instances.
Supported meta-heuristics:
- hill climbing
- simulated annealing
- random search
Be sure to have sufficient memory to run large instances!
cargo run
cargo test
cargo fmt