Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises
This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summariz...
Gespeichert in:
| Veröffentlicht in: | Mathematical problems in engineering 2021-11, Vol.2021, p.1-13 |
|---|---|
| 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 | 13 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | Mathematical problems in engineering |
| container_volume | 2021 |
| creator | Zhong, Weiya Cui, Jia |
| description | This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed. |
| doi_str_mv | 10.1155/2021/9308071 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2640853190</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2640853190</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1755-16bb71259177ea1a30004e3c97fc4b4ee54134423741bda92f689d23ba29e9ac3</originalsourceid><addsrcrecordid>eNp90E1LAzEQBuAgCtbqzR8Q8KhrM_nYbI6l1g8oVoqCt5Ddzbap26QmW4r_3pX27Gnm8PDO8CJ0DeQeQIgRJRRGipGCSDhBAxA5ywRwedrvhPIMKPs8RxcprUkvBRQDtBi3yxBdt9ok3ISI31z15fwSG1_jB5e66Mpd54LHocFz3zpv8TzWNibsPH61e7ywnXEtnvrOxm10yaZLdNaYNtmr4xyij8fp--Q5m82fXibjWVaBFCKDvCwlUKFASmvAMEIIt6xSsql4ya0VHBjnlEkOZW0UbfJC1ZSVhiqrTMWG6OaQu43he2dTp9dhF31_UtOck0IwUKRXdwdVxZBStI3uv9yY-KOB6L_W9F9r-thaz28PfOV8bfbuf_0L-Q5qsw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2640853190</pqid></control><display><type>article</type><title>Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises</title><source>Wiley Online Library Open Access</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Zhong, Weiya ; Cui, Jia</creator><contributor>He, Yandong ; Yandong He</contributor><creatorcontrib>Zhong, Weiya ; Cui, Jia ; He, Yandong ; Yandong He</creatorcontrib><description>This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><identifier>DOI: 10.1155/2021/9308071</identifier><language>eng</language><publisher>New York: Hindawi</publisher><subject>Algorithms ; Commodities ; Customers ; Electronic commerce ; Engineering ; Food ; Genetic algorithms ; Information processing ; Logistics ; Mathematical programming ; Order picking ; Order processing ; Packaging ; Route optimization ; Scheduling</subject><ispartof>Mathematical problems in engineering, 2021-11, Vol.2021, p.1-13</ispartof><rights>Copyright © 2021 Weiya Zhong and Jia Cui.</rights><rights>Copyright © 2021 Weiya Zhong and Jia Cui. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1755-16bb71259177ea1a30004e3c97fc4b4ee54134423741bda92f689d23ba29e9ac3</cites><orcidid>0000-0002-7766-4193 ; 0000-0001-8385-8472</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><contributor>He, Yandong</contributor><contributor>Yandong He</contributor><creatorcontrib>Zhong, Weiya</creatorcontrib><creatorcontrib>Cui, Jia</creatorcontrib><title>Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises</title><title>Mathematical problems in engineering</title><description>This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed.</description><subject>Algorithms</subject><subject>Commodities</subject><subject>Customers</subject><subject>Electronic commerce</subject><subject>Engineering</subject><subject>Food</subject><subject>Genetic algorithms</subject><subject>Information processing</subject><subject>Logistics</subject><subject>Mathematical programming</subject><subject>Order picking</subject><subject>Order processing</subject><subject>Packaging</subject><subject>Route optimization</subject><subject>Scheduling</subject><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp90E1LAzEQBuAgCtbqzR8Q8KhrM_nYbI6l1g8oVoqCt5Ddzbap26QmW4r_3pX27Gnm8PDO8CJ0DeQeQIgRJRRGipGCSDhBAxA5ywRwedrvhPIMKPs8RxcprUkvBRQDtBi3yxBdt9ok3ISI31z15fwSG1_jB5e66Mpd54LHocFz3zpv8TzWNibsPH61e7ywnXEtnvrOxm10yaZLdNaYNtmr4xyij8fp--Q5m82fXibjWVaBFCKDvCwlUKFASmvAMEIIt6xSsql4ya0VHBjnlEkOZW0UbfJC1ZSVhiqrTMWG6OaQu43he2dTp9dhF31_UtOck0IwUKRXdwdVxZBStI3uv9yY-KOB6L_W9F9r-thaz28PfOV8bfbuf_0L-Q5qsw</recordid><startdate>20211109</startdate><enddate>20211109</enddate><creator>Zhong, Weiya</creator><creator>Cui, Jia</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>COVID</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0002-7766-4193</orcidid><orcidid>https://orcid.org/0000-0001-8385-8472</orcidid></search><sort><creationdate>20211109</creationdate><title>Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises</title><author>Zhong, Weiya ; Cui, Jia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1755-16bb71259177ea1a30004e3c97fc4b4ee54134423741bda92f689d23ba29e9ac3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Commodities</topic><topic>Customers</topic><topic>Electronic commerce</topic><topic>Engineering</topic><topic>Food</topic><topic>Genetic algorithms</topic><topic>Information processing</topic><topic>Logistics</topic><topic>Mathematical programming</topic><topic>Order picking</topic><topic>Order processing</topic><topic>Packaging</topic><topic>Route optimization</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhong, Weiya</creatorcontrib><creatorcontrib>Cui, Jia</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Coronavirus Research Database</collection><collection>Middle East & Africa Database</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</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><collection>Engineering Collection</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhong, Weiya</au><au>Cui, Jia</au><au>He, Yandong</au><au>Yandong He</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2021-11-09</date><risdate>2021</risdate><volume>2021</volume><spage>1</spage><epage>13</epage><pages>1-13</pages><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed.</abstract><cop>New York</cop><pub>Hindawi</pub><doi>10.1155/2021/9308071</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-7766-4193</orcidid><orcidid>https://orcid.org/0000-0001-8385-8472</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1024-123X |
| ispartof | Mathematical problems in engineering, 2021-11, Vol.2021, p.1-13 |
| issn | 1024-123X 1563-5147 |
| language | eng |
| recordid | cdi_proquest_journals_2640853190 |
| source | Wiley Online Library Open Access; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection |
| subjects | Algorithms Commodities Customers Electronic commerce Engineering Food Genetic algorithms Information processing Logistics Mathematical programming Order picking Order processing Packaging Route optimization Scheduling |
| title | Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T02%3A08%3A34IST&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=Algorithms%20for%20Picking%20and%20Distribution%20of%20Online%20Orders%20in%20New%20Retail%20Enterprises&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Zhong,%20Weiya&rft.date=2021-11-09&rft.volume=2021&rft.spage=1&rft.epage=13&rft.pages=1-13&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/10.1155/2021/9308071&rft_dat=%3Cproquest_cross%3E2640853190%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=2640853190&rft_id=info:pmid/&rfr_iscdi=true |