Memetic ComputingPub Date : 2022-04-08DOI: 10.1007/s12293-022-00363-y
R. de Winter, Philip Bronkhorst, Bas van Stein, Thomas Bäck
{"title":"Constrained Multi-Objective Optimization with a Limited Budget of Function Evaluations","authors":"R. de Winter, Philip Bronkhorst, Bas van Stein, Thomas Bäck","doi":"10.1007/s12293-022-00363-y","DOIUrl":"https://doi.org/10.1007/s12293-022-00363-y","url":null,"abstract":"","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"14 1","pages":"151 - 164"},"PeriodicalIF":4.7,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44987948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Memetic ComputingPub Date : 2022-03-05DOI: 10.1007/s12293-022-00359-8
S. Yazdani, E. Hadavandi, Mohammad Mirzaei
{"title":"CCMBO: a covariance-based clustered monarch butterfly algorithm for optimization problems","authors":"S. Yazdani, E. Hadavandi, Mohammad Mirzaei","doi":"10.1007/s12293-022-00359-8","DOIUrl":"https://doi.org/10.1007/s12293-022-00359-8","url":null,"abstract":"","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"14 1","pages":"377 - 394"},"PeriodicalIF":4.7,"publicationDate":"2022-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46478385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Memetic ComputingPub Date : 2022-02-22DOI: 10.1007/s12293-022-00357-w
Jiangjiao Xu, Ke Li, Mohammad Abusara
{"title":"Preference based multi-objective reinforcement learning for multi-microgrid system optimization problem in smart grid","authors":"Jiangjiao Xu, Ke Li, Mohammad Abusara","doi":"10.1007/s12293-022-00357-w","DOIUrl":"https://doi.org/10.1007/s12293-022-00357-w","url":null,"abstract":"<p>Grid-connected microgrids comprising renewable energy, energy storage systems and local load, play a vital role in decreasing the energy consumption of fossil diesel and greenhouse gas emissions. A distribution power network connecting several microgrids can promote more potent and reliable operations to enhance the security and privacy of the power system. However, the operation control for a multi-microgrid system is a big challenge. To design a multi-microgrid power system, an intelligent multi-microgrids energy management method is proposed based on the preference-based multi-objective reinforcement learning (PMORL) techniques. The power system model can be divided into three layers: the consumer layer, the independent system operator layer, and the power grid layer. Each layer intends to maximize its benefit. The PMORL is proposed to lead to a Pareto optimal set for each object to achieve these objectives. A non-dominated solution is decided to execute a balanced plan not to favor any particular participant. The preference-based results show that the proposed method can effectively learn different preferences. The simulation outcomes confirm the performance of the PMORL and verify the viability of the proposed method.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"1 1","pages":""},"PeriodicalIF":4.7,"publicationDate":"2022-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Memetic ComputingPub Date : 2022-02-18DOI: 10.1007/s12293-021-00350-9
Zhan WangPing, Jiang Min, Yao JunFeng, Liu KunHong, Wu QingQiang
{"title":"The design of evolutionary feature selection operator for the micro-expression recognition","authors":"Zhan WangPing, Jiang Min, Yao JunFeng, Liu KunHong, Wu QingQiang","doi":"10.1007/s12293-021-00350-9","DOIUrl":"https://doi.org/10.1007/s12293-021-00350-9","url":null,"abstract":"","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"14 1","pages":"61 - 76"},"PeriodicalIF":4.7,"publicationDate":"2022-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41366159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Memetic ComputingPub Date : 2022-02-08DOI: 10.1007/s12293-022-00360-1
Jianlin Zhang, Jie Cao, Fuqing Zhao, Zuohan Chen
{"title":"A constrained multi-objective optimization algorithm with two cooperative populations","authors":"Jianlin Zhang, Jie Cao, Fuqing Zhao, Zuohan Chen","doi":"10.1007/s12293-022-00360-1","DOIUrl":"https://doi.org/10.1007/s12293-022-00360-1","url":null,"abstract":"<p>Constrained multi-objective problems (CMOPs) require balancing convergence, diversity, and feasibility of solutions. Unfortunately, the existing constrained multi-objective optimization algorithms (CMOEAs) exhibit poor performance when solving the CMOPs with complex feasible regions. To solve this shortcoming, this work proposes an improved algorithm named the CMOEA-TCP, which maintains two populations cooperating to push the solutions to approximate the constrained Pareto front. Specifically, one population is obtained by the Pareto-based method and aims to strengthen the algorithm’s convergence ability. Meanwhile, another population is maintained by decomposition-based method and devoted to improving its diversity. The two populations work cooperatively during the entire evolution process with the constraint-handling technique. The performance of the CMOEA- TCP is verified on three benchmark suites with 34 problems. The experimental results demonstrate that the CMOEA-TCP can achieve performance comparable to or better than the other six state-of-the-art CMOEAs on the majority of considered problems.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"18 2","pages":""},"PeriodicalIF":4.7,"publicationDate":"2022-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Memetic ComputingPub Date : 2022-01-31DOI: 10.1007/s12293-022-00358-9
Haokai Hong, Kai Ye, Min Jiang, Donglin Cao, Kay Chen Tan
{"title":"Solving large-scale multiobjective optimization via the probabilistic prediction model","authors":"Haokai Hong, Kai Ye, Min Jiang, Donglin Cao, Kay Chen Tan","doi":"10.1007/s12293-022-00358-9","DOIUrl":"https://doi.org/10.1007/s12293-022-00358-9","url":null,"abstract":"","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"14 1","pages":"165 - 177"},"PeriodicalIF":4.7,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42256061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Memetic ComputingPub Date : 2022-01-29DOI: 10.1007/s12293-022-00354-z
Juanjuan Luo, Dongqing Zhou, Lingling Jiang, Huadong Ma
{"title":"A particle swarm optimization based multiobjective memetic algorithm for high-dimensional feature selection","authors":"Juanjuan Luo, Dongqing Zhou, Lingling Jiang, Huadong Ma","doi":"10.1007/s12293-022-00354-z","DOIUrl":"https://doi.org/10.1007/s12293-022-00354-z","url":null,"abstract":"<p>Feature selection, as one of the dimension reduction methods, is a crucial processing step in dealing with high-dimensional data. It tries to preserve feature subset representing the whole feature space, which aims to reduce redundancy and increase the classification accuracy. Since the two objectives are usually in conflict with each other, feature selection is modeled as a multi-objective problem. However, the high search space and discrete Pareto front makes it not easy for existing evolutionary multiobjective algorithms. Classic evolutionary computation method, which is often applied to feature selection problem straightforwardly, gradually exposes its inefficiency in searching process. Hence, a particle swarm optimization based multiobjective memetic algorithm for high-dimensional feature selection is designed in this paper to deal with above shortcomings. Its basic idea is to model feature selection as a multiobjective optimization problem by optimizing the number of features and the classification accuracy in supervised condition simultaneously, in which information entropy based initialization and adaptive local search are designed to improve the search efficiency. Moreover, a new particle velocity update rule considering both convergence and diversity of solutions is designed to update particles, and a fast discrete nondominated sorting strategy is designed to rank the Pareto solutions. These strategies enable the proposed algorithm to gain better performance on both the quality and size of feature subset. The experimental results show that the proposed algorithm can improve the quality of Pareto fronts evolved by the state-of-the-art algorithms for feature selection.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":"33 4","pages":""},"PeriodicalIF":4.7,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}