abstract = "he Uncertain Capacitated Arc Routing Problem (UCARP)
is a well-known combinatorial optimization problem that
has many real-world applications. Genetic programming
has successfully evolved routing policies that can make
real-time routing decisions for uncertain arc routing
problems. Although the evolved routing policies are
highly effective, they are typically very complex thus
hard for real users to understand and trust. Therefore,
it is necessary to improve the interpretability of
GP-evolved routing policies.",