Multimensional Encoding Hybrid Genetic Algorithm for Location Routing Problem with Time Window

Logistics ◽  
2009 ◽  
Author(s):  
Jinhua Li ◽  
Zhuojun Xie
Keyword(s):  
Genetic Algorithm ◽  
Time Window ◽  
Hybrid Genetic Algorithm ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

Applied Research of Improved Hybrid Genetic Algorithm in Multiple Constraints Location - Routing Problem

2013 ◽  
Vol 791-793 ◽  
pp. 1176-1179
Author(s):  
Yan Fen Jiang ◽  
Chun Ling Feng
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Logistic Distribution ◽  
Total System ◽  
Genetic Operators ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Searching Ability

The location routing problem (LRP), which simultaneously tackles both facility location and the vehicle routing decisions to minimize the total system cost, is of great importance in designing an integrated logistic distribution network. In this paper a simulated annealing algorithm (SA) based hybrid genetic algorithm was developed to solve the LRP with capacity constraints (CLRP) on depots and routes. The proposed hybrid genetic algorithm modified the population generation method, genetic operators and recombination strategy and realized the combination of the local searching ability of SA and global searching ability of GA. To evaluate the performance of the proposed approach, we conducted an experimental study and compared its results with other heuristics on a set of well-known Barreto Benchmark instances. The experimental results verified the feasibility and effectiveness of our approach.

scholarly journals GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM

2019 ◽  
Vol 29 (3) ◽  
pp. 173-187
Author(s):  
Alena Rybičková ◽  
Denisa Mocková ◽  
Dušan Teichmann
Keyword(s):  
Genetic Algorithm ◽  
Continuous Location ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

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.

Sign in / Sign up

Export Citation Format

Share Document