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.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Inventory Routing Problem


    Subtitle :

    Routing and Scheduling Approach with the Objective of Slack Maximization


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:
    Yang, Xianfeng (author) / Feng, Lei (author)


    Publication date :

    2013-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    The Inventory Routing Problem: A Review

    Cao, Jinxin / Gao, Jiachen / Li, Bing et al. | TIBKAT | 2020


    Pollution-Inventory Routing Problem with Perishable Goods

    Al Shamsi, Ahmed / Al Raisi, Ammar / Aftab, Muhammad | Springer Verlag | 2014


    Dynamic-stochastic vehicle routing and inventory problem

    Maqueo, Rodrigo Rubio | DSpace@MIT | 1995

    Free access

    A stochastic inventory routing problem with stock-out

    Bertazzi, Luca | Online Contents | 2013