To access the full text documents, please follow this link:

A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem
González Martín, Sergio; Juan Pérez, Angel Alejandro; Riera Terrén, Daniel; Caceres Cruz, Jose de Jesus
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
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
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
Combinatorial optimization
Optimització combinatòria
Attribution-NonCommercial-NoDerivs 3.0 Spain

Show full item record

Related documents

Other documents of the same author

Juan Pérez, Angel Alejandro; Faulín, Javier; Caceres Cruz, Jose de Jesus; Riera Terrén, Daniel; Grasman, Scott
Caceres Cruz, Jose de Jesus; Grasas León, Alex; Lourenço, Helena R.; Juan Pérez, Angel Alejandro; Roca Puigvert, Mercè; Colomé Perales, Rosa
Juan Pérez, Angel Alejandro; Barrios, Barry; González Martín, Sergio; Coccola, Mariana; Faulín, Javier; Bektas, Tolga