A novel nomad migration-inspired algorithm for global optimization

Nature-inspired computing (NIC) has been widely studied for many optimization scenarios. However, miscellaneous solution space of real-world problem causes it is challenging to guarantee the global optimum. Besides, cumbersome structure and complex parameters setting-up make the existed algorithms hard for most users who are not specializing in NIC, to understand and use. To alleviate these limitations, this paper devises a succinct and efficient optimization algorithm called Nomad Algorithm (NA). It is inspired by the migratory behaviour of nomadic tribes on the prairie. Extensive experiments are implemented with respects to accuracy, rate, stability, and cost of optimization. Mathematical proof is given to guarantee the global convergence, and the nonparametric tests are conducted to confirm the significance of experiment results. The statistical results of optimization accuracy denote NA outperforms its rivals for most cases (23/28) by orders of magnitude significantly. It is considered as a promising optimizer with excellent efficiency and adaptability.