This paper extends the study of the inventory routing problem with slack maximization (IRPSM), which addresses the distribution of relief supplies in response to a sudden emergency. Compared with the classical routing problem, the objective of IRPSM is to maximize the slack in inventory, defined as the difference between the arrival time of new deliveries and the estimated time that the inventory will run out, rather than to minimize the total cost of delivery. Previous researchers have proposed a two-stage (scheduling and routing) solution framework, which was proved to be efficient to solve this problem. On the basis of this two-stage framework, this study developed an initial heuristic at the routing stage. With full realization of the limitations of the initial heuristic, an improved heuristic was proposed to prevent trapping of the solution at a local optimal condition. Compared with several existing solution algorithms, the results of a case study showed the effectiveness of the proposed heuristics.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Inventory Routing Problem


    Untertitel :

    Routing and Scheduling Approach with the Objective of Slack Maximization


    Weitere Titelangaben:

    Transportation Research Record


    Beteiligte:
    Yang, Xianfeng (Autor:in) / Feng, Lei (Autor:in)


    Erscheinungsdatum :

    2013-01-01




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Dynamic-stochastic vehicle routing and inventory problem

    Maqueo, Rodrigo Rubio | DSpace@MIT | 1995

    Freier Zugriff

    Robust Optimization for a Maritime Inventory Routing Problem

    Agra, Agostinho / Christiansen, Marielle / Hvattum, Lars Magnus et al. | British Library Online Contents | 2018



    A stochastic inventory routing problem with stock-out

    Bertazzi, Luca / Bosco, Adamo / Guerriero, Francesca et al. | Elsevier | 2011


    A Decomposition Approach for the Inventory-Routing Problem

    Campbell, Ann Melissa | Online Contents | 2004