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, Angel A. Riera Terrén, Daniel Elizondo, Mónica Fonseca Casas, Pau |
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 |
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. |
Keywords: | Monte Carlo methods vehicle routing |
DOI: | 10.1109/WSC.2012.6465034 |
Document type: | info:eu-repo/semantics/conferenceObject |
Version: | info:eu-repo/semantics/submittedVersion |
Issue Date: | Dec-2012 |
Publication license: | https://creativecommons.org/licenses/by-nc-sa/3.0/ |
Appears in Collections: | Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RandSHARP-SD_WSC_120330.pdf | Pre-print | 250,47 kB | Adobe PDF | View/Open |
Share:
This item is licensed under a Creative Commons License