Skip navigation links

oracle.spatial.network.lod
Class TSPLK

java.lang.Object
oracle.spatial.network.lod.TSPLK

All Implemented Interfaces:

TSP

public class TSPLK

extends java.lang.Object

implements TSP

This class implements the Lin-Kernighan heuristic for the Traveling-Salesman-Problem.

Since:

11gR2

Nested Class Summary

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

TSP.TourFlag

Constructor Summary

TSPLK(oracle.spatial.network.lod.NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, java.util.Map<PointOnNet,java.util.Map<PointOnNet,ShortestPath>> pairWiseSPAlgorithms)

Method Summary

TspPath

tspPath(PointOnNet[][] points, TSP.TourFlag tourFlag, int linkLevel, LODNetworkConstraint constraint) Returns the traveling salesman tour with the optimal or suboptimal cost.

Methods inherited from class java.lang.Object

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

Constructor Detail

TSPLK

public TSPLK(oracle.spatial.network.lod.NetworkExplorer ne,
             LinkCostCalculator[] lccs,
             NodeCostCalculator[] nccs,
             java.util.Map<PointOnNet,java.util.Map<PointOnNet,ShortestPath>> pairWiseSPAlgorithms)

Method Detail

tspPath

public TspPath tspPath(PointOnNet[][] points,
                       TSP.TourFlag tourFlag,
                       int linkLevel,
                       LODNetworkConstraint constraint)
                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 node ID.

linkLevel - link level

constraint - network constraint

Throws:

LODNetworkException

Skip navigation links