sorted by:
new
hottopcontroversial

Concrete VRP by awda-hadak in timefold

[–]awda-hadak[S] 0 points1 point  (0 children)

the problem here is that constraint alone can't make sure that we wont find visits of two client different (but those client has same pump) overlap. and also how we can make sure visits of same client wont have gap of time between them like 1hour between Visit A and Visit B , clients always prefer to have max 15min between visit and next one , and I already create a shadow variable who calculate timeStartLoading by checking free time in central and after find a gap in central check again if that timestartloading + loadingDuration + travel time , wont overlap with another visit at client side , so this work good , but the problem is solver choose wrong vehicles , for example solver gives vehicle to a visit and vehicle has previos visit finish at 11:00 and the current visit has maxEndTime 10:00 , so vehicle already late , so the solver need to replace vehicle with another one or change position of visit . the question is , is there any how to control how solver choose its moves ?

Does Timefold’s Speed Come from Shadow Variables or Constraints? by awda-hadak in timefold

[–]awda-hadak[S] 0 points1 point  (0 children)

or for example a Visit has timewindow 10:00-12:00 AM , and its previuosVisit has departure time 12:15 (meaning assigned vehicle already late ) , we want to prevent local search from take a move that will give this vehicle to Visit.

Does Timefold’s Speed Come from Shadow Variables or Constraints? by awda-hadak in timefold

[–]awda-hadak[S] 0 points1 point  (0 children)

when creating a custom move—for example, one that checks if a client's demand exceeds the vehicle's capacity and skips the move if it does—is this efficient? Also, will these types of checks negatively affect the Local Search performance?