Success Probability Applied to Inventory Routing Problem with Time Windows

Carlos Alberto Franco Franco, Germán Andrés Mendez Giraldo, Francisco Morales

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

Resumen

The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.
Idioma originalEnglish (US)
Páginas (desde-hasta)522-531
Número de páginas10
PublicaciónCommunications in Computer and Information Science
Volumen742
EstadoPublished - ago 29 2017

Huella dactilar

Applied Probability
Time Windows
Routing Problem
Dynamic programming
Vertex of a graph
Use Case
Dynamic Programming
Industry
Routing
Optimise

Citar esto

@article{fba223493adb47f6b13f5dfe80a84530,
title = "Success Probability Applied to Inventory Routing Problem with Time Windows",
abstract = "The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.",
author = "{Franco Franco}, {Carlos Alberto} and {Mendez Giraldo}, {Germ{\'a}n Andr{\'e}s} and Francisco Morales",
year = "2017",
month = "8",
day = "29",
language = "English (US)",
volume = "742",
pages = "522--531",
journal = "Communications in Computer and Information Science",
issn = "1865-0929",
publisher = "Springer",

}

Success Probability Applied to Inventory Routing Problem with Time Windows. / Franco Franco, Carlos Alberto; Mendez Giraldo, Germán Andrés ; Morales, Francisco.

En: Communications in Computer and Information Science, Vol. 742, 29.08.2017, p. 522-531.

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

TY - JOUR

T1 - Success Probability Applied to Inventory Routing Problem with Time Windows

AU - Franco Franco, Carlos Alberto

AU - Mendez Giraldo, Germán Andrés

AU - Morales, Francisco

PY - 2017/8/29

Y1 - 2017/8/29

N2 - The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.

AB - The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.

M3 - Article

VL - 742

SP - 522

EP - 531

JO - Communications in Computer and Information Science

JF - Communications in Computer and Information Science

SN - 1865-0929

ER -