面向汽车入厂物流系统的订单量协同模型及其算法

doi:10.16183/j.cnki.jsjtu.2019.10.003

上海交通大学学报 ›› 2019, Vol. 53 ›› Issue (10): 1159-1164.doi: 10.16183/j.cnki.jsjtu.2019.10.003

面向汽车入厂物流系统的订单量协同模型及其算法

张璇，陈峰

上海交通大学机械与动力工程学院，上海 200240

出版日期:2019-10-28 发布日期:2019-11-01
通讯作者: 陈峰，男，副教授，博士生导师，电话（Tel.）：13918071898；E-mail: fchen@sjtu.edu.cn.
作者简介:张璇（1994-），女，宁夏回族自治区固原市人，硕士生，主要研究方向为算法设计与分析.
基金资助:
国家自然科学基金资助项目 (71672115)

Order Quantity Collaborative Model and Algorithm Research on Inbound Logistics

ZHANG Xuan,CHEN Feng

School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China

Online:2019-10-28 Published:2019-11-01

摘要/Abstract

摘要： 针对汽车入厂物流中的订单协同问题，建立了混合整数规划模型，提出了启发式算法和分支定界法，并采用数值实验验证了模型和算法的可行性.结果表明：启发式算法和分支定界法的计算速度和结果均优于CPLEX求解数学模型；协同订单量可有效降低总成本.

关键词: 入厂物流；订单量协同；混合整数规划；优化算法

Abstract: 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.

Key words: inbound logistics; order quantity collaboration; mixed integer programming; optimization algorithm

中图分类号:

C 935

张璇，陈峰. 面向汽车入厂物流系统的订单量协同模型及其算法[J]. 上海交通大学学报, 2019, 53(10): 1159-1164.

ZHANG Xuan,CHEN Feng. Order Quantity Collaborative Model and Algorithm Research on Inbound Logistics[J]. Journal of Shanghai Jiaotong University, 2019, 53(10): 1159-1164.

参考文献

［1］LEI L, LIU S, RUSZCZYNSKI A, et al. On the integrated production, inventory, and distribution routing problem［J］. IIE Transactions, 2006, 38(11): 955-970.
［2］RAA B. Fleet optimization for cyclic inventory routing problems［J］. International Journal of Production Economics, 2015, 160: 172-181.
［3］ABSI N, ARCHETTI C, DAUZRE-PRS S, et al. A two-phase iterative heuristic approach for the production routing problem［J］. Transportation Science, 2015, 49(4): 1-22.
［4］MOIN N H, YULIANA T. Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem［J］. Mathematical Problems in Engineering, 2015, 2015(2): 1-11.
［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［J］. International Journal of Production Research, 2015, 53(20): 6040-6058.
［6］VANSTEENWEGEN P, MATEO M. An iterated local search algorithm for the single-vehicle cyclic inventory routing problem［J］. European Journal of Operational Research, 2014, 237(3): 802-813.
［7］陈誉文, 陆志强, 奚立峰. 聚类/禁忌搜索的协同物流网络资源需求定制与成本分析［J］. 上海交通大学学报, 2009(9): 1407-1411.
CHEN Yuwen, LU Zhiqiang, XI Lifeng. k-means clustering-tabu search algorithm for collaborative logistics network resource demands design and cost analysis［J］. Journal of Shanghai Jiao Tong University, 2009(9): 1407-1411.
［8］MIRZAEI S, SEIFI A. Considering lost sale in inventory routing problems for perishable goods［J］. Computers & Industrial Engineering, 2015, 87: 213-227.
［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［J］. Computers & Industrial Engineering, 2017, 104: 124-133.
［10］BERMAN O, WANG Q. Inbound logistic planning: minimizing transportation and inventory cost［J］. Transportation Science, 2006, 40(3): 287-299.
［11］ARCHETTI C, CHRISTIANSEN M, SPERANZA M G. Inventory routing with pickups and deliveries［J］. European Journal of Operational Research, 2018, 268(1): 314-324.
［12］SOYSAL M, BLOEMHOF-RUWAARD J M, HAIJEMA R, et al. Modeling an inventory routing problem for perishable products with environmental considerations and demand uncertainty［J］. International Journal of Production Economics, 2015, 164: 118-133.
［13］ZHONG Y, AGHEZZAF E H. Combining DC-programming and steepest-descent to solve the single-vehicle inventory routing problem［J］. Computers & Industrial Engineering, 2011, 61(2): 313-321.

[1]	虎慧泽,杨之涛,陈尔真,刘冉. 面向时变复杂环境的救护车布置和重定位[J]. 上海交通大学学报, 2019, 53(10): 1165-1172.
[2]	张政, 谢晓岚, 耿娜. 多目标优化下的手术室分派调度问题[J]. 上海交通大学学报（自然版）, 2012, 46(12): 1983-1988.

面向汽车入厂物流系统的订单量协同模型及其算法

Order Quantity Collaborative Model and Algorithm Research on Inbound Logistics

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

本文评价