基于时空网络的汽车零部件干线运输调拨策略优化模型

doi:10.13229/j.cnki.jdxbgxb.20240592

摘要/Abstract

摘要：

针对运输车辆在整车厂卸载后的“回空现象”，本文构建了时空网络描述各城市集散中心和整车厂的零部件调拨过程，以运输、库存和总成本最低为目标建立零部件调拨策略优化模型，并借助企业实际数据进行算例分析。结果表明：相较于现有调拨方案，优化后的方案减少了零部件回程运输的资源浪费，提高了车辆的利用率，显著降低了总成本。

关键词: 汽车零部件, 干线运输, 时空网络, 调拨策略

Abstract:

To address the “empty-backhaul” problem that occurs after delivery vehicles unload at vehicle-assembly plants， this paper constructs a space-time network to depict the parts-allocation processes among city distribution centers and assembly plants. An optimization model for parts-allocation strategies is developed with the objectives of minimizing transportation， inventory， and total costs， and a numerical example is solved using real enterprise data. The results show that， compared with the existing allocation plan， the optimized solution reduces the resource waste caused by empty return hauls， improves vehicle utilization， and significantly lowers total cost.

Key words: auto parts, trunk transportation, spatiotemporal network, allocation strategy

中图分类号:

U294

李智昊,宋瑞. 基于时空网络的汽车零部件干线运输调拨策略优化模型[J]. 吉林大学学报(工学版), 2026, 56(1): 150-157.

Zhi-hao LI,Rui SONG. Convection allocation algorithm for trunk transportation of auto parts based on spatiotemporal network[J]. Journal of Jilin University(Engineering and Technology Edition), 2026, 56(1): 150-157.

图/表 9

图1

表1

表2

表3

表4

表5

表6

图2

表7

参考文献 17

[1]	靳志宏, 邢磊, 蔡佳芯, 等. 集装箱零部件调运问题研究综述[J]. 大连海事大学学报, 2021, 47(1): 52-60, 110.
	Jin Zhi-hong, Xing Lei, Cai Jia-xin, et al. A review of research on container parts and components transportation[J]. Journal of Dalian Maritime University, 2021, 47(1): 52-60, 110.
[2]	潘常虹, 范厚明. 我国大型集装箱班轮公司空箱调运问题分析[J]. 物流技术, 2010, 29(17): 16-18.
	Pan Chang-hong, Fan Hou-ming. Analysis of the empty container allocation by the large-scale container liner companies in China[J]. Logistics Technology, 2010, 29(17):16-18.
[3]	Misra S C. Linear programming of empty wagon disposition[J]. Rail Internet, 1972, 7(3): 151-158.
[4]	Hiraki S, Ishii K, Katayama H. Designing of a production ordering system for automobile repair parts[J]. International Journal of Production Economics, 1999(60,61): 289-294.
[5]	王吉生,朱安格,唐金丽. 集装箱甩挂运输调度优化[J]. 中国储运, 2022, 4: 163-164.
	Wang Ji-sheng, Zhu An-ge, Tang Jin-li. Scheduling optimization of container dumping transportation[J]. China Storage and Transportation, 2022, 4: 163-164.
[6]	石红国, 高明瑶. 带时间窗约束的集装箱空箱调运随机机会约束模型研究[J]. 铁道运输与经济, 2020, 42(2): 87-92.
	Shi Hong-guo, Gao Ming-yao. Research on stochastic chance constraint model of empty container transfer with time window constraint[J]. Railway Transportation and Economy, 2020, 42(2): 87-92.
[7]	Jiang D. Research on railway emptycontainer disposition based on the integer linear programming method[C]∥Inernational Conference of Logistics Engineering and Management,Chengdu,China, 2012: 332-337.
[8]	Crainic T G, Gendreau M, Dejax P. Modelling the container fleet management problem using a stochastic dynamic approach[J]. Operational Research, 2003(5): 473-483.
[9]	李玉, 高银萍, 凌强. 基于数字孪生的自动化集装箱码头多AGV动态调度[J]. 计算机集成制造系统, 2023, 29(12): 4175-4190.
	Li Yu, Gao Yin-ping, Lin Qiang. Dynamic scheduling of multiple AGVs in automated container terminals based on digital twins[J]. Computer Integrated Manufacturing Systems, 2023, 29(12): 4175-4190.
[10]	李莉. 基于Supply-hub的物流服务供应链供应商动态优化选择研究[D]. 武汉: 武汉理工大学物流工程学院, 2019.
	Li Li. Research on dynamic optimization selection of logistics service supplychain suppliers based on Supply-hub[D]. Wuhan: School of Logistics Engineering,Wuhan University of Technology, 2019.
