Uses of Class
org.cicirello.search.problems.tsp.BaseTSP
Package
Description
Classes and interfaces related to the Traveling Salesperson Problem (TSP).

Uses of BaseTSP in org.cicirello.search.problems.tsp
Modifier and TypeClassDescriptionclass
This class and its nested classes implement the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix.static final class
This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with floatingpoint cost edges.static final class
This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with integer cost edges.class
This class and its nested classes implement the Traveling Salesperson Problem (TSP), such that cities are 2D points, and edge costs is the distance between them.static final class
Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floatingpoint valued.static final class
Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floatingpoint valued, and where all edge costs between pairs of cities are precomputed.static final class
Cost function for the Traveling Salesperson Problem (TSP), where edge costs are integer valued.static final class
Cost function for the Traveling Salesperson Problem (TSP), where edge costs are integer valued, and where all edge costs between pairs of cities are precomputed.ModifierConstructorDescriptionNearestCityHeuristic
(BaseTSP problem) Constructs a nearest city heuristic for an instance of the TSP.NearestCityPairHeuristic
(BaseTSP problem) Constructs a nearest city pair heuristic for an instance of the TSP.