The Value of Preemptive Pick-Up Services in Dynamic Vehicle Routing for Last-Mile Delivery: Space-Time Network-Based Formulation and Solution Algorithms

Table 6

Basic information of delivery requests in the illustrative example.

Corresponding physical node ID	Required service duration	Preferred time window
1	3	[0,28]
2	3	[0,28]
3	3	[0,28]
4	3	[0,28]
5	3	[0,28]
6	3	[0,28]
7	3	[0,28]
8	3	[0,28]
9	3	[0,28]
10	3	[0,28]
11	3	[0,28]
12	3	[0,28]
13	3	[0,28]
14	3	[0,28]