Document Type

Report

Publication Date

10-2009

Subjects

Vehicle routing problem -- Mathematical models, Transportation problems (Programming), Transportation -- Planning -- Case studies

Abstract

This paper studies approximations to the average length of Vehicle Routing Problems (VRP). The approximations are valuable for strategic and planning analysis of transportation and logistics problems. The research focus is on VRP with varying number of customers, demands, and locations. This modeling environment can be used in transport and logistics models that deal with a distribution center serving an area with daily variations in the demand. The routes are calculated daily based on what freight is available. New approximations and experimental settings are introduced. Average distance travelled is estimated as a function of the number of customers served and the number of routes needed. Approximations are tested in instances with different customer spatial distributions, demand levels, number of customers, and time windows, Regression results indicate that the proposed approximations can reasonably predict the average length of VRP problems in randomly generated problems and real urban networks.

Description

This is a final report, OTREC-RR-09-07, from the NITC program of TREC at Portland State University, and can be found online at: http://nitc.trec.pdx.edu/research/project/134

The project brief can be found here: http://archives.pdx.edu/ds/psu/16734

DOI

10.15760/trec.13

Persistent Identifier

http://archives.pdx.edu/ds/psu/16733

Download

Share

COinS