IDEAS home Printed from https://ideas.repec.org/a/kap/hcarem/v22y2019i2d10.1007_s10729-018-9438-6.html
   My bibliography  Save this article

Design of shared unit-dose drug distribution network using multi-level particle swarm optimization

Author

Listed:
  • Linjie Chen

    (University of Saint-Etienne, University of Lyon)

  • Thibaud Monteiro

    (University of Lyon)

  • Tao Wang

    (University of Lyon
    Central University of Finance and Economics)

  • Eric Marcon

    (University of Lyon)

Abstract

Unit-dose drug distribution systems provide optimal choices in terms of medication security and efficiency for organizing the drug-use process in large hospitals. As small hospitals have to share such automatic systems for economic reasons, the structure of their logistic organization becomes a very sensitive issue. In the research reported here, we develop a generalized multi-level optimization method – multi-level particle swarm optimization (MLPSO) – to design a shared unit-dose drug distribution network. Structurally, the problem studied can be considered as a type of capacitated location-routing problem (CLRP) with new constraints related to specific production planning. This kind of problem implies that a multi-level optimization should be performed in order to minimize logistic operating costs. Our results show that with the proposed algorithm, a more suitable modeling framework, as well as computational time savings and better optimization performance are obtained than that reported in the literature on this subject.

Suggested Citation

  • Linjie Chen & Thibaud Monteiro & Tao Wang & Eric Marcon, 2019. "Design of shared unit-dose drug distribution network using multi-level particle swarm optimization," Health Care Management Science, Springer, vol. 22(2), pages 304-317, June.
    • Handle: RePEc:kap:hcarem:v:22:y:2019:i:2:d:10.1007_s10729-018-9438-6
    DOI: 10.1007/s10729-018-9438-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10729-018-9438-6
    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/s10729-018-9438-6?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. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    2. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    3. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    4. Salhi, Said & Rand, Graham K., 1989. "The effect of ignoring routes when locating depots," European Journal of Operational Research, Elsevier, vol. 39(2), pages 150-156, March.
    5. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    6. Srivastava, R, 1993. "Alternate solution procedures for the location-routing problem," Omega, Elsevier, vol. 21(4), pages 497-506, July.
    7. Dhaenens-Flipo, Clarisse, 2000. "Spatial decomposition for a multi-facility production and distribution problem," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 177-186, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Giuseppe Guido & Sina Shaffiee Haghshenas & Sami Shaffiee Haghshenas & Alessandro Vitale & Vittorio Astarita & Ashkan Shafiee Haghshenas, 2020. "Feasibility of Stochastic Models for Evaluation of Potential Factors for Safety: A Case Study in Southern Italy," Sustainability, MDPI, vol. 12(18), pages 1-24, September.

    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. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    2. Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
    3. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    4. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    6. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    7. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    8. Michael Schneider & Maximilian Löffler, 2019. "Large Composite Neighborhoods for the Capacitated Location-Routing Problem," Service Science, INFORMS, vol. 53(1), pages 301-318, February.
    9. M. Tadaros & A. Migdalas, 2022. "Bi- and multi-objective location routing problems: classification and literature review," Operational Research, Springer, vol. 22(5), pages 4641-4683, November.
    10. Lihua Liu & Lai Soon Lee & Hsin-Vonn Seow & Chuei Yee Chen, 2022. "Logistics Center Location-Inventory-Routing Problem Optimization: A Systematic Review Using PRISMA Method," Sustainability, MDPI, vol. 14(23), pages 1-39, November.
    11. Caunhye, Aakil M. & Zhang, Yidong & Li, Mingzhe & Nie, Xiaofeng, 2016. "A location-routing model for prepositioning and distributing emergency supplies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 90(C), pages 161-176.
    12. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    13. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    14. Bagheri Hosseini, Mozhde & Dehghanian, Farzad & Salari, Majid, 2019. "Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network," European Journal of Operational Research, Elsevier, vol. 272(2), pages 655-673.
    15. Lin Zhou & Xu Wang & Lin Ni & Yun Lin, 2016. "Location-Routing Problem with Simultaneous Home Delivery and Customer’s Pickup for City Distribution of Online Shopping Purchases," Sustainability, MDPI, vol. 8(8), pages 1-20, August.
    16. Nadizadeh, Ali & Hosseini Nasab, Hasan, 2014. "Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 458-470.
    17. Cai, Lei & Li, Jiliu & Wang, Kai & Luo, Zhixing & Qin, Hu, 2025. "Optimal allocation and route design for station-based drone inspection of large-scale facilities," Omega, Elsevier, vol. 130(C).
    18. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    19. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    20. Tran, Trung Hieu & Nguyen, Thu Ba T. & Le, Hoa Sen T. & Phung, Duc Chinh, 2024. "Formulation and solution technique for agricultural waste collection and transport network design," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1152-1169.

    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:kap:hcarem:v:22:y:2019:i:2:d:10.1007_s10729-018-9438-6. 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.