A New Approach to Location Routing Problem: Capacitated Periodic Location Routing Problem with Inventory

2020 ◽  
pp. 751-766
Author(s):  
Esra Yaşar Boz ◽  
Ahmet Reha Botsalı ◽  
Tuba Ulusoy
Keyword(s):  
Location Routing Problem ◽  
Routing Problem ◽  
New Approach ◽  
Location Routing

scholarly journals An approach based on Clustering AH and VND for Supply Chain Management

2021 ◽  
Vol 14 (1) ◽  
pp. 306-315
Author(s):  
Fadoua Oudouar ◽  
◽  
El Zaoui ◽  
Keyword(s):  
Second Phase ◽  
Variable Neighborhood Descent ◽  
Location Routing Problem ◽  
Routing Problem ◽  
New Approach ◽  
Location Routing ◽  
Sweep Algorithm ◽  
Two Phases ◽  
The Cost ◽  
Capacitated Location

In this work, we present a new approach to solve the Capacitated Location-Routing Problem (CLRP). The aim of this method is to determine the depot locations, to assign customers to facilities and to define routes for each depot to serve the associated clients. The proposed approach contains two phases, which are the constructive phase and the improvement phase. In the first phase, we select the depots to be opened, allocate the customers to open depots using a Hierarchical Ascendant (HA) method and we solve the vehicle routing problem for each depot using Sweep algorithm. In the second phase, we apply a Variable Neighborhood Descent (VND) with three structures in order to optimize the cost obtained by the first phase. Two sets of well-known instances from the literature are used to evaluate the performance of this method, and the numerical results obtained are compared with the experimental results of other methods. Results show that our method is competitive with respect to the best-known solutions (BKSs) and demonstrate its efficiency in comparison with other approaches.

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
Sign in / Sign up

Export Citation Format

Share Document