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.

A Two-Phase Meta Heuristic Approach to the Location-Routing Problem for Transportation Network Planning

2013 ◽  
Vol 361-363 ◽  
pp. 1900-1905 ◽  
Author(s):  
Ji Ung Sun
Keyword(s):  
Ant Colony Optimization ◽  
Facility Location ◽  
Vehicle Routing ◽  
Optimization Algorithm ◽  
Transportation Network ◽  
Ant Colony Optimization Algorithm ◽  
Two Phase ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing

In this paper we consider the location-routing problem which combines the facility location and the vehicle routing decisions. In this type of problem, we have to determine the location of facilities within a set of possible locations and routes of the vehicles to meet the demands of number of customers. Since the location-routing problem is NP-hard, it is difficult to obtain optimal solution within a reasonable computational time. Therefore, a two-phase ant colony optimization algorithm is developed which solves facility location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study. The experimental results show that the proposed ant colony optimization algorithm can be a viable solution method for the general transportation network planning.

Sign in / Sign up

Export Citation Format

Share Document