2019
DOI: 10.3390/su11123420
|View full text |Cite
|
Sign up to set email alerts
|

Location-Routing Problem for Relief Distribution in the Early Post-Earthquake Stage from the Perspective of Fairness

Abstract: To address the shortage of relief in disaster areas during the early stages after an earthquake, a location-routing problem (LRP) was studied from the perspective of fairness. A multi-objective model for the fair LRP was developed by lexicographic order object optimal method in consideration of the urgent window constraints, partial road damage, multimodal relief delivery, disaster severity, and vulnerability of each demand node when its demand is not satisfied. The goals of this model are to minimize (1) the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
34
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(34 citation statements)
references
References 46 publications
0
34
0
Order By: Relevance
“…Table 3 shows the information about the test instances which includes the number of nodes and the capacity of vehicles. The related parameters are set according to the literature [37,48,49], as shown in Table 4. In this study, the traditional PSO algorithm is compared with the proposed PSOSA algorithm.…”
Section: Algorithm Experimentsmentioning
confidence: 99%
“…Table 3 shows the information about the test instances which includes the number of nodes and the capacity of vehicles. The related parameters are set according to the literature [37,48,49], as shown in Table 4. In this study, the traditional PSO algorithm is compared with the proposed PSOSA algorithm.…”
Section: Algorithm Experimentsmentioning
confidence: 99%
“…In later research, LAP and VRP started to be integrated as a complex combinatorial optimization problem called LRP. There are various exact methods, approximation algorithms and heuristic algorithms proposed to solve LRP [12], such as the branch-and-price method [13], the Lagrangian Relaxation-Granular Tabu Search (LRGTS) algorithm [14], the Multiple Ant Colony Optimization (MACO) algorithm [15], the Non-dominated Sorting Genetic Algorithm II (NSGA-II) [16], the Particle Swarm Optimization (PSO) algorithm [17], the integrated Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO) [18] and etc.…”
Section: Literature Reviewmentioning
confidence: 99%
“…It is obviously better than that of the standard colony algorithm (3840.55). In order to demonstrate the superiority of this method, intelligent algorithm (this work), Multiple Ant Colony Optimization Algorithm (MACOA) [65] and Non-dominated Sorting Genetic Algorithm (NSGA) [66] are selected in this paper to solve the problem respectively. We assumed the number of iterations as 100 times.…”
Section: Effectiveness Analysis Of Iacats Algorithmmentioning
confidence: 99%