Naru Okumura, Tomoaki Takagi, Yoshihiro Ohta, Hiroyuki Sato
{"title":"Pareto Front Upconvert on Multi-objective Building Facility Control Optimization","authors":"Naru Okumura, Tomoaki Takagi, Yoshihiro Ohta, Hiroyuki Sato","doi":"10.1145/3583133.3596339","DOIUrl":null,"url":null,"abstract":"This paper verified the effects of a supervised multi-objective optimization algorithm (SMOA) efficiently upconverting the Pareto front representation by utilizing known solutions on a real-world multi-objective building facility control optimization problem. Also, several sampling methods for evaluating promising candidate solutions in SMOA were proposed and compared. Evolutionary variations, such as crossover and mutation involving randomness, are not preferred in practical scenarios, particularly when the objective functions are computationally expensive. In order to suppress obtaining inferior solutions, SMOA constructs the Pareto front and Pareto set estimation models using known solutions, samples promising candidate solutions, and evaluates them. It was reported that SMOA could efficiently generate well-distributed solutions that upconvert the Pareto front representation compared to evolutionary variations with limited solution evaluations in artificial test problems. This paper focuses on the real-world building facility control problem with 15 known solutions, and results show that SMOA can efficiently improve the Pareto front representation compared to evolutionary variations. Also, results show that crowding distance-based one-time sampling considering the distribution of the known solutions achieved the best Pareto front approximation performance in the sampling methods compared in this paper.","PeriodicalId":422029,"journal":{"name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","volume":"400 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583133.3596339","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper verified the effects of a supervised multi-objective optimization algorithm (SMOA) efficiently upconverting the Pareto front representation by utilizing known solutions on a real-world multi-objective building facility control optimization problem. Also, several sampling methods for evaluating promising candidate solutions in SMOA were proposed and compared. Evolutionary variations, such as crossover and mutation involving randomness, are not preferred in practical scenarios, particularly when the objective functions are computationally expensive. In order to suppress obtaining inferior solutions, SMOA constructs the Pareto front and Pareto set estimation models using known solutions, samples promising candidate solutions, and evaluates them. It was reported that SMOA could efficiently generate well-distributed solutions that upconvert the Pareto front representation compared to evolutionary variations with limited solution evaluations in artificial test problems. This paper focuses on the real-world building facility control problem with 15 known solutions, and results show that SMOA can efficiently improve the Pareto front representation compared to evolutionary variations. Also, results show that crowding distance-based one-time sampling considering the distribution of the known solutions achieved the best Pareto front approximation performance in the sampling methods compared in this paper.