Order Quantity Collaborative Model and Algorithm Research on Inbound Logistics

被引：0
|
作者：
Zhang X. [1 ]
Chen F. [1 ]
机构：
[1] School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai
来源：
Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University | 2019年 / 53卷 / 10期
关键词：
Inbound logistics; Mixed integer programming; Optimization algorithm; Order quantity collaboration;
D O I：
10.16183/j.cnki.jsjtu.2019.10.003
中图分类号：
学科分类号：
摘要：
The order collaboration in automobile inbound logistics is studied. A mixed integer programming model is established. A heuristic algorithm and a branch and bound method are proposed. The numerical experiments are carried out to verify the feasibility of the model and algorithm. The results show that the proposed heuristic algorithm and branch and bound method are superior to CPLEX in computing speed and result. Collaboration of order quantity can effectively reduce the total cost. © 2019, Shanghai Jiao Tong University Press. All right reserved.
引用
收藏
页码：1159 / 1164
页数：5
相关论文
共 13 条
  • [1] Lei L., Liu S., Ruszczynski A., Et al., On the integrated production, inventory, and distribution routing problem, IIE Transactions, 38, 11, pp. 955-970, (2006)
  • [2] Raa B., Fleet optimization for cyclic inventory routing problems, International Journal of Production Economics, 160, pp. 172-181, (2015)
  • [3] Absi N., Archetti C., Dauzere-Peres S., Et al., A two-phase iterative heuristic approach for the production routing problem, Transportation Science, 49, 4, pp. 1-22, (2015)
  • [4] Moin N.H., Yuliana T., Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem, Mathematical Problems in Engineering, 2015, 2, pp. 1-11, (2015)
  • [5] Belo-Filho M.A.F., Amorim P., Almada-Lobo B., An adaptive large neighbourhood search for the operational integrated production and distribution problem of perishable products, International Journal of Production Research, 53, 20, pp. 6040-6058, (2015)
  • [6] Vansteenwegen P., Mateo M., An iterated local search algorithm for the single-vehicle cyclic inventory routing problem, European Journal of Operational Research, 237, 3, pp. 802-813, (2014)
  • [7] Chen Y., Lu Z., Xi L., k-means clustering-tabu search algorithm for collaborative logistics network resource demands design and cost analysis, Journal of Shanghai Jiao Tong University, 9, pp. 1407-1411, (2009)
  • [8] Mirzaei S., Seifi A., Considering lost sale in inventory routing problems for perishable goods, Computers & Industrial Engineering, 87, pp. 213-227, (2015)
  • [9] Azadeh A., Elahi S., Farahani M.H., Et al., A genetic algorithm-taguchi based approach to inventory routing problem of a single perishable product with transshipment, Computers & Industrial Engineering, 104, pp. 124-133, (2017)
  • [10] Berman O., Wang Q., Inbound logistic planning: minimizing transportation and inventory cost, Transportation Science, 40, 3, pp. 287-299, (2006)
12