• DocumentCode
    120886
  • Title

    Greedy Politics Optimization: Metaheuristic inspired by political strategies adopted during state assembly elections

  • Author

    Melvix, J. S. M. Lenord

  • Author_Institution
    Dept. of Electron. Eng., Anna Univ., Chennai, India
  • fYear
    2014
  • fDate
    21-22 Feb. 2014
  • Firstpage
    1157
  • Lastpage
    1162
  • Abstract
    Similar to biology inspired optimization algorithms, this paper proposes a novel metaheuristic Greedy Politics Optimization (GPO), inspired by political strategies adopted by politicians to contest in elections and form the government. Interestingly, the performance of the algorithm was found to improve when unethical practices adopted by greedy politicians were taken into account. Several benchmark multi-dimensional test functions were optimized using the proposed algorithm and the accuracy of GPO proved efficient compared to other classical metaheuristics. Performance analysis also reveals that the convergence efficiency of GPO is highly superior compared to particle swarm optimization.
  • Keywords
    government; optimisation; politics; GPO; greedy politics optimization; multi-dimensional test functions; political strategies; state assembly elections; Algorithm design and analysis; Assembly; Convergence; Genetic algorithms; Government; Nominations and elections; Optimization; Evolutionary computation; Metaheuristic; Political Competitions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advance Computing Conference (IACC), 2014 IEEE International
  • Conference_Location
    Gurgaon
  • Print_ISBN
    978-1-4799-2571-1
  • Type

    conf

  • DOI
    10.1109/IAdCC.2014.6779490
  • Filename
    6779490