A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces

2014 ◽  
Vol 12 (3) ◽  
pp. 397-415 ◽  
Author(s):  
Emre Tokgöz ◽  
Samir Alwazzi ◽  
Theodore B. Trafalis
Keyword(s):  
Facility Location ◽  
Heuristic Algorithm ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Riemannian Surfaces ◽  
Single Facility

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