主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院
Articles

A T-type Replenishment Strategy for Optimizing Logistics Operations of Retail Industry

Expand
  • 1. Research Center on Fictitious Economy and Data Science, Chinese Academy of Sciences, Beijing 100190, China;
    2. School of Economics and Management, University of Chinese Academy of Sciences, Beijing 100190, China;
    3. School of Information Technology, Jiangxi University of Finance & Economics, Nanchang 330013, China;
    4. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;
    5. Shanghai HEADING Information Engineering Co., Ltd, Shanghai 201112, China

Received date: 2017-01-13

  Revised date: 2018-02-23

  Online published: 2018-06-22

Abstract

At present, large and medium-sized retail logistics centers adopt three-dimensional shelves to enhance warehouse capacity, with hundreds of thousands of freight lots in different sizes. Each day, they need to handle the operations of tens of thousands to hundreds of thousands of Stock Keeping Units (SKUs). How to store these goods rationally and to replenish them to the picking lots efficiently are the key factors influencing the operational efficiency of the logistics centers.In computer science and management science, there are many approaches to store and replenish the products, but these methods are hard to implement in reality, especially when the number of SKUs is huge.Based on the virtual business theory, a brand new T-type replenishment strategy, i.e., taking the fixed picking lots as the base points, putting the storing good son shelves in T-shape and replenishing the goods is proposed to the picking lots with the "first in, first out" rule and the "closer and more priority" principle. Compared with the conventional replenishment strategy, the T-type replenishment strategy not only pays attention to the distances between the picking lot and the storing lots for a single commodity, but also emphasizes overall reasonableness of the storage of goods. The T-type replenishment strategy is a simple search algorithm that integrates easiness-to-implement, low operational cost and quick response capability, which can reduce storage and replenishment operations to achieve efficiency and profit growth.Comparing the operations data of a retailing firm in Shanghai, which is one of the top 100 retailing firms, before and after implementing the T-type replenishment strategy, it is found that the logistics operation efficiency has been greatly improved. The T-type replenishment strategy has been successfully applied by a batch of large-scale retailing logistics centers in the practice of information transformation, and significantly increased their economic benefits, which helps promote the commercial development and social progress in our country.

Cite this article

TIAN Xin, LUO Chun-lin, WANG Shou-yang, CHEN Qing-hong, LU Mei-hong . A T-type Replenishment Strategy for Optimizing Logistics Operations of Retail Industry[J]. Chinese Journal of Management Science, 2018 , 26(4) : 78 -87 . DOI: 10.16381/j.cnki.issn1003-207x.2018.04.009

References

[1] 田歆, 汪寿阳, 陈庆洪. 仓储配送中ABC管理的优化问题及其实证[J]. 运筹与管理, 2008,17(4):1-7.

[2] Berg JPVD. A literature survey on plannirong and contl of warehousing systems[J]. ⅡE Transactions, 1999, 31(8):751-762.

[3] Roodbergen K J, Vis I F A. A survey of literature on automated storage and retrieval systems[J]. European Journal of Operational Research, 2009,194(2):343-362.

[4] Hausman W H, Schwarz L B, Graves SC. Optimal storage assignement in automatic warehousing systems[J]. Management Science, 1976, 22(6):629-638.

[5] Ruben R A, Jacobs F R. Batch construction heuristics and storage assignment strategies for walk/ride and pick system[J]. Management Science, 1999, 45(4):575-596.

[6] AngT M, Lim Y F, Sim M. Robust storage assignment in unit-load warehouses[J]. Management Science, 2012, 58(11):2114-2130.

[7] Pan J C H, Shih P H, Wu M H, et al. A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system[J]. Computers & Industrial Engineering, 2015, 81:1-13.

[8] Goerigk M, Knust S, Le X T. Robust storage loading problems with stacking and payload constraints[J]. European Journal of Operational Research, 2016,253(1):51-67

[9] 肖建, 郑力. 考虑需求相关性的多巷道仓库货位分配问题[J]. 计算机集成制造系统,2008,14(12):2447-2451.

[10] 陈璐, 陆志强. 自动化立体仓库中的储位分配及存取路径优化[J]. 管理工程学报, 2012,26(1):42-47.

[11] 李英德. 波次分区拣货时装箱与货位指派问题协同优化的模型与算法[J]. 系统工程理论与实践, 2013, 33(5):1269-1276.

[12] 邓爱民, 蔡佳, 毛浪. 基于时间的自动化立体仓库货位优化模型研究[J]. 中国管理科学,2013,21(6):107-112.

[13] 宗晓萍, 齐兴敏, 王培光, 等. 自动化立体仓库拣选作业优化研究[J]. 企业物流, 2014,33(3):403-409.

[14] 宁浪, 张宏斌, 张斌. 面向JIT制造的零部件配送中心货位优化研究[J]. 管理科学学报, 2014,17(11):10-19.

[15] 董秉坤, 张群, 陈志新. 一种物品灵巧存取物流系统的设计与应用[J]. 中国管理科学, 2015, 23(11):234-239.

[16] 徐浩轩, 龚业明, 袁哲, 等. 考虑服务约束的第三方仓库收益与设计优化模型[J]. 中国管理科学,2015, 23(4):78-85.

[17] 付晓峰, 张波, 王卫青. 密集式叉车立体库的作业管理与货位分配算法[J]. 四川兵工学报, 2015,36(6):93-96.

[18] 李鹏飞,马航.基于病毒协同遗传算法的自动化立体仓库货位优化模型[J]. 中国管理科学,2017,25(5):70-77.

[19] 成思危. 信息化与虚拟商务[J]. 管理评论, 2014, 26(7):3-8.

[20] 成思危. 成思危论虚拟商务[M]. 北京:中国人民大学出版社, 2015.
Outlines

/