IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v317y2024i2p468-486.html
   My bibliography  Save this article

Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem

Author

Listed:
  • Arda, Yasemin
  • Cattaruzza, Diego
  • François, Véronique
  • Ogier, Maxime

Abstract

Home chemotherapy systems allow the administration of cancer treatments at a patient’s residence, avoiding an admission to inpatient care facilities. This innovative health care model is interesting both economically and on a human level. It also raises several logistical challenges. This paper focuses on one of the optimization problems arising in the context of home chemotherapy services, where a complex scheduling problem underlies the operational planning process. Indeed, some injectable chemotherapy drugs may remain stable only during a few hours after being produced. Consequently, their production has to be carefully scheduled jointly with their administration, which takes place at the patients homes during a predefined time window. This gives rise to an integrated production scheduling and vehicle routing problem, that we address using a large neighborhood search approach. Production and administration sequences are iteratively modified, while a linear program is used to determine optimal production and administration start times for the candidate sequences. We analyze the impact of the linear program and establish that it is a crucial component of the proposed method. We assess the performance of the proposed method by comparing its solutions with those obtained through a compact mathematical formulation. We then provide insights about the cost of taking into consideration time-related aspects of the problem, i.e., integrated planning horizons, drug stability times, and administration time windows.

Suggested Citation

  • Arda, Yasemin & Cattaruzza, Diego & François, Véronique & Ogier, Maxime, 2024. "Home chemotherapy delivery: An integrated production scheduling and multi-trip vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 317(2), pages 468-486.
  • Handle: RePEc:eee:ejores:v:317:y:2024:i:2:p:468-486
    DOI: 10.1016/j.ejor.2024.03.039
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724002595
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.03.039?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. Zhi-Long Chen & George L. Vairaktarakis, 2005. "Integrated Scheduling of Production and Distribution Operations," Management Science, INFORMS, vol. 51(4), pages 614-628, April.
    2. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.
    3. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    4. Lee, Jongsung & Kim, Byung-In & Johnson, Andrew L. & Lee, Kiho, 2014. "The nuclear medicine production and delivery problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 461-472.
    5. Christian Viergutz & Sigrid Knust, 2014. "Integrated production and distribution scheduling with lifespan constraints," Annals of Operations Research, Springer, vol. 213(1), pages 293-318, February.
    6. Braekers, Kris & Hartl, Richard F. & Parragh, Sophie N. & Tricoire, Fabien, 2016. "A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience," European Journal of Operational Research, Elsevier, vol. 248(2), pages 428-443.
    7. François, Véronique & Arda, Yasemin & Crama, Yves & Laporte, Gilbert, 2016. "Large neighborhood search for multi-trip vehicle routing," European Journal of Operational Research, Elsevier, vol. 255(2), pages 422-441.
    8. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates," Transportation Science, INFORMS, vol. 50(2), pages 676-693, May.
    9. Rasmussen, Matias Sevel & Justesen, Tor & Dohn, Anders & Larsen, Jesper, 2012. "The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies," European Journal of Operational Research, Elsevier, vol. 219(3), pages 598-610.
    10. Devapriya, Priyantha & Ferrell, William & Geismar, Neil, 2017. "Integrated production and distribution scheduling with a perishable product," European Journal of Operational Research, Elsevier, vol. 259(3), pages 906-916.
    11. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    12. Alexis Robbes & Yannick Kergosien & Virginie André & Jean-Charles Billaut, 2022. "Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 785-820, September.
    13. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    14. H. Neil Geismar & Gilbert Laporte & Lei Lei & Chelliah Sriskandarajah, 2008. "The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 21-33, February.
    15. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    16. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    17. Kergosien, Y. & Gendreau, M. & Billaut, J.-C., 2017. "A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints," European Journal of Operational Research, Elsevier, vol. 262(1), pages 287-298.
    18. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    19. İsmail Karaoğlan & Saadettin Erhan Kesen, 2017. "The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 536-557, January.
    20. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    21. Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot, 2018. "Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product," International Journal of Production Research, Taylor & Francis Journals, vol. 56(12), pages 4313-4336, June.
    22. Ronald Armstrong & Su Gao & Lei Lei, 2008. "A zero-inventory production and distribution problem with a fixed customer sequence," Annals of Operations Research, Springer, vol. 159(1), pages 395-414, March.
    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. Ling Liu & Sen Liu, 2020. "Integrated Production and Distribution Problem of Perishable Products with a Minimum Total Order Weighted Delivery Time," Mathematics, MDPI, vol. 8(2), pages 1-18, January.
    2. Berghman, Lotte & Kergosien, Yannick & Billaut, Jean-Charles, 2023. "A review on integrated scheduling and outbound vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 1-23.
    3. Alexis Robbes & Yannick Kergosien & Virginie André & Jean-Charles Billaut, 2022. "Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 785-820, September.
    4. Martha-Selene Casas-Ramírez & José-Fernando Camacho-Vallejo & Rosa G. González-Ramírez & José-Antonio Marmolejo-Saucedo & José-Manuel Velarde-Cantú, 2018. "Optimizing a Biobjective Production-Distribution Planning Problem Using a GRASP," Complexity, Hindawi, vol. 2018, pages 1-13, February.
    5. Ling Liu & Wenli Li & Kunpeng Li & Xuxia Zou, 2020. "A coordinated production and transportation scheduling problem with minimum sum of order delivery times," Journal of Heuristics, Springer, vol. 26(1), pages 33-58, February.
    6. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    7. Wang, Yu & Ropke, Stefan & Wen, Min & Bergh, Simon, 2023. "The mobile production vehicle routing problem: Using 3D printing in last mile distribution," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1407-1423.
    8. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    9. Kergosien, Y. & Gendreau, M. & Billaut, J.-C., 2017. "A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints," European Journal of Operational Research, Elsevier, vol. 262(1), pages 287-298.
    10. Iman Dayarian & Guy Desaulniers, 2019. "A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products," Transportation Science, INFORMS, vol. 53(3), pages 829-849, May.
    11. Guo, Zhaoxia & Shi, Leyuan & Chen, Longchao & Liang, Yong, 2017. "A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing," Omega, Elsevier, vol. 66(PB), pages 327-343.
    12. Mohammadi, S. & Al-e-Hashem, S.M.J. Mirzapour & Rekik, Y., 2020. "An integrated production scheduling and delivery route planning with multi-purpose machines: A case study from a furniture manufacturing company," International Journal of Production Economics, Elsevier, vol. 219(C), pages 347-359.
    13. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    14. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    15. Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut, 2017. "Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence," Journal of Scheduling, Springer, vol. 20(6), pages 681-693, December.
    16. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    17. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    18. Feng Li & Zhou Xu & Zhi-Long Chen, 2020. "Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1012-1029, October.
    19. Daniel Schubert & André Scholz & Gerhard Wäscher, 2017. "Integrated Order Picking and Vehicle Routing with Due Dates," FEMM Working Papers 170007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    20. Daniel Schubert & André Scholz & Gerhard Wäscher, 2018. "Integrated order picking and vehicle routing with due dates," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1109-1139, October.

    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:eee:ejores:v:317:y:2024:i:2:p:468-486. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.