{"title":"Modified grasshopper optimisation algorithm","authors":"Rajani Kumari, Sandeep Kumar, A. Nayyar","doi":"10.1145/3415088.3415092","DOIUrl":null,"url":null,"abstract":"The grasshopper optimization algorithm (GOA) mimics the foraging behavior of grasshopper insects. It is one of the youngest and widespread algorithms for optimization. In GOA exploration and exploitation depends on coefficient c used in position update process. So as to improve balancing in exploration and exploitation this paper introduced modified coefficient c for fine tuning these to contradictory process while searching for optimum solution. The new value of c is decided adaptively and stimulated by hyperbolic function. The anticipated algorithm is named as modified GOA (mGOA) and tested over a standard set of benchmark problems. Outcomes proves that mGOA outperformed considered algorithm for more than 90% problems.","PeriodicalId":274948,"journal":{"name":"Proceedings of the 2nd International Conference on Intelligent and Innovative Computing Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Intelligent and Innovative Computing Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3415088.3415092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The grasshopper optimization algorithm (GOA) mimics the foraging behavior of grasshopper insects. It is one of the youngest and widespread algorithms for optimization. In GOA exploration and exploitation depends on coefficient c used in position update process. So as to improve balancing in exploration and exploitation this paper introduced modified coefficient c for fine tuning these to contradictory process while searching for optimum solution. The new value of c is decided adaptively and stimulated by hyperbolic function. The anticipated algorithm is named as modified GOA (mGOA) and tested over a standard set of benchmark problems. Outcomes proves that mGOA outperformed considered algorithm for more than 90% problems.