Problem 106 Random Search Optimization
Back to General discussions forum
The example given in the problem statement has a minimum time of 102.2 sec with mover speeds of 3,5.6,3.5,3.6,and 1. If you plug these values into the automated simulator on the problem page this is confirmed. When I ran my program with the example data, I got tmin=93.6 with mover speeds of 2.2,3.5,4.7,1.7,and 1. Again this was confirmed with the simulator. So I question whether the optimum answers are really being provided in this problem.
Hi,
the example only has 16 steps (and 7 of those are invalid) so it isn't likely to give an accurate answer for the minimum time.
The simulator only simulates one set of parameters. It does no random search.
If your code is giving 93.6 with the example data, that suggests there's something wrong in your code.
Yes, when I ran the example data, it looked like the index was 1-based. In fact it was 0-based as I saw when I ran an actual data set.