{"title":"A Teaching-Learning-Based Optimization with Uniform Design for Solving Constrained Optimization Problems","authors":"Liping Jia, Zhonghua Li","doi":"10.1109/CIS.2017.00058","DOIUrl":null,"url":null,"abstract":"As a newly developed population-based metaheuristic algorithm, teaching-learning-based optimization (TBLO) has been gained extensively attention since it was proposed in 2011. It has been applied to many optimal problems and a lot of algorithms have also been designed to solve these real-world problems. In this paper, TBLO with uniform design is proposed for solving constrained optimization problems. The performance of the proposed algorithm is checked by experiments with two type of different benchmark problems under the criteria of best, mean, worst, function evaluations and ratio of feasible search space. Compared results are given to illustrate the efficiency of the proposed algorithm.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2017.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
As a newly developed population-based metaheuristic algorithm, teaching-learning-based optimization (TBLO) has been gained extensively attention since it was proposed in 2011. It has been applied to many optimal problems and a lot of algorithms have also been designed to solve these real-world problems. In this paper, TBLO with uniform design is proposed for solving constrained optimization problems. The performance of the proposed algorithm is checked by experiments with two type of different benchmark problems under the criteria of best, mean, worst, function evaluations and ratio of feasible search space. Compared results are given to illustrate the efficiency of the proposed algorithm.