Package drasys.or.graph.tsp

Traveling salesman problem algorithms.

See:
          Description

Interface Summary
ConstructI The interface used by all algorithms to access TSP construction algorithms.
ImproveI The interface used by all algorithms to access TSP improvement algorithms.
TSPI The interface used by all algorithms to access TSP algorithms.
 

Class Summary
BestOf This class implements a composite TSP algorithm by combining a set of construction algorithms with a set of improvement algorithms.
BestOfAll This class implements a composite TSP algorithm by combining the set of all the OR-Objects TSP construction algorithms with the set of all OR-Objects improvement algorithms.
CheapestInsertion This is an implementation of the Cheapest Insertion TSP construction algorithm.
Composite This class implements a composite TSP algorithm by combining a construction algorithm with an improvement algorithm.
ConstructBase A base class containing features common to many construction TSP algorithms.
ConstructToImproveConverter This class allows a construction algorithm to be used as an improvement algorithm.
FarthestInsertion This is an implementation of the Farthest Insertion TSP construction algorithm.
FullEnumeration This is TSP construction algorithm which fully enumerates all possibilities and retains the best.
Geni An implementation of the 'GENI' construction portion of the composite TSP heuristic 'GENIUS'.
Genius An implementation of the composite TSP heuristic 'GENIUS'.
ImproveBase A base class containing features common to many improvement TSP algorithms.
NearestAddition This is an implementation of the Nearest Addition TSP construction algorithm.
NearestInsertion This is an implementation of the Nearest Insertion TSP construction algorithm.
ThreeOpt This is an implementation of the 3-Opt TSP improvement algorithm.
TSPBase A base class containing features common to many TSP algorithms.
TwoOpt

References:

Local Search in Combinatorial Optimization
    Jan Karel Lenstra (Editor), Emile Aarts (Editor) / Paperback / Published 1997
The Traveling Salesman Problem : A Guided Tour of Combinatorial Optimization
    E.L. Lawler (Editor) / Paperback / Published 1985

Us An implementation of the 'US' improvement portion of the composite TSP heuristic 'GENIUS'.
 

Exception Summary
TourNotFoundException Thrown if a TSP algorithm can not find a connected tour.
TSPException The parent of all exception classes in the 'tsp' package.
 

Error Summary
TSPError The parent of all error classes in the 'tsp' package.
 

Package drasys.or.graph.tsp Description

Traveling salesman problem algorithms.

Author:
DRA Systems


Copyright(C)1997-2000 by DRA Systems all rights reserved. OpsResearch.com