{"title":"Trends and challenges in dynamic optimization problems","authors":"Ramoza Ahsan, W. Shahzad, A. R. Baig","doi":"10.1109/HIS.2011.6122119","DOIUrl":null,"url":null,"abstract":"This paper presents the challenges and problems faced in dynamic environment optimization problems. Real world problems are mostly dynamic thus such algorithms are required which can track the moving optima. Classical Optimization algorithm searches sequentially for the solution and are based on differential equations. In order to track the moving optima algorithm will have to be restarted and there is no guarantee that algorithm will find the optimum solution. On the other, Evolutionary algorithms are more suitable for such kind of problems as they can find the multiple optima in parallel. Evolutionary algorithms can track the optima and then repeatedly balance the need to exploit known optima with the need to search for new optima. A number of techniques have been proposed to deal with the dynamic environment problems. Different challenges and problems faced in dynamic environment whether it is for a multimodal functions or multi-objective have been discussed here.","PeriodicalId":418397,"journal":{"name":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on Hybrid Intelligent Systems (HIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2011.6122119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This paper presents the challenges and problems faced in dynamic environment optimization problems. Real world problems are mostly dynamic thus such algorithms are required which can track the moving optima. Classical Optimization algorithm searches sequentially for the solution and are based on differential equations. In order to track the moving optima algorithm will have to be restarted and there is no guarantee that algorithm will find the optimum solution. On the other, Evolutionary algorithms are more suitable for such kind of problems as they can find the multiple optima in parallel. Evolutionary algorithms can track the optima and then repeatedly balance the need to exploit known optima with the need to search for new optima. A number of techniques have been proposed to deal with the dynamic environment problems. Different challenges and problems faced in dynamic environment whether it is for a multimodal functions or multi-objective have been discussed here.