Optimization of picking in the warehouse
This paper studies the shortest path that the pickers should follow to complete the picking task in the actual e-commerce warehouse. Firstly, the concept of relay point is introduced and the distance model of the pickers in the warehouse is established through multiple Manhattan distances, and the c...
Gespeichert in:
| Veröffentlicht in: | Journal of physics. Conference series 2021-03, Vol.1861 (1), p.12100 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | 12100 |
| container_title | Journal of physics. Conference series |
| container_volume | 1861 |
| creator | Shen, Xiaojian Yi, Huiyang Wang, Jiaqi |
| description | This paper studies the shortest path that the pickers should follow to complete the picking task in the actual e-commerce warehouse. Firstly, the concept of relay point is introduced and the distance model of the pickers in the warehouse is established through multiple Manhattan distances, and the computer simulation method is used to obtain the precise distance of the pickers from the review station to the review station, from the stock keeping unit to the stock keeping unit and from the stock keeping unit to the review station. Then the picking problem of the picker is analogous to the TSP problem, and the shortest path that the picker walks is obtained by improving the results of the genetic algorithm. The sensitivity analysis results show that the model has good stability and prove the reliability of the model. |
| doi_str_mv | 10.1088/1742-6596/1861/1/012100 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2511971790</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2511971790</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2970-3ff470801c292464464a4bc4bc579828e0f81d572975c78262a7773b686034f83</originalsourceid><addsrcrecordid>eNo9UMFKxDAQDaLguvoNFrx4qZ1J2kx6lEVXYWEveg7dmrhZ3aYmLaJfb8rKDg9mhnm84T3GrhHuEJQqkEqey6qWBSqJBRaAHAFO2Ox4OT3OSp2zixh3ACIVzdjtuh_c3v02g_Nd5m3Wu_bDde-Z67Jha7LvJpitH6O5ZGe2-Yzm6r_P2evjw8viKV-tl8-L-1Xe8pogF9aWBAowrbyUZUJTbtqEimrFlQGr8K2iRK5aUlzyhojERioJorRKzNnNQbcP_ms0cdA7P4YuvdS8QqwJqYbEogOrDT7GYKzug9s34Ucj6CkWPRnWk3k9xaJRH2IRf8iWUjs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2511971790</pqid></control><display><type>article</type><title>Optimization of picking in the warehouse</title><source>Institute of Physics IOPscience extra</source><source>IOP_英国物理学会OA刊</source><source>Alma/SFX Local Collection</source><source>Free Full-Text Journals in Chemistry</source><source>EZB Electronic Journals Library</source><creator>Shen, Xiaojian ; Yi, Huiyang ; Wang, Jiaqi</creator><creatorcontrib>Shen, Xiaojian ; Yi, Huiyang ; Wang, Jiaqi</creatorcontrib><description>This paper studies the shortest path that the pickers should follow to complete the picking task in the actual e-commerce warehouse. Firstly, the concept of relay point is introduced and the distance model of the pickers in the warehouse is established through multiple Manhattan distances, and the computer simulation method is used to obtain the precise distance of the pickers from the review station to the review station, from the stock keeping unit to the stock keeping unit and from the stock keeping unit to the review station. Then the picking problem of the picker is analogous to the TSP problem, and the shortest path that the picker walks is obtained by improving the results of the genetic algorithm. The sensitivity analysis results show that the model has good stability and prove the reliability of the model.</description><identifier>ISSN: 1742-6588</identifier><identifier>EISSN: 1742-6596</identifier><identifier>DOI: 10.1088/1742-6596/1861/1/012100</identifier><language>eng</language><publisher>Bristol: IOP Publishing</publisher><subject>Computer simulation ; Genetic algorithms ; Optimization ; Physics ; Picking ; Sensitivity analysis ; Shortest-path problems ; Stability analysis ; Warehouses</subject><ispartof>Journal of physics. Conference series, 2021-03, Vol.1861 (1), p.12100</ispartof><rights>2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2970-3ff470801c292464464a4bc4bc579828e0f81d572975c78262a7773b686034f83</citedby><cites>FETCH-LOGICAL-c2970-3ff470801c292464464a4bc4bc579828e0f81d572975c78262a7773b686034f83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27929,27930</link.rule.ids></links><search><creatorcontrib>Shen, Xiaojian</creatorcontrib><creatorcontrib>Yi, Huiyang</creatorcontrib><creatorcontrib>Wang, Jiaqi</creatorcontrib><title>Optimization of picking in the warehouse</title><title>Journal of physics. Conference series</title><description>This paper studies the shortest path that the pickers should follow to complete the picking task in the actual e-commerce warehouse. Firstly, the concept of relay point is introduced and the distance model of the pickers in the warehouse is established through multiple Manhattan distances, and the computer simulation method is used to obtain the precise distance of the pickers from the review station to the review station, from the stock keeping unit to the stock keeping unit and from the stock keeping unit to the review station. Then the picking problem of the picker is analogous to the TSP problem, and the shortest path that the picker walks is obtained by improving the results of the genetic algorithm. The sensitivity analysis results show that the model has good stability and prove the reliability of the model.</description><subject>Computer simulation</subject><subject>Genetic algorithms</subject><subject>Optimization</subject><subject>Physics</subject><subject>Picking</subject><subject>Sensitivity analysis</subject><subject>Shortest-path problems</subject><subject>Stability analysis</subject><subject>Warehouses</subject><issn>1742-6588</issn><issn>1742-6596</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNo9UMFKxDAQDaLguvoNFrx4qZ1J2kx6lEVXYWEveg7dmrhZ3aYmLaJfb8rKDg9mhnm84T3GrhHuEJQqkEqey6qWBSqJBRaAHAFO2Ox4OT3OSp2zixh3ACIVzdjtuh_c3v02g_Nd5m3Wu_bDde-Z67Jha7LvJpitH6O5ZGe2-Yzm6r_P2evjw8viKV-tl8-L-1Xe8pogF9aWBAowrbyUZUJTbtqEimrFlQGr8K2iRK5aUlzyhojERioJorRKzNnNQbcP_ms0cdA7P4YuvdS8QqwJqYbEogOrDT7GYKzug9s34Ucj6CkWPRnWk3k9xaJRH2IRf8iWUjs</recordid><startdate>20210301</startdate><enddate>20210301</enddate><creator>Shen, Xiaojian</creator><creator>Yi, Huiyang</creator><creator>Wang, Jiaqi</creator><general>IOP Publishing</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>L7M</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20210301</creationdate><title>Optimization of picking in the warehouse</title><author>Shen, Xiaojian ; Yi, Huiyang ; Wang, Jiaqi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2970-3ff470801c292464464a4bc4bc579828e0f81d572975c78262a7773b686034f83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer simulation</topic><topic>Genetic algorithms</topic><topic>Optimization</topic><topic>Physics</topic><topic>Picking</topic><topic>Sensitivity analysis</topic><topic>Shortest-path problems</topic><topic>Stability analysis</topic><topic>Warehouses</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shen, Xiaojian</creatorcontrib><creatorcontrib>Yi, Huiyang</creatorcontrib><creatorcontrib>Wang, Jiaqi</creatorcontrib><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ProQuest Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Journal of physics. Conference series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shen, Xiaojian</au><au>Yi, Huiyang</au><au>Wang, Jiaqi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimization of picking in the warehouse</atitle><jtitle>Journal of physics. Conference series</jtitle><date>2021-03-01</date><risdate>2021</risdate><volume>1861</volume><issue>1</issue><spage>12100</spage><pages>12100-</pages><issn>1742-6588</issn><eissn>1742-6596</eissn><abstract>This paper studies the shortest path that the pickers should follow to complete the picking task in the actual e-commerce warehouse. Firstly, the concept of relay point is introduced and the distance model of the pickers in the warehouse is established through multiple Manhattan distances, and the computer simulation method is used to obtain the precise distance of the pickers from the review station to the review station, from the stock keeping unit to the stock keeping unit and from the stock keeping unit to the review station. Then the picking problem of the picker is analogous to the TSP problem, and the shortest path that the picker walks is obtained by improving the results of the genetic algorithm. The sensitivity analysis results show that the model has good stability and prove the reliability of the model.</abstract><cop>Bristol</cop><pub>IOP Publishing</pub><doi>10.1088/1742-6596/1861/1/012100</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1742-6588 |
| ispartof | Journal of physics. Conference series, 2021-03, Vol.1861 (1), p.12100 |
| issn | 1742-6588 1742-6596 |
| language | eng |
| recordid | cdi_proquest_journals_2511971790 |
| source | Institute of Physics IOPscience extra; IOP_英国物理学会OA刊; Alma/SFX Local Collection; Free Full-Text Journals in Chemistry; EZB Electronic Journals Library |
| subjects | Computer simulation Genetic algorithms Optimization Physics Picking Sensitivity analysis Shortest-path problems Stability analysis Warehouses |
| title | Optimization of picking in the warehouse |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-13T16%3A13%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimization%20of%20picking%20in%20the%20warehouse&rft.jtitle=Journal%20of%20physics.%20Conference%20series&rft.au=Shen,%20Xiaojian&rft.date=2021-03-01&rft.volume=1861&rft.issue=1&rft.spage=12100&rft.pages=12100-&rft.issn=1742-6588&rft.eissn=1742-6596&rft_id=info:doi/10.1088/1742-6596/1861/1/012100&rft_dat=%3Cproquest_cross%3E2511971790%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2511971790&rft_id=info:pmid/&rfr_iscdi=true |