Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ANOR
2006

favoriteEmaildiscussreport

81views more ANOR 2006»

The Vehicle Routing Problem with Demand Range

13 years 5 months ago

The Vehicle Routing Problem with Demand Range

Download myweb.uiowa.edu

We propose and formulate the vehicle routing problem with demand range (VRPDR), a new variation on the traditional vehicle routing problem. In the VRPDR, the delivery quantity for each customer i is allowed to vary from its original size di by an amount

Ann Melissa Campbell

Real-time Traffic

ANOR 2006 | Demand Range | Routing | Vehicle |

claim paper

Related Content

» Designing delivery districts for the vehicle routing problem with stochastic demands

» A memetic algorithm for the multicompartment vehicle routing problem with stochastic deman...

» The Vehicle Routing Problem with Stochastic Demand and Duration Constraints

» Solving the Vehicle Routing Problem with Stochastic Demands using the CrossEntropy Method

» An exact algorithm for a vehicle routing problem with time windows and multiple use of veh...

» Dynamic vehicle routing with heterogeneous demands

» A Vehicle Routing Problem Solved by Agents

» Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Deli...

» The multishift vehicle routing problem with overtime

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ANOR
Authors	Ann Melissa Campbell

Comments (0)