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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An integer programming approach to the bloodmobile routing problem




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    An integer programming approach to the bloodmobile routing problem

    Gunpinar, Serkan / Centeno, Grisselle | Elsevier | 2015


    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

    Free access

    Alternative mixed-integer linear programming models of a maritime inventory routing problem

    Jiang, Yongheng / Grossmann, Ignacio E. | Tema Archive | 2015


    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

    Free access