Computational experiments for the problem of Hamiltonian path with fixed number of color repetitions

In this paper we consider an approach to solve the problem of Hamiltonianpath with fixed number of color repetitions for arc-colored digraphs.Our approach is based on usage of local search algorithms tosolve a logical model for the problem.