An adaptation of the parliamentary metaheuristic for permutation constraint satisfaction

Author

De-Marcos, Luis ; García, Antonio ; García, Eva ; Martínez, José J. ; Gutiérrez, José A. ; Barchino, Roberto ; Gutiérrez, Jose M. ; Hilera, José R. ; Otón, Salvador

Author_Institution

Comput. Sci. Dept., Univ. of Alcala, Alcala, Spain

fYear

2010

fDate

18-23 July 2010

Firstpage

1

Lastpage

8

Abstract

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.

Keywords

combinatorial mathematics; constraint theory; operations research; optimisation; set theory; stochastic processes; combinatorial optimization; numerical optimization; parliameantary optimization algorithm; parliamentary metaheuristic; permutation constraint satisfaction; stochastic population based optimizer; Algorithm design and analysis; Convergence; Equations; Evolutionary computation; Mathematical model; Optimization; Tuning;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation (CEC), 2010 IEEE Congress on

Conference_Location

Barcelona

Print_ISBN

978-1-4244-6909-3

Type

conf

DOI

10.1109/CEC.2010.5585915

Filename

5585915