An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem

arXiv:2403.07028v1 Announce Type: new
Abstract: Recently, neural networks (NN) have made great strides in combinatorial optimization. However, they face challenges when solving the capacitated arc routing problem (CARP) which is to find the minimum-cost tour covering all required edges on a graph, while within capacity constraints. In tackling CARP, NN-based approaches tend to lag behind advanced metaheuristics, since they lack directed arc modeling and efficient learning methods tailored for complex CARP. In this paper, we introduce an NN-based solver to …

abstract arc arxiv capacity challenges constraints cost cs.ai cs.lg face graph however math.oc metaheuristics networks neural networks optimization routing solver type