[11]	李俊, 尹晶, 张煜. 汽车零部件多式联运组合式单元集装箱装载优化模型与算法[J]. 交通信息与安全, 2023, 41(5): 127-137.
	Li Jun, Yin Jing, Zhang Yu. Optimization model and algorithm for loading of combined unit containers for multimodal transportation of automotive parts[J]. Transportation Information and Safety, 2023, 41(5): 127-137.
[12]	代燕. 基于船联网的MILK-RUN船舶运输调度系统研究[J]. 舰船科学技术, 2017, 39(22): 28-30.
	Dai Yan. Research on MILK-RUN ship transportation scheduling system based on ship networking[J]. Ship Science and Technology, 2017, 39(22): 28-30.
[13]	He J L, Huang Y F, Chang D F. Simulation-based heuristic method for container supply chain network optimization[J]. Advanced Engineering Informatics, 2015, 29(3): 339-354.
[14]	Chao S L, Chen C C. Applying a time-space network to reposition reefer containers among major asian ports[J]. Research in Transportation Business & Management, 2015(17): 65-71.
[15]	Hao C L, Yue Y X. Optimization on combination of transport routes and modes on dynamic programming for a container multimodal transport system[J]. Procedia Engineering, 2016(137): 383-388.
[16]	朱爽, 王东. 汽车零部件物流网络优化设计与实现[J].计算机工程, 2011, 37(12): 258-261.
	Zhu Shuang, Wang Dong. Optimization design and implementation of automotive parts logistics network [J]. Computer Engineering, 2011,37(12):258-261.
[17]	汪金莲. 汽车制造厂零部件入厂物流循环取货运输路线规划和优化算法的研究[D]. 上海: 上海交通大学机械与动力工程学院, 2010.
	Wang Jin-lian. Research on the planning and optimization algorithm of logistics recycling and pickup transportation route for automotive manufacturing plant parts[D]. Shanghai: School of Mechanical Engineering, Shanghai Jiao Tong University, 2010.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed

	长春	天津	上海	长春'	天津'	上海'
长春	/	4	14	50	4+50	14+50
天津	4	/	12	4+50	50	12+50
上海	14	12	/	14+50	12+50	50
长春'	50	4+50	14+50	0	4+50	14+50
天津'	4+50	50	12+50	4+50	0	12+50
上海'	14+50	12+50	50	14+50	12+50	0

n=1	a=0~1：第1天		a=1~2：第2天		a=2~3：第3天
n=1	生产计划	供应量	生产计划	供应量	生产计划	供应量
长春	0	3	3	1	0	3
天津	0	1	2	6	4	0
上海	5	0	0	7	0	1
n=2	a=0~1：第1天		a=1~2：第2天		a=2~3：第3天
n=2	生产计划	供应量	生产计划	供应量	生产计划	供应量
长春	1	0	1	1	0	2
天津	4	0	3	0	1	2
上海	2	1	2	3	3	2

n=1：供>需	i	a	j	b	q（运输量）	成本
零部件运输	天津	0	上海	1	5	12
	上海	1	天津	2	5+2=7	12
	天津	1	长春	2	3	4
	天津	2	上海	3	2	12
	长春	2	天津	3	3+4=7	4
	天津	3	长春	4	4	4
零部件库存成本=q×c×t	长春	0	长春	2	3	3×1×2
零部件库存成本=q×c×t	天津	2	天津	3	5	5×2×1
n=2：供<需	i	a	j	b	q（运输量）	成本
零部件运输	天津	0	长春	1	1	4
	长春	1	天津	2	1+6=7	7
	天津	1	上海	2	1	6
	上海	1	长春	2	1	14
	长春	2	天津	3	3	4
	上海	2	天津	3	2+1=3	12
	长春	2	上海	3	1	14
	天津	3	上海	4	1	12
零部件库存成本=q×c×t	长春	0	长春	1	1	1×1×1
	上海	0	上海	1	3	3×1×1
	上海	1	上海	2	2	2×1×1

参数	数值
P	3
N	2
T	3
W	10
D_i	D_i ∈｛20，20，20｝
δ	0.1

n=1：供>需	a=0 （期初）	a=1 （第1天末）	a=2 （第2天末）	a=3 （第3天末）
长春	3	0	2	-1
天津	1	0	-4	0
上海	0	5	-2	-3
长春'	10	0	0	0
天津'	10	0	0	0
上海'	10	0	0	0
n=2：供<需	a=0 （期初）	a=1 （第1天末）	a=2 （第2天末）	a=3 （第3天末）
长春	1	2	2	0
天津	0	4	7	6
上海	3	4	3	4
长春'	6	0	0	0
天津'	6	0	0	0
上海'	6	0	0	0