IDEAS home Printed from https://ideas.repec.org/a/taf/tjmaxx/v9y2022i3p313-329.html
   My bibliography  Save this article

Three-stage algorithms for the large-scale dynamic vehicle routing problem with industry 4.0 approach

Author

Listed:
  • Maryam Abdirad
  • Krishna Krishnan
  • Deepak Gupta

Abstract

Companies are eager to have a smart supply chain especially when they have a dynamic system. Industry 4.0 is a concept which concentrates on mobility and real-time integration. Thus, it can be considered as a necessary component that has to be implemented for a dynamic vehicle routing problem. The aim of this research is to solve large-scale DVRP (LSDVRP) in which the delivery vehicles must serve customer demands from a common depot to minimize transit costs while not exceeding the capacity constraint of each vehicle. In LSDVRP, it is difficult to get an exact solution and the computational time complexity grows exponentially. To find near-optimal answers for this problem, a hierarchical approach consisting of three stages: “clustering, route-construction, route-improvement” is proposed. The major contribution of this paper is dealing with LSDVRP to propose the three-stage algorithm with better results. The results confirmed that the proposed methodology is applicable.

Suggested Citation

  • Maryam Abdirad & Krishna Krishnan & Deepak Gupta, 2022. "Three-stage algorithms for the large-scale dynamic vehicle routing problem with industry 4.0 approach," Journal of Management Analytics, Taylor & Francis Journals, vol. 9(3), pages 313-329, July.
    • Handle: RePEc:taf:tjmaxx:v:9:y:2022:i:3:p:313-329
    DOI: 10.1080/23270012.2022.2113161
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/23270012.2022.2113161
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/23270012.2022.2113161?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjmaxx:v:9:y:2022:i:3:p:313-329. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjma .

    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.