scholarly journals Heuristic algorithm based on Ant Colony Optimization for the Capacitated Location-Routing problem with Homogeneous Fleet

2021 ◽  
Vol 42 (16) ◽  
pp. 1-12
Author(s):  
Gustavo GATICA ◽  
◽  
John W. ESCOBAR ◽  
Rodrigo LINFATI ◽  
◽  
...  
Keyword(s):  
Ant Colony Optimization ◽  
Heuristic Algorithm ◽  
Ant Colony ◽  
Second Phase ◽  
Metaheuristic Algorithm ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Two Phases ◽  
Capacitated Location

This paper considers the Capacitated Location-Routing Problem with Homogeneous Fleet (CLRP). The objective is to minimize the sum of the open depots' costs, the costs for the used vehicles, and the costs associated with the distances traveled. A metaheuristic algorithm of two phases for the CLRP is proposed. In the first phase, customers establish the clusters to be subsequently heuristically assigned to the depots. In the second phase, the initial routes are improved using an algorithm based on Ant Colony. The obtained results show the efficiency of the proposed approach.

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.

Ant colony optimization with clustering for solving the dynamic location routing problem

2016 ◽  
Vol 285 ◽  
pp. 149-173 ◽  
Author(s):  
Shangce Gao ◽  
Yirui Wang ◽  
Jiujun Cheng ◽  
Yasuhiro Inazumi ◽  
Zheng Tang
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Dynamic Location

scholarly journals A hybrid metaheuristic algorithm for the capacitated location routing problem

DYNA ◽  
2015 ◽  
Vol 82 (189) ◽  
pp. 243-251 ◽  
Author(s):  
John Willmer Escobar ◽  
Rodrigo Linfati ◽  
Wilson Adarme-Jaimes
Keyword(s):  
Metaheuristic Algorithm ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Hybrid Metaheuristic ◽  
Location Routing ◽  
Capacitated Location
Sign in / Sign up

Export Citation Format

Share Document