An adaptation of the parliamentary metaheuristic for permutation constraint satisfaction

Inspired by political parties´ behavior in parliament´s elections of chairman, Parliameantary Optimization Algorithm (POA) has emerged as a new stochastic population-based optimizer. Current research has proven POA efficiency in numerical optimization but it is difficult to find a POA version that deals with combinatorial optimization. In this paper we present a parliamentary algorithm that can solve permutation constraint satisfaction problems along with the results of its experimental testing and comparison with other evolutionary methods. Results demonstrate POA efficiency in this new landscape.