Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Greedy function approximation: A gradient boosting machine.
Bagging predictors
MaxSAT by improved instance-specific algorithm configuration
ASlib: a benchmark library for algorithm selection
Certification of an optimal TSP tour through 85,900 cities
Efficiently solving very large-scale routing problems
New benchmark instances for the capacitated vehicle routing problem
The algorithm selection competitions 2015 and 2017
Very large-scale vehicle routing: new test problems, algorithms, and results
Instance space analysis and algorithm selection for the job shop scheduling problem
Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
Guidelines for the computational testing of machine learning approaches to vehicle routing problems
An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
The Vehicle Routing Problem
Introduction to Semi-Supervised Learning
Bounds and Heuristics for Capacitated Routing Problems
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
A Survey on the Explainability of Supervised Machine Learning
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Evolving diverse TSP instances by means of novel and creative mutation operators
Explaining AdaBoost
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Random forests

This page was built for publication: Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques