Journal article · 2026 · Open access
Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly
Operations Research, 74(4), 1811–1833 · Published 24 February 2026 · DOI 10.1287/opre.2023.0615
In brief
“Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly” is a 2026 journal article by Zhengzhong You and 3 co-authors, published in Operations Research. OpenAlex counts 13 citations as of 18 November 2026. It is open access: the full text is free to read at SSRN Electronic Journal.
- Citations
- 13
- Most cited in
- 2026 (11)
- Field-weighted impact
- 19.39
- References
- 71
- Authors
- 4
Abstract
Smarter Branching Speeds Up Leading Exact Vehicle Routing Solvers Researchers have introduced a learning-based branching strategy that substantially accelerates exact algorithms for vehicle routing problems, a core challenge in logistics and transportation systems. The study proposes the first learning-to-branch framework tailored for branch-price-and-cut methods, where dynamic variables and dense constraints make traditional branching decisions computationally expensive. The novel two-stage learning-based branching (2LBB) approach effectively filters promising candidates using inexpensive features and then applies selective, partial testing to reduce costly evaluations. A theoretical model further guides dynamic adjustment of branching effort, balancing decision time with solution quality. Extensive experiments show runtime reductions of 45%–50% on standard CVRP and VRPTW benchmarks and a 47% speedup over the state-of-the-art VRPSolver when integrated into the open-source RouteOpt. These results highlight the growing potential of disciplined machine learning to enhance exact optimization algorithms.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
You, Z., Yang, Y. L., Wang, X., & Yin, W. (2026). Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly. Operations Research, 74(4), 1811–1833. https://doi.org/10.1287/opre.2023.0615
MLA 9
You, Zhengzhong, et al. “Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly.” Operations Research, vol. 74, no. 4, 2026, pp. 1811–1833. https://doi.org/10.1287/opre.2023.0615.
Chicago
You, Zhengzhong, Yu Long Yang, Xinshang Wang, and Wotao Yin. 2026. “Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly.” Operations Research 74 (4): 1811–1833. https://doi.org/10.1287/opre.2023.0615.
Harvard
You, Z. et al. (2026) ‘Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly’, Operations Research, 74(4), pp. 1811–1833. doi:10.1287/opre.2023.0615.
IEEE
Z. You, Y. L. Yang, X. Wang, and W. Yin, “Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly,” Operations Research, vol. 74, no. 4, pp. 1811–1833, 2026, doi: 10.1287/opre.2023.0615.
BibTeX
@article{you2026stage,
title = {{Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly}},
author = {You, Zhengzhong and Yang, Yu Long and Wang, Xinshang and Yin, Wotao},
journal = {Operations Research},
year = {2026},
volume = {74},
number = {4},
pages = {1811--1833},
doi = {10.1287/opre.2023.0615},
url = {https://doi.org/10.1287/opre.2023.0615}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 1 | |
| 2026 | 11 |
Its field-weighted citation impact is 19.39: it has been cited 19.39 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- branch-price-and-cut
- vehicle routing
- exact optimization
- dynamic variables
- execution time reduction
Work with this paper
Most-cited papers in Engineering
- A Closed‐form Equation for Predicting the Hydraulic Conductivity of Unsaturated SoilsMartinus Th. van Genuchten · Soil Science Society of America Journal · 1980 · 28,197 citations
- An improved technique for determining hardness and elastic modulus using load and displacement sensing indentation experimentsW. C. Oliver, George M. Pharr · Journal of materials research/Pratt's guide to venture capital sources · 1992 · 27,379 citations
- Digital communicationsOwen Bishop · Routledge eBooks · 2007 · 24,890 citations
- The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysisNorden Eh Huang, Zhengwei Shen, Steven R. Long and 6 more · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 1998 · 24,008 citations
- Numerical Heat Transfer and Fluid FlowSuhas V. Patankar · CRC Press eBooks · 2018 · 23,491 citations
Questions about this paper
How do I cite this paper in APA style?
You, Z., Yang, Y. L., Wang, X., & Yin, W. (2026). Two-Stage Learning to Branch in Branch-Price-and-Cut Algorithms for Solving Vehicle Routing Problems Exactly. Operations Research, 74(4), 1811–1833. https://doi.org/10.1287/opre.2023.0615
How many times has this paper been cited?
13 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at SSRN Electronic Journal: sign in and open the full text from this page.
Who wrote this paper?
Zhengzhong You, Yu Long Yang, Xinshang Wang, Wotao Yin.
What is the DOI of this paper?
10.1287/opre.2023.0615, permanently at https://doi.org/10.1287/opre.2023.0615. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.