All Packages  Class Hierarchy  This Package  Previous  Next  Index

Class drasys.or.graph.tsp.Genius 

drasys.or.graph.tsp.Composite
   |
   +----drasys.or.graph.tsp.Genius
public class Genius
extends Composite
An implementation of the composite TSP heuristic 'GENIUS'. The 'GENIUS' algorithm is described in a paper by Michel Gendreau, Alain Hertz, Gilbert Laporte which was published in 'Operations Research' Vol.40, No.6, November-December 1992.
Copyright (C) 1997 by DRA Systems all rights reserved.

See Also:
Geni, Us

Constructor Index

o Genius(int)
Sets the neighborhood for both the GENI and US sections to the argument.
o Genius(int, GraphI)
Sets the neighborhood for both sections and the target graph.
o Genius(int, int)
Sets the neighborhood for both the GENI and US sections separately.
o Genius(int, int, GraphI)
Sets the neighborhood for each section separately and the target graph.

Constructors

o Genius 
 public Genius(int sizeOfNeighborhood)
Sets the neighborhood for both the GENI and US sections to the argument. The graph must be set with 'setGraph()' before constructing a tour.

o Genius 
 public Genius(int geniSizeOfNeighborhood,
               int usSizeOfNeighborhood)
Sets the neighborhood for both the GENI and US sections separately. The graph must be set with 'setGraph()' before constructing a tour.

o Genius 
 public Genius(int sizeOfNeighborhood,
               GraphI graph)
Sets the neighborhood for both sections and the target graph.

o Genius 
 public Genius(int geniSizeOfNeighborhood,
               int usSizeOfNeighborhood,
               GraphI graph)
Sets the neighborhood for each section separately and the target graph. 

All Packages  Class Hierarchy  This Package  Previous  Next  Index