IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i15p2394-d1447286.html
   My bibliography  Save this article

Stochastic Multi-Objective Multi-Trip AMR Routing Problem with Time Windows

Author

Listed:
  • Lulu Cheng

    (Faculty of Science, Kunming University of Science and Technology, Kunming 650500, China)

  • Ning Zhao

    (Faculty of Science, Kunming University of Science and Technology, Kunming 650500, China)

  • Kan Wu

    (Business Analytics Research Center, Chang Gung University, Taoyuan City 33302, Taiwan)

Abstract

In recent years, with the rapidly aging population, alleviating the pressure on medical staff has become a critical issue. To improve the work efficiency of medical staff and reduce the risk of infection, we consider the multi-trip autonomous mobile robot (AMR) routing problem in a stochastic environment. Our goal is to minimize the total expected operating cost and maximize the total service quality for patients, ensuring that each route violates the vehicle capacity and the time window with only a minimal probability. The travel time of AMRs is stochastically affected by the surrounding environment; the demand for each ward is unknown until the AMR reaches the ward, and the service time is linearly related to the actual demand. We developed a population-based tabu search algorithm (PTS) that combines the genetic algorithm with the tabu search algorithm to solve this problem. Extensive numerical experiments were conducted on the modified Solomon instances to demonstrate the efficiency of the PTS algorithm and reveal the impacts of the confidence level on the optimal solution, providing insights for decision-makers to devise delivery schemes that balance operating costs with patient satisfaction.

Suggested Citation

  • Lulu Cheng & Ning Zhao & Kan Wu, 2024. "Stochastic Multi-Objective Multi-Trip AMR Routing Problem with Time Windows," Mathematics, MDPI, vol. 12(15), pages 1-22, July.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:15:p:2394-:d:1447286
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/15/2394/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/15/2394/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Benjamin Biesinger & Bin Hu & Günther R. Raidl, 2018. "A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 52(3), pages 673-690, June.
    2. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    3. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2022. "Fleet sizing and routing of healthcare automated guided vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    4. Tan, K.C. & Cheong, C.Y. & Goh, C.K., 2007. "Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation," European Journal of Operational Research, Elsevier, vol. 177(2), pages 813-839, 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. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    2. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
    3. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
    4. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    5. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    6. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    7. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    8. Marlin W. Ulmer & Barrett W. Thomas & Dirk C. Mattfeld, 2019. "Preemptive depot returns for dynamic same-day delivery," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 327-361, December.
    9. Federica Bomboi & Christoph Buchheim & Jonas Pruente, 2022. "On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency," 4OR, Springer, vol. 20(2), pages 217-239, June.
    10. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    11. Karels, Vincent C.G. & Rei, Walter & Veelenturf, Lucas P. & Van Woensel, Tom, 2024. "A vehicle routing problem with multiple service agreements," European Journal of Operational Research, Elsevier, vol. 313(1), pages 129-145.
    12. Yi, Tao & Cheng, Xiaobin & Peng, Peng, 2022. "Two-stage optimal allocation of charging stations based on spatiotemporal complementarity and demand response: A framework based on MCS and DBPSO," Energy, Elsevier, vol. 239(PC).
    13. Maaike Hoogeboom & Yossiri Adulyasak & Wout Dullaert & Patrick Jaillet, 2021. "The Robust Vehicle Routing Problem with Time Window Assignments," Transportation Science, INFORMS, vol. 55(2), pages 395-413, March.
    14. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    15. S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam, 2014. "A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 414-446, August.
    16. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
    17. C. Y. Lam, 2021. "Optimizing logistics routings in a network perspective of supply and demand nodes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 357-377, March.
    18. van der Hagen, L. & Agatz, N.A.H. & Spliet, R. & Visser, T.R. & Kok, A.L., 2022. "Machine Learning-Based Feasibility Checks for Dynamic Time Slot Management," ERIM Report Series Research in Management ERS-2022-001-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    19. Jorge E. Mendoza & Louis-Martin Rousseau & Juan G. Villegas, 2016. "A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints," Journal of Heuristics, Springer, vol. 22(4), pages 539-566, August.
    20. Sebastián Dávila & Miguel Alfaro & Guillermo Fuertes & Manuel Vargas & Mauricio Camargo, 2021. "Vehicle Routing Problem with Deadline and Stochastic Service Times: Case of the Ice Cream Industry in Santiago City of Chile," Mathematics, MDPI, vol. 9(21), pages 1-18, 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:gam:jmathe:v:12:y:2024:i:15:p:2394-:d:1447286. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.