Capacitated Arc Routing Problem （CARP）

Sep 1, 2018

For a graph $G=(N,E)$, if a part of the edges (task edges) need to be served, find the routes of minimum cost.

CARP Combinatorial optimization
Avatar
Li Rui
PhD of system science

My research interests include evolutionary computation, swarm intelligence and optimization.

Publications

Memetic algorithm with non-smooth penalty for capacitated arc routing problem

Non-smooth penalty and a memetic algorithm with non-smooth penalty are proposed .
PDF Code Project Project