scholarly journals Order Fulfillment Decision under Multiwarehouse Collaborative Delivery

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Song Shuanjun ◽  
Peng Longguang ◽  
Meng Yuanyi ◽  
Hu Sheng

Aiming at the high cost of multicategory orders fulfillment under multiwarehouse collaborative distribution, comprehensively considering the fulfillment costs of different orders fulfillment strategies, an order fulfillment strategy selection model is proposed. The first step of the model uses the linear programming algorithm to solve the cost of suborder merge transportation after the order is split. The second step calculates the cost of the current “greedy algorithm” of the e-commerce platform for order split fulfillment. Then, the cost of each strategy is compared and the lowest cost one is chosen. The calculation example analysis shows that the order fulfillment strategy is closely related to the delivery location of the order and the SKU category. When the delivery location is far away and SKU categories are many in the order, the merged transportation strategy of suborders after the order is split will be significantly better than the cost of separate transportation. The multiwarehouse collaborative distribution fulfillment strategy proposed in this paper can provide a decision basis for the e-commerce platform to choose which fulfillment method.

2004 ◽  
Vol 197 (1) ◽  
pp. 139-166 ◽  
Author(s):  
Aleksandar Donev ◽  
Salvatore Torquato ◽  
Frank H. Stillinger ◽  
Robert Connelly

2019 ◽  
Vol 135 ◽  
pp. 02016
Author(s):  
Elena Korchagina ◽  
Andrey Bochkarev ◽  
Pavel Bochkarev ◽  
Sergey Barykin ◽  
Svetlana Suvorova

The article addresses the treatment of applying the method of dynamic linear programming to solve the task of choosing the optimal strategy for the containers dispatch, taking into account the significant unevenness of loading and shipment of containers. The optimizing container transportation dynamic planning could be treated as mathematical model of the dynamic multi-period task of the loaded containers shipment, which allows the choice of the optimal strategy for sending containers, taking into account the significant unevenness of their loading and dispatch from the railway freight station. The efficiency of considered method is proved by numerical calculation being presented to disclose the dynamic linear programming algorithm implementing to solve the problem.


Sign in / Sign up

Export Citation Format

Share Document