A Hybrid Global Optimization Method Based on Genetic Algorithm and Shrinking Box


  •  Saleem Ramadan    

Abstract

This paper proposes a hybrid genetic algorithm method for optimizing constrained black box functions utilizing shrinking box and exterior penalty function methods (SBPGA). The constraints of the problem were incorporated in the fitness function of the genetic algorithm through the penalty function. The hybrid method used the proposed Variance-based crossover (VBC) and Arithmetic-based mutation (ABM) operators; moreover, immigration operator was also used. The box constraints constituted a hyperrectangle that kept shrinking adaptively in the light of the revealed information from the genetic algorithm about the optimal solution. The performance of the proposed algorithm was assessed using 11 problems which are used as benchmark problems in constrained optimization literatures. ANOVA along with a success rate performance index were used to analyze the model.

Based on the results, we believe that the proposed method is fairly robust and efficient global optimization method for Constrained Optimization Problems whether they are continuous or discrete.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1913-1844
  • Issn(Onlne): 1913-1852
  • Started: 2007
  • Frequency: monthly

Journal Metrics

(The data was calculated based on Google Scholar Citations)

Google-based Impact Factor (2018): 6.49

h-index (January 2018): 30

i10-index (January 2018): 163

h5-index (January 2018): 19

h5-median(January 2018): 25

Contact