drasys.or.graph.tsp
Class NearestAddition

java.lang.Object
  |
  +--drasys.or.graph.tsp.TSPBase
        |
        +--drasys.or.graph.tsp.ConstructBase
              |
              +--drasys.or.graph.tsp.NearestAddition

public class NearestAddition

extends ConstructBase

implements ConstructI

This is an implementation of the Nearest Addition TSP construction algorithm.

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

Constructor Summary

NearestAddition()

NearestAddition(GraphI graph)

 

Method Summary
protected  void	construct()

 

Methods inherited from class drasys.or.graph.tsp.ConstructBase

constructClosedTour, constructOpenTour, constructOpenTour, constructOpenTourFrom, constructOpenTourTo, saveTour, selectVertex, selectVertex, selectVertex

 

Methods inherited from class drasys.or.graph.tsp.TSPBase

checkChangeCount, countVertices, forwardCost, getCost, getTour, initVertices, initVertices, reverseCost, rotateClosedTour, setEdgeKey, setGraph, setProperties

 

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

 

Constructor Detail

NearestAddition

public NearestAddition()

NearestAddition

public NearestAddition(GraphI graph)

construct

protected void construct()
                  throws TourNotFoundException

Overrides:

construct in class ConstructBase