Uses of Class
org.ddolib.examples.tsp.TSPState
Packages that use TSPState
Package
Description
This package implements the acs, astar and ddo models for the Traveling Salesman Problem (TSP).
-
Uses of TSPState in org.ddolib.examples.tsp
Methods in org.ddolib.examples.tsp that return TSPStateModifier and TypeMethodDescriptionTSPProblem.initialState()Returns the initial state for a search algorithm.TSPRelax.mergeStates(Iterator<TSPState> states) Merges multipleTSPStateinstances into a single relaxed state.TSPProblem.transition(TSPState state, Decision decision) Computes the next state after making a decision from the current state.Methods in org.ddolib.examples.tsp with parameters of type TSPStateModifier and TypeMethodDescriptionintCompares two TSP states.Returns the domain of possible decisions for a given state and variable index.doubleTSPFastLowerBound.fastLowerBound(TSPState state, Set<Integer> unassignedVariables) Computes a fast lower bound on the cost to complete the TSP tour from the given state.doubleRelaxes the cost of a transition between states.TSPProblem.transition(TSPState state, Decision decision) Computes the next state after making a decision from the current state.doubleTSPProblem.transitionCost(TSPState state, Decision decision) Computes the transition cost of moving from the current state to the next state by visiting a given node.Method parameters in org.ddolib.examples.tsp with type arguments of type TSPStateModifier and TypeMethodDescriptionTSPRelax.mergeStates(Iterator<TSPState> states) Merges multipleTSPStateinstances into a single relaxed state.