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...

Descripción completa

Detalles Bibliográficos
Autores Principales: Morales F., Franco, Carlos, Mendez-Giraldo G.A.
Formato: Objeto de conferencia (Conference Object)
Lenguaje:Inglés (English)
Publicado: Springer Verlag 2017
Materias:
Acceso en línea:https://repository.urosario.edu.co/handle/10336/23747
https://doi.org/10.1007/978-3-319-66963-2_46
id ir-10336-23747
recordtype dspace
spelling ir-10336-237472022-05-02T12:37:16Z Success probability applied to inventory routing problem with time windows Morales F. Franco, Carlos Mendez-Giraldo G.A. Computer science Computers Dynamic component Inventory routing problems Solution methods Time windows Dynamic programming Disruption networks Dynamic programming Inventory routing problem 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. 2017 2020-05-26T00:05:03Z info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion 18650929 https://repository.urosario.edu.co/handle/10336/23747 https://doi.org/10.1007/978-3-319-66963-2_46 eng info:eu-repo/semantics/openAccess application/pdf Springer Verlag instname:Universidad del Rosario
institution EdocUR - Universidad del Rosario
collection DSpace
language Inglés (English)
topic Computer science
Computers
Dynamic component
Inventory routing problems
Solution methods
Time windows
Dynamic programming
Disruption networks
Dynamic programming
Inventory routing problem
spellingShingle Computer science
Computers
Dynamic component
Inventory routing problems
Solution methods
Time windows
Dynamic programming
Disruption networks
Dynamic programming
Inventory routing problem
Morales F.
Franco, Carlos
Mendez-Giraldo G.A.
Success probability applied to inventory routing problem with time windows
description 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.
format Objeto de conferencia (Conference Object)
author Morales F.
Franco, Carlos
Mendez-Giraldo G.A.
author_facet Morales F.
Franco, Carlos
Mendez-Giraldo G.A.
author_sort Morales F.
title Success probability applied to inventory routing problem with time windows
title_short Success probability applied to inventory routing problem with time windows
title_full Success probability applied to inventory routing problem with time windows
title_fullStr Success probability applied to inventory routing problem with time windows
title_full_unstemmed Success probability applied to inventory routing problem with time windows
title_sort success probability applied to inventory routing problem with time windows
publisher Springer Verlag
publishDate 2017
url https://repository.urosario.edu.co/handle/10336/23747
https://doi.org/10.1007/978-3-319-66963-2_46
_version_ 1740172367998484480
score 12,131701