IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v42y2021i4d10.1007_s10878-019-00506-x.html
   My bibliography  Save this article

Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode

Author

Listed:
  • Gengjun Gao

    (Shanghai Maritime University)

  • Yuxuan Che

    (Shanghai Maritime University)

  • Jian Shen

    (Shanghai General Hospital)

Abstract

The distribution of medical consumables inside the hospital is an important part of the daily operation of the hospital, which directly affects the operating efficiency of the entire hospital. Under the hospital SPD supply chain mode, the medical medicinal materials distribution nodes of various departments, pharmacies and warehouses of the hospital constitute the logistics distribution network of SPD central warehouse-secondary warehouse-consumption point. Considering the influence of time, distance and carrying vehicle on the distribution route of medical consumables in the hospital, the optimal distribution model of medical consumables under the hospital SPD supply chain mode was established with the minimum distribution cost of the hospital. The corresponding GA is designed and solved by MATLAB programming software. According to the established path optimization model, the distribution path optimization of medical consumables in a hospital in Shanghai is realized. The results show that the model is in line with the actual needs of the hospital; the algorithm is validated and the convergence speed is fast; compared with the traditional distribution path of medical consumables in the hospital, It is found that the optimized hospital medical consumables joint distribution path reduces logistics costs and improves the efficiency of distribution services. This article optimizes the joint distribution route of medical consumables in hospitals, promotes the organic combination of hospital SPD supply chain model and hospital operation structure, and promotes the modernization process of Chinese hospitals.

Suggested Citation

  • Gengjun Gao & Yuxuan Che & Jian Shen, 2021. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 866-883, November.
  • Handle: RePEc:spr:jcomop:v:42:y:2021:i:4:d:10.1007_s10878-019-00506-x
    DOI: 10.1007/s10878-019-00506-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00506-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-019-00506-x?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.

    References listed on IDEAS

    as
    1. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2019. "Two-stage medical supply chain scheduling with an assignable common due window and shelf life," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 319-329, January.
    2. Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang, 2015. "Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 938-948, November.
    3. Haiyan Lu & Enyu Yao & Liqun Qi, 2006. "Some further results on minimum distribution cost flow problems," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 351-371, June.
    4. Jing Fan & Xiwen Lu, 2015. "Supply chain scheduling problem in the hospital with periodic working time on a single machine," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 892-905, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gengjun Gao & Yuxuan Che & Jian Shen, 0. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    2. Huidan Lin & Qun Li & Xueguo Xu & Ying Zhang, 2021. "Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 848-865, November.
    3. Huidan Lin & Qun Li & Xueguo Xu & Ying Zhang, 0. "Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    4. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2019. "Two-stage medical supply chain scheduling with an assignable common due window and shelf life," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 319-329, January.
    5. Gang Du & Luyao Zheng & Xiaoling Ouyang, 2019. "Real-time scheduling optimization considering the unexpected events in home health care," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 196-220, January.
    6. Zhiguo Wang & Lufei Huang & Cici Xiao He, 2021. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 785-812, November.
    7. J. Behnamian & Z. Gharabaghli, 2023. "Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-35, March.
    8. Jing Fan & Hui Shi, 0. "A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    9. Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
    10. Prahalad Venkateshan & Kamlesh Mathur & Ronald H. Ballou, 2008. "An efficient generalized network-simplex-based algorithm for manufacturing network flows," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 315-341, May.
    11. Zhiguo Wang & Lufei Huang & Cici Xiao He, 0. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-28.
    12. Wenhua Li & Xing Chai, 2019. "The medical laboratory scheduling for weighted flow-time," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 83-94, January.
    13. Lu Liu & Chun Wang & Jianjun Wang, 2019. "A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 405-417, January.
    14. Jing Fan & Hui Shi, 2022. "Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1645-1654, July.
    15. Long Zhang & Yuzhong Zhang & Qingguo Bai, 0. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    16. Jing Fan & Hui Shi, 2021. "A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 896-908, November.
    17. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.
    18. He Huang & Wei Gao & Chunming Ye, 2021. "An intelligent data-driven model for disease diagnosis based on machine learning theory," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 884-895, November.
    19. Bowen Jiang & Jiafu Tang & Chongjun Yan, 2019. "A comparison of fixed and variable capacity-addition policies for outpatient capacity allocation," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 150-182, January.
    20. He Huang & Wei Gao & Chunming Ye, 0. "An intelligent data-driven model for disease diagnosis based on machine learning theory," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.

    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:spr:jcomop:v:42:y:2021:i:4:d:10.1007_s10878-019-00506-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.