{"title":"寻找图中中心顶点的球收缩遗传搜索算法","authors":"A. Vlasov, A. Khomchenko, A. Faizliev, S. Mironov","doi":"10.2991/ahcs.k.191206.017","DOIUrl":null,"url":null,"abstract":"The paper proposes a genetic algorithm (GA) for finding central vertices in a graph. The algorithm uses a different approach to the method presentation of the solution and describes a new look at the crossover process of GA. The algorithm was compared with existing exact and other genetic algorithms on various random graphs. Empirical results show that this approach can be used in applications and compete with existing algorithms.","PeriodicalId":287734,"journal":{"name":"Proceedings of the Fourth Workshop on Computer Modelling in Decision Making (CMDM 2019)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Ball-Shrinking Genetic Search Algorithm for Finding Central Vertices in Graphs\",\"authors\":\"A. Vlasov, A. Khomchenko, A. Faizliev, S. Mironov\",\"doi\":\"10.2991/ahcs.k.191206.017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a genetic algorithm (GA) for finding central vertices in a graph. The algorithm uses a different approach to the method presentation of the solution and describes a new look at the crossover process of GA. The algorithm was compared with existing exact and other genetic algorithms on various random graphs. Empirical results show that this approach can be used in applications and compete with existing algorithms.\",\"PeriodicalId\":287734,\"journal\":{\"name\":\"Proceedings of the Fourth Workshop on Computer Modelling in Decision Making (CMDM 2019)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth Workshop on Computer Modelling in Decision Making (CMDM 2019)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2991/ahcs.k.191206.017\",\"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 of the Fourth Workshop on Computer Modelling in Decision Making (CMDM 2019)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/ahcs.k.191206.017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ball-Shrinking Genetic Search Algorithm for Finding Central Vertices in Graphs
The paper proposes a genetic algorithm (GA) for finding central vertices in a graph. The algorithm uses a different approach to the method presentation of the solution and describes a new look at the crossover process of GA. The algorithm was compared with existing exact and other genetic algorithms on various random graphs. Empirical results show that this approach can be used in applications and compete with existing algorithms.