Sim-RandSharp: A Hybrid Algorithm for solving the Arc Routing Problem with Stochastic Demands

Inicio | ¿Qué es? | Contacto

English | Català

Consultar RECERCAT

Por comunidades y
colecciones Por fecha Por autores Por títulos Por temas (CDU)

Consultar departamento

Por fecha Por autores Por títulos Por temas (CDU)

Estadisticas

Del documento Todo RECERCAT

Mi RECERCAT

Entrar Alertas por correo-e

Directorio de otros repositorios

RECERCAT Principal > Universitat Oberta de Catalunya > Documents de recerca > Tecnologia i comunicació > Informàtica, tecnologia i multimèdia > Articles > Visualizar documento

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10609/90870

dc.contributor.author	González Martín, Sergio
dc.contributor.author	Juan Pérez, Ángel Alejandro
dc.contributor.author	Riera Terrén, Daniel
dc.contributor.author	Elizondo, Mónica
dc.contributor.author	Fonseca Casas, Pau
dc.date	2019-01-30T12:16:35Z
dc.date	2019-01-30T12:16:35Z
dc.date	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.citation	9781467347822
dc.identifier.citation	1558-4305
dc.identifier.citation	10.1109/WSC.2012.6465034
dc.identifier.uri	http://hdl.handle.net/10609/90870
dc.format	application/pdf
dc.language.iso	eng
dc.publisher	Winter Simulation Conference (WSC). Proceedings
dc.relation	Winter Simulation Conference (WSC). Proceedings, 2012
dc.relation	Winter Simulation Conference, Berlin, Alemanya, 09-12, desembre de 2012
dc.relation	https://informs-sim.org/wsc12papers/includes/files/con252.pdf.
dc.relation	https://ieeexplore.ieee.org/document/6465034
dc.relation	info:eu-repo/grantAgreement/CYTED2010-511RT0419
dc.relation	info:eu-repo/grantAgreement/TRA2010-21644-C03
dc.rights	cc-by-nc-sa
dc.rights	https://creativecommons.org/licenses/by-nc-sa/3.0/
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Monte Carlo methods
dc.subject	vehicle routing
dc.subject	ruta para vehículos
dc.subject	métodos Monte Carlo
dc.subject	ruta per a vehicles
dc.subject	mètodes Monte Carlo
dc.subject	Algorithms
dc.subject	Algorismes
dc.subject	Algoritmos
dc.title	Sim-RandSharp: A Hybrid Algorithm for solving the Arc Routing Problem with Stochastic Demands
dc.type	info:eu-repo/semantics/conferenceObject
dc.type	info:eu-repo/semantics/submittedVersion
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.

Mostrar el registro sencillo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

On the use of biased randomization and simheuristics to solve Vehicle and Arc Routing Problems

González Martín, Sergio; Barrios Barrios, Barry; Juan Pérez, Ángel Alejandro; Riera Terrén, Daniel

A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem

González Martín, Sergio; Juan Pérez, Angel Alejandro; Riera Terrén, Daniel; Caceres Cruz, Jose de Jesus

Combining biased random sampling with metaheuristics for the facility location problem in distributed computer systems

Cabrera Añon, Guillem; González Martín, Sergio; Juan Pérez, Ángel Alejandro; Grasman, Scott Erwin; Marquès Puig, Joan Manuel

Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem

Juan Pérez, Ángel Alejandro; Barrios Barrios, Barry; Coccola, Mariana; González Martín, Sergio; Faulin Fajardo, Francisco Javier; Bektas, Tolga

Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the vehicle routing problem

Guimarans, Daniel; Riera Terrén, Daniel; Juan Pérez, Ángel Alejandro; Ramos González, Juan José

Accesibilidad | Aviso legal | Política de Cookies | Documentos de uso interno

Coordinación

Patrocinio