Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
An additive bounding procedure for the asymmetric travelling salesman problem
Mathematical Programming: Series A and B
Polyhedral study of the capacitated vehicle routing problem
Mathematical Programming: Series A and B
Integer Programming Formulation of Traveling Salesman Problems
Journal of the ACM (JACM)
An overview of vehicle routing problems
The vehicle routing problem
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
An overview of vehicle routing problems
The vehicle routing problem
Computers and Operations Research
New lower bounds for the vehicle routing problem with simultaneous pickup and delivery
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
International Journal of Applied Metaheuristic Computing
Description and composition of bio-inspired design patterns: a complete overview
Natural Computing: an international journal
Generation of VNS components with grammatical evolution for vehicle routing
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Using graphical information systems to improve vehicle routing problem instances
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Multi-robot repeated area coverage
Autonomous Robots
A novel meta-heuristic based on soccer concepts to solve routing problems
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
The vehicle rescheduling problem
Computers and Operations Research
Hi-index | 0.04 |
In this paper we review the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered. These algorithms have considerably increased the size of VRPs that can be solved with respect to earlier approaches. Moreover, at least for the case in which the cost matrix is asymmetric, branch and bound algorithms still represent the state-of-the-art with respect to the exact solution. Computational results comparing the performance of different relaxations and algorithms on a set of benchmark instances are presented. We conclude by examining possible future directions of research in this field.