Package org.cicirello.search.problems.tsp


package org.cicirello.search.problems.tsp
Classes and interfaces related to the Traveling Salesperson Problem (TSP).
  • Class
    Description
    This class serves as an abstract base class for the various classes that implement variations of the Traveling Salesperson Problem provided by the library.
    This class implements a nearest city constructive heuristic for the TSP for use by stochastic sampling algorithms.
    This class implements a constructive heuristic for the TSP that prefers the first city of the nearest pair of cities.
    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.
    This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with floating-point cost edges.
    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.
    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.
    Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floating-point valued.
    Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floating-point valued, and where all edge costs between pairs of cities are precomputed.
    Cost function for the Traveling Salesperson Problem (TSP), where edge costs are integer valued.
    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.
    A functional interface for specifying a distance function between a pair of cities in a TSP instance.