Investigations on linear sweep algorithm for solving vehicle routing problem with simultaneous pickup and delivery between two depots

Abstract

Logistics appears as an imperative constituent of supply chainmanagement that combines roles similar to planning, purchasing, marketingand distribution along with manufacturing. Planning of logistics participatesas a central function in supply chain. Efficient planning starts with planningof routes which is carried out by Vehicle Routing Problem (VRP). Efficientrouting and effective utilization of vehicle capacity are crucial for logisticsefficiency. VRP plays fundamental function in planning of distributionsystems and logistics in several areas for instance, delivery of mails, goodsdistribution, garbage collection, school bus routing, task scheduling, freightforwarding operations, private travel operations between major cities, etc.In this study, vehicle routing for a private logistic serviceprovider with regular freight forwarding operations within Tamilnadu state of India has been taken up. The model is also applicable for a private travelservice provider serving passengers travelling between two major cities. Theobjectives of this research work are (i) To minimize the number of vehicles,(ii) To minimize the total distance travelled by the vehicles and hence thecost of travel, and (iii) To maximize the capacity utilization of the vehicles. newline