IDEAS home Printed from https://ideas.repec.org/a/vrs/logitl/v13y2022i1p37-48n4.html
   My bibliography  Save this article

Solving XpressBees Logistics Problem by Using Exact and Heuristic Method

Author

Listed:
  • Malhotra Swati
  • Khandelwal Mitali

    (Delhi Technological University, Department of Applied Mathematics, Delhi, India)

Abstract

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.

Suggested Citation

  • Malhotra Swati & Khandelwal Mitali, 2022. "Solving XpressBees Logistics Problem by Using Exact and Heuristic Method," LOGI – Scientific Journal on Transport and Logistics, Sciendo, vol. 13(1), pages 37-48, January.
    • Handle: RePEc:vrs:logitl:v:13:y:2022:i:1:p:37-48:n:4
    DOI: 10.2478/logi-2022-0004
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/logi-2022-0004
    Download Restriction: no
    File URL: https://libkey.io/10.2478/logi-2022-0004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vrs:logitl:v:13:y:2022:i:1:p:37-48:n:4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.