{"id":"https://openalex.org/W2282530738","doi":null,"title":"Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling","display_name":"Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2282530738","mag":"2282530738"},"language":"en","primary_location":{"id":"pmh:oai:psasir.upm.edu.my:11930","doi":null,"is_oa":true,"landing_page_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","pdf_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","source":{"id":"https://openalex.org/S4377196260","display_name":"Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130343225","host_organization_name":"Universiti Putra Malaysia","host_organization_lineage":["https://openalex.org/I130343225"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038046933","display_name":"Shahrzad M. Pour","orcid":"https://orcid.org/0000-0002-2585-2360","observed_orcids":["https://orcid.org/0000-0002-2585-2360"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shahrzad M. Pour","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2585-2360","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5038046933"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9990000128746033,"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":0.9990000128746033,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/examination-timetabling","display_name":"examination timetabling","score":0.9919999837875366},{"id":"https://openalex.org/keywords/hyper-heuristics","display_name":"hyper-heuristics","score":0.9599999785423279},{"id":"https://openalex.org/keywords/constructive-heuristics","display_name":"constructive heuristics","score":0.7379999756813049},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.7459999918937683},{"id":"https://openalex.org/keywords/local-optima","display_name":"local optima","score":0.765999972820282},{"id":"https://openalex.org/keywords/exploration-and-exploitation","display_name":"exploration and exploitation","score":0.7889999747276306},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.7590000033378601},{"id":"https://openalex.org/keywords/timetabling-constraints","display_name":"timetabling constraints","score":0.7409999966621399}],"concepts":[{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.9324479103088379},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7173977494239807},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6449915170669556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5783000588417053},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338493585586548},{"id":"https://openalex.org/C2780510313","wikidata":"https://www.wikidata.org/wiki/Q178706","display_name":"Institution","level":2,"score":0.4644567668437958},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4448598623275757},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.41706976294517517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39498740434646606},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29911118745803833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27345675230026245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21740293502807617},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13556477427482605},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.06355506181716919},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:psasir.upm.edu.my:11930","doi":null,"is_oa":true,"landing_page_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","pdf_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","source":{"id":"https://openalex.org/S4377196260","display_name":"Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130343225","host_organization_name":"Universiti Putra Malaysia","host_organization_lineage":["https://openalex.org/I130343225"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"mag:2282530738","doi":null,"is_oa":false,"landing_page_url":"http://psasir.upm.edu.my/id/eprint/11930/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:psasir.upm.edu.my:11930","doi":null,"is_oa":true,"landing_page_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","pdf_url":"http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf","source":{"id":"https://openalex.org/S4377196260","display_name":"Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130343225","host_organization_name":"Universiti Putra Malaysia","host_organization_lineage":["https://openalex.org/I130343225"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2282530738.pdf","grobid_xml":"https://content.openalex.org/works/W2282530738.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2188329315","https://openalex.org/W1556503417","https://openalex.org/W2086726443","https://openalex.org/W3066458696","https://openalex.org/W2074281851","https://openalex.org/W3045305527","https://openalex.org/W4200545480","https://openalex.org/W2123932009","https://openalex.org/W2129574464","https://openalex.org/W1601464705"],"abstract_inverted_index":{"Examination":[0],"Timetabling":[1],"Problem":[2],"(ETTP)":[3],"is":[4,61,87,107,124],"an":[5],"NP-hard":[6],"typical":[7],"optimization":[8],"problem":[9,38,70,123],"faced":[10],"by":[11],"institutions":[12],"and":[13,50],"universities":[14],"across":[15],"the":[16,34,37,47,58,64,94,110,120],"world.":[17],"This":[18],"nature":[19],"leads":[20],"to":[21,43,76,81],"heuristic":[22,100,126],"methods":[23,60,73],"cover":[24],"a":[25],"large":[26],"branch":[27],"of":[28,52,57,63,83,89,96,109],"researches":[29],"in":[30,67,104],"this":[31,97],"area.":[32],"On":[33],"other":[35],"hand,":[36],"varies":[39],"from":[40,113],"one":[41,62,88,108],"institution":[42],"another,":[44],"depending":[45],"on":[46,130],"size,":[48],"structure":[49],"constraints":[51],"that":[53,125],"institution.":[54],"Therefore":[55],"generality":[56,78],"proposed":[59],"major":[65],"goals":[66],"solving":[68],"timetabling":[69],"nowadays.":[71],"These":[72],"are":[74],"trying":[75],"keep":[77],"while":[79],"adding":[80],"factors":[82],"these":[84,90],"methods.":[85],"Hyperheuristic":[86],"approaches":[91,101],"which":[92],"make":[93],"basis":[95],"thesis.":[98],"In":[99],"getting":[102],"stuck":[103],"local":[105,121],"optimum":[106],"propounded":[111],"problems":[112],"early":[114],"days.":[115],"The":[116],"main":[117],"cause":[118],"for":[119],"optimal":[122],"algorithms":[127],"either":[128],"focus":[129],"exploration":[131],"(global":[132],"improvement)":[133,138],"rather":[134],"than":[135],"exploitation":[136],"(local":[137],"or":[139],"vice":[140],"versa.":[141]},"counts_by_year":[],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}