Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870308
S. Samarakoon, M. Muthugala, M. R. Elara
Area coverage is essential for robots used in cleaning, painting, and exploration applications. Reconfigurable robots have been introduced to solve the area coverage limitation of fixed-shape robots. The existing global coverage algorithms of reconfigurable robots are limited to consideration of a limited set of predefined shapes for the reconfiguration and do not consider the exact geometrical shape of obstacles. Therefore, degraded coverage performance could be observed from the existing methods. On the other hand, the coverage methods that consider reconfiguring beyond a limited set of predefined shapes are limited to local coverage. Furthermore, these methods only consider a single reconfiguration for the coverage. Therefore, this paper proposes a novel coverage method for a reconfigurable robot consisting of both global and local path planners. The global path planner uses boustrophedon motion combined with the A * algorithm. The optimum grid positioning that maximizes the global coverage is determined through a Genetic Algorithm (GA). The local coverage planner performs continuous reconfig-uration of the robot to adequately cover obstacle zones while navigating through narrow spaces without collisions. A GA is used to determine the reconfiguration parameters of the robot at each instance of the local coverage. Simulation results confirm that the proposed method is effective in performing both global and local coverage path planning for improving the area coverage performance.
{"title":"Global and Local Area Coverage Path Planner for a Reconfigurable Robot","authors":"S. Samarakoon, M. Muthugala, M. R. Elara","doi":"10.1109/CEC55065.2022.9870308","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870308","url":null,"abstract":"Area coverage is essential for robots used in cleaning, painting, and exploration applications. Reconfigurable robots have been introduced to solve the area coverage limitation of fixed-shape robots. The existing global coverage algorithms of reconfigurable robots are limited to consideration of a limited set of predefined shapes for the reconfiguration and do not consider the exact geometrical shape of obstacles. Therefore, degraded coverage performance could be observed from the existing methods. On the other hand, the coverage methods that consider reconfiguring beyond a limited set of predefined shapes are limited to local coverage. Furthermore, these methods only consider a single reconfiguration for the coverage. Therefore, this paper proposes a novel coverage method for a reconfigurable robot consisting of both global and local path planners. The global path planner uses boustrophedon motion combined with the A * algorithm. The optimum grid positioning that maximizes the global coverage is determined through a Genetic Algorithm (GA). The local coverage planner performs continuous reconfig-uration of the robot to adequately cover obstacle zones while navigating through narrow spaces without collisions. A GA is used to determine the reconfiguration parameters of the robot at each instance of the local coverage. Simulation results confirm that the proposed method is effective in performing both global and local coverage path planning for improving the area coverage performance.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114398247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870315
Jonathan Carrero, Ismael Rodríguez, F. Rubio
In multi-agent resource allocation systems, it is reasonable that the specific allocation of resources depends on the utility functions declared by the different agents. However, this can easily lead to strategic behaviors in which the agents involved are interested in lying, since such lies can bring them more profitable deals. In this paper we analyze the case of egalitarian social welfare, where the objective is to maximize the utility of the agent who receives the least utility. In this context, agents can obtain advantages by undervaluing their preferences. Thus, we will see how to discourage such lies even in the presence of public goods and non-additive utilities. Likewise, we will use genetic algorithms to show, through experimental results, the robustness of our proposal against lies.
{"title":"Avoiding strategic behaviors in the egalitarian social welfare under public resources and non-additive utilities","authors":"Jonathan Carrero, Ismael Rodríguez, F. Rubio","doi":"10.1109/CEC55065.2022.9870315","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870315","url":null,"abstract":"In multi-agent resource allocation systems, it is reasonable that the specific allocation of resources depends on the utility functions declared by the different agents. However, this can easily lead to strategic behaviors in which the agents involved are interested in lying, since such lies can bring them more profitable deals. In this paper we analyze the case of egalitarian social welfare, where the objective is to maximize the utility of the agent who receives the least utility. In this context, agents can obtain advantages by undervaluing their preferences. Thus, we will see how to discourage such lies even in the presence of public goods and non-additive utilities. Likewise, we will use genetic algorithms to show, through experimental results, the robustness of our proposal against lies.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117275064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870207
Kohei Fukuhara, Ryo Kumagai, Fukawa Yuta, S. Tanabe, Hiroki Kawano, Yoshihiro Ohta, Hiroyuki Sato
This work addresses a real-world building facility control problem by using evolutionary algorithms. The variables are facility control parameters, such as the start/stop time of air-conditioning, lighting, and ventilation operation, etc. The problem has six objectives: annual energy consumption, elec-tricity cost, overall satisfaction, thermal satisfaction, indoor air quality satisfaction, and lighting satisfaction. The problem has five constraints: power consumption, temperature, humidity, $mathbf{CO}_{2}$ concentration, and average illuminance. To solve the problem, we utilize IBEA framework. For efficient solution generation, we employ the steady-state model for IBEA. We propose the total constraint win-loss rank for multiple constraints to treat multiple constraints equally. Experimental results on artificial test problems and building facility control problems show that the proposed constraint IBEA with steady-state and total con-straint win-loss rank archives better search performance than conventional representative algorithms.
{"title":"Digital Twin Based Evolutionary Building Facility Control Optimization","authors":"Kohei Fukuhara, Ryo Kumagai, Fukawa Yuta, S. Tanabe, Hiroki Kawano, Yoshihiro Ohta, Hiroyuki Sato","doi":"10.1109/CEC55065.2022.9870207","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870207","url":null,"abstract":"This work addresses a real-world building facility control problem by using evolutionary algorithms. The variables are facility control parameters, such as the start/stop time of air-conditioning, lighting, and ventilation operation, etc. The problem has six objectives: annual energy consumption, elec-tricity cost, overall satisfaction, thermal satisfaction, indoor air quality satisfaction, and lighting satisfaction. The problem has five constraints: power consumption, temperature, humidity, $mathbf{CO}_{2}$ concentration, and average illuminance. To solve the problem, we utilize IBEA framework. For efficient solution generation, we employ the steady-state model for IBEA. We propose the total constraint win-loss rank for multiple constraints to treat multiple constraints equally. Experimental results on artificial test problems and building facility control problems show that the proposed constraint IBEA with steady-state and total con-straint win-loss rank archives better search performance than conventional representative algorithms.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117309164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870219
Julian Blank, K. Deb
Metaheuristics are known to be effective for solving a broad category of optimization problems. However, most heuristics require different parameter settings appropriately for a problem class or even for a specific problem. Researchers address this commonly by performing a parameter tuning study (also known as hyper-parameter optimization) or developing a parameter control mechanism that changes parameters dynamically. Whereas parameter tuning is computationally expensive and limits the parameter configuration to stay constant throughout the run, parameter control is also a challenging task because all dynamics induced by various operators must be learned to make an appropriate adaptation of parameters on the fly. This paper investigates parameter tuning and control for a well-known optimization method - differential evolution (DE). In contrast to most existing DE practices, an additional individualistic evolutionary operator called polynomial mutation is incorporated into the offspring creation. Results on test problems with up to 50 variables indicate that mutation can be helpful for multi-modal problems to escape from local optima. On the one hand, the effectiveness of parameter tuning for a specific problem becomes apparent; on the other hand, its generalization capabilities seem to be limited. Moreover, a generic coevolutionary approach for parameter control outperforms a random choice of parameters. Recognizing the importance of choosing a suitable parameter configuration to solve any optimization problem, we have incorporated a standard implementation of both tuning and control approaches into a single framework, providing a direction for the evolutionary computation and optimization researchers to use and further investigate the effects of parameters on DE and other metaheuristics-based algorithms.
{"title":"Parameter Tuning and Control: A Case Study on Differential Evolution With Polynomial Mutation","authors":"Julian Blank, K. Deb","doi":"10.1109/CEC55065.2022.9870219","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870219","url":null,"abstract":"Metaheuristics are known to be effective for solving a broad category of optimization problems. However, most heuristics require different parameter settings appropriately for a problem class or even for a specific problem. Researchers address this commonly by performing a parameter tuning study (also known as hyper-parameter optimization) or developing a parameter control mechanism that changes parameters dynamically. Whereas parameter tuning is computationally expensive and limits the parameter configuration to stay constant throughout the run, parameter control is also a challenging task because all dynamics induced by various operators must be learned to make an appropriate adaptation of parameters on the fly. This paper investigates parameter tuning and control for a well-known optimization method - differential evolution (DE). In contrast to most existing DE practices, an additional individualistic evolutionary operator called polynomial mutation is incorporated into the offspring creation. Results on test problems with up to 50 variables indicate that mutation can be helpful for multi-modal problems to escape from local optima. On the one hand, the effectiveness of parameter tuning for a specific problem becomes apparent; on the other hand, its generalization capabilities seem to be limited. Moreover, a generic coevolutionary approach for parameter control outperforms a random choice of parameters. Recognizing the importance of choosing a suitable parameter configuration to solve any optimization problem, we have incorporated a standard implementation of both tuning and control approaches into a single framework, providing a direction for the evolutionary computation and optimization researchers to use and further investigate the effects of parameters on DE and other metaheuristics-based algorithms.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121613872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870369
Bo Sun, Wei Li, Y. Huang
Particle swarm optimization has been extensively noticed for its fast convergence speed with few parameters. However, it would be plagued by the premature convergence only affected by the global particles. In this study, Composite Proactive Particles in Swarm Optimization (Co-PPSO) is proposed. In Co-PPSO, the composite strategy framework is embedded into Proactive Particles in Swarm Optimization (PPSO), that is, three learning strategies are proposed to evaluate their differences and select the most suitable one for each particle. In addition, an elite group is constructed to make the particles jump out of the situation that they are only affected by the global best one in the particle swarm, and further improve the convergence accuracy. CEC2022 competition of single objective bound-constrained numerical optimization is employed to test the effect of 10-$D$ and 20-$D$ optimization, and four well-known PSO variants were used for comparison. The experimental results show that the Co-PPSO has certain competitiveness to improve premature convergence.
粒子群算法以其收敛速度快、参数少而受到广泛关注。但是，它会受到仅受全局粒子影响的过早收敛的困扰。本研究提出了一种复合主动粒子群优化算法(Co-PPSO)。在Co-PPSO中，将复合策略框架嵌入到主动粒子群优化(Proactive Particles In Swarm Optimization, PPSO)中，提出了三种学习策略来评估它们之间的差异，并为每个粒子选择最合适的学习策略。此外，构造了一个精英群，使粒子群跳出了粒子群中只受全局最优粒子影响的局面，进一步提高了收敛精度。采用CEC2022竞争单目标约束数值优化来测试10-$D$和20-$D$优化的效果，并使用四种知名的PSO变体进行比较。实验结果表明，Co-PPSO在改善过早收敛方面具有一定的竞争力。
{"title":"Performance of Composite PPSO on Single Objective Bound Constrained Numerical Optimization Problems of CEC 2022","authors":"Bo Sun, Wei Li, Y. Huang","doi":"10.1109/CEC55065.2022.9870369","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870369","url":null,"abstract":"Particle swarm optimization has been extensively noticed for its fast convergence speed with few parameters. However, it would be plagued by the premature convergence only affected by the global particles. In this study, Composite Proactive Particles in Swarm Optimization (Co-PPSO) is proposed. In Co-PPSO, the composite strategy framework is embedded into Proactive Particles in Swarm Optimization (PPSO), that is, three learning strategies are proposed to evaluate their differences and select the most suitable one for each particle. In addition, an elite group is constructed to make the particles jump out of the situation that they are only affected by the global best one in the particle swarm, and further improve the convergence accuracy. CEC2022 competition of single objective bound-constrained numerical optimization is employed to test the effect of 10-$D$ and 20-$D$ optimization, and four well-known PSO variants were used for comparison. The experimental results show that the Co-PPSO has certain competitiveness to improve premature convergence.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122642682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870285
Brendan Rogers, N. Noman, S. Chalup, P. Moscato
Deep Neural Networks (DNN) require specifically tuned architectures and hyperparameters when being applied to any given task. Nature-inspired algorithms have been successfully applied for optimising various hyperparameters in different types of DNNs such as convolutional and recurrent for sentence classification. Hybrid networks, which contain multiple types of neural architectures have more recently been used for sentence classification in order to achieve better performance. However, the inclusion of hybrid architectures creates numerous possibilities of designing the network and those sub-networks also need fine-tuning. At present these hybrid networks are designed manually and various organisation attempts are noticed. In order to understand the benefit and the best design principle of such hybrid DNNs for sentence classification, in this work we used an Evolutionary Algorithm (EA) to optimise the topology and various hyperparameters in different types of layers within the network. In our experiments, the proposed EA designed the hybrid networks by using a single dataset and evaluated the evolved networks on multiple other datasets to validate their generalisation capability. We compared the EA-designed hybrid networks with human-designed hybrid networks in addition to other EA-optimised and expert-designed non-hybrid architectures.
{"title":"Joint Optimization of Topology and Hyperparameters of Hybrid DNNs for Sentence Classification","authors":"Brendan Rogers, N. Noman, S. Chalup, P. Moscato","doi":"10.1109/CEC55065.2022.9870285","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870285","url":null,"abstract":"Deep Neural Networks (DNN) require specifically tuned architectures and hyperparameters when being applied to any given task. Nature-inspired algorithms have been successfully applied for optimising various hyperparameters in different types of DNNs such as convolutional and recurrent for sentence classification. Hybrid networks, which contain multiple types of neural architectures have more recently been used for sentence classification in order to achieve better performance. However, the inclusion of hybrid architectures creates numerous possibilities of designing the network and those sub-networks also need fine-tuning. At present these hybrid networks are designed manually and various organisation attempts are noticed. In order to understand the benefit and the best design principle of such hybrid DNNs for sentence classification, in this work we used an Evolutionary Algorithm (EA) to optimise the topology and various hyperparameters in different types of layers within the network. In our experiments, the proposed EA designed the hybrid networks by using a single dataset and evaluated the evolved networks on multiple other datasets to validate their generalisation capability. We compared the EA-designed hybrid networks with human-designed hybrid networks in addition to other EA-optimised and expert-designed non-hybrid architectures.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122913652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870405
P. Krömer, Vojtěch Uher
The traveling salesman problem (TSP) is an iconic permutation problem with a number of applications in planning, scheduling, and logistics. It has also attracted much attention as a benchmarking problem frequently used to assess the properties of a variety of nature-inspired optimization methods. However, the standard libraries of TSP instances, such as the TSPLIB, are often decades old and might not reflect the requirements of modern real-world applications very well. In this work, we introduce several novel TSP instances representing real-world locations of pharmacies in several major cities of the Czech Republic. We look for the optimum routes between the pharmacies by selected nature-inspired algorithms and compare the results obtained on the real-world instances with their results on standard TSPLIB instances.
{"title":"Optimization of real-world supply routes by nature-inspired metaheuristics","authors":"P. Krömer, Vojtěch Uher","doi":"10.1109/CEC55065.2022.9870405","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870405","url":null,"abstract":"The traveling salesman problem (TSP) is an iconic permutation problem with a number of applications in planning, scheduling, and logistics. It has also attracted much attention as a benchmarking problem frequently used to assess the properties of a variety of nature-inspired optimization methods. However, the standard libraries of TSP instances, such as the TSPLIB, are often decades old and might not reflect the requirements of modern real-world applications very well. In this work, we introduce several novel TSP instances representing real-world locations of pharmacies in several major cities of the Czech Republic. We look for the optimum routes between the pharmacies by selected nature-inspired algorithms and compare the results obtained on the real-world instances with their results on standard TSPLIB instances.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129992182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870414
Xinyang Du, Ruibin Bai, Tianxiang Cui, R. Qu, Jiawei Li
A competitive traveling salesmen problem is a variant of traveling salesman problem in that multiple agents compete with each other in visiting a number of cities. The agent who is the first one to visit a city will receive a reward. Each agent aims to collect as more rewards as possible with the minimum traveling distance. There is still not effective algorithms for this complicated decision making problem. We investigate an improved ant colony approach for the competitive traveling sales-men problem which adopts a time dominance mechanism and a revised pheromone depositing method to improve the quality of solutions with less computational complexity. Simulation results show that the proposed algorithm outperforms the state of art algorithms.
{"title":"An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem","authors":"Xinyang Du, Ruibin Bai, Tianxiang Cui, R. Qu, Jiawei Li","doi":"10.1109/CEC55065.2022.9870414","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870414","url":null,"abstract":"A competitive traveling salesmen problem is a variant of traveling salesman problem in that multiple agents compete with each other in visiting a number of cities. The agent who is the first one to visit a city will receive a reward. Each agent aims to collect as more rewards as possible with the minimum traveling distance. There is still not effective algorithms for this complicated decision making problem. We investigate an improved ant colony approach for the competitive traveling sales-men problem which adopts a time dominance mechanism and a revised pheromone depositing method to improve the quality of solutions with less computational complexity. Simulation results show that the proposed algorithm outperforms the state of art algorithms.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124658217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-18DOI: 10.1109/CEC55065.2022.9870436
Hao Hao, Shuai Wang, Bingdong Li, Aimin Zhou
The estimation of distribution algorithm (EDA) is an efficient heuristic method for handling black-box optimization problems since the ability for global population distribution modeling and gradient-free searching. However, the trial and error search mechanism relies on a large number of function evaluations, which is a considerable challenge under expensive black-box problems. Therefore, this article presents a surrogate assisted EDA with multi-acquisition functions. Firstly, a variable-width histogram is used as the global distribution model that focuses on promising areas. Next, the evaluated-free local search method improves the quality of new generation solutions. Fi-nally, model management with multiple acquisitions maintains global and local exploration preferences. Several commonly used benchmark functions with 20 and 50 dimensions are adopted to evaluate the proposed algorithm compared with several state-of-the-art surrogate assisted evaluation algorithms (SAEAs) and Bayesian optimization method. In addition, a rover trajectories optimizing problem is used to verify the ability to solve complex problems. The experimental results demonstrate the superiority of the proposed algorithm over these comparison algorithms.
{"title":"A Surrogate Model Assisted Estimation of Distribution Algorithm with Mutil-acquisition Functions for Expensive Optimization","authors":"Hao Hao, Shuai Wang, Bingdong Li, Aimin Zhou","doi":"10.1109/CEC55065.2022.9870436","DOIUrl":"https://doi.org/10.1109/CEC55065.2022.9870436","url":null,"abstract":"The estimation of distribution algorithm (EDA) is an efficient heuristic method for handling black-box optimization problems since the ability for global population distribution modeling and gradient-free searching. However, the trial and error search mechanism relies on a large number of function evaluations, which is a considerable challenge under expensive black-box problems. Therefore, this article presents a surrogate assisted EDA with multi-acquisition functions. Firstly, a variable-width histogram is used as the global distribution model that focuses on promising areas. Next, the evaluated-free local search method improves the quality of new generation solutions. Fi-nally, model management with multiple acquisitions maintains global and local exploration preferences. Several commonly used benchmark functions with 20 and 50 dimensions are adopted to evaluate the proposed algorithm compared with several state-of-the-art surrogate assisted evaluation algorithms (SAEAs) and Bayesian optimization method. In addition, a rover trajectories optimizing problem is used to verify the ability to solve complex problems. The experimental results demonstrate the superiority of the proposed algorithm over these comparison algorithms.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128707315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：