Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
González-Martín, S.; Juan, A.; Riera, D.; Caceres, J.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
18th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Any de l'edició
2011
Data de presentació
2011-06
Llibre d'actes
Proceedings of the 18th RCRA workshop on experimental evaluation of algorithms for solving problems with combinatorial explosion
Pàgina inicial
46
Pàgina final
54
Repositori
http://hdl.handle.net/2117/17578 Obrir en finestra nova
URL
http://ijcai-11.iiia.csic.es/files/proceedings/RCRA2011-proceedings.pdf Obrir en finestra nova
Resum
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 methodo...
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.

Participants

  • González Martín, Sergio  (autor ponent)
  • Juan Perez, Angel Alejandro  (autor ponent)
  • Riera Terrén, Daniel  (autor ponent)
  • Caceres Cruz, Jose de Jesus  (autor ponent)

Arxius