A two-phase tabu search approach to the location routing problem

1999 ◽  
Vol 116 (1) ◽  
pp. 87-99 ◽  
Author(s):  
Dilek Tuzun ◽  
Laura I. Burke
Keyword(s):  
Tabu Search ◽  
Two Phase ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Search 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.

Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

2007 ◽  
Vol 41 (4) ◽  
pp. 470-483 ◽  
Author(s):  
Christian Prins ◽  
Caroline Prodhon ◽  
Angel Ruiz ◽  
Patrick Soriano ◽  
Roberto Wolfler Calvo
Keyword(s):  
Tabu Search ◽  
Lagrangean Relaxation ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Search Heuristic ◽  
Location Routing ◽  
Capacitated Location

scholarly journals A comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH)

DYNA ◽  
2017 ◽  
Vol 84 (200) ◽  
pp. 193-201 ◽  
Author(s):  
José Alfonso Bernal-Moyano ◽  
John Willmer Escobar Velasquez ◽  
Cesar Marín-Moreno ◽  
Rodrigo Linfati ◽  
Gustavo Gatica
Keyword(s):  
Tabu Search ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Location Routing

Nosotros consideramos el problema de localización y ruteo de vehículos con flota heterogénea (LRPH) en el cual la meta es determinar los depósitos a ser abiertos, los clientes asignados a cada deposito, y las rutas que satisfagan la demanda de los clientes considerando una flota heterogénea. Nosotros proponemos una comparación de algoritmos granulares de Recocido Simulado (GSA), Búsqueda de Vecindario Variable (GVNS) y Tabú Search probabilístico (pGTS) para el LRPH. De esta manera, los algoritmos propuestos consideran un subconjunto del espacio en el cual los movimientos menos favorables son descartados según un factor de granularidad. Los algoritmos propuestos son comparados experimentalmente para la solución del LRPH, considerando el tiempo de CPU y la calidad de la solución obtenida en instancias adaptadas de la literatura. Los resultados computacionales muestran que el algoritmos GSA es capaz de obtener buenas soluciones en tiempos computacionales reducidos, mejorando los resultados obtenidos por los otros algoritmos propuestos.

Sign in / Sign up

Export Citation Format

Share Document