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 3600 s.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An integer programming approach to the bloodmobile routing problem



    Erschienen in:

    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    BKL:    85.00 / 55.82 Güterverkehr



    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 Linear Programming Formulations for the Fleet Quickest Routing Problem on Grids

    Carla De Francesco / Luigi De Giovanni | BASE | 2022

    Freier Zugriff


    An Integer Programming Approach to the Hospitals/Residents Problem with Ties

    Kwanashie, A. / Manlove, D.F. / Gesellschaft fur Operations Research; Dutch Society of Operations Research; Erasmus Universiteit Rotterdam | British Library Conference Proceedings | 2014


    A novel mixed-integer programming approach for the aircraft landing problem

    Sergejs Rogovs / Viktoriya Nikitina / Matthias Gerdts | DOAJ | 2022

    Freier Zugriff