{"title":"Multi-objective Optimization Research and Applied in Cloud Computing","authors":"Guang Peng","doi":"10.1109/ISSREW.2019.00051","DOIUrl":null,"url":null,"abstract":"In many real-life applications, a decision maker often needs to handle different conflicting objectives. Problems with more than one conflicting objective are called multi-objective optimization problems (MOPs). Multi-objective evolutionary algorithms (MOEAs) have been developed for solving MOPs. MOEAs have been shown to perform well on some MOPs with two or three objectives; however, MOEAs have substantial difficulties for tackling MOPs with more than three objectives, often referred to as many-objective problems (MaOPs) nowadays. In my thesis, first, I plan to propose an efficient multi-objective artificial bee colony algorithm based on decomposition for solving MOPs. Then, another effective adaptive many-objective evolutionary algorithm is designed to deal with MaOPs. What's more, based on defining a multi-objective optimization model of task scheduling in cloud computing, I use an improved particle swarm optimization algorithm to solve the model. Finally, I try to establish a many-objective optimization model of offloading in mobile edge computing, and find a suitable many-objective evolutionary algorithm for solving it. The proposed algorithms are compared to several state-of-the-art algorithms on these models. The experimental results will show the efficiency and effectiveness of the proposed algorithms.","PeriodicalId":166239,"journal":{"name":"2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"20 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSREW.2019.00051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In many real-life applications, a decision maker often needs to handle different conflicting objectives. Problems with more than one conflicting objective are called multi-objective optimization problems (MOPs). Multi-objective evolutionary algorithms (MOEAs) have been developed for solving MOPs. MOEAs have been shown to perform well on some MOPs with two or three objectives; however, MOEAs have substantial difficulties for tackling MOPs with more than three objectives, often referred to as many-objective problems (MaOPs) nowadays. In my thesis, first, I plan to propose an efficient multi-objective artificial bee colony algorithm based on decomposition for solving MOPs. Then, another effective adaptive many-objective evolutionary algorithm is designed to deal with MaOPs. What's more, based on defining a multi-objective optimization model of task scheduling in cloud computing, I use an improved particle swarm optimization algorithm to solve the model. Finally, I try to establish a many-objective optimization model of offloading in mobile edge computing, and find a suitable many-objective evolutionary algorithm for solving it. The proposed algorithms are compared to several state-of-the-art algorithms on these models. The experimental results will show the efficiency and effectiveness of the proposed algorithms.