Waste clean-up after a disaster is one of the most critical tasks in the response stage of disaster management. We develop a model to minimise the cost and duration of disaster waste clean-up considering using Temporary Disaster Waste Management Sites (TDWMSs), which can store and process waste before it is sent to the final disposal sites. The problem that arises can be seen as a Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) in which the main decisions are the location of the TDWMSs and the routing of vehicles in both echelons. In this paper, we propose both a mixed-integer program and a Genetic Algorithm (GA) to model and solve the problem. Computational tests indicate: (i) the performance of proposed GA is robust; (ii) the use of TDWMSs can reduce both total waste clean-up cost and duration; and (iii) the capacities of TDWMSs have a significant impact on the total waste clean-up time and duration.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-period two-echelon location routing problem for disaster waste clean-up


    Contributors:

    Published in:

    Publication date :

    2022-12-02


    Size :

    31 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Two Echelon Vehicle Routing Problem for Disaster Mapping Process Using Cooperated Vehicles Assignment

    Perwira Redi, A. A. N. / Sekaringtyas, Nandini N. / Astiana, Handina B. et al. | Springer Verlag | 2023



    Two-Echelon Location-Routing Problem with Time Windows and Transportation Resource Sharing

    Yong Wang / Yaoyao Sun / Xiangyang Guan et al. | DOAJ | 2021

    Free access

    Multi-start heuristics for the Two-Echelon Vehicle Routing Problem

    T. G. Crainic / MANCINI, SIMONA / PERBOLI, Guido et al. | BASE | 2011

    Free access