Success probability applied to inventory routing problem with time windows

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationApplied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings
EditorsJuan Carlos Figueroa-Garcia, Eduyn Ramiro Lopez-Santana, Roberto Ferro-Escobar, Jose Luis Villa-Ramirez
PublisherSpringer
Pages522-531
Number of pages10
ISBN (Print)9783319669625
DOIs
StatePublished - 2017
Event4th Workshop on Engineering Applications, WEA 2017 - Cartagena, Colombia
Duration: Sep 27 2017Sep 29 2017

Publication series

NameCommunications in Computer and Information Science
Volume742
ISSN (Print)1865-0929

Conference

Conference4th Workshop on Engineering Applications, WEA 2017
CountryColombia
CityCartagena
Period9/27/179/29/17

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Success probability applied to inventory routing problem with time windows'. Together they form a unique fingerprint.

Cite this