A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
Computers & Operations Research, Volume 64, Issue C, 2015.
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
Full Text (Upload PDF)
PPT (Upload PPT)