TspTwState
Represents a state in the dynamic programming model for the Traveling Salesperson Problem with Time Windows (TSPTW).
Each state encapsulates the current information about the vehicle's position, the set of nodes yet to visit, and timing information. This record is used both for individual states and for relaxed/merged states.
Value parameters
- depth
-
a depth of the layer containing this state in the dynamic programming model
- maybeVisit
-
a set representing nodes that might have been visited or not in merged states
- mustVisit
-
a set representing all nodes that must still be visited
- position
-
the current last position of the vehicle. Usually unique and represented by TspNode. In merged states, the vehicle can be "at any position at the same time," represented by VirtualNodes
- time
-
the arrival time of the vehicle at the current position
Attributes
- Graph
-
- Supertypes
-
trait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass Any