{"title":"高级贝叶斯优化算法在分解问题中的应用","authors":"J. Schwarz, Jiri Ocenasek, J. Jaros","doi":"10.1109/ECBS.2004.1316688","DOIUrl":null,"url":null,"abstract":"We deal with the usage of Bayesian optimization algorithm (BOA) and its advanced variants for solving complex NP-complete combinatorial optimization problems. We focus on the hypergraph-partitioning problem and multiprocessor scheduling problem, which belong to the class of frequently solved decomposition tasks. One of the goals is to use these problems to experimentally compare the performance of the recently proposed Mixed Bayesian optimization algorithm (MBOA) with the performance of several other evolutionary algorithms based on the estimation and sampling of probabilistic model. We also propose the utilization of prior knowledge about the structure of hypergraphs and task graphs to increase the convergence speed and the quality of solutions. The performance of knowledge based MBOA (KMBOA) algorithms on the multiprocessor scheduling problem is empirically investigated and confirmed.","PeriodicalId":137219,"journal":{"name":"Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004.","volume":"465 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Advanced Bayesian optimization algorithms applied in decomposition problems\",\"authors\":\"J. Schwarz, Jiri Ocenasek, J. Jaros\",\"doi\":\"10.1109/ECBS.2004.1316688\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We deal with the usage of Bayesian optimization algorithm (BOA) and its advanced variants for solving complex NP-complete combinatorial optimization problems. We focus on the hypergraph-partitioning problem and multiprocessor scheduling problem, which belong to the class of frequently solved decomposition tasks. One of the goals is to use these problems to experimentally compare the performance of the recently proposed Mixed Bayesian optimization algorithm (MBOA) with the performance of several other evolutionary algorithms based on the estimation and sampling of probabilistic model. We also propose the utilization of prior knowledge about the structure of hypergraphs and task graphs to increase the convergence speed and the quality of solutions. The performance of knowledge based MBOA (KMBOA) algorithms on the multiprocessor scheduling problem is empirically investigated and confirmed.\",\"PeriodicalId\":137219,\"journal\":{\"name\":\"Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004.\",\"volume\":\"465 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECBS.2004.1316688\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 11th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECBS.2004.1316688","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Advanced Bayesian optimization algorithms applied in decomposition problems
We deal with the usage of Bayesian optimization algorithm (BOA) and its advanced variants for solving complex NP-complete combinatorial optimization problems. We focus on the hypergraph-partitioning problem and multiprocessor scheduling problem, which belong to the class of frequently solved decomposition tasks. One of the goals is to use these problems to experimentally compare the performance of the recently proposed Mixed Bayesian optimization algorithm (MBOA) with the performance of several other evolutionary algorithms based on the estimation and sampling of probabilistic model. We also propose the utilization of prior knowledge about the structure of hypergraphs and task graphs to increase the convergence speed and the quality of solutions. The performance of knowledge based MBOA (KMBOA) algorithms on the multiprocessor scheduling problem is empirically investigated and confirmed.