K. Y. Kok, P. Rajendran, R. Rainis, Wan Mohd Muhiyuddin Wan Ibrahim
{"title":"Investigation on selection schemes and population sizes for genetic algorithm in unmanned aerial vehicle path planning","authors":"K. Y. Kok, P. Rajendran, R. Rainis, Wan Mohd Muhiyuddin Wan Ibrahim","doi":"10.1109/ISTMET.2015.7358990","DOIUrl":null,"url":null,"abstract":"Genetic algorithm has been widely used in numerous fields. Recently, researchers have developed significant interest in applying GA in unmanned aerial vehicle path planning. However, experiments should be conducted to determine selection schemes and population sizes. This process is time consuming and inconvenient for users. Thus, a study is conducted on the performance of GA at various selection schemes and population sizes. Results show that large population sizes do not contribute in improving the performance of GA. Tournament selection shows the highest performance in terms of path cost, whereas the weakest performance is in terms of computational cost. Truncation selection shows the optimum performance among the selection schemes.","PeriodicalId":302732,"journal":{"name":"2015 International Symposium on Technology Management and Emerging Technologies (ISTMET)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Symposium on Technology Management and Emerging Technologies (ISTMET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTMET.2015.7358990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Genetic algorithm has been widely used in numerous fields. Recently, researchers have developed significant interest in applying GA in unmanned aerial vehicle path planning. However, experiments should be conducted to determine selection schemes and population sizes. This process is time consuming and inconvenient for users. Thus, a study is conducted on the performance of GA at various selection schemes and population sizes. Results show that large population sizes do not contribute in improving the performance of GA. Tournament selection shows the highest performance in terms of path cost, whereas the weakest performance is in terms of computational cost. Truncation selection shows the optimum performance among the selection schemes.