TspTwRanking
org.ddolibscala.example.tsptw.TspTwRanking
class TspTwRanking extends StateRanking[TspTwState]
Ranking class for states in the Traveling Salesperson Problem with Time Windows (TSPTW).
This class implements org.ddolibscala.modeling.StateRanking for TSPTWState and is used to order states within the same layer of a decision diagram. The ranking helps identify which states are better candidates for merging in a relaxed decision diagram.
The comparison is based on the number of nodes in the maybeVisit set: states with more nodes in maybeVisit are considered better candidates for merging and are ranked higher.
Attributes
- Graph
-
- Supertypes
-
trait StateRanking[TspTwState]trait StateRanking[TspTwState]trait Comparator[TspTwState]class Objecttrait Matchableclass Any
Members list
In this article