-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbenchmark.log
More file actions
95 lines (90 loc) · 6.51 KB
/
Copy pathbenchmark.log
File metadata and controls
95 lines (90 loc) · 6.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
Running instance burma14.tsp with optimum 3323.0 (1/6):
Starting Branch and Bound (timeout 60s):
[BnB] New Best Solution: 4048.0 for [1, 8, 11, 9, 10, 2, 14, 3, 4, 12, 6, 7, 13, 5]
[BnB] New Best Solution: 3814.0 for [1, 8, 11, 9, 10, 2, 14, 3, 4, 12, 6, 7, 5, 13]
[BnB] New Best Solution: 3535.0 for [1, 8, 11, 9, 10, 2, 14, 3, 4, 12, 6, 5, 7, 13]
[BnB] New Best Solution: 3416.0 for [1, 8, 11, 9, 10, 2, 14, 3, 4, 5, 6, 12, 7, 13]
[BnB] New Best Solution: 3381.0 for [1, 8, 11, 9, 10, 13, 7, 12, 6, 5, 4, 3, 14, 2]
[BnB] New Best Solution: 3359.0 for [1, 8, 9, 10, 11, 13, 7, 12, 6, 5, 4, 3, 14, 2]
[BnB] New Best Solution: 3346.0 for [1, 8, 2, 14, 3, 4, 5, 6, 12, 7, 13, 11, 9, 10]
[BnB] New Best Solution: 3336.0 for [1, 8, 10, 9, 11, 13, 7, 12, 6, 5, 4, 3, 14, 2]
[BnB] Timeout with current best solution: 3336.0 for tour [1, 8, 4, 14, 12, 11, 9, 6, 7, 13, 5]
Results: 3336.0 (60.0s)
Starting Dynamic Programming (timeout 60s):
Results: 3323.0 (0.023s)
Starting Integer Linear Programming (timeout 60s):
Results: 3323.0 (0.182s)
Running instance gr17.tsp with optimum 2085.0 (2/6):
Starting Branch and Bound (timeout 60s):
[BnB] New Best Solution: 2187.0 for [1, 13, 4, 7, 8, 6, 17, 14, 15, 3, 11, 5, 10, 2, 9, 12, 16]
[BnB] New Best Solution: 2158.0 for [1, 13, 4, 7, 8, 6, 17, 14, 15, 3, 11, 5, 2, 10, 9, 12, 16]
[BnB] New Best Solution: 2094.0 for [1, 13, 4, 7, 8, 6, 17, 14, 15, 3, 11, 10, 2, 5, 9, 12, 16]
[BnB] Timeout with current best solution: 2094.0 for tour [1, 13, 4, 7, 17, 14, 10, 3, 15, 8, 12, 11, 5, 2]
Results: 2094.0 (60.0s)
Starting Dynamic Programming (timeout 60s):
Results: 2085.0 (0.283s)
Starting Integer Linear Programming (timeout 60s):
Results: 2085.0 (0.445s)
Running instance gr21.tsp with optimum 2707.0 (3/6):
Starting Branch and Bound (timeout 60s):
[BnB] New Best Solution: 3333.0 for [1, 12, 4, 11, 20, 10, 18, 21, 15, 2, 14, 13, 17, 19, 7, 8, 6, 16, 5, 9, 3]
[BnB] New Best Solution: 3258.0 for [1, 12, 4, 11, 20, 10, 18, 21, 15, 2, 14, 13, 3, 9, 5, 16, 6, 8, 7, 19, 17]
[BnB] New Best Solution: 3122.0 for [1, 12, 4, 11, 20, 10, 18, 21, 15, 14, 13, 2, 3, 9, 5, 16, 6, 8, 7, 19, 17]
[BnB] New Best Solution: 3078.0 for [1, 12, 4, 11, 20, 10, 18, 21, 19, 17, 13, 14, 15, 2, 3, 9, 5, 16, 6, 8, 7]
[BnB] New Best Solution: 3033.0 for [1, 12, 4, 11, 20, 10, 18, 13, 14, 15, 2, 21, 3, 9, 5, 16, 6, 8, 7, 19, 17]
[BnB] New Best Solution: 2917.0 for [1, 12, 4, 11, 20, 10, 18, 13, 14, 15, 21, 2, 3, 9, 5, 16, 6, 8, 7, 19, 17]
[BnB] Timeout with current best solution: 2917.0 for tour [1, 12, 4, 11, 20, 10, 18, 13, 17, 6, 8, 19, 21, 15, 3, 9, 5]
Results: 2917.0 (60.0s)
Starting Dynamic Programming (timeout 60s):
Results: 2707.0 (7.521s)
Starting Integer Linear Programming (timeout 60s):
Results: 2707.0 (0.128s)
Running instance gr24.tsp with optimum 1272.0 (4/6):
Starting Branch and Bound (timeout 60s):
[BnB] New Best Solution: 1553.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 22, 18, 19, 2, 20, 15, 3, 11]
[BnB] New Best Solution: 1528.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 22, 18, 19, 2, 15, 20, 3, 11]
[BnB] New Best Solution: 1504.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 22, 18, 19, 15, 2, 20, 3, 11]
[BnB] New Best Solution: 1493.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 22, 19, 2, 20, 15, 18, 3, 11]
[BnB] New Best Solution: 1465.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 19, 2, 20, 15, 22, 18, 3, 11]
[BnB] New Best Solution: 1429.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 2, 20, 15, 19, 22, 18, 3, 11]
[BnB] New Best Solution: 1413.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 10, 17, 20, 2, 15, 19, 22, 18, 3, 11]
[BnB] New Best Solution: 1409.0 for [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 9, 13, 14, 20, 2, 15, 19, 10, 17, 22, 18, 3, 11]
[BnB] Timeout with current best solution: 1409.0 for tour [1, 16, 6, 7, 8, 21, 5, 24, 12, 4, 23, 13, 20, 19, 14, 22, 17, 3, 11, 18, 10]
Results: 1409.0 (60.0s)
Starting Dynamic Programming (timeout 60s):
Results: Timeout (-s)
Starting Integer Linear Programming (timeout 60s):
Results: 1272.0 (5.135s)
Running instance ulysses16.tsp with optimum 6859.0 (5/6):
Starting Branch and Bound (timeout 60s):
[BnB] New Best Solution: 9988.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 10, 9, 4, 2, 3, 11]
[BnB] New Best Solution: 9851.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 10, 9, 3, 2, 4, 11]
[BnB] New Best Solution: 8054.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 10, 9, 11, 4, 2, 3]
[BnB] New Best Solution: 8040.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 10, 9, 11, 3, 2, 4]
[BnB] New Best Solution: 7902.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 9, 11, 10, 4, 2, 3]
[BnB] New Best Solution: 7729.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 9, 11, 10, 3, 2, 4]
[BnB] New Best Solution: 7179.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 11, 9, 10, 4, 2, 3]
[BnB] New Best Solution: 7006.0 for [1, 8, 16, 13, 14, 12, 7, 6, 15, 5, 11, 9, 10, 3, 2, 4]
[BnB] New Best Solution: 7004.0 for [1, 8, 16, 13, 14, 12, 7, 6, 10, 9, 11, 5, 15, 4, 2, 3]
[BnB] Timeout with current best solution: 7004.0 for tour [1, 8, 16, 13, 7, 4, 15, 2, 9, 12, 6, 10, 5]
Results: 7004.0 (60.0s)
Starting Dynamic Programming (timeout 60s):
Results: 6859.0 (0.133s)
Starting Integer Linear Programming (timeout 60s):
Results: 6859.0 (1.0s)
Running instance ulysses22.tsp with optimum 7013.0 (6/6):
Starting Branch and Bound (timeout 60s):
[BnB] New Best Solution: 10586.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 20, 21, 19, 10, 9, 3, 2, 11]
[BnB] New Best Solution: 8736.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 20, 21, 19, 10, 9, 11, 3, 2]
[BnB] New Best Solution: 8734.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 20, 21, 19, 9, 11, 10, 3, 2]
[BnB] New Best Solution: 8712.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 20, 21, 19, 11, 9, 10, 3, 2]
[BnB] New Best Solution: 8697.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 19, 10, 9, 11, 20, 21, 3, 2]
[BnB] New Best Solution: 8649.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 10, 9, 11, 19, 20, 21, 3, 2]
[BnB] New Best Solution: 8362.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 9, 11, 10, 19, 20, 21, 3, 2]
[BnB] New Best Solution: 7639.0 for [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 7, 6, 15, 5, 11, 9, 10, 19, 20, 21, 3, 2]
[BnB] Timeout with current best solution: 7639.0 for tour [1, 8, 22, 17, 4, 18, 16, 13, 14, 12, 21, 7, 20, 10, 19, 15, 2, 3, 6, 11, 9]
Results: 7639.0 (60.0s)
Starting Dynamic Programming (timeout 60s):
Results: 7013.0 (16.464s)
Starting Integer Linear Programming (timeout 60s):
Results: Timeout (-s)