{"id":"https://openalex.org/W2000541569","doi":"https://doi.org/10.1007/s10951-010-0202-0","title":"A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling","display_name":"A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling","publication_year":2010,"publication_date":"2010-11-02","ids":{"openalex":"https://openalex.org/W2000541569","doi":"https://doi.org/10.1007/s10951-010-0202-0","mag":"2000541569"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-010-0202-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-010-0202-0","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-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/A5023052971","display_name":"Sadaf Naseem Jat","orcid":null},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sadaf Naseem Jat","raw_affiliation_strings":["Department of Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK","University of Leicester"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"University of Leicester","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040583251","display_name":"Shengxiang Yang","orcid":"https://orcid.org/0000-0001-7222-4917"},"institutions":[{"id":"https://openalex.org/I59433898","display_name":"Brunel University of London","ror":"https://ror.org/00dn4t376","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I59433898"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shengxiang Yang","raw_affiliation_strings":["Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK","*Brunel University"],"affiliations":[{"raw_affiliation_string":"Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK","institution_ids":["https://openalex.org/I59433898"]},{"raw_affiliation_string":"*Brunel University","institution_ids":["https://openalex.org/I59433898"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023052971"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.6427,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.92678505,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"14","issue":"6","first_page":"617","last_page":"637"},"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.9659000039100647,"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/tabu-search","display_name":"Tabu search","score":0.8720591068267822},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6833311319351196},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6582424640655518},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6477434039115906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6068486571311951},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5910261273384094},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5887237787246704},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5836696624755859},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5194294452667236},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4831911623477936},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4661245346069336},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45812568068504333},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4151197373867035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3913632333278656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24149900674819946}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8720591068267822},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6833311319351196},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6582424640655518},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6477434039115906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6068486571311951},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5910261273384094},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5887237787246704},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5836696624755859},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5194294452667236},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4831911623477936},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4661245346069336},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45812568068504333},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4151197373867035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3913632333278656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24149900674819946},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10951-010-0202-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-010-0202-0","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:bura.brunel.ac.uk:2438/5985","is_oa":false,"landing_page_url":"http://bura.brunel.ac.uk/handle/2438/5985","pdf_url":null,"source":{"id":"https://openalex.org/S4306401473","display_name":"Brunel University Research Archive (BURA) (Brunel University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59433898","host_organization_name":"Brunel University of London","host_organization_lineage":["https://openalex.org/I59433898"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:dora.dmu.ac.uk:2086/8458","is_oa":false,"landing_page_url":"http://hdl.handle.net/2086/8458","pdf_url":null,"source":{"id":"https://openalex.org/S4306400394","display_name":"DMU Open Research Archive (De Montfort University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66943878","host_organization_name":"De Montfort University","host_organization_lineage":["https://openalex.org/I66943878"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5788800149","display_name":null,"funder_award_id":"EP/E060722/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W16305195","https://openalex.org/W92177461","https://openalex.org/W345766220","https://openalex.org/W1485002359","https://openalex.org/W1490782680","https://openalex.org/W1503234983","https://openalex.org/W1512847430","https://openalex.org/W1529959093","https://openalex.org/W1532406186","https://openalex.org/W1549006996","https://openalex.org/W1554437347","https://openalex.org/W1586313000","https://openalex.org/W1587889267","https://openalex.org/W1590936410","https://openalex.org/W1601081952","https://openalex.org/W1639032689","https://openalex.org/W1727183286","https://openalex.org/W1767486396","https://openalex.org/W1792875263","https://openalex.org/W1820539928","https://openalex.org/W1883366561","https://openalex.org/W1966942146","https://openalex.org/W1972125202","https://openalex.org/W1973555220","https://openalex.org/W1991318915","https://openalex.org/W2003160050","https://openalex.org/W2003633373","https://openalex.org/W2014856631","https://openalex.org/W2016721869","https://openalex.org/W2028480548","https://openalex.org/W2032876227","https://openalex.org/W2040727232","https://openalex.org/W2050992341","https://openalex.org/W2056956492","https://openalex.org/W2057369325","https://openalex.org/W2062742101","https://openalex.org/W2073634948","https://openalex.org/W2086961057","https://openalex.org/W2095134601","https://openalex.org/W2096052211","https://openalex.org/W2096321178","https://openalex.org/W2096648407","https://openalex.org/W2099942580","https://openalex.org/W2102287935","https://openalex.org/W2102758566","https://openalex.org/W2108432292","https://openalex.org/W2113836425","https://openalex.org/W2127670720","https://openalex.org/W2128926660","https://openalex.org/W2137360482","https://openalex.org/W2138029669","https://openalex.org/W2138144419","https://openalex.org/W2144149212","https://openalex.org/W2147440785","https://openalex.org/W2152512538","https://openalex.org/W2198693942","https://openalex.org/W2307904408","https://openalex.org/W2339500526","https://openalex.org/W2480762398","https://openalex.org/W2520202718","https://openalex.org/W2561675875","https://openalex.org/W2604181158","https://openalex.org/W2731086824","https://openalex.org/W2904250082","https://openalex.org/W4211023471","https://openalex.org/W4212899374","https://openalex.org/W4285719527","https://openalex.org/W6635000382","https://openalex.org/W6635049128","https://openalex.org/W7054900182"],"related_works":["https://openalex.org/W2476121495","https://openalex.org/W2370323645","https://openalex.org/W2382688260","https://openalex.org/W1543589757","https://openalex.org/W4247343174","https://openalex.org/W2168643831","https://openalex.org/W1987877777","https://openalex.org/W2038822609","https://openalex.org/W1533229056","https://openalex.org/W2794858631"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}
