Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/90869
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Cáceres Cruz, José de Jesús | - |
dc.contributor.author | Juan, Angel A. | - |
dc.contributor.author | Grasman, Scott Erwin | - |
dc.contributor.author | Bektas, Tolga | - |
dc.contributor.author | Faulin, Javier | - |
dc.date.accessioned | 2019-01-30T12:16:35Z | - |
dc.date.available | 2019-01-30T12:16:35Z | - |
dc.date.issued | 2012-12 | - |
dc.identifier.citation | Cáceres-Cruz, J., Juan, A.A., Grasman, S., Bektas, T. & Faulin Fajardo, F.J. (2012). Combining Monte-Carlo Simulation with Heuristics for solving the Inventory Routing Problem with Stochastic Demands. Winter Simulation Conference (WSC). Proceedings, 2012(), 3114-3122. doi: 10.1109/WSC.2012.6464999 | - |
dc.identifier.isbn | 9781467347815 | - |
dc.identifier.issn | 1558-4305MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/90869 | - |
dc.description.abstract | In this paper, we introduce a simulation-based algorithm for solving the single-period Inventory Routing Problem (IRP) with stochastic demands. Our approach, which combines simulation with heuristics, considers different potential inventory policies for each customer, computes their associated inventory costs according to the expected demand in the period, and then estimates the marginal routing savings associated with each customer-policy entity. That way, for each customer it is possible to rank each inventory policy by estimating its total costs, i.e., both inventory and routing costs. Finally, a multi-start process is used to iteratively construct a set of promising solutions for the IRP. At each iteration of this multi-start process, a new set of policies is selected by performing an asymmetric randomization on the list of policy ranks. Some numerical experiments illustrate the potential of our approach. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Winter Simulation Conference (WSC). Proceedings | - |
dc.relation.ispartof | Winter Simulation Conference (WSC). Proceedings, 2012 | - |
dc.relation.ispartofseries | Winter Simulation Conference, Berlín, Alemanya, 9-12, desembre de 2012 | - |
dc.relation.uri | https://ieeexplore.ieee.org/document/6464999 | - |
dc.relation.uri | https://informs-sim.org/wsc12papers/includes/files/con168.pdf | - |
dc.rights | (c) Author/s & (c) Journal | - |
dc.subject | routing | en |
dc.subject | stochastic processes | en |
dc.subject | heuristic algorithms | en |
dc.subject | educational institutions | en |
dc.subject | vehicles | en |
dc.subject | modeling | en |
dc.subject | Monte Carlo methods | en |
dc.subject | enrutament | ca |
dc.subject | enrutamiento | es |
dc.subject | procesos estocásticos | es |
dc.subject | processos estocàstics | ca |
dc.subject | algorismes heurístics | ca |
dc.subject | algoritmos heurísticos | es |
dc.subject | institucions educatives | ca |
dc.subject | instituciones educativas | es |
dc.subject | vehículos | es |
dc.subject | vehicles | ca |
dc.subject | modelització | ca |
dc.subject | modelización | es |
dc.subject | métodos Monte Carlo | es |
dc.subject | mètodes Monte Carlo | ca |
dc.subject.lcsh | Algorithms | en |
dc.title | Combining Monte-Carlo simulation with heuristics for solving the inventory routing problem with stochastic demands | - |
dc.type | info:eu-repo/semantics/conferenceObject | - |
dc.audience.mediator | Theme areas | - |
dc.subject.lemac | Algorismes | ca |
dc.subject.lcshes | Algoritmos | es |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | - |
dc.identifier.doi | 10.1109/WSC.2012.6464999 | - |
dc.gir.id | AR/0000003281 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TRA2010-21644-C03 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/CYTED2010-511RT0419 | - |
Aparece en las colecciones: | Articles |
Ficheros en este ítem:
No hay ficheros asociados a este ítem.
Comparte:
Los ítems del Repositorio están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.