{"id":"https://openalex.org/W2122057613","doi":"https://doi.org/10.1109/dmo.2009.5341917","title":"Multi-Neighbourhood Particle Collision Algorithm for solving course timetabling problems","display_name":"Multi-Neighbourhood Particle Collision Algorithm for solving course timetabling problems","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2122057613","doi":"https://doi.org/10.1109/dmo.2009.5341917","mag":"2122057613"},"language":"en","primary_location":{"id":"doi:10.1109/dmo.2009.5341917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341917","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/A5068760252","display_name":"Anmar Abuhamdah","orcid":"https://orcid.org/0000-0003-3496-6711"},"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":"Anmar Abuhamdah","raw_affiliation_strings":["Data Mining & Optimization Group (DMO), Centre of Artificial Intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, Bangi, Selangor Darul Ehsan, Malaysia","Data Mining & Optimization Group (DMO), Centre of Artificial intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Group (DMO), Centre of Artificial Intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, Bangi, Selangor Darul Ehsan, Malaysia","institution_ids":[]},{"raw_affiliation_string":"Data Mining & Optimization Group (DMO), Centre of Artificial intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"last","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 Group (DMO), Centre of Artificial Intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, Bangi, Selangor Darul Ehsan, Malaysia","Data Mining & Optimization Group (DMO), Centre of Artificial intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Group (DMO), Centre of Artificial Intelligence Technology (CAIT), Computer Science Department, University Kebangsaan Malaysia, Bangi, Selangor Darul Ehsan, Malaysia","institution_ids":[]},{"raw_affiliation_string":"Data Mining & Optimization Group (DMO), Centre of Artificial intelligence Technology (CAIT), Computer Science Department, 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":3.3317,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92219885,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"92","issue":null,"first_page":"21","last_page":"27"},"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.9440000057220459,"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.9390000104904175,"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/simulated-annealing","display_name":"Simulated annealing","score":0.676366925239563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6404566764831543},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.5082261562347412},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.49049562215805054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4584914743900299},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4239237606525421},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4178805649280548},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4094901382923126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2197788953781128}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.676366925239563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6404566764831543},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.5082261562347412},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.49049562215805054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4584914743900299},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4239237606525421},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4178805649280548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4094901382923126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2197788953781128},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dmo.2009.5341917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341917","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7900000214576721}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308175","display_name":"Minnesota Pollution Control Agency","ror":"https://ror.org/01cn04b23"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W62280645","https://openalex.org/W1489881420","https://openalex.org/W1512847430","https://openalex.org/W1542447043","https://openalex.org/W1553244859","https://openalex.org/W1577845686","https://openalex.org/W1792875263","https://openalex.org/W1966942146","https://openalex.org/W1975473038","https://openalex.org/W2003160050","https://openalex.org/W2032876227","https://openalex.org/W2033930346","https://openalex.org/W2043926068","https://openalex.org/W2076259622","https://openalex.org/W2086726443","https://openalex.org/W2087215158","https://openalex.org/W2099942580","https://openalex.org/W2108375259","https://openalex.org/W2109964130","https://openalex.org/W2113836425","https://openalex.org/W2114388796","https://openalex.org/W2138144419","https://openalex.org/W2152512538","https://openalex.org/W2198693942","https://openalex.org/W2490780778","https://openalex.org/W2552712687","https://openalex.org/W4285719527","https://openalex.org/W6629956140","https://openalex.org/W6632316560","https://openalex.org/W6723318092"],"related_works":["https://openalex.org/W4393363920","https://openalex.org/W4248744973","https://openalex.org/W4383700488","https://openalex.org/W4287780535","https://openalex.org/W2371075315","https://openalex.org/W4212897237","https://openalex.org/W4327850430","https://openalex.org/W2161410550","https://openalex.org/W2997067626","https://openalex.org/W2045438354"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"a":[3,24,32,41,92,224],"particle":[4],"collision":[5,88],"algorithm":[6,21,89],"(PCA)":[7],"to":[8,17,31,40,218],"solve":[9],"university":[10],"course":[11,194],"timetabling":[12,195],"problems.":[13],"The":[14,86,104],"aim":[15],"is":[16,73,216],"produce":[18,219],"an":[19],"effective":[20],"for":[22,101],"assigning":[23],"set":[25,42],"of":[26,35,43,59,106,120,158,168,189],"courses,":[27],"lecturers":[28],"and":[29,37,67,79,134,182,213],"students":[30],"specific":[33],"number":[34],"rooms":[36],"timeslots,":[38],"subject":[39],"constraints.":[44],"PCA":[45,62,93,107,117,125,157],"always":[46],"accepts":[47,52],"improved":[48],"solution":[49,132,180],"but":[50],"adaptively":[51],"worse":[53],"solutions":[54,222],"based":[55,144],"on":[56,83,191],"the":[57,60,109,147,187],"quality":[58,221],"solution.":[61],"differs":[63,114,165],"from":[64,115,160],"simulated":[65,110],"annealing":[66,111],"other":[68,208],"meta-heuristic":[69],"approaches":[70,209],"in":[71,118,129,146,166,176,210],"that":[72,95,204,214],"does":[74,80],"not":[75,81],"have":[76],"cooling":[77],"schedule":[78],"rely":[82],"user-defined":[84],"parameters.":[85],"multi-neighbourhood":[87,170],"(MPCA)":[90],"enhances":[91],"approach":[94],"was":[96],"originally":[97],"introduced":[98,199],"by":[99,200],"Sacco":[100],"policy":[102],"optimization.":[103],"structure":[105],"resembles":[108],"structure.":[112],"It":[113],"basic":[116],"terms":[119,167],"improvement":[121,183],"phase":[122,133,149],"(exploration":[123],"phase).":[124],"perform":[126,139],"local":[127,140,161],"search":[128,141],"both":[130],"construction":[131],"scattering":[135,148],"phase,":[136],"while":[137],"MPCA":[138,153,164,172,190,205,215],"(hill":[142],"climbing":[143],"search)":[145],"only,":[150],"which":[151,197],"makes":[152],"more":[154],"capable":[155],"than":[156],"escaping":[159],"optima.":[162],"Also":[163],"applying":[169],"structures.":[171],"employ":[173],"different":[174],"neighbourhood":[175],"two":[177],"stages":[178],"(construction":[179],"stage":[181],"stage).":[184],"We":[185],"evaluate":[186],"effectiveness":[188],"standard":[192],"benchmark":[193],"datasets":[196],"were":[198],"Socha.":[201],"Results":[202],"show":[203],"significantly":[206],"outperformed":[207],"some":[211],"instances":[212],"able":[217],"good":[220],"within":[223],"reasonable":[225],"time.":[226]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}