Optimal Routing under Capacity and Distance Restrictions

1 October 1985

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 33 (5) , 1050-1073
https://doi.org/10.1287/opre.33.5.1050

Abstract

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, depending upon the nature of the distance matrix. Exact solutions are obtained for problems involving up to sixty cities.

Keywords

OPTIMAL
INTEGER
SUBTOUR
MATRIX
SIXTY
RELAXATION
CAPACITY AND DISTANCE
CONSTRAINTS
PROBLEMS INVOLVING

This publication has 0 references indexed in Scilit: