{"title":"最小权值三角剖分的遗传算法","authors":"K. Qin, Wenping Wang, Minglun Gong","doi":"10.1109/ICEC.1997.592370","DOIUrl":null,"url":null,"abstract":"In this paper, a new method for the minimum weight triangulation of points on a plane, called genetic minimum weight triangulation (GMWT), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"A genetic algorithm for the minimum weight triangulation\",\"authors\":\"K. Qin, Wenping Wang, Minglun Gong\",\"doi\":\"10.1109/ICEC.1997.592370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new method for the minimum weight triangulation of points on a plane, called genetic minimum weight triangulation (GMWT), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm.\",\"PeriodicalId\":167852,\"journal\":{\"name\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1997.592370\",\"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 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1997.592370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A genetic algorithm for the minimum weight triangulation
In this paper, a new method for the minimum weight triangulation of points on a plane, called genetic minimum weight triangulation (GMWT), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm.