Success probability applied to inventory routing problem with time windows

Francisco Morales, Carlos Franco, Germán Andres Mendez-Giraldo

Resultado de la investigación: Capítulo en Libro/Reporte/ConferenciaContribución a la conferencia

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 originalInglés estadounidense
Título de la publicación alojadaApplied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings
EditoresJuan Carlos Figueroa-Garcia, Eduyn Ramiro Lopez-Santana, Roberto Ferro-Escobar, Jose Luis Villa-Ramirez
EditorialSpringer
Páginas522-531
Número de páginas10
ISBN (versión impresa)9783319669625
DOI
EstadoPublicada - 2017
Evento4th Workshop on Engineering Applications, WEA 2017 - Cartagena, Colombia
Duración: sep 27 2017sep 29 2017

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen742
ISSN (versión impresa)1865-0929

Conferencia

Conferencia4th Workshop on Engineering Applications, WEA 2017
PaísColombia
CiudadCartagena
Período9/27/179/29/17

All Science Journal Classification (ASJC) codes

  • Informática (todo)
  • Matemáticas (todo)

Huella Profundice en los temas de investigación de 'Success probability applied to inventory routing problem with time windows'. En conjunto forman una huella única.

Citar esto