The pyramidal capacitated vehicle routing problem

The pyramidal capacitated vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor20101868
Volume: 205
Issue: 1
Start Page Number: 59
End Page Number: 64
Publication Date: Aug 2010
Journal: European Journal of Operational Research
Authors:
Keywords: programming: travelling salesman
Abstract:

This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal route is defined as a route on which the vehicle first visits customers in increasing order of customer index, and on the remaining part of the route visits customers in decreasing order of customer index.

Reviews

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