A Machine Learning Based Branch and Price Algorithm for a Sampled Vehicle Routing Problem

Nikolaus Furian*, Michael O'Sullivan, Cameron Walker, Eranda Cela

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Planning of operations, such as routing of vehicles, is often performed repetitively in rea-world settings, either by humans or algorithms solving mathematical problems. While humans build experience over multiple executions of such planning tasks and are able to recognize common patterns in different problem instances, classical optimization algorithms solve every instance independently. Machine learning (ML) can be seen as a computational counterpart to the human ability to recognize patterns based on experience. We consider variants of the classical Vehicle Routing Problem with Time Windows and Capacitated Vehicle Routing Problem, which are based on the assumption that problem instances follow specific common patterns. For this problem, we propose a ML-based branch and price framework which explicitly utilizes those patterns. In this context, the ML models are used in two ways: (a) to predict the value of binary decision variables in the optimal solution and (b) to predict branching scores for fractional variables based on full strong branching. The prediction of decision variables is then integrated in a node selection policy, while a predicted branching score is used within a variable selection policy. These ML-based approaches for node and variable selection are integrated in a reliability-based branching algorithm that assesses their quality and allows for replacing ML approaches by other (classical) better performing approaches at the level of specific variables in each specific instance. Computational results show that our algorithms outperform benchmark branching strategies. Further, we demonstrate that our approach is robust with respect to small changes in instance sizes.

Original languageEnglish
Pages (from-to)693-732
Number of pages40
Issue number3
Early online dateJan 2021
Publication statusPublished - Sept 2021


  • Vehicle Routing
  • Branch and Price
  • Branching Strategies
  • Machine Learning,·
  • Branching strategies
  • Vehicle routing
  • Machine learning
  • Branch and price

ASJC Scopus subject areas

  • Computational Mathematics
  • Management Science and Operations Research

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Theoretical


Dive into the research topics of 'A Machine Learning Based Branch and Price Algorithm for a Sampled Vehicle Routing Problem'. Together they form a unique fingerprint.

Cite this