“…NP-hard problems in large-scale are tackled by meta-heuristic and swarm intelligence algorithms (Dekhici andBelkadi, 2015, Arun andKumar, 2017). In many researches in the field of the SCS problem, some heuristic or meta-heuristic procedures such as genetic algorithm (Marques et al, 2014), simulated annealing Demeulemeester, 2007, Beliën et al, 2009), tabu search (Lamiri et al, 2009, Saremi et al, 2013, and ant colony optimization (Xiang et al, 2015 were developed to achieve near-optimal solutions, because this problem is NP-hard combinatorial optimization problem (Marques et al, 2014). The ACO is compatible with the MRSCS problem since this is classified into the constructive algorithms and these always generate a feasible solution in a short time,while improvement approaches may generate infeasible solutions for the MRSCS after applying their operators and hence more time may be needed to repair the infeasible solutions.…”