Highlights Model simultaneously identifies number of bloodmobiles and shortens distance. Considers uncertain blood potentials and variable durations in mobile stops. Branch-and-price algorithm optimally solves problem up to 30 donation locations. Bloodmobiles travel longer distances when inventory costs are considered.

    Abstract Every day, a blood center must determine a set of locations among a group of potential sites to route their vehicles for blood collection so as to avoid shortfalls. In this study, a vehicle routing problem is modeled using an integer programming approach to simultaneously identify number of bloodmobiles to operate and minimize the distance travelled. Additionally, the model is extended to incorporate uncertainty in blood potentials and variable durations in bloodmobile visits. Optimal routings are determined using CPLEX solver and branch-and-price algorithm. Results show that proposed algorithm solve the problem to optimality up to 30 locations within 3600s.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An integer programming approach to the bloodmobile routing problem


    Beteiligte:


    Erscheinungsdatum :

    2015-12-10


    Format / Umfang :

    22 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Truck routing cut and fill problem in roadworks using integer programming

    Viviane Adriano Falcão / Ernesto Ferreira Nobre Júnior / Bruno de Athayde Prata | DOAJ | 2020

    Freier Zugriff


    Integer Fuzzy Programming Approach in Bi-objective Selective Maintenance Allocation Problem

    Ali, I. / Hasan, S. S. | British Library Online Contents | 2014


    An Integer Programming Based Approach to Delivery Drone Routing under Load-Dependent Flight Speed

    Mao Nishira / Satoshi Ito / Hiroki Nishikawa et al. | DOAJ | 2023

    Freier Zugriff