Learning to repeatedly solve routing problems

DOI10.1002/net.22200arXiv2212.08101MaRDI QIDQ6196890

Andrea Lodi, Unnamed Author, Guy Desaulniers

Publication date: 15 March 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.08101

zbMATH Keywords

heuristicsmachine learningroutingreoptimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• New benchmark instances for the capacitated vehicle routing problem
• Learning when to use a decomposition
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• A generic exact solver for vehicle routing and related problems
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
• Column Generation
• Shortest Path Problems with Resource Constraints
• A Machine Learning-Based Approximation of Strong Branching

This page was built for publication: Learning to repeatedly solve routing problems