A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/17578
Tipus de documentText en actes de congrés
Data publicació2011
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
The Arc Routing Problem is a kind of NP-hard routing problems
where the demand is located in some of the arcs connecting nodes
and should be completely served fulfilling certain constraints. This paper
presents a hybrid algorithm which combines a classical heuristic with biased
random sampling, to solve the Capacitated Arc Routing Problem
(CARP). This new algorithm is compared with the classical Path scanning
heuristic, reaching results which outperform it. As discussed in the
paper, the methodology presented is flexible, can be easily parallelised
and it does not require any complex fine-tuning process. Some preliminary
tests show the potential of the proposed approach as well as its
limitations
CitacióGonzález-Martín, S. [et al.]. A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem. A: International Workshop on. "Proceedings of the 18th RCRA Workshop on". Barcelona: 2011, p. 46-54.
Versió de l'editorhttp://ijcai-11.iiia.csic.es/files/proceedings/RCRA2011-proceedings.pdf
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Juan_A_RCRA18_2011.pdf | 91,03Kb | Visualitza/Obre |