Constructive heuristic for the mixed capacitated arc routing problem with multi capacity

Abstract

This paper addresses a variant of the capacitated arc routing problems known as the mixed capacitated arc routing problem (MCARP) with multi capacity constraints. The MCARP represents closely real life situations since it takes into account directed and undirected links to serve customers in the associated network. A constructive heuristic based on insertion techniques is proposed to tackle the problem. Computational experiments were conducted using some randomly generated instances and the experiments show competitive results. Some avenues for future research are also highlighted.