Ítem
Solo Metadatos

Success probability applied to inventory routing problem with time windows

Mostrar el registro sencillo de la publicación
dc.creatorMorales F.spa
dc.creatorFranco Franco, Carlos Albertospa
dc.creatorMendez-Giraldo G.A.spa
dc.date.accessioned2020-05-26T00:05:03Z
dc.date.available2020-05-26T00:05:03Z
dc.date.created2017spa
dc.description.abstractThe 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.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1007/978-3-319-66963-2_46
dc.identifier.issn18650929
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/23747
dc.language.isoengspa
dc.publisherSpringer Verlagspa
dc.relation.citationEndPage531
dc.relation.citationStartPage522
dc.relation.citationTitleCommunications in Computer and Information Science
dc.relation.citationVolumeVol. 742
dc.relation.ispartofCommunications in Computer and Information Science, ISSN:18650929, Vol.742,(2017); pp. 522-531spa
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85030032287&doi=10.1007%2f978-3-319-66963-2_46&partnerID=40&md5=730ea91c6333a796aef23ea70b0ecb12spa
dc.rights.accesRightsinfo:eu-repo/semantics/openAccess
dc.rights.accesoAbierto (Texto Completo)spa
dc.source.instnameinstname:Universidad del Rosariospa
dc.source.reponamereponame:Repositorio Institucional EdocURspa
dc.subject.keywordComputer sciencespa
dc.subject.keywordComputersspa
dc.subject.keywordDynamic componentspa
dc.subject.keywordInventory routing problemsspa
dc.subject.keywordSolution methodsspa
dc.subject.keywordTime windowsspa
dc.subject.keywordDynamic programmingspa
dc.subject.keywordDisruption networksspa
dc.subject.keywordDynamic programmingspa
dc.subject.keywordInventory routing problemspa
dc.titleSuccess probability applied to inventory routing problem with time windowsspa
dc.typeconferenceObjecteng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaDocumento de conferenciaspa
Archivos
Colecciones
Artículos