Abstract
Capacitated Arc Routing Problem (CARP) is the problem in which routes are made in order to minimize the total cost of vehicles' trip back to depot through each demand arc in network. For the cases like mail delivery where demand is concentrated, and road sweeping where road section itself is the target of service, it is suitable to adopt the approach based on CARP in which demands are set on arcs. In this paper, a solution of CARP, utilizing simulated annealing is proposed. Adoption of "string model", a one-dimensional alignment model makes efficient search for better solution possible. The proposed method is simple and implemented in one phase procedure, while preceding methods are constructed in two phases. Computational experiments are conducted on benchmark instances.
