A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/17578

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.contributor.author	González Martín, Sergio
dc.contributor.author	Juan Pérez, Angel Alejandro
dc.contributor.author	Riera Terrén, Daniel
dc.contributor.author	Caceres Cruz, Jose de Jesus
dc.date	2011
dc.identifier.citation	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.
dc.identifier.uri	http://hdl.handle.net/2117/17578
dc.language.iso	eng
dc.relation	http://ijcai-11.iiia.csic.es/files/proceedings/RCRA2011-proceedings.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
dc.subject	Combinatorial optimization
dc.subject	Optimització combinatòria
dc.title	A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.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

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author