Random search with adaptive boundaries algorithm for obtaining better initial solutions

•The proposed algorithm depends on updating upper and/or lower boundaries dynamically.•This algorithm provides an adaptive initial solution which is better than pure random.•The proposed algorithm converges to the optimal-like solutions in small dimension test cases.•In large dimension cases, wide boundaries have been narrowed without trapping local optimums.•RSAB is ready to be integrated with global optimum algorithm as the first step.