Dynamic Multicompartment Refrigerated Vehicle Routing Problem with Multigraph Based on Real-Time Traffic Information

Table 7

The delivery routes corresponding to the optimal solution in the preoptimization stage.

	Route	Selected path	Delivery time ()	Total cost	Cargo damage cost
Vehicle1	0-39-15-22-7-8-41-0	2, 3, 1, 1, 1, 1, 1	5.70	1382.60	196.19
Vehicle2	0-31-38-14-35-0	2, 1, 1, 1, 1	3.61	716.73	130.83
Vehicle3	0-1-37-19-40-11-0	2, 1, 1, 1, 1, 1	3.24	660.25	89.05
Vehicle4	0-29-44-6-24-0	3, 1, 3, 3, 1	2.79	650.47	113.91
Vehicle5	0-12-36-42-4-16-0	3, 1, 1, 1, 1, 1	3.32	790.12	135.07
Vehicle6	0-25-2-20-33-21-17-0	3, 1, 3, 1, 1, 1, 1	5.80	1180.20	215.74
Vehicle7	0-10-5-3-13-32-9-26-0	3, 1, 1, 1, 1, 1, 1, 1	5.41	1093.30	146.16
Vehicle8	0-43-18-27-34-30-0	2, 1, 1, 1, 1, 1	3.06	863.93	85.58
Vehicle9	0-23-28-0	3, 1, 1	1.36	357.94	23.61
Total	—	—	—	7695.5	1136.1