SOLVING XPRESSBEES LOGISTICS PROBLEM USING EXACT AND HEURISTIC METHOD

Abstract

Finding a route with shortest distance travelled according to various conditions can help travellers to make better route choice decisions.The main purpose of this paper is to solve the routing problem for the company(Xpressbees) fleet vehicle in order to find the optimal route subject to various constraints such that the transportation cost is improved using real data. It applies the following methodology.First it gives a brief introduction to the formula tion of our problem then it characterizes into process of delivering products in a logistic company. As a result, it identifies the principal scientific challenges that need to be ad dressed other than finding shortest distance like time dependency , traffic conditions and various constraints like vehicle capacity and customer demands. This paper includes exact and heuristic methods to find optimal solution. In the initial part the branch and bound penalty exact method is used after that it includes Dijkstra’s algorithm with signalized intersections. In this part,It includes the lost time occur at the intersections of the different signals calculated using Highway Capacity Manual. After that this paper incorporates three scenarios Truck Route Optimization , Last Mile Delivery and Hyper Local Delivery and in all of the scenarios the heuristic approach is used. In Truck Route optimization dynamic programming is used using backward recursion approach. In Last Mile Delivery vehicle routing problem with capacity con straint(VRPC) is used which is solved using clarks and wright saving based algorithm and in then hyperlocal delivery the vehicle routing problem with capacity and time win dows(VRPCTW) constraint is used which is solved using Holmes and Parker heuristic method.In the last we can also observed that Holmes and Parker heuristic is better than clarks and wright saving based algorithm and gives better solution.