inicioir al DIIbuscar
on the capacitated vehicle routing problem


The Capacitated Vehicle Routing Problem (CVRP) is a very important combinatorial optimization problem, with immediate applications in logistics. It was proposed by Dantzig and Ramser in 1959 and since then, it has been the focus of a lot of research. In spite of all this effort, the size of the instances that can be solved to optimality is still relatively small. In this talk we will give an overview of the CVRP and present the approach we used to be able to solve to optimality several open instances of the problem. This is joint work with: H. Longo, J. Lysgaard, M. Poggi de Aragao, M. Reis, E. Uchoa, R. Werneck.