{"id":"https://openalex.org/W2149781825","doi":"https://doi.org/10.1109/sde.2011.5952072","title":"A Differential Evolution algorithm for the economic lot scheduling problem","display_name":"A Differential Evolution algorithm for the economic lot scheduling problem","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2149781825","doi":"https://doi.org/10.1109/sde.2011.5952072","mag":"2149781825"},"language":"en","primary_location":{"id":"doi:10.1109/sde.2011.5952072","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sde.2011.5952072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Symposium on Differential Evolution (SDE)","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/A5089650598","display_name":"M. Fatih Tasgetiren","orcid":"https://orcid.org/0000-0002-5716-575X"},"institutions":[{"id":"https://openalex.org/I59944920","display_name":"Ya\u015far University","ror":"https://ror.org/00dz1eb96","country_code":"TR","type":"education","lineage":["https://openalex.org/I59944920"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"M. Fatih Tasgetiren","raw_affiliation_strings":["Industrial Engineering Department, Yasar University, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Yasar University, Izmir, Turkey","institution_ids":["https://openalex.org/I59944920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056325509","display_name":"\u00d6nder Bulut","orcid":"https://orcid.org/0000-0003-1476-6333"},"institutions":[{"id":"https://openalex.org/I59944920","display_name":"Ya\u015far University","ror":"https://ror.org/00dz1eb96","country_code":"TR","type":"education","lineage":["https://openalex.org/I59944920"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Onder Bulut","raw_affiliation_strings":["Industrial Engineering Department, Yasar University, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Yasar University, Izmir, Turkey","institution_ids":["https://openalex.org/I59944920"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060263125","display_name":"Mehmet Murat Fad\u0131lo\u011flu","orcid":"https://orcid.org/0000-0003-0610-775X"},"institutions":[{"id":"https://openalex.org/I15059493","display_name":"\u0130zmir University of Economics","ror":"https://ror.org/04hjr4202","country_code":"TR","type":"education","lineage":["https://openalex.org/I15059493"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"M. Murat Fadiloglu","raw_affiliation_strings":["Industrial and Systems Engineering, Izmir University of Economics, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial and Systems Engineering, Izmir University of Economics, Izmir, Turkey","institution_ids":["https://openalex.org/I15059493"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.22999109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.677279531955719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6727656126022339},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6021925210952759},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.5980774760246277},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5421687960624695},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5023236274719238},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.48302754759788513},{"id":"https://openalex.org/keywords/production-schedule","display_name":"Production schedule","score":0.44575971364974976},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.43289270997047424},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4212121069431305},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41289931535720825},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4124053716659546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40816226601600647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2284925878047943},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.08801379799842834}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.677279531955719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6727656126022339},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6021925210952759},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.5980774760246277},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5421687960624695},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5023236274719238},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.48302754759788513},{"id":"https://openalex.org/C2778420936","wikidata":"https://www.wikidata.org/wiki/Q7247843","display_name":"Production schedule","level":3,"score":0.44575971364974976},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.43289270997047424},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4212121069431305},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41289931535720825},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4124053716659546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40816226601600647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2284925878047943},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.08801379799842834},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sde.2011.5952072","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sde.2011.5952072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Symposium on Differential Evolution (SDE)","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":26,"referenced_works":["https://openalex.org/W350071688","https://openalex.org/W1496503345","https://openalex.org/W1540838551","https://openalex.org/W1591000919","https://openalex.org/W1595159159","https://openalex.org/W1879678483","https://openalex.org/W1967406152","https://openalex.org/W1986221804","https://openalex.org/W1991372444","https://openalex.org/W1998674867","https://openalex.org/W2023261881","https://openalex.org/W2054623195","https://openalex.org/W2060960395","https://openalex.org/W2087685067","https://openalex.org/W2091210562","https://openalex.org/W2092550662","https://openalex.org/W2106980278","https://openalex.org/W2145479420","https://openalex.org/W2145614148","https://openalex.org/W2156194072","https://openalex.org/W2167580870","https://openalex.org/W3137715965","https://openalex.org/W6611846058","https://openalex.org/W6632536631","https://openalex.org/W6635478365","https://openalex.org/W6639376729"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2162001022","https://openalex.org/W2092240563","https://openalex.org/W2074319831","https://openalex.org/W2094800167","https://openalex.org/W2020576236","https://openalex.org/W2963730330"],"abstract_inverted_index":{"In":[0],"this":[1],"study":[2],"we":[3],"provide":[4],"a":[5,40,94],"Differential":[6],"Evolution":[7],"(DE)":[8],"based":[9],"heuristic":[10],"to":[11,26,36],"solve":[12],"the":[13,28,45,56,62,81,91,98,108],"Economic":[14],"Lot":[15],"Scheduling":[16],"Problem":[17],"(ELSP)":[18],"under":[19],"basic":[20,57,104],"period":[21,105],"approach.":[22],"The":[23,59],"problem":[24,99],"is":[25,51,78,88,101],"find":[27],"best":[29],"cyclic":[30],"production":[31,46,63],"schedule":[32],"of":[33,48,55,93,97],"n":[34],"items":[35],"be":[37],"produced":[38],"on":[39],"single":[41],"machine":[42],"such":[43],"that":[44,75],"cycle":[47],"each":[49],"item":[50],"an":[52],"integer":[53],"multiple":[54],"period.":[58],"demand":[60],"and":[61,67,85],"rates":[64],"are":[65],"deterministic":[66],"known":[68],"in":[69,107],"advance.":[70],"Our":[71],"computational":[72],"results":[73],"suggest":[74],"our":[76],"algorithm":[77],"competitive":[79],"with":[80],"existing":[82],"genetic":[83],"algorithm,":[84],"therefore":[86],"it":[87],"promising":[89],"for":[90],"solution":[92],"generalized":[95],"version":[96],"which":[100],"called":[102],"extended":[103],"approach":[106],"future.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}