Grain Emergency Vehicle Scheduling Problem with Time and Demand Uncertainty

Table 1

The travel time between every two nodes.

	W1	W2	W3	DN1	DN2	DN3	DN4	DN5	DN6	DN7	DN8
W1	—	1	2	4	3	6	3	5	9	7	6
W2	1	—	3	2	5	7	6	3	4	8	1
W3	2	3	—	4	2	1	2	7	5	6	8
DN1	4	2	4	—	5	8	1	6	3	7	1
DN2	3	5	2	5	—	2	4	2	1	5	3
DN3	6	7	1	8	2	—	1	5	4	8	1
DN4	3	6	2	1	4	1	—	3	7	4	9
DN5	5	3	7	6	2	5	3	—	9	4	3
DN6	9	4	5	3	1	4	7	9	—	2	8
DN7	7	8	6	7	5	8	4	4	2	—	7
DN8	6	1	8	1	3	1	9	3	8	7	—

W: warehouse; DN: demand node.
The demand generated randomly: 700, 450, 900, 300, 700, 450, 750, and 600.
The latest arrival time generated randomly: 0, 0, 0, 5, 4, 7, 6, and 9.