“…Thus, we calculate the lower bounds corresponding to the instances by relaxing some complex constraints. Since Constraints (16) and (17) include big-M and significantly impacts the CPU time based on the preliminary tests, two new valid inequalities are set to substitute them: 8 600 6 3742 94 0 3742 a 47 8 600 6 4286 97 0 4286 a 51 8 600 6 3936 101 0 3936 a 61 8 600 6 3952 96 0 3952 a 44 8 600 6 4202 100 0 4202 a 54 10 800 8 5525 133 0 5525 a 103 10 800 8 4946 141 0 4946 a 116 10 800 8 5237 144 0 5237 a 95 10 800 8 4854 137 0 4854 a 104 10 800 8 5613 134 0 Based on the preliminary tests, the probability of crossover, the probability of mutation, and the maximum generations of the GA are set as 60, 0.6, 0.1 and 80, respectively. Based on the preliminary tests, the parameters of the SA, i.e., the initial temperature T, cooling rate a, the number of nested loops R, and the threshold are set as 40, 0.6, 40 and 1, respectively.…”