![Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition: Paper and Code - CatalyzeX Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition: Paper and Code - CatalyzeX](https://ai2-s2-public.s3.amazonaws.com/figures/2017-08-08/3043ad9d2de565e9c08a165258ccfc2ee6185214/5-Figure1-1.png)
Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition: Paper and Code - CatalyzeX
![BRKGA Algorithm for the Capacitated Arc Routing Problem – topic of research paper in Computer and information sciences. Download scholarly article PDF and read for free on CyberLeninka open science hub. BRKGA Algorithm for the Capacitated Arc Routing Problem – topic of research paper in Computer and information sciences. Download scholarly article PDF and read for free on CyberLeninka open science hub.](https://cyberleninka.org/viewer_images/305356/f/1.png)
BRKGA Algorithm for the Capacitated Arc Routing Problem – topic of research paper in Computer and information sciences. Download scholarly article PDF and read for free on CyberLeninka open science hub.
![A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems | Papers With Code A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems | Papers With Code](https://paperswithcode.com/static/thumbs/2104.06585.jpg)
A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems | Papers With Code
![Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition | DeepAI Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition | DeepAI](https://images.deepai.org/publication-preview/divide-and-conquer-large-scale-capacitated-arc-routing-problems-with-route-cutting-off-decomposition-page-9-medium.jpg)
Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition | DeepAI
![A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems | Semantic Scholar A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/078cf62a6cfc1f84bb699f02bd77411cdc514abb/2-Figure1-1.png)
A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems | Semantic Scholar
![Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities - ScienceDirect Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S2352340916304358-gr1.jpg)
Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities - ScienceDirect
![PDF) A parameterized approximation algorithm for the mixed capacitated arc routing problem: Theory and experiments PDF) A parameterized approximation algorithm for the mixed capacitated arc routing problem: Theory and experiments](https://i1.rgstatic.net/publication/342123063_A_parameterized_approximation_algorithm_for_the_mixed_capacitated_arc_routing_problem_Theory_and_experiments/links/5ee347ac299bf1faac4e82b6/largepreview.png)
PDF) A parameterized approximation algorithm for the mixed capacitated arc routing problem: Theory and experiments
GitHub - SUSTechBruce/Capacitated-Arc-Routing: This is SUSTech AI lab about Capacitated Arc Routing Problem
![HYBRID ANT COLONY ALGORITHM FOR THE MULTI-DEPOT PERIODIC OPEN CAPACITATED ARC ROUTING PROBLEM by ijaiajournal - issuu HYBRID ANT COLONY ALGORITHM FOR THE MULTI-DEPOT PERIODIC OPEN CAPACITATED ARC ROUTING PROBLEM by ijaiajournal - issuu](https://image.isu.pub/200311104238-6fd53137d3051f5de3f1dd9431932549/jpg/page_1_thumb_large.jpg)
HYBRID ANT COLONY ALGORITHM FOR THE MULTI-DEPOT PERIODIC OPEN CAPACITATED ARC ROUTING PROBLEM by ijaiajournal - issuu
![Figure 1 from NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM | Semantic Scholar Figure 1 from NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/61ee90f3518a33979e0538bd3fc6c7893dbd0f37/4-Figure1-1.png)