{"id":"https://openalex.org/W3162191716","doi":"https://doi.org/10.1145/3448734.3450854","title":"Analysis and Research on Optimization of Picking in Warehouse","display_name":"Analysis and Research on Optimization of Picking in Warehouse","publication_year":2021,"publication_date":"2021-01-28","ids":{"openalex":"https://openalex.org/W3162191716","doi":"https://doi.org/10.1145/3448734.3450854","mag":"3162191716"},"language":"en","primary_location":{"id":"doi:10.1145/3448734.3450854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448734.3450854","pdf_url":null,"source":{"id":"https://openalex.org/S4306531993","display_name":"The 2nd International Conference on Computing and Data Science","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2nd International Conference on Computing and Data Science","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/A5065487257","display_name":"Jingru Chen","orcid":"https://orcid.org/0000-0001-9317-906X"},"institutions":[{"id":"https://openalex.org/I167027274","display_name":"Nanjing Forestry University","ror":"https://ror.org/03m96p165","country_code":"CN","type":"education","lineage":["https://openalex.org/I167027274"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jingru Chen","raw_affiliation_strings":["Nanjing Forestry University"],"affiliations":[{"raw_affiliation_string":"Nanjing Forestry University","institution_ids":["https://openalex.org/I167027274"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011809514","display_name":"Linjing Xing","orcid":null},"institutions":[{"id":"https://openalex.org/I177739611","display_name":"Yangtze University","ror":"https://ror.org/05bhmhz54","country_code":"CN","type":"education","lineage":["https://openalex.org/I177739611"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Linjing Xing","raw_affiliation_strings":["Yangtze University"],"affiliations":[{"raw_affiliation_string":"Yangtze University","institution_ids":["https://openalex.org/I177739611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024027579","display_name":"Xun Shen","orcid":"https://orcid.org/0000-0002-8827-5791"},"institutions":[{"id":"https://openalex.org/I174442536","display_name":"South Central University for Nationalities","ror":"https://ror.org/03d7sax13","country_code":"CN","type":"education","lineage":["https://openalex.org/I174442536"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xun Shen","raw_affiliation_strings":["South-Central University for Nationalities"],"affiliations":[{"raw_affiliation_string":"South-Central University for Nationalities","institution_ids":["https://openalex.org/I174442536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065487257"],"corresponding_institution_ids":["https://openalex.org/I167027274"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07621483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"3"},"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.9945999979972839,"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.9945999979972839,"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/desk","display_name":"Desk","score":0.7122136354446411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7107608318328857},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6765322685241699},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5239422917366028},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5147726535797119},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.49906349182128906},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49524059891700745},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4688397943973541},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.46730685234069824},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45220187306404114},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44254687428474426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19792243838310242},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12776917219161987},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1266137659549713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12258002161979675}],"concepts":[{"id":"https://openalex.org/C2776545233","wikidata":"https://www.wikidata.org/wiki/Q1064858","display_name":"Desk","level":2,"score":0.7122136354446411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7107608318328857},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6765322685241699},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5239422917366028},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5147726535797119},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.49906349182128906},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49524059891700745},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4688397943973541},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.46730685234069824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45220187306404114},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44254687428474426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19792243838310242},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12776917219161987},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1266137659549713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12258002161979675},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3448734.3450854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448734.3450854","pdf_url":null,"source":{"id":"https://openalex.org/S4306531993","display_name":"The 2nd International Conference on Computing and Data Science","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2nd International Conference on Computing and Data Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475"],"abstract_inverted_index":{"The":[0,41,98,116,135],"rapid":[1],"development":[2],"of":[3,15,26,36,39,157,173,209],"e-commerce":[4],"requires":[5],"warehouse":[6,117],"to":[7,33,121,153],"improve":[8],"picking":[9,27,182,214],"efficiency":[10],"and":[11,17,56,59,63,65,88,94,108,128,159,177,186,189,201,216],"reduce":[12,160],"the":[13,22,34,37,78,82,85,89,92,95,109,122,126,129,133,147,161,163,168,178,190,197,204,207,221],"waste":[14],"manpower":[16],"time.":[18],"This":[19],"paper":[20,205],"studies":[21],"optimal":[23,169,191],"route":[24],"problem":[25,38,101,164,172,180],"goods":[28],"in":[29],"warehouse,":[30],"which":[31,150],"belongs":[32],"deformation":[35],"travelers.":[40],"model":[42,138],"is":[43,102,114,119,139,165,193],"constructed":[44],"by":[45,61,141],"using":[46],"classification":[47],"discussion,":[48],"linear":[49,105],"programming,":[50],"ant":[51,142],"colony":[52,143],"algorithm,":[53],"immune":[54],"algorithm":[55],"arrangement":[57],"combination,":[58],"solved":[60],"MATLAB":[62],"excel,":[64],"further":[66],"optimization":[67,148],"strategies":[68],"are":[69],"given.":[70],"It":[71],"can":[72,151],"be":[73],"divided":[74,166],"into":[75,104,167],"three":[76],"categories:":[77],"distance":[79,83,90,100,111],"between":[80,84,91,112],"shelves,":[81],"review":[86,96,130,187],"bench":[87],"shelves":[93],"desk.":[97],"shortest":[99,110,136],"transformed":[103],"programming":[106],"problem,":[107],"elements":[113],"obtained.":[115,194],"diagram":[118],"simplified":[120],"authorized":[123],"drawing":[124],"with":[125,196],"shelf":[127],"desk":[131],"as":[132],"node.":[134],"path":[137,170],"established":[140],"algorithm.":[144],"Based":[145],"on":[146,213,220],"model,":[149],"adapt":[152],"a":[154],"large":[155],"number":[156],"calculations":[158],"repetition,":[162],"selection":[171],"each":[174],"task":[175,184],"list":[176,185],"best":[179,210,222],"among":[181],"personnel,":[183],"desk,":[188],"scheme":[192],"Combined":[195],"results,":[198],"actual":[199],"situation":[200],"relevant":[202],"literature,":[203],"analyzes":[206],"effect":[208],"seller":[211,223],"placement":[212],"efficiency,":[215],"puts":[217],"forward":[218],"suggestions":[219],"placement.":[224]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
