“…Those traditional optimization methods include Linear Programming (LP) (Marino and Mohammadi, 1983;Jabr et al, 2000;Reis et al, 2006;Lu et al, 2011;Li et al, 2013), Nonlinear Programming (NLP) (Martin, 1983;Lund and Ferreira, 1996;Barros et al, 2003;Chen, 2007), Lagrangian Relaxation (LR) (Hindi and Ghani, 1991;EI-Keib et al, 1994), Quadratic Programming (QP) (Papageorgiou and Fraga, 2007), Network Flow Algorithm (NFA) (Braga and Barbosa, 2001), and Dynamic programming (DP) (Johnson et al, 1993;Raman and Chandramouli, 1996;Eum et al, 2010;Goor et al, 2011;Shokri et al, 2013), etc. They are all elitist algorithms, and have already received different degrees of success in solving CROO problems.…”