Dominance relation for the Traveling Salesperson Problem with Time Windows (TSPTW).
This class defines a dominance rule between two TspTwState instances. Two states are comparable if they share the same current position and the same set of remaining locations to visit mustVisit. Among such comparable states, the state with the lower current time dominates the other.
Dominance is used to prune the search space: if a state is dominated by another, it can be safely discarded without losing optimality.
Test whether state1 is dominated by or equivalent to state2.
Test whether state1 is dominated by or equivalent to state2.
A state state1 is said to be dominated by state2 if every feasible continuation from state1 cannot yield a better objective value than one from state2. In other words, state2 is at least as good as state1 in all relevant aspects of the problem.
Value parameters
state1
the first state to compare
state2
the second state to compare against
Attributes
Returns
true if state1 is dominated by or equivalent to state2
Returns a canonical key associated with a given state.
Returns a canonical key associated with a given state.
This key is typically used to identify equivalent states or to group states that share the same dominance characteristics. Implementations should ensure that two states with identical keys are comparable under the same dominance criteria.
Value parameters
state
the state for which a dominance key is requested
Attributes
Returns
an object uniquely (or canonically) representing the given state