基于模拟退火的n-n入厂物流运输方案规划

doi:10.3969/j.issn.1007-7375.e16-1179

工业工程 ›› 2017, Vol. 20 ›› Issue (2): 86-90.doi: 10.3969/j.issn.1007-7375.e16-1179

基于模拟退火的n-n入厂物流运输方案规划

郑硕, 蔺宇

天津大学管理与经济学部, 天津 300072

收稿日期:2016-06-20 出版日期:2017-04-30 发布日期:2017-05-13
作者简介:郑硕(1992-),男,河北省人,硕士研究生,主要研究方向为供应链管理.

n-n Inbound Logistic Transportation Planning Based on Improved Simulated Annealing Algorithm

ZHENG Shuo, LIN Yu

College of Management and Economics, Tianjin University, Tianjin 300072, China

Received:2016-06-20 Online:2017-04-30 Published:2017-05-13

摘要/Abstract

摘要： 为降低企业入厂物流成本，以最小化运行成本为目标，将直送、越库和循环取货3种入厂物流运输模式拓展到多供应商、多制造商（n-n）的研究空间，建立入厂物流运输方案规划问题的非线性整数规划模型并使用模拟退火算法进行求解。该算法中解的表示方法采用了综合循环取货与越库的m×n矩阵编码方法，并设计了基于3种变异操作的邻域选择方法。最后的算例验证了算法的有效性及使用该方法设计的运输方案所具有的显著优越性。

关键词: 多对多物流系统, 入厂物流, 模拟退火

Abstract: To reduce inbound logistic cost of enterprises, aiming at minimizing running costs, three kinds of inbound logistic transportation modes: the direct transportation mode, the cross-dock transportation mode, and the milk-run transportation mode, were applied to the multi-suppliers and multi-manufactures (n-n) inbound logistic transportation problem. Then, the respective non-linear integer programming model was built and solved by simulated annealing algorithm. The solution coding scheme in this algorithm was m×n matrix coding scheme combining with the milk-run and the cross-dock. And the neighborhood selection process was designed based on three mutation operations. Finally, numerical examples verified the significant advantages of the proposed programming method and the validity of this proposed algorithm.

Key words: n-n logistic network, inbound logistics, Simulated Annealing Algorithm

中图分类号:

F252.14

郑硕, 蔺宇. 基于模拟退火的n-n入厂物流运输方案规划[J]. 工业工程, 2017, 20(2): 86-90.

ZHENG Shuo, LIN Yu. n-n Inbound Logistic Transportation Planning Based on Improved Simulated Annealing Algorithm[J]. Industrial Engineering Journal , 2017, 20(2): 86-90.

参考文献

