Universitat Oberta de Catalunya
2019-01-30T12:16:35Z
2019-01-30T12:16:35Z
2012-12
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.
Object of conference
Submitted version
English
Monte Carlo methods; vehicle routing; ruta para vehículos; métodos Monte Carlo; ruta per a vehicles; mètodes Monte Carlo; Algorithms; Algorismes; Algoritmos
Winter Simulation Conference (WSC). Proceedings
Winter Simulation Conference (WSC). Proceedings, 2012
Winter Simulation Conference, Berlin, Alemanya, 09-12, desembre de 2012
https://informs-sim.org/wsc12papers/includes/files/con252.pdf.
https://ieeexplore.ieee.org/document/6465034
info:eu-repo/grantAgreement/CYTED2010-511RT0419
info:eu-repo/grantAgreement/TRA2010-21644-C03
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
9781467347822
1558-4305
10.1109/WSC.2012.6465034
cc-by-nc-sa
https://creativecommons.org/licenses/by-nc-sa/3.0/
Articles [361]
