Interface TSP

  • All Known Implementing Classes:
    TspImpl, TspNearestNeighbor, TspOp2

    public interface TSP
    This interface defines methods supported by traveling salesman problem algorithm.
    Since:
    11gR2
    • Nested Class Summary

      Nested Classes 
      Modifier and Type Interface Description
      static class  TSP.TourFlag
      Enumeration whose values indicate whether a tsp tour is open or closed, and if open, whether the tour have fixed start and/or end point.
    • Method Detail

      • setNetworkAnalyst

        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. If network analyst is not needed by the shortest path algorithm, the algorithm can choose to do nothing with this method.
      • tspPath

        TspPath tspPath​(PointOnNet[][] points,
                        TSP.TourFlag tourFlag,
                        LODNetworkConstraint pathConstraint,
                        TspConstraint tspConstraint)
                 throws LODNetworkException
        Returns the traveling salesman tour with the optimal or suboptimal cost.
        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.
        pathConstraint - network constraint
        tspConstraint - tsp constraint
        Throws:
        LODNetworkException