Loading...
Please wait, while we are loading the content...
Similar Documents
A Hybrid Algorithm combining Path Scanning and Biased Random Sampling for the Arc Routing Problem
| Content Provider | CiteSeerX |
|---|---|
| Author | Riera, Daniel Juan, Angel A. |
| Abstract | Abstract. The Arc Routing Problem is a kind of NP-hard routing prob-lems 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 bi-ased random sampling, to solve the Capacitated Arc Routing Problem (CARP). This new algorithm is compared with the classical Path scan-ning 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 prelim-inary tests show the potential of the proposed approach as well as its limitations. |
| File Format | |
| Access Restriction | Open |
| Content Type | Text |