Nedim Srndic, Emir Pandzo, Mirza Dervisevic, S. Konjicija
{"title":"并行遗传算法在小学班级排课中的应用:粗粒度方法","authors":"Nedim Srndic, Emir Pandzo, Mirza Dervisevic, S. Konjicija","doi":"10.1109/ICAT.2009.5348396","DOIUrl":null,"url":null,"abstract":"This paper describes the application of a parallel genetic algorithm that solves the weekly timetable construction problem for elementary schools. Timetable construction is NP-complete and highly constrained problem, and therefore represents a computationally intensive task. A Parallel Genetic Algorithm (PGA) is proposed with specific methods for chromosome representation and fitness evaluation, and specific recombination and mutation operators. The proposed solution uses a coarse grained PGA, which is suitable for execution on a Beowulf cluster. Experimental results are provided, with a comparison of serial and parallel execution times for the same algorithm.","PeriodicalId":211842,"journal":{"name":"2009 XXII International Symposium on Information, Communication and Automation Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"The application of a Parallel Genetic Algorithm to timetabling of elementary school classes: A coarse grained approach\",\"authors\":\"Nedim Srndic, Emir Pandzo, Mirza Dervisevic, S. Konjicija\",\"doi\":\"10.1109/ICAT.2009.5348396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes the application of a parallel genetic algorithm that solves the weekly timetable construction problem for elementary schools. Timetable construction is NP-complete and highly constrained problem, and therefore represents a computationally intensive task. A Parallel Genetic Algorithm (PGA) is proposed with specific methods for chromosome representation and fitness evaluation, and specific recombination and mutation operators. The proposed solution uses a coarse grained PGA, which is suitable for execution on a Beowulf cluster. Experimental results are provided, with a comparison of serial and parallel execution times for the same algorithm.\",\"PeriodicalId\":211842,\"journal\":{\"name\":\"2009 XXII International Symposium on Information, Communication and Automation Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 XXII International Symposium on Information, Communication and Automation Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAT.2009.5348396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 XXII International Symposium on Information, Communication and Automation Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAT.2009.5348396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The application of a Parallel Genetic Algorithm to timetabling of elementary school classes: A coarse grained approach
This paper describes the application of a parallel genetic algorithm that solves the weekly timetable construction problem for elementary schools. Timetable construction is NP-complete and highly constrained problem, and therefore represents a computationally intensive task. A Parallel Genetic Algorithm (PGA) is proposed with specific methods for chromosome representation and fitness evaluation, and specific recombination and mutation operators. The proposed solution uses a coarse grained PGA, which is suitable for execution on a Beowulf cluster. Experimental results are provided, with a comparison of serial and parallel execution times for the same algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
