VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERY

Presented by, KIRAN M. Roll No: 09

Department of Mechanical Engineering Mar Athanasius College of Engineering Kothamangalam

INTRODUCTION
Vehicle Routing Problem (VRP) defined as a problem of finding optimal

routes of delivery or collection from one or several depots to a number of customers while satisfying some constraints.
First study was done by Dantzig and Ramzer in 1959. Different variants of VRP are: VRP with and without Time Window Capacitated VRP Open VRP Dynamic VRP VRP with Pick - up and Delivery

Problem is to find set of least cost vehicle route in such a way that: * Each customer is visited exactly once by exactly one vehicle. * All vehicle route starts and ends in depot (except Open VRP) * Other constraints as per the selected variant problem. Importance of reverse logistics activities lead to the researches in VRP

with Pick-up and Delivery.

Good have to be delivered to customers and also picked up from customers to depot

Earlier studies was known as VRP with

Backhauls.
Considered as two independent VRP, one for delivery

and other for pick up. Resulted in unnecessary vehicle utilization.

Lead

to the research to VRP Simultaneous Pick-up and Delivery.

with

LITERATURE REVIEW
Year Author Model Method Aggregation of points pair vice whose combined demand do not exceed vehicle capacity. Savings Algorithm Heuristic methods. Developed problem Instances. Frank Wolfe Algorithm LHBH Heuristic Insertion based Heuristic Insertion based Heuristic

1959 Dantzig and Ramzer[1]

Truck Dispatching Problem (Single vehicle)

Multi vehicle problem VRP with Time Window Dynamic VRP VRP with Backhauls Vehicle Routing and Reverse Logistics: VRPSPD

1964 1983 1986 1989 2001 2005

Clark and Wright[2] M. M. Solomon[3] W. B. Powell[4] Jacob Blencha[5] Jan Dethloff[6] Nagy and Salhi[7]

VRPSPD with multiple depot

Year
2009 2012

Author
Gajpal and Abad[8] Serdan Tasan and Mituo Gen[9]

Model
VRPSPD

Method
Ant colony optimization Genetic Algorithm

VRP with Simultaneous Pick-up and Delivery

* Considering GA based approach for VRPSPD by Serdan Tasan as base

paper, objective of thesis is to develop a better heuristic method for solving the vehicle routing problem with simultaneous pick-up and delivery.

REFERENCES
[1] Dantzig, G., Fulkerson, R., & Johnson, S. (1954), Solution of a large-scale travelling salesman problem. Operations Research, 2, 393410. [2] Clarke, G., & Wright, J. W. (1964), Scheduling of vehicles from a depot to a number of delivery points. Operations Research, 12, 568581. [3] M. Solomon, (1987), Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 254265. [4] Powell, W. B. (1986), A stochastic model of the dynamic vehicle allocation problem. Transportation Science, 20(2), 117129. [5] Goetschalckx M, JacobsBlecha C. (1989), The vehicle routing problem with backhauls. European Journal of Operational Research 42: 3951 [6] Dethloff, J. (2001), Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, 23, 7996. [7] Nagy, G., & Salhi, S. (2005), Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162, 126141.

[8] Gajpal, Y., & Abad, P. (2009), An ant colony system for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research, 36, 3215 3223. [9] A. Serdar Tasan, Mitsuo Gen. (2012), A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering 62 755761. [10] Liong Choong Yean, Wan Rosmania Ismail, Kahiruddin Omar, (2008), Vehicle routing problem: Models and Solutions. Journal of Quality Measurement and Analysis, 4(1), 205-218.