Finding the shortest travelling distance based on various situations might assist travelers in making a better selection of route decisions. The main goal of this paper is to solve the routing problem for the company’s fleet vehicle (XpressBees) in order to find the best route under various constraints such as Signalized Intersections, Vehicle Capacity, Customer Demands, and Time Windows in order to reduce transportation costs by using real data. TSP and VRP and their variants are common problems for logistics companies that handle commodities transportation. In addition, for signalised intersections, the Highway Capacity Manual is used, and for truck optimization, the Product Loading Algorithm is used. As a result, there are various algorithms that provide a solution to this problem, such as the Branch and Bound Penalty Method, Dijikstra’s Algorithm, Dynamic Programming, Clarke and Wright savings algorithm and Holmes and Parker Heuristic. These algorithm returns the best option, which is the cheapest route.


    Access

    Download


    Export, share and cite



    Title :

    Solving XpressBees Logistics Problem by Using Exact and Heuristic Method


    Contributors:


    Publication date :

    2022




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Exact and heuristic static routing algorithms for improving online grocery shopping logistics

    Cepolina, Francesco / Cepolina, Elvezia Maria / Ferla, Guido | TIBKAT | 2021

    Free access

    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Free access


    A Model and Heuristic Algorithm for Inventory Routing Problem in Emergency Logistics

    Xie, B. / Hu, X. | British Library Conference Proceedings | 2009