Back

G-85-11

Exact Algorithms for the Vehicle Routing Problem

and

BibTeX reference

This paper presents a survey of exact algorithms for various types of vehicle routing problems. Algorithms are divided into three main categories: direct search methods, dynamic programming and integer linear programming. This latter category comprises three approaches: set partitioning, vehicle flow formulations and commodity flow formulations.

, 62 pages

This cahier was revised in November 1985

Research Axis

Research application