{"title":"考试排课问题的混合把握和分散搜索","authors":"D. Hadjidj, H. Drias","doi":"10.1109/ICMWI.2010.5648136","DOIUrl":null,"url":null,"abstract":"In this paper we describe a new hybrid evolutionary algorithm and its implementation for the NP hard exam timetabling problem. This approach uses the good features of the Greedy Randomized Adaptive Search Procedure (GRASP) and the evolutionary Scatter Search (SS) approach which uses strategies for search diversification and intensification to maintain and evolve a population of solutions. New solutions are improved before replacing others according to their quality and diversity. The implementation of the algorithm has been experimented on the popular Carter's benchmarks and compared with the best recent results.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A hybrid Grasp and Scatter Search for the exam timetabling problem\",\"authors\":\"D. Hadjidj, H. Drias\",\"doi\":\"10.1109/ICMWI.2010.5648136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe a new hybrid evolutionary algorithm and its implementation for the NP hard exam timetabling problem. This approach uses the good features of the Greedy Randomized Adaptive Search Procedure (GRASP) and the evolutionary Scatter Search (SS) approach which uses strategies for search diversification and intensification to maintain and evolve a population of solutions. New solutions are improved before replacing others according to their quality and diversity. The implementation of the algorithm has been experimented on the popular Carter's benchmarks and compared with the best recent results.\",\"PeriodicalId\":404577,\"journal\":{\"name\":\"2010 International Conference on Machine and Web Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Machine and Web Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMWI.2010.5648136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Machine and Web Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMWI.2010.5648136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid Grasp and Scatter Search for the exam timetabling problem
In this paper we describe a new hybrid evolutionary algorithm and its implementation for the NP hard exam timetabling problem. This approach uses the good features of the Greedy Randomized Adaptive Search Procedure (GRASP) and the evolutionary Scatter Search (SS) approach which uses strategies for search diversification and intensification to maintain and evolve a population of solutions. New solutions are improved before replacing others according to their quality and diversity. The implementation of the algorithm has been experimented on the popular Carter's benchmarks and compared with the best recent results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
