Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare
From MaRDI portal
Publication:2676325
DOI10.1016/j.cor.2022.105921OpenAlexW4283072268WikidataQ113877477 ScholiaQ113877477MaRDI QIDQ2676325
Mario Benini, Paolo Detti, Garazi Zabalo Manrique de Lara
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105921
healthcaretransfersmixed integer linear programmingvehicle routing problemadaptive large neighborhood searchlifetime constraints
Cites Work
- Selective vehicle routing for a mobile blood donation system
- A general heuristic for vehicle routing problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A MILP model for biological sample transportation in healthcare
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Survey on blood supply chain management: models and methods
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
- Variable neighborhood search for the dial-a-ride problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- The Pickup And Delivery Problem With Time Windows And Transshipment
This page was built for publication: Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare