Adds the specified node to this problem instance. If a node with the same identifier already exists, the previous node will be replaced. @param node

Returns the identifier of the node visited at the specified index. Tours are cyclic, so specifying an index {@code < 0} or {@code >= size()} is cycled

The number of nodes visited in this tour. @return the number of nodes visited in this tour

Constructs a tour from the specified array. The values in the array should start at {@code 1}. @param entries the nodes visited in the tour @return

Returns the canonical tour with the given length. The canonical tour visits the nodes in order, i.e., {@code [1, 2, 3, ..., length]}. @param length

Reads the next line from the reader, parses out one or more weights, and appends the weights to the given queue. @param reader the reader containing

Returns the node with the specified identifier. @param id the identifier of the node to return @return the node with the specified identifier

Returns {@code true} if this tour is equivalent to the specified tour; {@code false} otherwise. Two tours are considered equivalent if they visit the

Calculates and returns the total distance of this tour. The total distance includes the distance from the last node back to the first node in the tou

Returns the solutions to this problem instance. @return the solutions to this problem instance

Adds a solution to this TSPLIB problem instance. This method does not verify that the solution has all required edges; the caller must ensure this co

Returns the type of this problem instance. @return the type of this problem instance

Returns this tour as an array of integers. @return this tour as an array of integers

Converts a latitude or longitude value in the form {@code DDD.MM} to its geographical angle in radians. @param x the latitude or longitude value in t

Returns the number of nodes defined by this problem instance. @return the number of nodes defined by this problem instance

Returns the distance between the two specified nodes. @param id1 the identifier of the first node @param id2 the identifier of the second node @retur

Reverses the order in which the nodes are visited between the two specified indices. The first index defines the start of the reverse operation; the

Adds a tour to this graphical display. The tour will be displayed using the default color. @param tour the tour to display

Returns the distance table that defines the nodes, edges, and weights for this problem instance. @return the distance table that defines the nodes, e

Returns the identifier of this node. @return the identifier of this node

Returns the opposite endpoint of this edge. @param id the identifier of the one endpoint @return the opposite endpoint of this edge @throws IllegalAr

