E-viri
Recenzirano
-
Wan, Yanchun; Wang, Shudi; Hu, Yujun
Engineering letters, 05/2023, Letnik: 31, Številka: 2Journal Article
Online order picking has become one of the key issues for ensuring the service level of modern retail e-commerce. This paper studies the online order batching and batch assignment problem (OOBBAP) with multiple pickers of picker-to-parts warehouses. First, we establish a biobjective optimization model that minimises the total picking time and order response time. Then, an online order batching algorithm embedded with the sequencing algorithm and optimal path algorithm is designed to solve the model. Finally, we use retail e-commerce from China with data on 87,277 orders of an online shopping festival to examine the optimization results of the model. The optimization results of the key indicators are satisfactory. The optimization rates of the maximum order response time, average order response time, total picking time, average picking time of picking posts, picker total walking distance and average walking distance are between 7.45% and 30.20%. The model demonstrates an excellent ability to solve the OOBBAP in multiple picker warehouses, which can provide a reference solution for similar picking problems in picker-to-parts retail e-commerce warehouses.
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.