{"id":"https://openalex.org/W2166340431","doi":"https://doi.org/10.1109/dmo.2009.5341897","title":"Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem","display_name":"Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2166340431","doi":"https://doi.org/10.1109/dmo.2009.5341897","mag":"2166340431"},"language":"en","primary_location":{"id":"doi:10.1109/dmo.2009.5341897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341897","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/A5077054156","display_name":"Ariff Md Ab Malik","orcid":"https://orcid.org/0000-0003-3009-387X"},"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":"Ariff Md Ab Malik","raw_affiliation_strings":["Data Mining & Optimization Research Group, University Kebangsaan Malaysia, UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Research Group, University Kebangsaan Malaysia, UKM Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"middle","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, University Kebangsaan Malaysia, UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Research Group, University Kebangsaan Malaysia, UKM Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114202146","display_name":"Abdul Razak Hamdan","orcid":null},"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":"Abdul Razak Hamdan","raw_affiliation_strings":["Data Mining & Optimization Research Group, University Kebangsaan Malaysia, UKM Bangi, Selangor, Malaysia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Data Mining & Optimization Research Group, University Kebangsaan Malaysia, UKM Bangi, Selangor, Malaysia","institution_ids":["https://openalex.org/I885383172"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8329,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79250429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2079","issue":null,"first_page":"141","last_page":"148"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9574999809265137,"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"}},{"id":"https://openalex.org/T14025","display_name":"Educational Technology and Assessment","score":0.9247999787330627,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.8863110542297363},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.8759281635284424},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6489646434783936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5610342025756836},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5534692406654358},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.5022625923156738},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.42505836486816406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3261905312538147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3194621503353119},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07492014765739441}],"concepts":[{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.8863110542297363},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8759281635284424},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6489646434783936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5610342025756836},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5534692406654358},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.5022625923156738},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.42505836486816406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3261905312538147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3194621503353119},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07492014765739441},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dmo.2009.5341897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dmo.2009.5341897","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":[{"id":"https://metadata.un.org/sdg/11","score":0.8399999737739563,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W207226807","https://openalex.org/W578916329","https://openalex.org/W1539889974","https://openalex.org/W1545258328","https://openalex.org/W1596914020","https://openalex.org/W1767486396","https://openalex.org/W2011653811","https://openalex.org/W2014856631","https://openalex.org/W2020608597","https://openalex.org/W2031012845","https://openalex.org/W2036108050","https://openalex.org/W2086726443","https://openalex.org/W2093789277","https://openalex.org/W2099942580","https://openalex.org/W2100936956","https://openalex.org/W2107349336","https://openalex.org/W2134909806","https://openalex.org/W2137365217","https://openalex.org/W2138029669","https://openalex.org/W2324472571","https://openalex.org/W2339500526","https://openalex.org/W2354686230","https://openalex.org/W3144853840","https://openalex.org/W4212899374","https://openalex.org/W4232951231","https://openalex.org/W4248677208","https://openalex.org/W4285719527","https://openalex.org/W6632492418","https://openalex.org/W6635924533","https://openalex.org/W6680148501"],"related_works":["https://openalex.org/W2224940485","https://openalex.org/W2935342279","https://openalex.org/W1608676749","https://openalex.org/W1968740415","https://openalex.org/W2535266198","https://openalex.org/W2567474168","https://openalex.org/W2036813338","https://openalex.org/W2123115451","https://openalex.org/W1533229056","https://openalex.org/W2182085295"],"abstract_inverted_index":{"In":[0],"this":[1],"research,":[2],"we":[3],"introduce":[4],"a":[5,113],"set":[6],"of":[7,10],"multi-neighbourhood":[8],"strategies":[9],"iterated":[11],"two-stage":[12],"tabu":[13,28],"search,":[14],"ITMTS,":[15],"to":[16,104,116],"solve":[17],"examination":[18],"timetabling":[19],"problems.":[20],"This":[21],"work":[22,63],"is":[23],"based":[24],"on":[25],"the":[26,37,45,78,100,105],"standard":[27,84],"search":[29,47,54,60],"with":[30,65,77,92,102],"some":[31],"modifications":[32],"that":[33,95],"are":[34,90],"derived":[35],"from":[36],"neighbourhood":[38,41,46,53,57,67],"structure.":[39],"The":[40],"structure":[42],"has":[43],"divided":[44],"mechanism":[48],"into":[49],"two":[50],"stages,":[51],"vertical":[52],"and":[55,69,74,83,109],"horizontal":[56],"search.":[58],"These":[59],"mechanisms":[61],"will":[62],"alternately":[64],"different":[66],"concentration":[68],"candidate":[70],"evaluation.":[71],"We":[72],"test":[73],"evaluate":[75],"ITMTS":[76],"uncapacitated":[79],"Carter":[80],"benchmark":[81,107],"datasets":[82],"Carter's":[85,106],"proximity":[86],"cost.":[87],"Our":[88],"results":[89],"comparable":[91],"other":[93],"approaches":[94],"have":[96,110],"been":[97],"reported":[98],"in":[99],"literature":[101],"regards":[103],"dataset":[108],"shown":[111],"as":[112],"promising":[114],"technique":[115],"be":[117],"further":[118],"enhanced.":[119]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}