Replies: 1 comment 2 replies
-
|
Hello @SER1-CG! You're right that doing this in a constraint would be painful and unnecessary. At the moment, I think your best bet is to generate your |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Hey TimeFold team, great work with TimeFold Solver. We love it!
Currently, we try to solve a rich VRP problem, based on your very comprehensive quick-start. We want to reduce the search space by narrowing the assignable
Visitclasses of aVehicle. We thought of creating a cached problem fact in ourPlanningSolutionthat precisely captures assignability per vehicle:Now, we need to create a
ValueRangeProvideron theVehicleclass that specifies the range of its visits using the according map entry of this problem fact. However, it must hold that globally on the solution, no assigned visit of a vehicle is assigned to another vehicle. This before was done via aValueRangeProviderof visits in solution class. It is unclear to us how to implement thisValueRangeProviderfor vehicles that supports this desired behavior: a value range per vehicle that is dependent on static information before optimizing, that forbids overlapping assigned values over the set of vehicles.I could implement this as a constraint, but it wouldn't make too much sense as there are domain constraints that forbid assigning these - think of working hours of the vehicle that don't align with the availability time window of a visit.
Beta Was this translation helpful? Give feedback.
All reactions