A branch and bound algorithm for the capacitated vehicle routing problem
- 1 June 1983
- journal article
- Published by Springer Science and Business Media LLC in OR Spectrum
- Vol. 5 (2), 77-85
- https://doi.org/10.1007/bf01720015
Abstract
This paper considers a version of the vehicle routing problem in which a non-negative weight is assigned to each city to be visited and where all vehicles are identical and have the same capacityD. The weight assigned to a vehicle on a given route may not exceed this capacity. The problem is formulated as an integer program: integrality is obtained by means of a branch and bound procedure; capacity constraints are first relaxed, and introduced only when they are found to be violated. Three variants of this basic algorithm are examined. Exact solutions are obtained for problems ranging from 15 to 50 cities. Diese Arbeit befaßt sich mit einer Variante des Fahrzeugroutenproblems, bei der jeder zu besuchenden Stadt ein nichtnegatives Gewicht zugeordnet ist und bei der alle Fahrzeuge gleich sind und die gleiche KapazitätD haben. Das Problem wird als ganzzahliges lineares Programm formuliert: Ganzzahligkeit wird über ein Branch und Bound-Verfahren erreicht. Dabei werden die Kapazitätsbeschränkungen zunächst relaxiert und nur dann wieder einbezogen, wenn sie verletzt werden. Drei Varianten dieses Basisverfahrens werden untersucht. Exakte Lösungen werden für Probleme mit 15 bis 50 Städten erhalten.Keywords
This publication has 15 references indexed in Scilit:
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Implementing vehicle routing algorithmsNetworks, 1977
- An Integer Programming Approach to the Vehicle Scheduling ProblemJournal of the Operational Research Society, 1976
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- On an Integer Program for a Delivery ProblemOperations Research, 1964
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- Applications of Linear Programming in the Oil IndustryManagement Science, 1957