{"id":"https://openalex.org/W2161312825","doi":"https://doi.org/10.1109/cec.2011.5949639","title":"A discrete artificial bee colony algorithm for the economic lot scheduling problem","display_name":"A discrete artificial bee colony algorithm for the economic lot scheduling problem","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2161312825","doi":"https://doi.org/10.1109/cec.2011.5949639","mag":"2161312825"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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":true,"raw_author_name":"M. Fatih Tasgetiren","raw_affiliation_strings":["Industrial Engineering Department, Yasar University, Izmir, Turkey"],"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"],"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":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Murat Fadiloglu","raw_affiliation_strings":["Industrial Engineering Department, Izmir Economy University, Izmir, Turkey"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department, Izmir Economy University, Izmir, Turkey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089650598"],"corresponding_institution_ids":["https://openalex.org/I59944920"],"apc_list":null,"apc_paid":null,"fwci":5.2886,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.95153753,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"347","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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.9994000196456909,"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.9962999820709229,"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/T12288","display_name":"Optimization and Search Problems","score":0.9782000184059143,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6204293966293335},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5843952894210815},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.5665673017501831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5601107478141785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5432814359664917},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4758610129356384},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.46634265780448914},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44324031472206116},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.42991313338279724},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.4261205494403839},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.42176252603530884},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.41281214356422424},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4115133583545685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2910969853401184},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.0957869291305542},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.09426307678222656}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6204293966293335},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5843952894210815},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.5665673017501831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5601107478141785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5432814359664917},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4758610129356384},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46634265780448914},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44324031472206116},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.42991313338279724},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.4261205494403839},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.42176252603530884},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.41281214356422424},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4115133583545685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2910969853401184},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0957869291305542},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.09426307678222656},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2011.5949639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W181374404","https://openalex.org/W1967406152","https://openalex.org/W1983348386","https://openalex.org/W1986221804","https://openalex.org/W1991372444","https://openalex.org/W1998969892","https://openalex.org/W2010334716","https://openalex.org/W2023261881","https://openalex.org/W2037754907","https://openalex.org/W2054623195","https://openalex.org/W2060960395","https://openalex.org/W2087685067","https://openalex.org/W2090812374","https://openalex.org/W2091210562","https://openalex.org/W2092550662","https://openalex.org/W2106980278","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2145479420","https://openalex.org/W2145614148","https://openalex.org/W2167580870","https://openalex.org/W2169064301","https://openalex.org/W2287814884","https://openalex.org/W2313669427","https://openalex.org/W2325663341","https://openalex.org/W2502455647","https://openalex.org/W6696126189"],"related_works":["https://openalex.org/W2156819531","https://openalex.org/W2162001022","https://openalex.org/W2092240563","https://openalex.org/W1975572806","https://openalex.org/W2074319831","https://openalex.org/W2759139055","https://openalex.org/W2568166236","https://openalex.org/W2094800167","https://openalex.org/W2362221182","https://openalex.org/W2020576236"],"abstract_inverted_index":{"In":[0,31],"this":[1,105],"study":[2],"we":[3],"present":[4],"a":[5,36,47,63,84,114],"discrete":[6],"artificial":[7],"bee":[8],"colony":[9],"(DABC)":[10],"algorithm":[11,34,112,151,157,171],"to":[12,43,118,158,175],"solve":[13],"the":[14,52,67,72,89,99,102,123,135,138,161,169,176,181,185],"economic":[15],"lot":[16],"scheduling":[17],"problem":[18],"(ELSP)":[19],"under":[20,77,184],"extended":[21],"basic":[22],"period":[23,94],"(EBP)":[24],"approach":[25,79],"and":[26,76,122,129,187],"power":[27],"of-two":[28],"(PoT)":[29],"policy.":[30,189],"specific,":[32],"our":[33,110],"provides":[35],"cyclic":[37],"production":[38,53,124],"schedule":[39],"of":[40,55,62,74,101,140],"n":[41],"items":[42,90],"be":[44,96],"produced":[45,97],"on":[46],"single":[48],"machine":[49],"such":[50],"that":[51,86,168],"cycle":[54],"each":[56,93],"item":[57],"is":[58,81,108,152,172],"an":[59],"integer":[60,68],"multiple":[61],"fundamental":[64],"cycle.":[65],"All":[66],"multipliers":[69,121],"are":[70,132],"in":[71,92,134],"form":[73],"power-of-two,":[75],"EBP":[78,186],"feasibility":[80],"guaranteed":[82],"with":[83],"constraint":[85,143],"checks":[87],"if":[88],"assigned":[91],"can":[95],"within":[98],"length":[100],"period.":[103],"For":[104],"problem,":[106],"which":[107],"NP-hard,":[109],"DABC":[111,156],"employs":[113],"multi-chromosome":[115],"solution":[116,162],"representation":[117],"encode":[119],"power-of-two":[120],"positions":[125],"separately.":[126],"Both":[127],"feasible":[128],"infeasible":[130],"solutions":[131],"maintained":[133],"population":[136],"through":[137],"use":[139],"some":[141],"sophisticated":[142],"handling":[144],"methods.":[145],"A":[146],"variable":[147],"neighborhood":[148],"search":[149],"(VNS)":[150],"also":[153],"fused":[154],"into":[155],"further":[159],"enhance":[160],"quality.":[163],"The":[164],"experimental":[165],"results":[166],"show":[167],"proposed":[170],"very":[173],"competitive":[174],"best":[177],"performing":[178],"algorithms":[179],"from":[180],"existing":[182],"literature":[183],"PoT":[188]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}