Dynamic path planning for truck-assault boat collaborative transportation in flood disaster scenario

doi:10.16265/j.cnki.issn1003-3033.2025.05.1436

Abstract

Abstract:

In order to solve the multi-period and multi-batch relief delivery problem under flood disaster scenarios, a routing model was constructed for collaborative relief delivery of trucks and assault boats by comprehensively considering factors such as the dynamic changes of disaster situations, and the collaborative transportation of trucks and assault boats. The objective of the model was to minimize the total distribution time within each period. A HHA, which combines the improved ant colony algorithm(IACA) with a genetic algorithm(GA), was designed for solving this problem. Compared with the ant colony algorithm and the simulated annealing algorithm, the experimental results show that the HHA provides truck-assault boat collaborative distribution routing solutions under the dynamically changing disaster situations in a relatively short time. The HHA effectively reduces the total distribution time and improves the efficiency of relief delivery. The rationality, feasibility, and effectiveness of the HHA were demonstrated. The number of flooded areas and the number of assault boats have a significant impact on the routing of relief delivery. Emergency logistics decision-making departments should weigh the disaster situation and resource allocation of each flooded area, and dispatch a reasonable number of assault boats to ensure the efficiency of relief delivery.

Key words: flood disasters, truck-assault boat collaborative transportation, dynamic path planning, hybrid heuristic algorithm(HHA), emergency material

CLC Number:

LIU Changshi, LIU Tao, LIU Guanghong, SUN Peng, LI Junyu, QIAO Rui. Dynamic path planning for truck-assault boat collaborative transportation in flood disaster scenario[J]. China Safety Science Journal, 2025, 35(5): 204-212.

Figures/Tables 5

Table 1

Fig.1

Table 2

Table 3

Table 4

References 19

[1]	DUBOIS F, RENAUD-GOUD P, STOLF P. Capacitated vehicle routing problem under deadlines: an application to flooding crisis[J]. IEEE Access, 2022, 10: 45 629-45 642.
[2]	WENG Xun, DUAN Shuyao, ZHANG Jingtian, et al. A material allocation model for public health emergency under a multimodal transportation network by considering the demand priority and psychological pain[J]. Mathematics, 2024, 12(3): DOI:10.3390/MATH12030489.
[3]	TAN Kangye, LIU Weihua, XU Fang, et al. Optimization model and algorithm of logistics vehicle routing problem under major emergency[J]. Mathematics, 2023, 11(5): DOI:10.3390/math11051274.
[4]	刘钊, 罗辰汉, 张明阳. 多碍航物水域救援船路径规划方法[J]. 中国安全科学学报, 2023, 33(7):90-97. doi: 10.16265/j.cnki.issn1003-3033.2023.07.2046
	LIU Zhao, LUO Chenhan, ZHANG Mingyang. Path planning method of rescue ships in waters with multiple obstacles[J]. China Safety Science Journal, 2023, 33(7):90-97. doi: 10.16265/j.cnki.issn1003-3033.2023.07.2046
[5]	李双琳, 马祖军, 郑斌, 等. 震后初期应急物资配送的模糊多目标选址-多式联运问题[J]. 中国管理科学, 2013, 21(2):144-151.
	LI Shuanglin, MA Zujun, ZHENG Bin, et al. Fuzzy multi-objective location-multimodal transportation problem for relief delivery during the initial post earthquake period[J]. Chinese Management Science, 2013, 21(2):144-151.
[6]	郑斌, 马祖军, 周愉峰. 震后应急物流动态选址-联运问题的双层规划模型[J]. 系统管理学报, 2017, 26(2):326-337.
	ZHENG Bin, MA Zujun, ZHOU Yufeng. Bilevel model for dynamic location-transportation problem for post-earthquake relief distribution[J]. Journal of Systems & Management, 2017, 26(2):326-337.
[7]	刘长石, 吴张, 马祖军, 等. 通行受限下需求可拆分的应急物资卡车-多无人机协同运输路径优化[J]. 系统科学与数学, 2023, 43(11):2930-2948. doi: 10.12341/jssms23380
	LIU Changshi, WU Zhang, MA Zujun, et al. Split delivery truck multi-drone collaborative routing for emergency supplies under traffic restriction[J]. Systems Science and Mathematics, 2023, 43(11):2930-2948.
[8]	刘长石, 吴张, 周愉峰, 等. 疫区应急物资供应的卡车-无人机动态协同运输路径优化[J]. 系统科学与数学, 2022, 42(11):3027-3043. doi: 10.12341/jssms22266
	LIU Changshi, WU Zhang, ZHOU Yufeng, et al. The optimization of dynamic and cooperative truck-drone distribution routes for emergency supplies delivery in pandemic[J]. Systems Science and Mathematics, 2022, 42(11):3027-3043.
