Solving mesh network of capacitated arc routing problem via reactive tabu search

Abstract

In this paper, we describe a mesh network of capacitated arc routing problem (CARP) that represents the real case of truck operation in waste collection. In general, the layout of residential houses area in Malaysia is likely similar to a mesh network where several nodes are connected with arcs. In CARP model, a truck starts its operation by moving from a depot to the first customer (first node). Then the collection of household refusal begins when the truck moves along the alley (arcs) thus increases its capacity. A set of customers which located along the arcs is visited exactly once without exceeding the truck capacity. The objective in this study is to find the minimum routing cost using tabu search and reactive tabu search methods.