A Bee Evolutionary Algorithm for Multiobjective Vehicle Routing Problem with Simultaneous Pickup and Delivery
Table 5
The basic information of test example 1 with 22 customers.
Number
X/km
Y/km
Demand/ton
Recycle/ton
Service time
Cen. 0
0
50
50
-
-
-
Dis. 1
1
41
60
3
1.5
8 am-10 am
Dis. 2
2
39
40
2
1
10 am-12 am
Dis. 3
3
60
58
4
2
8 am-10 am
Dis. 4
4
58
42
3.5
2
8.5 am-10.5 am
Dis. 5
5
18
86
3
0.5
9.5 am-11.5 am
Dis. 6
6
4
12
3
1.5
9 am-12 am
Dis. 7
7
90
6
2
2
10 am-3 pm
Dis. 8
8
92
86
4
2
10 am-3 pm
Dis. 9
9
25
76
2.5
2
10 am-3 pm
Dis. 10
10
30
40
3
2
10 am-3 pm
Dis. 11
11
72
36
2.5
1
10 am-3 pm
Dis. 12
12
68
80
3
1.5
10 am-3 pm
Dis. 13
13
22
69
3.5
2.5
10 am-3 pm
Dis. 14
14
28
44
2
1.5
8.5 am-10.5 am
Dis. 15
15
56
36
4
1.5
9.5 am-11.5 am
Rec.1
16
64
62
0
6
9 am-12 am
Rec.2
17
32
80
0
7
10 am-3 pm
Rec.3
18
28
36
0
7
10 am-3 pm
Sup.1
19
62
40
0
6
10 am-3 pm
Sup.2
20
63
55
0
6.3
10 am-3 pm
Sup.3
21
14
70
0
6.3
10 am-3 pm
Sup.4
22
20
30
0
6.3
10 am-3 pm
Note: (a) Cen., Dis., Rec., and Sup. are the abbreviations of recycling center, distributors, recycler, and supplier, respectively. (b) “-” means that these data do not need to be set in advance.
