Download Implementing a Time Optimal Task Sequence For Robot

Figure 12: The cycle time value using travel time as cost function, and the or-opt local
search operator.
t
0
1
2
3
4
5
Upper Bound(s)
56.15
70.75
101.51
101.83
104.94
105.70
Lower Bound(s)
49.40
66.26
95.41
94.48
96.92
98.96
Average(s)
52.11
68.72
98.27
97.23
100.81
101.74
Table 10: The upper, lower, and average objective value for different settings of which
tool to use for pick-up.
search found a better solution after two solutions while local search did not manage to
find a solution that outperformed the reference within the time limit.
50