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

2019 ◽  
Vol 11 (12) ◽  
pp. 3420 ◽  
Author(s):  
Changshi Liu ◽  
Gang Kou ◽  
Yi Peng ◽  
Fawaz E. Alsaadi
Keyword(s):  
Lexicographic Order ◽  
Optimal Method ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Maximum Loss ◽  
Location Routing ◽  
Demand Node ◽  
Relief Distribution ◽  
Disaster Severity ◽  
Time Required

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 maximum loss of demand node, (2) the total loss of demand node, and (3) the maximum time required for the demand node to receive relief. A hybrid heuristic algorithm was proposed to solve the model. Finally, the utility and fairness of the model and algorithm were demonstrated by a case study during the first day after the great Wenchuan earthquake in China.

An integrated location-routing problem with post-disaster relief distribution

2020 ◽  
Vol 147 ◽  
pp. 106632
Author(s):  
Xiaowen Wei ◽  
Huaxin Qiu ◽  
Dujuan Wang ◽  
Jiahui Duan ◽  
Yanzhang Wang ◽  
...  
Keyword(s):  
Disaster Relief ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Relief Distribution ◽  
Post Disaster

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

scholarly journals Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 45
Author(s):  
Rafael D. Tordecilla ◽  
Pedro J. Copado-Méndez ◽  
Javier Panadero ◽  
Carlos L. Quintero-Araujo ◽  
Jairo R. Montoya-Torres ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Local Search ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Iterated Local Search ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Fuzzy Pattern ◽  
Reasonable Computing

The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.

Multiobjective location-routing problem of relief commodities with reliability

2021 ◽  
Author(s):  
Hossein Beiki ◽  
Seyed M. Seyedhosseini ◽  
Leonardus W. W. Mihardjo ◽  
Seyed M. Seyedaliakbar
Keyword(s):  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

scholarly journals A review on the electric vehicle routing problems: Variants and algorithms

2021 ◽  
Author(s):  
Hu Qin ◽  
Xinxin Su ◽  
Teng Ren ◽  
Zhixing Luo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Location Routing Problem ◽  
Routing Problems ◽  
Routing Problem ◽  
Delivery Problem ◽  
Pickup And Delivery Problem ◽  
The Past ◽  
Location Routing ◽  
Comprehensive Survey

AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.

Sign in / Sign up

Export Citation Format

Share Document