Vehicle Routing Problem and Simulated Annealing

16 Pages Posted: 24 Dec 2012

See all articles by S. Rajagopalan

S. Rajagopalan

The Icfai Business School; Indian Institute of Management (IIMB), Bangalore

A. Rao

SDM Institute of Management Development

Date Written: September 30, 1993

Abstract

The Vehicle Routing Problem (VRP) is concerned with finding efficient routes for a fleet of vehicles/buses to pick up employees from pre-determined bus stops and bring them to the work place. We believe that the VRP will increase in importance as the fuel prices rise and as the extent to which an organization will subsidize the transportation decreases in the face of increased competition as a result of liberalization. In this paper, two heuristics, both based on iterative improvement of an initial solution, have been developed. One of the routines has been developed using Simulated Annealing. We compare these routines with some existing routines and the results are favorable.

Suggested Citation

Rajagopalan, S. and Rao, A., Vehicle Routing Problem and Simulated Annealing (September 30, 1993). IIM Bangalore Research Paper No. 54, Available at SSRN: https://ssrn.com/abstract=2180650 or http://dx.doi.org/10.2139/ssrn.2180650

S. Rajagopalan

The Icfai Business School ( email )

62, Nagarjuna Hill
Panjagutta
Hyderabad, TX AP 501504
India

Indian Institute of Management (IIMB), Bangalore ( email )

Bannerghatta Road
Bangalore, Karnataka 560076
India

A. Rao (Contact Author)

SDM Institute of Management Development ( email )

Mysore
India

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
149
Abstract Views
788
Rank
354,898
PlumX Metrics