| org.jgap.impl.salesman |
|
Handling of Traveling Salesman Person (TSP) related problems
|
| Java Source File Name | Type | Comment |
| AllSalesmanTests.java | Class | |
| Salesman.java | Class | The class solves the travelling salesman problem.
The traveling salesman problem, or TSP for short, is this: given a finite
number of 'cities' along with the cost of travel between each pair of
them, find the cheapest way of visiting all the cities and returning to
your starting point.)
author:
Audrius Meskauskas
author:
Neil Rotstan, Klaus Meffert (reused code fragments)
author:
since:
2.0
See Also: |
| SalesmanFitnessFunction.java | Class | The fitness function to solve the Travelling Salesman problem. |
| TravellingSalesmanTest.java | Class | Test JGAP's travelling salesman implementation. |