A vehicle routing model with split delivery and stop nodes
In this work, a new variant of the Capacitated Vehicle Routing Problem (CVRP) is presented where the vehicles cannot perform any route leg longer than a given length L (although the routes can be longer). Thus, once a route leg length is close to L, the vehicle must go to a stop node to end the leg or return to the depot. We introduce this condition in a variation of the CVRP, the Split Delivery Vehicle Routing Problem, where multiple visits to a customer by different vehicles are allowed. We present two formulations for this problem which we call Split Delivery Vehicle Routing Problem with Stop Nodes: a vehicle flow formulation and a commodity flow formulation. Because of the complexity of this problem, a heuristic approach is developed. We compare its performance with and without the stop nodes
|Date of creation:||Apr 2011|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://portal.uc3m.es/portal/page/portal/dpto_estadistica
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cte:wsrepe:ws110906. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.