A column generation-based algorithm for solving combined inventory and routing problems

Título traducido de la contribución: Algoritmo basado en generación de columnas para resolver problemas combinados de ruteo e inventarios

Carlos Alberto Franco Franco, Juan Carlos Figueroa-Garcia

Resultado de la investigación: Contribución a RevistaArtículo

2 Citas (Scopus)

Resumen

Este trabajo presenta un algoritmo basado en generación de columnas para la solución de problemas combinados de ruteo e inventarios. Este problema trata de coordinar los niveles de inventario del cliente mediante envíos a costo mínimo. Siendo este un problema de decisión combinatorio, ya que combina problemas de ruteo de vehículos (VRP) y problemas de inventario. Utilizando el método de generación de columnas se pueden generar iterativamente rutas interesantes al sistema basadas en los costos duales, esto es rutas que mejoren la calidad de la función objetivo al presentar costos reducidos negativos. Para esto el problema entero mixto original se relaja para obtener los costos reducidos y se establece un subproblema encargado de generar las rutas. El subproblema se modela como un problema de ruta más corta. Finalmente cuando se tiene un conjunto de rutas atractivas para el modelo, el problema entero mixto es el encargado de seleccionar aquellas rutas que minimicen costos y satisfagan las restricciones establecidas.
Idioma originalEnglish (US)
Páginas (desde-hasta)305-313
Número de páginas9
PublicaciónIngeniare
Volumen24
N.º2
EstadoPublished - 2016

Huella dactilar

Costs
Vehicle routing
Freight transportation

Citar esto

@article{f384563eb2b84570bab178f82aac9cf2,
title = "A column generation-based algorithm for solving combined inventory and routing problems",
abstract = "This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are combined. Using the column generation method, we can iteratively generate interesting routes to the system, based on their dual costs, this is routes that will improve the quality of the objective function because its reduced costs are negatives. The initial mixed integer problem has to be relaxed for getting its reduced costs. The sub problem is defined as the shortest path problem that returns a set of desirable routes. Finally, when the set of desirable routes is obtained, the mixed integer model should select a set of routes that fulfill both minimum shipping costs and the constraints of the system.",
author = "{Franco Franco}, {Carlos Alberto} and Figueroa-Garcia, {Juan Carlos}",
year = "2016",
language = "English (US)",
volume = "24",
pages = "305--313",
journal = "Ingeniare",
issn = "0718-3291",
publisher = "Universidad de Tarapaca",
number = "2",

}

A column generation-based algorithm for solving combined inventory and routing problems. / Franco Franco, Carlos Alberto; Figueroa-Garcia, Juan Carlos .

En: Ingeniare, Vol. 24, N.º 2, 2016, p. 305-313.

Resultado de la investigación: Contribución a RevistaArtículo

TY - JOUR

T1 - A column generation-based algorithm for solving combined inventory and routing problems

AU - Franco Franco, Carlos Alberto

AU - Figueroa-Garcia, Juan Carlos

PY - 2016

Y1 - 2016

N2 - This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are combined. Using the column generation method, we can iteratively generate interesting routes to the system, based on their dual costs, this is routes that will improve the quality of the objective function because its reduced costs are negatives. The initial mixed integer problem has to be relaxed for getting its reduced costs. The sub problem is defined as the shortest path problem that returns a set of desirable routes. Finally, when the set of desirable routes is obtained, the mixed integer model should select a set of routes that fulfill both minimum shipping costs and the constraints of the system.

AB - This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are combined. Using the column generation method, we can iteratively generate interesting routes to the system, based on their dual costs, this is routes that will improve the quality of the objective function because its reduced costs are negatives. The initial mixed integer problem has to be relaxed for getting its reduced costs. The sub problem is defined as the shortest path problem that returns a set of desirable routes. Finally, when the set of desirable routes is obtained, the mixed integer model should select a set of routes that fulfill both minimum shipping costs and the constraints of the system.

M3 - Article

VL - 24

SP - 305

EP - 313

JO - Ingeniare

JF - Ingeniare

SN - 0718-3291

IS - 2

ER -