Permutation design is a crucial point for turbocodes in terms of error correction performance. Many permutation design models have been proposed to deal with this point. However, most of them are defined in terms of several free parameters that have to be correctly chosen. The selection of these parameters generally leads to a systematic search in a wide domain of parameters value. In this article, we focus on the ARP model and describe an algorithm which avoids combinatorial enumeration.