A Bee Evolutionary Algorithm for Multiobjective Vehicle Routing Problem with Simultaneous Pickup and Delivery
Table 3
The basic information of test example 1 with 12 customers.
Customer
Number
X/km
Y/km
Demand/ton
Recycle/ton
Service time
Cen. 0
0
35
35
-
-
-
Dis. 1
1
49
69
8
2.5
8 am-10 am
Dis. 2
2
60
25
6
2
10 am-12 am
Dis. 3
3
0
36
12
6
8 am-10 am
Dis. 4
4
15
25
9
5
8.5 am-10.5 am
Dis. 5
5
35
-6
9
4
9.5 am-11.5 am
Dis. 6
6
69
30
11
5
9 am-12 am
Rec.1
7
50
9
0
8
10 am-3 pm
Rec.2
8
36
70
0
8
10 am-3 pm
Rec.3
9
4
60
0
10
10 am-3 pm
Sup.1
10
15
69
0
6.3
10 am-3 pm
Sup.2
11
63
55
0
6.3
10 am-3 pm
Sup.3
12
5
5
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.
