“…Mathematical optimization methods include linear programming [6]- [8], quadratic programming, non-linear programming [9], integer programming and mixedinteger programming [10]- [14] and their combinations. For high dimensional non-convex problems these methods become computationally expensive and have been enhanced by heuristic methods [15]- [17]. The most popular include sensitivity analysis [18], [19], genetic algorithms [20]- [25], simulated annealing [26]- [28], tabu search [29], [30] and particle swarm optimization [31], [32].…”