電子商務物流當日配訂單指派問題之研究

The same-day delivery orders assignment problem for E-commerce Logistics

林至康(Chih-Kang Lin) ； 盧宗成(Chung-Cheng Lu) ； 葉智承(Zhi-Cheng Yeh)

《管理學術研討會》 第十六屆 (2018/11) Pp. 1-10

https://doi.org/10.29893/NCUTMAN.201811.0001

摘要

本研究從電子商務平台業者立場，求解當日配（same-day delivery）訂單指派最佳化問題；所謂當日配是指在當日設定的截止時間前顧客所下的訂單，必須在當日物流公司結束營業前配送完畢。此一問題考慮電子商務平台業者與多家物流業者合作，由這些物流業者負責在當天指定的時間內將消費者網購商品配送到消費者指定的地點。此問題之求解目標為最小化電商平台業者之總物流成本；在限制式方面，除了每一筆訂單皆須指派給一家物流業者之外，亦須考量物流業者的服務區域與能量、以及訂單指派的公平性等實務上的要求，避免訂單無法配送，或是訂單集中於少數物流業者的情形發生。本研究以時空網路方式呈現一電商平台業者之當日配訂單需求，並以多層時空網路方式描述各家物流業者之供給資料，每一層時空網路代表一家物流業者，接著利用所建立之時空網路構建訂單指派最佳化數學模式。本研究以台灣主要電商平台資料為基礎產生測試範例，並利用Gurobi最佳化軟體進行求解。測試結果顯示模式求解品質良好，效率性高，可提供電子商務平台業者後續進行訂單當日配指派之參考。

關鍵字

電子商務 ； 物流管理 ； 訂單指派 ； 時空網路 ； 最佳化

並列摘要

This study deals with the problem of assigning same-day delivery orders of Electronic Commerce (EC) operators to their logistics service providers (LSPs). Same-day delivery orders refer to the orders which are placed by online shopping customers before the cut-off time set by EC operators and have to be delivered (usually by the end of operation time of logistics companies) on the same day. The problem considers a single EC operator collaborating with several LSPs that deliver online shopping orders to the locations specified by customers within the same day when orders are placed. The objective is to minimize the total logistics cost of the EC operator. The constraints include that (i) each order must be assigned to a LSP, (ii) the service areas, distribution modes and capacities of the LSPs need to be considered, and (iii) the minimal number of orders assigned to each LSP guaranteed by the EC operator must be satisfied. The last constraint facilitates that all orders do not concentrate on a small number of LSPs. This study builds a time-space network to represent the given same-day delivery orders (i.e., demand data) and constructs a multi-layer time-space network to describe the supply data (i.e., service areas, modes, capacities and costs) of the LSPs, with each layer corresponding to a LSP. An optimal same-day delivery orders assignment model is then established based on the constructed multi-layer time-space network. A numerical example is generated based on the real data of several EC operators in Taiwan and solved using the optimization software, Gurobi. Sensitivity analyses are also conducted to examine the impact of several model parameters on the objective value and computational time. The results show that the proposed model can help EC operators to effectively assign same-day-delivery orders to their LSPs.

並列關鍵字

E-commerce ； logistics management ； orders assignment ； time-space networks ； optimization