{"title":"Constrained Optimization Based on Epsilon Constrained Biogeography-Based Optimization","authors":"Xiaojun Bi, Jue Wang","doi":"10.1109/IHMSC.2012.184","DOIUrl":null,"url":null,"abstract":"A new epsilon constrained biogeography-based optimization is proposed to solve constrained optimization problems. In the proposed algorithm, the epsilon constrained method is utilized to handle the constraints. Simultaneously, based on the feature of epsilon constrained method, a new ordering rule based on epsilon constrained is used to obtain the immigration rate and emigration rate. Additionally, a new dynamic migration strategy is shown to enhance the search ability of migration mechanism. Eventually, with the purpose of improving the precision of convergence, the piecewise logistic chaotic map is introduced to improve the variation mechanism. Numerical experiments on 13 well-known benchmark test function have shown that the proposed algorithm is competitive with other optimization algorithms. Furthermore, the proposed algorithm can avoid effectively the convergence before the optimal results have been found, and balance the exploitation and the exploration.","PeriodicalId":431532,"journal":{"name":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 4th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2012.184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
A new epsilon constrained biogeography-based optimization is proposed to solve constrained optimization problems. In the proposed algorithm, the epsilon constrained method is utilized to handle the constraints. Simultaneously, based on the feature of epsilon constrained method, a new ordering rule based on epsilon constrained is used to obtain the immigration rate and emigration rate. Additionally, a new dynamic migration strategy is shown to enhance the search ability of migration mechanism. Eventually, with the purpose of improving the precision of convergence, the piecewise logistic chaotic map is introduced to improve the variation mechanism. Numerical experiments on 13 well-known benchmark test function have shown that the proposed algorithm is competitive with other optimization algorithms. Furthermore, the proposed algorithm can avoid effectively the convergence before the optimal results have been found, and balance the exploitation and the exploration.