7 papers
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…
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…
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…
Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem
Bachtiar Herdianto, Romain Billot, Flavien Lucas +1
We propose a feature-based guidance mechanism to enhance metaheuristic algorithms for solving the Capacitated Vehicle Routing Problem (CVRP). This mechanism leverages an Explainabl…
Edge-Selector Model Applied for Local Search Neighborhood for Solving Vehicle Routing Problems
Bachtiar Herdianto, Romain Billot, Flavien Lucas +2
This research proposes a hybrid Machine Learning and metaheuristic mechanism that is designed to solve Vehicle Routing Problems (VRPs). The main of our method is an edge solution s…
Hybrid Node-Destroyer Model with Large Neighborhood Search for Solving the Capacitated Vehicle Routing Problem
Bachtiar Herdianto, Romain Billot, Flavien Lucas +2
In this research, we propose an iterative learning hybrid optimization solver developed to strengthen the performance of metaheuristic algorithms in solving the Capacitated Vehicle…