For finding the solutions to the problem the subproblems are solved and best from these sub-problems is considered. This choice may depend upon the previously made choices but it does not depend on any future choice. Thus in the greedy method, greedy choices are made one after the another, ...
The L-BFGS-B optimizer with the Python module default parameters is used to find the maximum of EI in order to determine the best sample during each iteration (Virtanen et al., 2020). The initial samples (initial sample size is 5 samples) of each BO run are generated using LHS to be ...
5: if r = 1: → if smallest_info is the best solution6: output smallest_info → output results7: break → Exit the loop and end the program Algorithm 2 Seek_the_smallest() 1:for i in list_space: →...
5: if r = 1: → if smallest_info is the best solution6: output smallest_info → output results7: break → Exit the loop and end the program Algorithm 2 Seek_the_smallest() 1:for i in list_space: →...
We report the best solution found (Z) for the heuristics 𝐴1A1 and 𝐴3A3. On the other hand, for the heuristic 𝐴2A2, we report the best solution after 100 runs, the mean value of solutions (𝑍𝑚Zm), and the standard deviation (s). The above is due to the inherent ...