A time-dependent location-routing problem of hazardous material transportation with edge unavailability and time window

2021 ◽  
Vol 322 ◽  
pp. 128951
Author(s):  
Saeed Tasouji Hassanpour ◽  
Ginger Y. Ke ◽  
David M. Tulett
Keyword(s):  
Time Window ◽  
Time Dependent ◽  
Hazardous Material ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Hazardous Material Transportation ◽  
Material Transportation

scholarly journals Developing a Chaotic-Simulation Based Model for Ranking High Selected Network Links in Hazardous Material Transportation

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Abbas Mahmoudabadi
Keyword(s):  
Road Safety ◽  
Road Network ◽  
Hazardous Material ◽  
Routing Problem ◽  
Hazardous Material Transportation ◽  
Wide Range ◽  
Simulation Based ◽  
Material Transportation ◽  
General Transport ◽  
The Mathematical Model

Hazardous material transportation is one of the main concerns due to the nature of hazardous materials and their incident impacts. In general, transport risk is a main attribute to develop mathematical models for hazardous material routing problem as well as network designing or improving road safety. This paper presents a chaotic-simulation based model to determine the high selected links to improve road network quality for hazardous material transportation, in which risk is considered as a chaotic variable over the network whereas a simulation technique has been applied to cover a wide range of selecting paths. A real road network, consists of fifty-nine nodes and eighty two-way edges, is used for running the mathematical model and checking validation. Due to the large amounts of hazardous material transported by trucks, the proposed methodology is focused on fuel transportation, and high selected list of edges (links) has been obtained to improve road safety. Sensitivity analysis revealed that using different seeds for generating transport risk has no significant effects on finding the most frequent paths and high selected edges.

scholarly journals Location-Routing Problem of Emergency Facilities under Uncertain Demand by Branch-Price and Cut

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Xuchen Deng
Keyword(s):  
Demand Uncertainty ◽  
Time Window ◽  
Location Routing Problem ◽  
Protection Level ◽  
Routing Problem ◽  
Support Set ◽  
Location Routing ◽  
Robust Model ◽  
Price Cutting ◽  
Resource Constrained Shortest Path

This paper studies the location-routing problem of emergency facilities with time window under demand uncertainty. We propose a robust mathematical model in which uncertain requirements are represented by two forms: the support set defined by cardinal constraint set. When the demand value of rescue point changes in a given definition set, the model can ensure the feasibility of each line. We propose a branch and price cutting algorithm, whose pricing problem is a robust resource-constrained shortest path problem. In addition, we take the Wenchuan Earthquake as an example to verify the practicability of the method. The robust model is simulated under different uncertainty levels and distributions and compared with the scheme obtained by the deterministic problem. The results show that the robust model can run successfully and maintain its robustness, and the robust model provides better protection against demand uncertainty. In addition, we find that cost is more sensitive to uncertainty level than protection level, and our proposed model also allows controlling the robustness level of the solution by adjusting the protection level. In all experiments, the cost of robustness is that the routing cost increases by an average of 13.87%.

scholarly journals Research on the Model and Algorithm for Multimodal Distribution of Emergency Supplies after Earthquake in the Perspective of Fairness

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Xiaowen Xiong ◽  
Fan Zhao ◽  
Yundou Wang ◽  
Yapeng Wang
Keyword(s):  
High Efficiency ◽  
Time Window ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Logistics Network ◽  
Emergency Rescue ◽  
Location Routing ◽  
Driving Time ◽  
Emergency Logistics ◽  
Time Window Constraints

After the earthquake, it is important to ensure the emergency supplies are provided in time. However, not only the timeliness, but also the fairness from different perspectives should be considered. Therefore, we use a multilevel location-routing problem (LPR) to study the fairness of distribution for emergency supplies after earthquake. By comprehensively considering the time window constraints, the partial road damage and dynamic recovery in emergency logistics network, the stochastic driving time of the vehicle, and the mixed load of a variety of emergency materials, we have developed a multiobjective model for the LRP in postearthquake multimodal and fair delivery of multivariety emergency supplies with a limited period. The goal of this model is to minimize the total time in delivering emergency supplies and to minimize the maximum waiting time for emergency supplies to reach demand points. A hybrid heuristic algorithm is designed to solve the model. The example shows that this algorithm has a high efficiency and can effectively realize the supply of emergency supplies after the earthquake within the specified period. This method might be particularly suitable for the emergency rescue scenarios where the victims of the earthquake are vulnerable to mood swings and the emergency supplies need to be fairly distributed.

The time-dependent location-routing problem

2019 ◽  
Vol 128 ◽  
pp. 293-315 ◽  
Author(s):  
Carise E. Schmidt ◽  
Arinei C.L. Silva ◽  
Maryam Darvish ◽  
Leandro C. Coelho
Keyword(s):  
Time Dependent ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing
Sign in / Sign up

Export Citation Format

Share Document