A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem

Computers & Operations Research, Volume 64, Issue C, 2015.

Cited by: 15|Bibtex|Views13|Links
EI

Abstract:

We consider the Commodity constrained Split Delivery Vehicle Routing Problem (C-SDVRP), a routing problem where customers may request multiple commodities. The vehicles can deliver any set of commodities and multiple visits to a customer are allowed only if the customer requests multiple commodities. If the customer is visited more than o...More

Code:

Data:

Your rating :
0

 

Tags
Comments