Success probability applied to inventory routing problem with time windows
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 appl...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2017
- Institución:
- Universidad del Rosario
- Repositorio:
- Repositorio EdocUR - U. Rosario
- Idioma:
- eng
- OAI Identifier:
- oai:repository.urosario.edu.co:10336/23747
- Acceso en línea:
- https://doi.org/10.1007/978-3-319-66963-2_46
https://repository.urosario.edu.co/handle/10336/23747
- Palabra clave:
- Computer science
Computers
Dynamic component
Inventory routing problems
Solution methods
Time windows
Dynamic programming
Disruption networks
Dynamic programming
Inventory routing problem
- Rights
- License
- http://purl.org/coar/access_right/c_abf2
| Summary: | 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. © 2017, Springer International Publishing AG. |
|---|