{"id":"https://openalex.org/W7140220268","doi":"https://doi.org/10.1016/j.procs.2026.03.037","title":"Multiobjective Optimization Approaches for Room Allocation in University Course Timetabling\u2729","display_name":"Multiobjective Optimization Approaches for Room Allocation in University Course Timetabling\u2729","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7140220268","doi":"https://doi.org/10.1016/j.procs.2026.03.037"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2026.03.037","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.03.037","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2026.03.037","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bruno Antunes-Batista","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bruno Antunes-Batista","raw_affiliation_strings":["Instituto Universit\u00e1rio de Lisboa (ISCTE-IUL), ISTAR, 1649-026 Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto Universit\u00e1rio de Lisboa (ISCTE-IUL), ISTAR, 1649-026 Lisboa, Portugal","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Soumen Atta","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Soumen Atta","raw_affiliation_strings":["Faculty of Information Technology, University of Jyv\u00e4skyl\u00e4, P.O. Box 35 (Agora), Jyv\u00e4skyl\u00e4, 40014, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Jyv\u00e4skyl\u00e4, P.O. Box 35 (Agora), Jyv\u00e4skyl\u00e4, 40014, Finland","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"V\u00edtor Basto-Fernandes","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"V\u00edtor Basto-Fernandes","raw_affiliation_strings":["Instituto Universit\u00e1rio de Lisboa (ISCTE-IUL), ISTAR, 1649-026 Lisboa, Portugal","Sorbonne Universit\u00e9, CNRS, LIP6, 75005 Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto Universit\u00e1rio de Lisboa (ISCTE-IUL), ISTAR, 1649-026 Lisboa, Portugal","institution_ids":[]},{"raw_affiliation_string":"Sorbonne Universit\u00e9, CNRS, LIP6, 75005 Paris, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Iryna Yevseyeva","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Iryna Yevseyeva","raw_affiliation_strings":["School of Computer Science and Informatics, Faculty of Technology, Arts, and Culture, De Montfort University, Leicester, LE1 9BH, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, Faculty of Technology, Arts, and Culture, De Montfort University, Leicester, LE1 9BH, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Michael Emmerich","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael Emmerich","raw_affiliation_strings":["Faculty of Information Technology, University of Jyv\u00e4skyl\u00e4, P.O. Box 35 (Agora), Jyv\u00e4skyl\u00e4, 40014, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, University of Jyv\u00e4skyl\u00e4, P.O. Box 35 (Agora), Jyv\u00e4skyl\u00e4, 40014, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62867934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"278","issue":null,"first_page":"663","last_page":"670"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9793000221252441,"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.9793000221252441,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.004000000189989805,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/relocation","display_name":"Relocation","score":0.7232999801635742},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.6377999782562256},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6370000243186951},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5072000026702881},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5033000111579895},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5029000043869019},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4977000057697296},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4839000105857849}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.847000002861023},{"id":"https://openalex.org/C2779019381","wikidata":"https://www.wikidata.org/wiki/Q3499564","display_name":"Relocation","level":2,"score":0.7232999801635742},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.6377999782562256},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6370000243186951},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5625},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5033000111579895},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5029000043869019},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4977000057697296},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.48579999804496765},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44609999656677246},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3869999945163727},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34529998898506165},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.3398999869823456},{"id":"https://openalex.org/C2777552389","wikidata":"https://www.wikidata.org/wiki/Q1962728","display_name":"Course (navigation)","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C2988952207","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multiobjective programming","level":3,"score":0.3147999942302704},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3091000020503998},{"id":"https://openalex.org/C2984968299","wikidata":"https://www.wikidata.org/wiki/Q1077784","display_name":"Software tool","level":3,"score":0.2863999903202057},{"id":"https://openalex.org/C3020013979","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimal allocation","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2712000012397766}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2026.03.037","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.03.037","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2026.03.037","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2026.03.037","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1997071828","https://openalex.org/W2000825106","https://openalex.org/W2007930753","https://openalex.org/W2013014665","https://openalex.org/W2022485595","https://openalex.org/W2085507535","https://openalex.org/W2098907614","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W3186677729","https://openalex.org/W4313328140"],"related_works":[],"abstract_inverted_index":{"This":[0,52],"study":[1],"addresses":[2],"the":[3,16,28,47,56,61,122,129],"complex":[4,43],"and":[5,46,67,82,90,96,108,118,160,191],"time-consuming":[6],"task":[7],"of":[8,18,30,35,49,60,87,115],"room":[9,57,84,88,91,103,123,172],"allocation":[10,58,124],"in":[11,189],"university":[12,144],"timetabling,":[13],"which,":[14],"despite":[15],"avail-ability":[17],"software":[19,37],"tools,":[20],"is":[21],"still":[22],"predominantly":[23],"performed":[24],"manually":[25],"due":[26,41],"to":[27,42,73,100,109,121],"inefficiency":[29],"existing":[31],"solutions.":[32],"The":[33,174],"adoption":[34],"such":[36],"remains":[38],"limited,":[39],"primarily":[40],"parameter":[44],"configurations":[45],"lack":[48],"institutional":[50],"customization.":[51],"paper":[53],"focuses":[54],"on":[55],"subproblem":[59],"University":[62],"Course":[63],"Timetabling":[64],"Problem":[65],"(UCTP)":[66],"defines":[68],"six":[69],"criteria:":[70],"four":[71],"objectives":[72],"minimize":[74],"student":[75],"relocation":[76],"between":[77,80,93],"buildings,":[78],"mismatches":[79],"requested":[81],"assigned":[83],"types,":[85],"waste":[86],"capacity":[89,104],"changes":[92],"consecutive":[94],"classes,":[95],"two":[97],"hard":[98],"constraints":[99],"ensure":[101],"that":[102],"require-ments":[105],"are":[106],"respected":[107],"prevent":[110],"scheduling":[111],"overlaps.":[112],"Customized":[113],"variants":[114],"NSGA-II,":[116],"NSGA-III,":[117],"MOEA/D,":[119],"tailored":[120],"context,":[125],"were":[126,137,179],"developed":[127],"using":[128,139,193],"jMetal":[130],"framework":[131],"with":[132,168],"integrated":[133],"local":[134],"search.":[135],"Experiments":[136],"conducted":[138],"real-world":[140],"data":[141],"from":[142],"a":[143,146],"over":[145,161,169],"full":[147],"academic":[148],"semester,":[149],"involving":[150],"approximately":[151],"10,000":[152],"students,":[153],"more":[154],"than":[155],"26,000":[156],"scheduled":[157],"class":[158],"sessions,":[159],"120":[162],"classrooms":[163],"distributed":[164],"across":[165],"multiple":[166],"buildings":[167],"20":[170],"distinct":[171],"types.":[173],"cus-tomized":[175],"multiobjective":[176],"evolutionary":[177],"algorithms":[178],"compared":[180],"against":[181],"an":[182],"integer":[183],"linear":[184],"programming":[185],"(ILP)":[186],"formulation":[187],"modeled":[188],"Pyomo":[190],"solved":[192],"Gurobi.":[194]},"counts_by_year":[],"updated_date":"2026-04-25T08:17:42.794288","created_date":"2026-03-25T00:00:00"}