Comparing Static and Dynamic Policies for Vehicle Routing Problems with Backhauling and Dynamic Customer Demands

Authors:
Subrata Mitra
Affiliations:
Department of Operations Management, Indian Institute of Management-Calcutta, Joka, Calcutta, India
Venue:
International Journal of Applied Logistics
Year:
2013

Citing 11
Cited 0

Diversion Issues in Real-Time Vehicle Dispatching

Transportation Science
Vehicle routing and scheduling with dynamic travel times

Computers and Operations Research
The dynamic multi-period vehicle routing problem

Computers and Operations Research
A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries

Expert Systems with Applications: An International Journal
Online vehicle routing and scheduling with dynamic travel times

Computers and Operations Research
An improved LNS algorithm for real-time vehicle routing problem with time windows

Computers and Operations Research
An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information

Expert Systems with Applications: An International Journal
An effective local search approach for the Vehicle Routing Problem with Backhauls

Expert Systems with Applications: An International Journal
A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries

Computers and Industrial Engineering
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem

Journal of Combinatorial Optimization
A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic vehicle routing problems with backhauling VRPB, although important, have attracted little attention in the literature. Dynamic VRPB is more complex than dynamic vehicle routing problems VRP without backhauling, and since VRP without backhauling is a special case of VRPB, models and algorithms for dynamic VRPB can easily be adapted for dynamic VRP. In this paper, the author compared between static and dynamic policies for solving VRPB with dynamic occurrences of customer delivery and pickup demands. They developed heuristic algorithms for medium-sized problems under static and dynamic policies. Although dynamic policies are always at least as good as static policies, the author observed from numerical experimentations that static policies perform relatively well for low degrees of dynamism dod. On the other hand, dynamic policies are expected to perform significantly better than static policies for high dod and early availabilities of dynamic customer delivery and pickup demand information. The author concludes the paper by providing directions for future research on dynamic VRPB.