This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance constraints. The method uses constraint relaxation and a new class of subtour elimination constraints. Two versions of the algorithm are presented, according to the nature of the distance matrix. Exact solutions are obtained for problems involving up to 60 cities.