[1] 马东彦. 基于直送的两阶段混合调度模型的模拟退火算法研究[J]. 物流技术, 2009, 28(10): 48-50. MA Dongyan. Simulated annealing algorithm of two-stage hybrid scheduling model based on through transport [J]. Logistics Technology, 2009, 28(10): 48-50.
[2] 邱晗光. 供应链协同供应配送策略研究[J]. 物流技术, 2013, 32(11): 336-338. QIU Hanguang. Study on supply chain joint supply and distribution strategy [J]. Logistics Technology, 2013, 32(11): 336-338.
[3] LEE Y H, JUNG W J, LEE K M. Vehicle routing scheduling for cross-docking in the supply chain [J]. Computers & Industrial Engineering, 2006, 51(2): 247-256.
[4] BERMAN Oded, QIAN Wang. Inbound logistic planning: minimizing transportation and inventory cost [J]. Transportation Science, 2006, 40(3): 287-299.
[5] LIAO Ching-Jong, LIN Yaoming, SHIH S C. Vehicle routing with cross-docking in the supply chain [J]. Expert Systems with Applications, 2010, 37(10): 6868-6873.
[6] 麦家骥, 陈峰. 基于循环取料的不确定越库调度模型与算法[J]. 上海交通大学学报, 2011, 45(2): 159-163. MAI Jiaji, CHEN Feng. Uncertain milk run-based cross docking scheduling: model and algorithms [J]. Journal of Shanghai Jiaotong University, 2011, 45(2): 159-163.
[7] MIAO Zhaowei, YANG Feng, FU Ke, et al. Transshipment service through crossdocks with both soft and hard time windows[J]. Annals of operations research, 2012, 192(1): 21-47.
[8] DONDO R, CERDÁ J. A monolithic approach to vehicle routing and operations scheduling of a cross-dock system with multiple dock doors [J]. Computers & Chemical Engineering, 2014, 63: 184-205.
[9] SADJADI S J, JAFARI M, AMINI T. A new mathematical modeling and a genetic algorithm search for milk run problem (an auto industry supply chain case study) [J]. The International Journal of Advanced Manufacturing Technology, 2009, 44(1/2): 194-200.
[10] 汪金莲, 蒋祖华. 汽车制造厂零部件入厂物流的循环取货路径规划[J]. 上海交通大学学报, 2009, 43(11): 1703-1708. WANG Jinlian, JIANG Zuhua. Routing for the Milk-Run Pickup System in Automobile Parts Supply [J]. Journal of Shanghai Jiaotong University, 2009, 43(11): 1703-1708.
[11] GURINDER Singh Brar, GAGAN Saini. Milk run logistics: literature review and directions [C]//Proceedings of the World Congress on Engineering. 2011, 1: 6-8.
[12] JAFARI-ESKANDARI M, ALIAHMADi A R, KHALEGHI G H H. A robust optimization approach for the milk run problem with time windows with inventory uncertainty: an auto industry supply chain case study [J]. International Journal of Rapid Manufacturing, 2010, 1(3): 334-347.
[13] 章勋宏, 贾国柱, 孔继利. 考虑零件三维装载约束带时间窗的循环取货路径问题研究[J]. 管理工程学报, 2014, 28(4): 207-218. ZHANG Xunhong, JIA Guozhu, KONG Jili. Vehicle routing problem with time windows under three-dimensional loading constraint based on milk-run [J]. Journal of Industrial Engineering /Engineering Management, 2014, 28(4): 207-218.
[14] 朱伟军, 屈挺, 王宗忠, 等. 工业园区集配中心循环取货路径规划[J]. 现代制造工程, 2015 (9): 13-19. ZHU Weijun, QU Ting, WANG Zongzhong, et al. Milk run route planning for supply hub in industrial park [J]. Modern Manufacturing Engineering, 2015 (9): 13-19.
[15] TOSHINORI Nemoto, KATSUHIKO Hayashi, MASATAKA Hashimoto. Milk-run logistics by Japanese automobile manufacturers in Thailand [J]. Procedia-Social and Behavioral Sciences, 2010, 2(3): 5980-5989.
[16] 邓爱民, 毛超, 周彦霆. 带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J]. 系统工程理论与实践, 2009, 29(5): 186-192. DENG Aimin, MAO Chao, ZHOU Yanting. Optimizing research of an improved simulated annealing algorithm to soft time windows vehicle routing problem with pick-up and delivery [J]. Systems Engineering--Theory & Practice, 2009, 29(5): 186-192.
[17] 郎茂祥. 配送车辆优化调度模型与算法[M]. 北京: 电子工业出版社, 2009.

基于模拟退火的n-n入厂物流运输方案规划

n-n Inbound Logistic Transportation Planning Based on Improved Simulated Annealing Algorithm

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 4

编辑推荐

Metrics

本文评价

[1]	王玖河, 韩希卓, 时国强. 考虑铁路分割线的物流园区功能区布局规划研究[J]. 工业工程, 2019, 22(5): 102-108.
[2]	刘思婧，张锦，李国旗. 基于退货策略的快速时尚品物流网络规划模型研究[J]. 工业工程, 2013, 16(6): 128-133.
[3]	林汉华1，陈新度1，吴立华1，李黎明2. 工期不确定的模具车间柔性Flowshop调度问题[J]. 工业工程, 2012, 15(1): 120-124.
[4]	彭碧涛1,2，周永务1. 三维装载约束的车辆路径问题的模拟退火算法[J]. 工业工程, 2011, 14(5): 71-74.