The Euclidean distance function with distances rounded up to the nearest integer.

Enumeration of the supported data types.

Enumeration of ways a graphical display can be generated from the data.

Abstract superclass of all distance function implementations. This class ensures the two nodes provided to the {@link #distance(Node, Node)} method a

Tests the distance functions against the cases provided in the official TSPLIB documentation.

A distance table provides a lookup of the distances between the nodes in a TSPLIB problem instance.

An edge between two nodes.

Stores the edges in a graph.

Enumeration of the formats in which edge data is specified.

Tests the {@link Edge} class.

Enumeration of the various formats in which edge weights (distances) can be specified.

Stores the edge weight matrix from a TSPLIB problem instance.

Enumeration of the ways that explicit edge weights (distances) can be specified.

The Euclidean distance function.

The geographical distance function. Node coordinates must be specified in latitude and longitude positions of the form {@code DDD.MM} where {@code DD

The Manhattan distance function.

The maximum distance function.

Represents a node (i.e., city) or arbitrary dimension.

Enumeration of the ways node coordinates can be specified.

Stores the nodes in a TSPLIB problem instance and provides methods for calculating the distances between nodes.

The psuedo-Euclidean distance function used by the {@code ATT} TSPLIB problem instances.

Implementation of the 2-opt heuristic for the traveling salesman problem. The 2-opt heuristic searches for any two edges in a tour that can be rearran

Tests the {@link TSP2OptHeuristic} class.

Demonstration of optimizing a TSP problem using the MOEA Framework optimization library (http://www.moeaframework.org/). A window will appear showing

A TSPLIB problem instance.

Panel for displaying TSPLIB problem instances and tours.

The optimization problem definition. This is a 1 variable, 1 objective optimization problem. The single variable is a permutation that defines the n

Tests asymmetric traveling salesman problem (ATOP) instances. This only tests if the instances loaded without error, not for correctness.

Tests Hamiltonian cycle problem (HCP) instances.

Tests sequential ordering problem (SOP) instances. This only tests if the instances load without error, not for correctness.

Tests traveling salesman problem (TSP) instances.

Tests vehicle routing problem (VRP) instances. This only tests if the instance loads correctly, not for correctness.

Stores the nodes (by their identifier) that are visited in a tour. Tours are cyclic, so an implicit edge exists between the last index and the first.

The inner class storing tour display settings. These settings control the paint and line stroke when rendering the tour.

Tests the {@link Tour} class.

Stores the demand at each node and identifies the depot nodes for vehicle routing problems.