Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/90870
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | González Martín, Sergio | - |
dc.contributor.author | Juan, Angel A. | - |
dc.contributor.author | Riera Terrén, Daniel | - |
dc.contributor.author | Elizondo, Mónica | - |
dc.contributor.author | Fonseca Casas, Pau | - |
dc.date.accessioned | 2019-01-30T12:16:35Z | - |
dc.date.available | 2019-01-30T12:16:35Z | - |
dc.date.issued | 2012-12 | - |
dc.identifier.citation | Gonzalez Martin, S., Elizondo, M., Riera-Terrén, D., Juan, A.A. & Fonseca, P. (2012). Sim-RandSHARP: A Hybrid Algorithm for solving the Arc Routing Problem with Stochastic Demands. Winter Simulation Conference (WSC). Proceedings, 2012(), 1-11. doi: 10.1109/WSC.2012.6465034 | - |
dc.identifier.isbn | 9781467347822 | - |
dc.identifier.issn | 1558-4305MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/90870 | - |
dc.description.abstract | This paper proposes a new hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands (ARPSD). Our approach combines Monte Carlo simulation (MCS) with the RandSHARP algorithm, which is designed for solving the Capacitated Arc Routing Problem (CARP) with deterministic demands. The RandSHARP algorithm makes use of a CARP-adapted version of the Clarke and Wright Savings heuristic, which was originally designed for the Vehicle Routing Problem. The RandSHARP algorithm also integrates a biased-randomized process, which allows it to obtain competitive results for the CARP in low computational times. The RandSHARP algorithm is then combined with MCS to solve the ARPSD. Some numerical experiments contribute to illustrate the potential benefits 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, Berlin, Alemanya, 09-12, desembre de 2012 | - |
dc.relation.uri | https://doi.org/10.1109/WSC.2012.6465034 | - |
dc.rights | cc-by-nc-sa | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/3.0/ | - |
dc.subject | Monte Carlo methods | en |
dc.subject | vehicle routing | en |
dc.subject | ruta para vehículos | es |
dc.subject | ruta per a vehicles | ca |
dc.subject | métodos Monte Carlo | es |
dc.subject | mètodes Monte Carlo | ca |
dc.subject.lcsh | Algorithms | en |
dc.title | Sim-RandSharp: A Hybrid Algorithm for solving the Arc Routing Problem with Stochastic Demands | - |
dc.type | info:eu-repo/semantics/conferenceObject | - |
dc.audience.mediator | Theme areas | en |
dc.subject.lemac | Algorismes | ca |
dc.subject.lcshes | Algoritmos | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
dc.identifier.doi | 10.1109/WSC.2012.6465034 | - |
dc.gir.id | AR/0000003280 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/CYTED2010-511RT0419 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TRA2010-21644-C03 | - |
dc.type.version | info:eu-repo/semantics/submittedVersion | - |
Aparece en las colecciones: | Articles |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
RandSHARP-SD_WSC_120330.pdf | Pre-print | 250,47 kB | Adobe PDF | Visualizar/Abrir |
Comparte:
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons