IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/4526641.html
   My bibliography  Save this article

Providing a Mathematical Routing-Inventory Model for the Drug Supply Chain Considering the Travel Time Dependence and Perishability on Multiple Graphs

Author

Listed:
  • Madad Ali
  • Martha Ng
  • Rui Dias
  • Iskandar Muda
  • Riyadh Al-Obaidi
  • Barno Abdullaeva
  • Himanshu Sharma
  • Hussein Mohammed Esmail Abu Al-Rejal
  • Ali Thaeer Hammid
  • Reza Lotfi

Abstract

High turnover in the pharmaceutical industry, the location of placebos in urban spaces, and the high rate of corruption of products in this industry are the distinguishing features of the drug supply chain. Thus, to survive and maintain competitive advantages in the current business environment, managers are active in this background to implement the theoretical foundations of supply chain management. One of the influential areas in this category is integrated inventory management, inventory control, and vehicle routing. Therefore, this study mainly aims to analyze and define a routing problem, inventory in the drug supply chain with perishable products, and travel time dependence on multiple graphs with travel time dependence. The Box–Jenkins forecasting method has been utilized to meet the study’s aim and deal with demand uncertainty. This method can identify the best pattern governing the data. Finally, the mathematical model is validated, and managerial perspectives are provided. The study results demonstrated the possibility of achieving cost-saving and reducing product spoilage. Applying the solutions of this model can provide some inherent social and environmental advantages, including reducing traffic load and emissions.

Suggested Citation

  • Madad Ali & Martha Ng & Rui Dias & Iskandar Muda & Riyadh Al-Obaidi & Barno Abdullaeva & Himanshu Sharma & Hussein Mohammed Esmail Abu Al-Rejal & Ali Thaeer Hammid & Reza Lotfi, 2022. "Providing a Mathematical Routing-Inventory Model for the Drug Supply Chain Considering the Travel Time Dependence and Perishability on Multiple Graphs," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-11, September.
  • Handle: RePEc:hin:jnddns:4526641
    DOI: 10.1155/2022/4526641
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2022/4526641.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2022/4526641.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/4526641?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
    ---><---

    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:hin:jnddns:4526641. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.