Returns {@code true} if either endpoint of this edge is the specified node; {@code false} otherwise. @param id the identifier of the node @return {@c

Converts the node coordinates into display coordinates on the screen. If this problem uses geographical weights, then the latitude/longitude coordinat

Applies the 2-opt heuristic to the specified tour. @param tour the tour that is modified by the 2-opt heuristic

Returns the length (dimension) of the coordinates. @return the length (dimension) of the coordinates

Returns the position of this node. @return the position of this node

Converts a MOEA Framework solution to a {@link Tour}. @param solution the MOEA Framework solution @return the tour defined by the solution

Adds an edge to this graph. @param id1 the identifier of the first node @param id2 the identifier of the second node @throws IllegalArgumentException

Removes all nodes from this problem instance.

Sets this tour equal to the specified array. @param array the array of integers defining a tour

Returns the way graphical displays of the data should be generated. @return the way graphical displays of the data should be generated

Returns the name of this problem instance. @return the name of this problem instance

Returns {@code true} if the specified nodes are neighbors; {@code false} otherwise. @param id1 the identifier of the first node @param id2 the identi

Loads a problem instance from the specified TSPLIB file. @param file the TSPLIB file defining the problem @throws IOException if an I/O error occurre

Reads the next line of adjacent edges, adding the parsed values to the queue. @param reader the reader containing the adjacent edge data @param entri

Saves the string to a temporary file. @param string the contents of the temporary file @return the temporary file containing the specified string con

Sets the identifier of the node visited at the specified index. Tours are cyclic, so setting an index {@code < 0} or {@code >= size()} is cycled thro

Returns the number of nodes that this instance contains. @return the number of nodes that this instance contains

Removes all tours shown in this display.

Returns {@code true} if this tour contains all the fixed edges required by the TSPLIB problem instances; {@code false} otherwise. @param problem the

Returns a random tour with the given length. A random tour will visit every node exactly once. @param length the number of nodes in the resulting to

Saves a {@link Tour} into a MOEA Framework solution. @param solution the MOEA Framework solution @param tour the tour

Returns the data used to graphically display the nodes; or {@code null} if the display data is not explicitly defined. @return the data used to graph

Returns the way edge weights are specified. @return the way edge weights are specified

Returns the edges contained in this graph. Changes to the returned list will be reflected in this graph. @return the edges contained in this graph

Returns the edges that are required in each solution to this problem instance. @return the edges that are required in each solution to this problem i

Returns the identifiers of all neighbors of the specified node. A neighbor must have a direct edge between itself and the specified node. @param id

Returns the paint/color used when rendering the tour. @return the paint/color used when rendering the tour

Returns the line stroke used when rendering the tour. @return the line stroke used when rendering the tour

Returns {@code true} if this tour is a Hamiltonian cycle; {@code false} otherwise. A Hamiltonian cycle is a path through a graph that visits every no

Returns the identifiers of all nodes in this distance table. @return the identifiers of all nodes in this distance table

Loads the contents of this tour from the given reader. @param reader the reader that defines this tour @throws IOException if an I/O error occurred w

Loads the demands from the specified reader. @param reader the reader containing the demands @throws IOException if an I/O error occurred while readi

Loads the depot list from the given reader. @param reader the reader that defines the depot nodes @throws IOException if an I/O error occurred while

Removes the node with the specified identifier from this problem instance. @param id the identifier of the node to remove

Set to {@code true} if this graphical display should automatically repaint when the displayed tours are changed; {@code false} otherwise. When {@code

Returns the edges belonging to this tour. @return the edges belonging to this tour

Constructs a new Euclidean distance function with distances rounded up to the nearest integer.

Constructs a new distance function.

Constructs a new distance table instance.

Constructs an edge between two nodes. @param id1 the identifier of the first node @param id2 the identifier of the second node

Constructs a new, empty graph with no edges. @param size the number of nodes represented in this graph @param format the format of the edge data sect

Constructs a new, empty edge weight matrix. @param size the number of nodes represented in this edge weight matrix @param format the format of this e

Constructs a new Euclidean distance function.

Constructs a new geographical distance function.

Constructs a new Manhattan distance function.

Constructs a new maximum distance function.

Constructs a new node with the specified identifier and position. @param id the identifier of this node @param position the position of this node

Constructs a new node coordinate enumeration. @param length the length (dimension) of the coordinates

Constructs a new, empty node coordinates instance. @param size the number of nodes to load into this problem instance @param edgeWeightType the edge

Constructs a new pseudo-Euclidean distance function.

Constructs a new 2-opt heuristic for the specified traveling salesman problem instance. @param instance the traveling salesman problem instance

Constructs a new, empty TSPLIB problem instance.

Constructs a new panel for displaying a TSPLIB problem instance. @param problem the TSPLIB problem instance

Constructs a new optimization problem for the given TSP problem instance. @param instance the TSP problem instance

Constructs a new, empty tour.

Constructs a new, default tour display setting.

Constructs a new, empty vehicle routing table. @param size the number of nodes the the problem instance

{@inheritDoc} @throws IllegalArgumentException if the nodes are not two dimensional

{@inheritDoc} @throws IllegalArgumentException if the nodes are not two dimensional

Computes and returns the distance (or edge weight) between the two specified nodes. @param node1 the first node @param node2 the second node @return

Returns the truck capacity in CVRP problem instances. The return value is undefined if the data type is not {@code CVRP}. @return the truck capacity

Returns any comments about this problem instance. @return any comments about this problem instance

Returns the demand at the specified node. @param id the identifier of the node @return the demand at the specified node @throws IllegalArgumentExcept