Skip to Main content Skip to Navigation
Journal articles

An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups

Abstract : This article addresses a new version of the biomedical sample transportation problem, as a vehicle routing problem with precedence constraints arising in the context of healthcare logistics, and proposes an iterated local search algorithm to solve it. This new version is more realistic and complex since it considers the collection centres’ opening hours and the moment at which they are visited as decision variables, granting additional flexibility to elaborate more efficient routes. Indeed, this problem is harder to model and to solve than its previous version because the constraint on the short samples’ lifetime leads to interdependency between successive pickups at each collection center. A metaheuristic is thus proposed to solve real-life instances. Numerical experiments confirm (1) the value of simultaneously planning routes, opening hours, and visit hours (which is new in the literature) and (2) the efficiency of the proposed algorithm to solve this problem.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02428594
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Monday, January 6, 2020 - 9:58:25 AM
Last modification on : Monday, July 20, 2020 - 1:06:06 PM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Ana María Anaya-Arenas, Caroline Prodhon, Jacques Renaud, Angel Ruiz. An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups. Journal of the Operational Research Society, Palgrave Macmillan, In press, pp.1-16. ⟨10.1080/01605682.2019.1657369⟩. ⟨hal-02428594⟩

Share

Metrics

Record views

43