{"id":"https://openalex.org/W2105599997","doi":"https://doi.org/10.1109/dmo.2009.5341898","title":"Hybrid Ant Colony systems for course timetabling problems","display_name":"Hybrid Ant Colony systems for course timetabling problems","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2105599997","doi":"https://doi.org/10.1109/dmo.2009.5341898","mag":"2105599997"},"language":"en","primary_location":{"id":"doi:10.1109/dmo.2009.5341898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 2nd Conference on Data Mining and Optimization","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011296289","display_name":"Masri Ayob","orcid":"https://orcid.org/0000-0002-5157-7921"},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Masri Ayob","raw_affiliation_strings":["Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Selangor, Malaysia","Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]},{"raw_affiliation_string":"Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055424167","display_name":"Ghaith M. Jaradat","orcid":"https://orcid.org/0000-0002-5166-1576"},"institutions":[{"id":"https://openalex.org/I885383172","display_name":"National University of Malaysia","ror":"https://ror.org/00bw8d226","country_code":"MY","type":"education","lineage":["https://openalex.org/I885383172"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Ghaith Jaradat","raw_affiliation_strings":["Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Selangor, Malaysia","Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]},{"raw_affiliation_string":"Data Mining & Optimization Research Group, Center of Artificial Intelligence Technology, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9152,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.91031635,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"120","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14025","display_name":"Educational Technology and Assessment","score":0.9621000289916992,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9617000222206116,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.732500433921814},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7233560085296631},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6663649082183838},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.636631965637207},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6338269114494324},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5721487998962402},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5078964829444885},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47136154770851135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46673473715782166},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.46149763464927673},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.45566999912261963},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.33840417861938477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12983694672584534}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.732500433921814},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7233560085296631},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6663649082183838},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.636631965637207},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6338269114494324},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5721487998962402},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5078964829444885},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47136154770851135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46673473715782166},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46149763464927673},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.45566999912261963},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33840417861938477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12983694672584534},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dmo.2009.5341898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341898","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 2nd Conference on Data Mining and Optimization","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1489881420","https://openalex.org/W1490782680","https://openalex.org/W1500644178","https://openalex.org/W1512847430","https://openalex.org/W1514724177","https://openalex.org/W1532406186","https://openalex.org/W1542447043","https://openalex.org/W1573676079","https://openalex.org/W1579290916","https://openalex.org/W1591939288","https://openalex.org/W1833366547","https://openalex.org/W1975473038","https://openalex.org/W1993966952","https://openalex.org/W2003160050","https://openalex.org/W2033930346","https://openalex.org/W2086726443","https://openalex.org/W2107941094","https://openalex.org/W2109964130","https://openalex.org/W2113836425","https://openalex.org/W2114388796","https://openalex.org/W2118573797","https://openalex.org/W2126554879","https://openalex.org/W2138144419","https://openalex.org/W2152665062","https://openalex.org/W2154929945","https://openalex.org/W2326015099","https://openalex.org/W4285719527","https://openalex.org/W4292083457","https://openalex.org/W6632316560","https://openalex.org/W6701518577"],"related_works":["https://openalex.org/W2052469048","https://openalex.org/W4321504838","https://openalex.org/W2081475278","https://openalex.org/W1611875833","https://openalex.org/W2794855054","https://openalex.org/W2005169299","https://openalex.org/W173587566","https://openalex.org/W1547053391","https://openalex.org/W2900012203","https://openalex.org/W2462483068"],"abstract_inverted_index":{"The":[0,32],"university":[1,78],"course":[2,79,129],"timetabling":[3,130],"is":[4,10,34],"a":[5,21,37,81,89,98],"complex":[6],"optimization":[7,197],"problem":[8],"which":[9],"difficult":[11],"to":[12,20,35,75,94],"solve":[13,76],"for":[14,109,192],"optimality.":[15],"It":[16],"involves":[17],"assigning":[18],"lectures":[19],"fixed":[22],"number":[23,82],"of":[24,83,92,101,195],"timeslots":[25],"and":[26,40,67,117,153,159,176],"rooms;":[27],"while":[28],"satisfying":[29],"some":[30,179],"constraints.":[31],"goal":[33],"construct":[36,88],"feasible":[38],"timetable":[39],"satisfy":[41],"soft":[42],"constraints":[43],"as":[44,46],"much":[45],"possible.":[47],"In":[48],"this":[49],"study,":[50],"we":[51],"apply":[52],"two":[53],"hybrids":[54],"ant":[55,63,71],"colony":[56,64,72],"systems,":[57],"namely":[58],"the":[59,77,86,103,107,110,126],"simulated":[60],"annealing":[61],"with":[62,70,137],"system":[65,73],"(ACS-SA),":[66],"tabu":[68],"search":[69],"(ACS-TS)":[74],"timetabling,":[80],"ants":[84,104],"in":[85],"ACS":[87,123,187],"complete":[90],"assignment":[91],"courses":[93],"timeslots.":[95],"Based":[96],"on":[97,171,178],"pre-ordered":[99],"list":[100],"courses,":[102],"probabilistically":[105],"choose":[106],"timeslot":[108],"given":[111],"course,":[112],"guided":[113],"by":[114,140],"heuristic":[115],"information":[116],"stigmergic":[118],"information.":[119],"We":[120,132,182],"test":[121,174],"both":[122,151],"algorithms":[124,188],"over":[125],"Socha's":[127,172],"benchmark":[128,173,180],"problem.":[131],"also":[133,166,190],"compare":[134],"our":[135],"results":[136,148],"those":[138],"obtained":[139],"other":[141,168,193],"methodologies":[142,169],"recent":[143],"literature":[144],"has":[145],"illustrated.":[146],"Experimental":[147],"showed":[149],"that":[150,184],"ACS-SA":[152],"ACS-TS":[154],"produces":[155],"good":[156],"quality":[157],"solutions":[158],"outperforms":[160],"previously":[161],"applied":[162],"Ant":[163],"algorithms;":[164],"they":[165],"outperform":[167],"tested":[170],"instances,":[175],"approaches":[177],"instances.":[181],"believe":[183],"these":[185],"hybrid":[186],"are":[189],"valid":[191],"types":[194],"combinational":[196],"problems.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}