[9]	张艳萍, 崔娜, 张波. 基于多式联运的应急物资供应多目标优化研究[J]. 中国安全科学学报, 2023, 33(7):230-238. doi: 10.16265/j.cnki.issn1003-3033.2023.07.1427
	ZHANG Yanping, CUl Na, ZHANG Bo. Multi-objective optimization strategy of emergency material supply based on multi-mode transportation[J]. China Safety Science Journal, 2023, 33(7):230-238. doi: 10.16265/j.cnki.issn1003-3033.2023.07.1427
[10]	MOSHREF-JAVADI M, LEE S, WINKENBACH M. Design and evaluation of a multi-trip delivery model with truck and drones[J]. Transportation Research Part E: Logistics and Transportation Review, 2020,136:DOI:10.1016/j.tre.2020.101887.
[11]	LI Xiaodong, XU Yang, LAI Keungkin, et al. A multi-period vehicle routing problem for emergency perishable materials under uncertain demand based on an improved whale optimization algorithm[J]. Mathematics, 2022, 10(17):DOI:10.3390/math10173124.
[12]	WANG Yanyan, SUN Baiqing. Multiperiod optimal emergency material allocation considering road network damage and risk under uncertain conditions[J]. Operational Research, 2022, 22(3): 2173-2208.
[13]	胡斐.江西多地出现大面积洪涝鄱阳湖水体面积达3 872平方公里[EB/OL].[2024-07-03]. https://jx.cnr.cn/yw/20240703/t20240703_526776248.shtml.
[14]	BLAZEWICZ J, LENSTRA J K, KAN A H G R. Scheduling subject to resource constraints: classification and complexity[J]. Discrete Applied Mathematics, 1983, 5(1): 11-24.
[15]	SOLOMON M M. Algorithms for the vehicle routing problem with time windows constrains[J]. Operations Researches, 1987, 35(2):254-265.
[16]	MANOPINIWES W, TAKASHI I. Multi-period temporary depot location problem in flood natural disaster response[C]. Proceedings of the International Conference on Industrial Engineering and Operations Management, 2019:1094-1102.
[17]	FRAGSSA C. Engineering design driven by models and measures: the case of a rigid inflatable boat[J]. Journal of Marine Science and Engineering, 2019, 7(1):DOI:10.3390/jmse7010006.
[18]	LIU Changshi, KOU Gang, ZHOU Xiancheng, et al. Time-dependent vehicle routing problem with time windows of city logistics with a congestion avoidance approach[J]. Knowledge-Based Systems, 2020,188:DOI:10.1016/j.knosys.2019.06.021.
[19]	ARIYANI A K, MAHMUDY W F, ANGGODO Y P. Hybrid genetic algorithms and simulated annealing for multi-trip vehicle routing problem with time windows[J]. International Journal of Electrical & Computer Engineering, 2018, 8(6): 4713-4723.

算例	T/d	FMT/min	DT/min	NT/min	CST/min	DST/min	RT/s
R103	1	2030.87	509.96	520.90	780	220	172.79
	2	1919.97	485.65	434.31	810	190	166.92
	3	1983.06	527.69	455.37	810	190	164.38
	4	1970.98	529.95	441.03	820	180	140.12
RC103	1	2008.78	581.23	427.55	800	200	172.58
	2	1977.22	597.20	380.02	830	170	163.63
	3	1977.26	582.93	394.33	840	160	152.88
	4	1901.34	617.05	284.29	890	110	121.33
R203	1	1997.23	481.94	515.29	780	220	162.57
	2	1947.63	507.92	439.72	810	190	156.48
	3	1963.84	528.89	434.95	810	190	152.17
	4	1948.12	532.76	415.36	820	180	123.56

算例	t/d	HHA		SAA		ACA
算例	t/d	TDT/min	RT/s	TDT/min	RT/s	TDT/min	RT/s
R103	1	2 030.87	172.79	2 136.58	269.28	2 120.05	330.91
	2	1 919.97	166.92	1 992.86	262.56	2 025.20	259.78
	3	1 983.06	164.38	1 976.99	258.65	1 991.92	250.75
	4	1 970.98	140.12	1 962.17	240.89	1 956.09	234.15
平均值		1 976.22	161.05	2 017.15	257.84	2 023.31	268.89

数量	LT/mm	TT/min
1	1 574.76	2 053.25
2	1 184.3	2 053.25
3	1 036.06	2 053.25
4	954.59	2 053.25

数量	TDT	TT	NT
4	7 904.88	2 053.25	1 851.61
5	8 425.22	1 816.48	2 608.74
6	8 656.28	1 773.21	2 883.07
7	8 818.81	1 683.42	3 135.39