Papers › A generalized formulation for vehicle routing problems
A generalized formulation for vehicle routing problems
Pedro Munari, Twan Dollevoet, Remy Spliet
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Different types of formulations are proposed in the literature to model vehicle routing problems. Currently, the most used ones can be fitted into two classes, namely vehicle flow formulations and set partitioning formulations. These types of formulations differ from each other not only due to their variables and constraints but also due to their main features. Vehicle flow formulations have the advantage of being compact models, so general-purpose optimization packages can be used to straightforwardly solve them. However, they typically show weak linear relaxations and have a large number of constraints. Branch-and-cut methods based on specialized valid inequalities can also be devised to solve these formulations, but they have not shown to be effective for large-scale instances. On the other hand, set partitioning formulations have stronger linear relaxations, but requires the implementation of sophisticate techniques such as column generation and specialized branch-and-price methods. Due to all these reasons, so far it is has been recognized in the vehicle routing community that these two types of formulations are rather different. In this paper, we show that they are actually strongly related as they correspond to special cases of a generalized formulation of vehicle routing problems.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections