{"id":"https://openalex.org/W3010075537","doi":"https://doi.org/10.1109/icsai48974.2019.9010580","title":"Storage Allocation Algorithm with Multi-Objective Optimization in High-Density Tridimensional Warehouse","display_name":"Storage Allocation Algorithm with Multi-Objective Optimization in High-Density Tridimensional Warehouse","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3010075537","doi":"https://doi.org/10.1109/icsai48974.2019.9010580","mag":"3010075537"},"language":"en","primary_location":{"id":"doi:10.1109/icsai48974.2019.9010580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsai48974.2019.9010580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Systems and Informatics (ICSAI)","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/A5045132819","display_name":"Qiubo Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiubo Huang","raw_affiliation_strings":["School of Computer Science and Technology, Donghua University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Donghua University, Shanghai, China","institution_ids":["https://openalex.org/I181326427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006898766","display_name":"Shuda Xie","orcid":null},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuda Xie","raw_affiliation_strings":["School of Computer Science and Technology, Donghua University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Donghua University, Shanghai, China","institution_ids":["https://openalex.org/I181326427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100380138","display_name":"Guohua Liu","orcid":"https://orcid.org/0000-0001-8461-9473"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guohua Liu","raw_affiliation_strings":["School of Computer Science and Technology, Donghua University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Donghua University, Shanghai, China","institution_ids":["https://openalex.org/I181326427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181326427"],"apc_list":null,"apc_paid":null,"fwci":0.4083,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61241869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"40","issue":null,"first_page":"195","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998999834060669,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9909999966621399,"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/knapsack-problem","display_name":"Knapsack problem","score":0.7016623616218567},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6675969362258911},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6508151888847351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6147856712341309},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5306149125099182},{"id":"https://openalex.org/keywords/rack","display_name":"Rack","score":0.5168328881263733},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4445899724960327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24306821823120117},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1382223665714264}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7016623616218567},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6675969362258911},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6508151888847351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6147856712341309},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5306149125099182},{"id":"https://openalex.org/C2776843527","wikidata":"https://www.wikidata.org/wiki/Q1351382","display_name":"Rack","level":2,"score":0.5168328881263733},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4445899724960327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24306821823120117},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1382223665714264},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsai48974.2019.9010580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsai48974.2019.9010580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Systems and Informatics (ICSAI)","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":2,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1964379056"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W1966986652","https://openalex.org/W2142105839","https://openalex.org/W1563501581","https://openalex.org/W4389887952","https://openalex.org/W4391505986","https://openalex.org/W2367132302","https://openalex.org/W814774360"],"abstract_inverted_index":{"Storage":[0],"allocation":[1,28,42],"in":[2,15,29,139],"a":[3,16,23,51,154],"high-density":[4],"tridimensional":[5],"warehouse":[6,33],"has":[7],"more":[8,145],"constraints":[9],"and":[10,49,70,95,144],"optimization":[11,72,132],"objectives":[12],"than":[13],"that":[14,111],"single":[17],"or":[18],"dual":[19],"rack":[20],"warehouse.":[21],"As":[22],"result,":[24],"algorithms":[25],"for":[26,66,89],"storage":[27,41],"this":[30,96],"kind":[31],"of":[32,104,115],"must":[34],"be":[35],"different.":[36],"This":[37],"paper":[38],"mapped":[39],"the":[40,45,58,67,71,77,82,93,102,108,112,150],"problem":[43,47,142],"to":[44,56,75,92,100],"knapsack":[46],"(KP)":[48],"introduced":[50],"dynamic":[52],"programming":[53],"(DP)":[54],"algorithm":[55,117,135],"solve":[57],"problem.":[59],"A":[60,84],"penalty":[61,78],"score":[62,79],"strategy":[63,86,97],"was":[64,87,118],"defined":[65],"DP":[68,105,116,134,147],"algorithm,":[69],"objective":[73],"is":[74],"minimize":[76],"while":[80],"satisfying":[81],"constraints.":[83],"multi-index":[85],"used":[88],"preprocess":[90],"according":[91],"constraints,":[94],"also":[98],"helped":[99],"reduce":[101],"scale":[103],"algorithm.":[106,126],"Finally,":[107],"simulation":[109],"showed":[110],"time":[113],"complexity":[114],"greatly":[119],"reduced":[120],"compared":[121,128],"with":[122,129],"depth-first-search":[123],"based":[124],"recursive":[125],"While":[127],"particle":[130],"swarm":[131],"(PSO),":[133],"can":[136,148],"run":[137],"faster":[138],"actual":[140],"projects":[141],"scale,":[143],"importantly,":[146],"get":[149],"optimal":[151],"solution,":[152],"not":[153],"suboptimal":[155],"one.":[156]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}