Routefinder: Towards foundation models for vehicle routing problems
This paper introduces RouteFinder, a comprehensive foundation model framework to tackle
different Vehicle Routing Problem (VRP) variants. Our core idea is that a foundation model …
different Vehicle Routing Problem (VRP) variants. Our core idea is that a foundation model …
MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
Learning to solve vehicle routing problems (VRPs) has garnered much attention. However,
most neural solvers are only structured and trained independently on a specific problem …
most neural solvers are only structured and trained independently on a specific problem …
Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
T Marty, L Boisvert, T François, P Tessier, L Gautier… - Constraints, 2024 - Springer
Constraint programming is known for being an efficient approach to solving combinatorial
problems. Important design choices in a solver are the branching heuristics, designed to …
problems. Important design choices in a solver are the branching heuristics, designed to …
Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs
Graph neural networks (GNNs) have achieved great success for a variety of tasks such as
node classification, graph classification, and link prediction. However, the use of GNNs (and …
node classification, graph classification, and link prediction. However, the use of GNNs (and …