Title: Heuristic for solving routing problem in Supply Chain Management
Authors: M. Rajmohan, P. Shahabudeen
Addresses: Department of Industrial Engineering, College of Engineering, Guindy, Anna University, Chennai, Tamil Nadu, India. ' Department of Industrial Engineering, College of Engineering, Guindy, Anna University, Chennai, Tamil Nadu, India
Abstract: Transportation costs constitute a significant fraction of total logistics cost in Supply Chain Management (SCM). To reduce transportation costs and to improve customer service, the optimal selection of the vehicle route is a frequent decision problem and this is commonly known as Vehicle Routing Problem (VRP). Vehicle Routing Problem with Time Windows (VRPTW) is an important variant of VRP and also a practical problem in real-world applications. Since VRPTW belongs to NP hard problem, development of heuristics is a prime concern. In this paper, an ant colony based heuristic is developed to solve VRPTW. The heuristic is tested with benchmark instances and provides improved solutions.
Keywords: vehicle routing problem; VRP; time windows; logistics; supply chain management; SCM; ant colony optimisation; ACO.
International Journal of Applied Decision Sciences, 2008 Vol.1 No.2, pp.153 - 178
Published online: 16 Sep 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article