Loading...
Loading...

Go to the content (press return)

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

Author
González-Martín, S.; Juan, A.; Riera, D.; Caceres, J.
Type of activity
Presentation of work at congresses
Name of edition
18th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Date of publication
2011
Presentation's date
2011-06
Book of congress proceedings
Proceedings of the 18th RCRA workshop on experimental evaluation of algorithms for solving problems with combinatorial explosion
First page
46
Last page
54
Repository
http://hdl.handle.net/2117/17578 Open in new window
URL
http://ijcai-11.iiia.csic.es/files/proceedings/RCRA2011-proceedings.pdf Open in new window
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 methodo...
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.

Participants

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

Attachments