Package oracle.spatial.network.lod

Class TspNearestNeighbor

java.lang.Object

oracle.spatial.network.lod.TspNearestNeighbor

All Implemented Interfaces:

TSP

public class TspNearestNeighbor
extends java.lang.Object
implements TSP

This is a simple heuristic TSP algorithm, which always picks the closest point as the next one to visit.

Since:

11gR2

Nested Class Summary

Nested classes/interfaces inherited from interface oracle.spatial.network.lod.TSP

TSP.TourFlag

Constructor Summary

Constructors

Constructor	Description
TspNearestNeighbor(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm)

Method Summary

Modifier and Type	Method	Description
void	setNetworkAnalyst(NetworkAnalyst analyst)	This method allows caller to pass the network analyst object to this TSP algorithm implementation, so that the algorithm can call the analysis functions provided by the network analyst, or access the network explorer associated with the network analyst.
Matrix<LogicalSubPath>	shortestPaths(PointOnNet[][] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint, TSP.TourFlag tourFlag)
TspPath	tspPath(PointOnNet[][] points, TSP.TourFlag tourFlag, LODNetworkConstraint constraint, TspConstraint tspConstraint)	Returns the traveling salesman tour with the optimal or suboptimal cost.

Methods inherited from class java.lang.Object

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

Constructor Detail

TspNearestNeighbor

public TspNearestNeighbor(NetworkExplorer ne,
                          LinkCostCalculator[] lccs,
                          NodeCostCalculator[] nccs,
                          ShortestPath spAlgorithm)

Method Detail

tspPath

public TspPath tspPath(PointOnNet[][] points,
                       TSP.TourFlag tourFlag,
                       LODNetworkConstraint constraint,
                       TspConstraint tspConstraint)
                throws LODNetworkException

Description copied from interface: TSP

Returns the traveling salesman tour with the optimal or suboptimal cost.

Specified by:

tspPath in interface TSP

Parameters:

points - points to visit on the TSP tour.

tourFlag - a flag indicating whether the tour should be open or closed, and if the tour is open, whether the tour should have fixed start or end point.

constraint - network constraint

tspConstraint - tsp constraint

Throws:

LODNetworkException

shortestPaths

public Matrix<LogicalSubPath> shortestPaths(PointOnNet[][] startPoints,
                                            PointOnNet[][] endPoints,
                                            LODNetworkConstraint constraint,
                                            TSP.TourFlag tourFlag)
                                     throws LODNetworkException

Throws:

LODNetworkException

setNetworkAnalyst

public void setNetworkAnalyst(NetworkAnalyst analyst)

Description copied from interface: TSP

This method allows caller to pass the network analyst object to this TSP algorithm implementation, so that the algorithm can call the analysis functions provided by the network analyst, or access the network explorer associated with the network analyst. If network analyst is not needed by the shortest path algorithm, the algorithm can choose to do nothing with this method.

Specified by:

setNetworkAnalyst in interface TSP