TITLE

Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

AUTHOR(S)
Bektaş, Tolga; Erdoğan, Güneş; Røpke, Stefan
PUB. DATE
August 2011
SOURCE
Transportation Science;Aug2011, Vol. 45 Issue 3, p299
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total cost of travel is minimized and all demands are met. This paper describes and compares four new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential-size sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented.
ACCESSION #
65049859

 

Related Articles

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics