Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/90870
Title: Sim-RandSharp: A Hybrid Algorithm for solving the Arc Routing Problem with Stochastic Demands
Author: González Martín, Sergio
Juan Pérez, Ángel Alejandro
Riera Terrén, Daniel  
Elizondo, Mónica
Fonseca Casas, Pau
Keywords: Monte Carlo methods
vehicle routing
Issue Date: Dec-2012
Publisher: Winter Simulation Conference (WSC). Proceedings
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
Series/Report no.: Winter Simulation Conference, Berlin, Alemanya, 09-12, desembre de 2012
Project identifier: info:eu-repo/grantAgreement/CYTED2010-511RT0419
info:eu-repo/grantAgreement/TRA2010-21644-C03
Also see: https://informs-sim.org/wsc12papers/includes/files/con252.pdf.
https://ieeexplore.ieee.org/document/6465034
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.
Language: English
URI: http://hdl.handle.net/10609/90870
ISBN: 9781467347822
ISSN: 1558-4305MIAR
Appears in Collections:Articles

Share:
Export:
Files in This Item:
File Description SizeFormat 
RandSHARP-SD_WSC_120330.doc212.5 kBMicrosoft WordView/Open

This item is licensed under a Creative Commons License Creative Commons