2021
DOI: 10.1080/23249935.2021.1916644
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 rou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(2 citation statements)
references
References 40 publications
0
2
0
Order By: Relevance
“…Furthermore, they introduced an NSGA-II algorithm enhanced with directed local search to effectively solve this model. Cheng et al, [5] presented a model in their study that aims to minimize both the cost and the duration of natural disaster debris cleanup. The researchers carefully considered utilizing temporary sites for debris management to achieve this goal.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Furthermore, they introduced an NSGA-II algorithm enhanced with directed local search to effectively solve this model. Cheng et al, [5] presented a model in their study that aims to minimize both the cost and the duration of natural disaster debris cleanup. The researchers carefully considered utilizing temporary sites for debris management to achieve this goal.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This section provides an analysis on the corresponding algorithm, which solves the above proposed bi-level decision model based on goal programming. A hybrid genetic algorithm (HGA) embedded with the method of successive average (MSA) is given based on the characteristic of proposed model [50,[52][53][54][55][56].…”
Section: Solving Algorithmmentioning
confidence: 99%