A vehicle routing problem with stochastic demand
Operations Research
The vehicle scheduling problem with intermittent customer demands
Computers and Operations Research
The vehicle routing problem
Tabu Search
Waiting Strategies for Dynamic Vehicle Routing
Transportation Science
Truck route planning in nonstationary stochastic networks with time windows at customer locations
IEEE Transactions on Intelligent Transportation Systems
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
Computers and Operations Research
Fareplay: An examination of taxicab drivers' response to dispatch policy
Expert Systems with Applications: An International Journal
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
Transportation Science
The exact solution of several classes of inventory-routing problems
Computers and Operations Research
Workforce Management in Periodic Delivery Operations
Transportation Science
Hi-index | 0.00 |
This paper investigates the construction of routes for local delivery of packages. The primary objective of this research is to provide realistic models to optimize vehicle dispatching when customer locations and demands vary from day to day while maintaining driver familiarity with their service territories, hence dispatch consistency. The objective of increasing driver familiarity tends to make routes or service territories fixed. On the other hand, to serve varying demand it is advantageous to reassign vehicles/drivers and service territories each day. To balance the trade-offs between these two objectives, we developed the concepts of “cell,” “core area,” and “flex zone,” and created a two-stage vehicle routing model---strategic core area design and operational cell routing---and explicitly evaluated the effect of driver familiarity through the use of learning and forgetting curves.