“…The first attempt to start these types of studies is genetic algorithm (GA) (Holland, 1992) which actually employs the natural process of genetic evolution. After that various nature-inspired meta-heuristic approaches have been proposed such as differential evolution (DE) (Storn & Price, 1997), evolutionary strategy (ES) (Back, 1996;Beyer, 2001), particle swarm optimization (PSO) (Kennedy & Eberhart, 1995), ant colony optimization (ACO) (Dorigo, 2004), cuckoo search (CS) (Gandomi et al, 2013), firefly algorithm (FA) (Gandomi, 2011), biogeography-based optimization (BBO) (Simon, 2008) big bang-big crunch algorithm (Erol & Eksin, 2006), charged system search (CSS) (Kaveh & Talatahari, 2010) animal migration optimization (AMO) (Li et al, 2013), water cycle algorithm (WCA) (Eskandar et al, 2012), mine blast Algorithm (MBA) (Sadollaha et al, 2013), harmony search algorithm (Mahdavi et al, 2007), improvements of Symbiosis Organisms Search Algorithm (Nama et al 2016b(Nama et al , 2016bNama & Saha, 2018). Recently Civicioglu (2013) proposed a novel algorithm called backtracking search algorithm (BSA) which is based on the return of a social group at random intervals to hunting areas that were previously found fruitful for obtaining nourishment (Civicioglu, 2013;Nama et al, 2016d) BSA's strategy for generating a trial population includes two new crossover and mutation operators which are different from other evolutionary algorithm like DE and GA. BSA uses random mutation strategy with one direction individual for each target individual and a non-uniform crossover strategy.…”