{"id":"https://openalex.org/W2126637747","doi":"https://doi.org/10.1109/cec.2003.1299890","title":"Memetic algorithms for timetabling","display_name":"Memetic algorithms for timetabling","publication_year":2004,"publication_date":"2004-07-09","ids":{"openalex":"https://openalex.org/W2126637747","doi":"https://doi.org/10.1109/cec.2003.1299890","mag":"2126637747"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299890","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5071955909","display_name":"Alpay Alkan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Alkan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391"},"institutions":[{"id":"https://openalex.org/I100072489","display_name":"Yeditepe University","ror":"https://ror.org/025mx2575","country_code":"TR","type":"education","lineage":["https://openalex.org/I100072489"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"E. Ozcan","raw_affiliation_strings":["Department of Computer Engineering, Yeditepe University, Istanbul, Turkey","Yeditepe University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Yeditepe University, Istanbul, Turkey","institution_ids":["https://openalex.org/I100072489"]},{"raw_affiliation_string":"Yeditepe University","institution_ids":["https://openalex.org/I100072489"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"1796","last_page":"1802"},"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.9912999868392944,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9286999702453613,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8047398328781128},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.7649757862091064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6818330883979797},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5831606984138489},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5673434734344482},{"id":"https://openalex.org/keywords/memetics","display_name":"Memetics","score":0.4785768985748291},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.46423378586769104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40288645029067993},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3944776952266693},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.33807116746902466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16408056020736694}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8047398328781128},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.7649757862091064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6818330883979797},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5831606984138489},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5673434734344482},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.4785768985748291},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.46423378586769104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40288645029067993},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3944776952266693},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33807116746902466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16408056020736694},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2003.1299890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299890","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:openaccess.yeditepe.edu.tr:20.500.11831/8447","is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.11831/8447","pdf_url":null,"source":{"id":"https://openalex.org/S7407055288","display_name":"Yeditepe University Institutional Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Web of Science","raw_type":"Event"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W132676638","https://openalex.org/W183020650","https://openalex.org/W326774659","https://openalex.org/W1497256448","https://openalex.org/W1502186542","https://openalex.org/W1518679956","https://openalex.org/W1545459265","https://openalex.org/W1560399833","https://openalex.org/W1570709358","https://openalex.org/W1581822553","https://openalex.org/W1766971425","https://openalex.org/W1817244122","https://openalex.org/W1883366561","https://openalex.org/W2003160050","https://openalex.org/W2011716148","https://openalex.org/W2032876227","https://openalex.org/W2050315723","https://openalex.org/W2086961057","https://openalex.org/W2133897050","https://openalex.org/W2152150600","https://openalex.org/W2324827308","https://openalex.org/W2399362491","https://openalex.org/W2574022113","https://openalex.org/W2904250082","https://openalex.org/W3023540311","https://openalex.org/W4285719527","https://openalex.org/W6605442218","https://openalex.org/W6607453643","https://openalex.org/W6631088941","https://openalex.org/W6632749127","https://openalex.org/W6633422000","https://openalex.org/W6634779340","https://openalex.org/W6639360379","https://openalex.org/W6679752787","https://openalex.org/W6684541762"],"related_works":["https://openalex.org/W2904131175","https://openalex.org/W115040951","https://openalex.org/W4242383018","https://openalex.org/W2077418700","https://openalex.org/W2102350580","https://openalex.org/W2008607212","https://openalex.org/W2095089069","https://openalex.org/W2097377934","https://openalex.org/W4211189042","https://openalex.org/W1990478250"],"abstract_inverted_index":{"Course":[0],"timetabling":[1,42],"problems":[2,8],"are":[3,10,64,76],"real":[4,72],"world":[5],"constraint":[6],"optimization":[7],"that":[9,32],"often":[11],"coped":[12],"with":[13],"educational":[14],"institutions,":[15],"such":[16,44],"as":[17],"universities":[18],"or":[19],"high":[20],"schools.":[21],"In":[22],"this":[23],"paper,":[24],"we":[25],"present":[26],"a":[27,55,67,71],"variety":[28],"of":[29,70],"new":[30],"operators":[31],"can":[33],"be":[34],"also":[35],"applied":[36],"in":[37],"evolutionary":[38],"algorithms":[39],"for":[40],"other":[41],"problems,":[43],"as,":[45],"exam":[46],"timetabling.":[47],"Operators":[48],"include":[49],"violation":[50,57],"directed":[51,58],"mutations,":[52],"crossovers,":[53],"and":[54,74],"successful":[56],"hierarchical":[59],"hill":[60],"climbing":[61],"method.":[62],"Tests":[63],"performed":[65],"on":[66],"small":[68],"portion":[69],"data":[73],"results":[75],"promising.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}