Paper Info
Title
An Adaptation Of The Parliamentary Metaheuristic For Permutation Constraint Satisfaction
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.
Year
DOI
Venue
2010
10.1109/CEC.2010.5585915
2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)
Keywords
Field
DocType
constraint satisfaction,evolutionary computation,combinatorial optimization,stochastic processes,convergence,set theory,algorithm design and analysis,optimization,mathematical model,tuning,operations research,constraint satisfaction problem
Population,Constraint satisfaction,Mathematical optimization,Algorithm design,Computer science,Permutation,Evolutionary computation,Combinatorial optimization,Constraint satisfaction problem,Artificial intelligence,Machine learning,Metaheuristic
Conference
Citations 
PageRank 
References 
0
0.34
6
Authors
9
Name
Order
Citations
PageRank
Luis de Marcos111216.95
Antonio Garcia200.34
Eva García325.23
Javier Martínez48018.52
Jesús Gutiérrez57914.06
Jesús Gutiérrez67914.06
Roberto Barchino79719.75
José Ramón Hilera87121.46
Salvador Otón94113.90