“…For many optimization problems, it has been demonstrated that it is essential to involve some improvement strategies into a heuristic method to yield effective optimization tools (see Maric et al, 2013;Goh et al, 2009;Ribeiro and Hansen, 2002;Ishibuchi et al, 2009;Asl-Najafi et al, 2015). In the literature, there are several heuristic and meta-heuristic algorithms in different fields such as genetic algorithm for inspection planning , teaching-learning-based optimization algorithm for realistic flowshop rescheduling problems (Li et al, 2015), GRASP algorithm for humanitarian relief transportation problem (Talebian-Sharif and Salari, 2015), ant colony optimization in solving JIT scheduling problem (Khalouli et al, 2010), multi-start path relinking algorithm in vehicle routing problem (Tan et al, 2001, Lacomme et al, 2015, tabu search algorithm for the maximum independent set problem (Jin and Hao, 2015), variable neighborhood search in flowshop scheduling problem (Giannopoulos et al, 2012), simulated annealing and particle swarm optimization for track train timetabling and HLP (Jamili et al, 2012;Sedehzadeh et al, 2014), swarm intelligence in green logistics (Zhang et al, 2015), imperialist competitive algorithm in healthcare network design, HLP, redundancy allocation problems and reverse logistics (Ghodsi et al, 2010;Mohammadi et al, 2010Mohammadi et al, , 2011aMohammadi et al, , 2011bMohammadi et al, , 2013Mohammadi et al, , 2014bAzizmohammadi et al, 2013;Zahiri et al, 2014aZahiri et al, , 2014bVahdani and Mohammadi, 2015;Sedehzadeh et al, 2015), and invasive weed optimization algorithm in hub location problem (Niakan et al, 2014).…”