In the ongoing power system reform in Japan, division of transmission and distribution is separated from former general electric utility became a business operator. After reform, operators will procure reserve market. We have formulated clearing problem market as 0-1 integer programming problem. This can be viewed Min-Max set multi-cover Since covering belongs NP-hard, it not easy to solve larg...

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...