A new subtour elimination constraint for the vehicle routing problem

A new subtour elimination constraint for the vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor1999197
Country: Netherlands
Volume: 91
Issue: 3
Start Page Number: 573
End Page Number: 586
Publication Date: Jun 1996
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: integer, programming: network
Abstract:

Vehicle Routing Problems (VRP) are concerned with the delivery of a single commodity from a centralized depot to a number of specified customer locations with known demands. In this paper we consider the VRP characterized by: fixed or variable number of vehicles, common vehicle capacity, distance restrictions, and minimization of total distance travelled by all vehicles as the objective. We develop an exact algorithm based on a new subtour elimination constraint. The algorithm is implemented using the CPLEX package for solving the relaxed subproblems. Computational results on 1590 simulated problems and 10 literature problems (without distance restrictions) are reported and a comparative analysis is carried out.

Reviews

Required fields are marked *. Your email address will not be published.