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

Título:	Sim-RandSharp: A Hybrid Algorithm for solving the Arc Routing Problem with Stochastic Demands
Autor/a:	González Martín, Sergio; Juan Pérez, Ángel Alejandro; Riera Terrén, Daniel; Elizondo, Mónica; Fonseca Casas, Pau
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.
Materia(s):	-Monte Carlo methods -vehicle routing -ruta para vehículos -métodos Monte Carlo -ruta per a vehicles -mètodes Monte Carlo -Algorithms -Algorismes -Algoritmos
Derechos:	cc-by-nc-sa https://creativecommons.org/licenses/by-nc-sa/3.0/
Tipo de documento:	Objeto de conferencia Artículo - Versión presentada
Editor:	Winter Simulation Conference (WSC). Proceedings
Compartir:

Mostrar el registro completo del ítem