3 papers
math.OC2026
Branch \& Price \& Cut for the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW)
Florian Rascoussier, Romain Billot, Lina Fahed +1
In urban contexts, travel times vary strongly with the time of day and traffic conditions. The Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) extends the classi…
math.OC2026
Randomized Constructive Heuristics for the VRPTW: A Focus on Regret-k
Florian Rascoussier, Romain Billot, Lina Fahed +1
The Vehicle Routing Problem with Time Windows (VRPTW) requires a fleet of capacitated vehicles to serve customers within strict time windows while minimizing total travel time. Con…
math.OC2026
Impact of Scaling and Rounding on Metaheuristic Performance for the Vehicle Routing Problem with Time Windows
Florian Rascoussier, Romain Billot, Lina Fahed +1
Classical Euclidean instances for the Vehicle Routing Problem with Time Windows (VRPTW) have floating-point arc costs derived from node coordinates. This raises reproducibility and…