Ant colony optimisation for location routing problem and its application to bill delivery services

2013 ◽  
Vol 14 (1) ◽  
pp. 1
Author(s):  
M. Vamshidhar Reddy ◽  
Vinay V. Panicker ◽  
R. Sridharan
Keyword(s):  
Ant Colony ◽  
Ant Colony Optimisation ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Delivery Services

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 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.

Sign in / Sign up

Export Citation Format

Share Document