{"id":"https://openalex.org/W2159971551","doi":"https://doi.org/10.1109/iri.2007.4296604","title":"Solving Multicriteria University Timetabling Problem by a Self-adaptive Genetic Algorithm with Minimal Perturbation","display_name":"Solving Multicriteria University Timetabling Problem by a Self-adaptive Genetic Algorithm with Minimal Perturbation","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2159971551","doi":"https://doi.org/10.1109/iri.2007.4296604","mag":"2159971551"},"language":"en","primary_location":{"id":"doi:10.1109/iri.2007.4296604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2007.4296604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Information Reuse and Integration","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/A5062750671","display_name":"Radom\u00edr Perzina","orcid":"https://orcid.org/0000-0002-5822-3982"},"institutions":[{"id":"https://openalex.org/I32366509","display_name":"Silesian University in Opava","ror":"https://ror.org/02w4f2z17","country_code":"CZ","type":"education","lineage":["https://openalex.org/I32366509"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Radomir Perzina","raw_affiliation_strings":["Silesian University in Opava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Silesian University in Opava, Czech Republic","institution_ids":["https://openalex.org/I32366509"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062750671"],"corresponding_institution_ids":["https://openalex.org/I32366509"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.20069005,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"98","last_page":"103"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9577000141143799,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9121999740600586,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6437737941741943},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6272218823432922},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5505051612854004},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.5432544350624084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.402109831571579},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2659657597541809}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6437737941741943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6272218823432922},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5505051612854004},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.5432544350624084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.402109831571579},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2659657597541809},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iri.2007.4296604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2007.4296604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Information Reuse and Integration","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1570709358","https://openalex.org/W1964072303","https://openalex.org/W2026125863","https://openalex.org/W2027995993","https://openalex.org/W2086961057","https://openalex.org/W2099942580","https://openalex.org/W2133591430","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"The":[0],"most":[1],"of":[2,80],"methods":[3],"for":[4,66,76,91],"solving":[5,49],"the":[6,12,32,38,45,50,64,84,88],"university":[7],"timetabling":[8,46],"problem":[9,13,41],"deal":[10],"with":[11],"statically,":[14],"which":[15],"makes":[16],"great":[17],"difficulties":[18],"when":[19],"requirements":[20],"are":[21],"changed,":[22],"because":[23],"a":[24,52],"new":[25],"timetable":[26,92],"is":[27,42,94],"usually":[28],"very":[29],"different":[30],"from":[31],"previous":[33,60],"one.":[34],"To":[35],"overcome":[36],"it":[37],"minimal":[39],"perturbation":[40],"incorporated":[43],"into":[44],"model.":[47],"For":[48],"model":[51],"self-adaptive":[53],"genetic":[54,81],"algorithm":[55],"was":[56],"proposed.":[57],"Comparing":[58],"to":[59],"approaches":[61],"we":[62],"designed":[63],"encoding":[65],"self-adaptation":[67],"not":[68],"only":[69],"one":[70],"parameter":[71],"or":[72],"several":[73],"ones":[74],"but":[75],"all":[77],"possible":[78],"parameters":[79],"algorithms":[82],"at":[83],"same":[85],"time.":[86],"Also":[87],"multicriteria":[89],"system":[90],"evaluation":[93],"presented.":[95]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}