{"id":"https://openalex.org/W2133711295","doi":"https://doi.org/10.1145/2480362.2480404","title":"A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem","display_name":"A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem","publication_year":2013,"publication_date":"2013-03-18","ids":{"openalex":"https://openalex.org/W2133711295","doi":"https://doi.org/10.1145/2480362.2480404","mag":"2133711295"},"language":"en","primary_location":{"id":"doi:10.1145/2480362.2480404","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2480362.2480404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th Annual ACM Symposium on Applied Computing","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/A5037695680","display_name":"Cl\u00e1udio Fabiano Motta Toledo","orcid":"https://orcid.org/0000-0003-4776-8052"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Claudio F. M. Toledo","raw_affiliation_strings":["University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil","institution_ids":["https://openalex.org/I17974374"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039202034","display_name":"M\u00e1rcio da Silva Arantes","orcid":"https://orcid.org/0000-0002-9309-7678"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcio da Silva Arantes","raw_affiliation_strings":["University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil","institution_ids":["https://openalex.org/I17974374"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031619125","display_name":"Renato Resende Ribeiro de Oliveira","orcid":null},"institutions":[{"id":"https://openalex.org/I1315085146","display_name":"Universidade Federal de Lavras","ror":"https://ror.org/0122bmm03","country_code":"BR","type":"education","lineage":["https://openalex.org/I1315085146"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Renato R. R. Oliveira","raw_affiliation_strings":["Federal University of Lavras, Lavras, MG, Brazil"],"affiliations":[{"raw_affiliation_string":"Federal University of Lavras, Lavras, MG, Brazil","institution_ids":["https://openalex.org/I1315085146"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084551356","display_name":"Alexandre C. B. Delbem","orcid":"https://orcid.org/0000-0003-1810-1742"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Alexandre C. B. Delbem","raw_affiliation_strings":["University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil"],"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5037695680"],"corresponding_institution_ids":["https://openalex.org/I17974374"],"apc_list":null,"apc_paid":null,"fwci":2.1053,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.88621684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9886000156402588,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/sizing","display_name":"Sizing","score":0.7842110991477966},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7455952167510986},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7216198444366455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6574316620826721},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6569811701774597},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6560673713684082},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5785309672355652},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5205115675926208},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4763110876083374},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4368094801902771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4135046601295471},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20316770672798157},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.08205384016036987},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.05797538161277771}],"concepts":[{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.7842110991477966},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7455952167510986},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7216198444366455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6574316620826721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6569811701774597},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6560673713684082},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5785309672355652},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5205115675926208},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4763110876083374},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4368094801902771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4135046601295471},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20316770672798157},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.08205384016036987},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.05797538161277771},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2480362.2480404","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2480362.2480404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th Annual ACM Symposium on Applied Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3824053298","display_name":null,"funder_award_id":"2011/15534-5, 2011/15581-3, 2010/10133-0","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"}],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1540706608","https://openalex.org/W1974954216","https://openalex.org/W1978009882","https://openalex.org/W1980760279","https://openalex.org/W1988303826","https://openalex.org/W2005757716","https://openalex.org/W2007797237","https://openalex.org/W2026582326","https://openalex.org/W2034904438","https://openalex.org/W2069633728","https://openalex.org/W2069862925","https://openalex.org/W2102510699","https://openalex.org/W2114557838","https://openalex.org/W2126759136","https://openalex.org/W2142661676","https://openalex.org/W2148379945","https://openalex.org/W2770038798","https://openalex.org/W4292921884"],"related_works":["https://openalex.org/W2131215816","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2041180560","https://openalex.org/W2130815404","https://openalex.org/W2122665723"],"abstract_inverted_index":{"The":[0,55],"present":[1],"paper":[2],"proposes":[3],"a":[4,8,69,88],"hybrid":[5,45,70,85],"version":[6],"of":[7,52],"compact":[9],"genetic":[10,72],"algorithm":[11,73],"(cGA)":[12],"as":[13],"approach":[14,46],"to":[15,32,41],"solve":[16],"the":[17,77,84],"Multi-Level":[18],"Capacitated":[19],"Lot":[20],"Sizing":[21],"Problem.":[22],"A":[23],"fix":[24],"and":[25,67],"optimize":[26],"heuristic":[27],"is":[28,39,47],"embedded":[29],"with":[30,60,68,95],"cGA":[31,86],"improve":[33],"solutions":[34],"while":[35],"mathematical":[36],"programming":[37],"technique":[38],"used":[40],"evaluate":[42],"them.":[43],"This":[44],"tested":[48],"over":[49],"two":[50,61],"sets":[51],"benchmark":[53],"instances.":[54],"results":[56,81],"achieved":[57],"are":[58],"compared":[59],"time-oriented":[62],"decomposition":[63],"heuristics":[64],"from":[65],"literature":[66],"multi-population":[71],"recently":[74],"proposed":[75],"for":[76,92],"same":[78],"problem.":[79],"Computational":[80],"show":[82],"that":[83],"has":[87],"superior":[89],"performance":[90],"mainly":[91],"instances":[93],"dealing":[94],"setup":[96],"times.":[97]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}