Author/Authors :
Hosseini Naveh، Saeid نويسنده Anar Branch, Islamic Azad University, Anar, Iran , , Ghadiri Anari، Reza نويسنده Anar Branch, Islamic Azad University, Anar, Iran , , Zeinaddini Meymand، Majid نويسنده Anar Branch, Islamic Azad University, Anar, Iran ,
Abstract :
Transmission Expansion Planning (TEP) is a
non-convex optimization problem that can be solved via
different heuristic algorithms. Varieties of classical as
well as heuristic algorithms in literature are addressed to
solve TEP problem. In this paper, a Constructive
Heuristic Algorithm (CHA) is used for solving TEP
problem. The basic idea comes from Garver’s work
applied to the transportation model. In this algorithm,
CHA is applied to a linear model as hybrid model. This
algorithm proposed by ‘Villasana Garver Salon’ (VGS) to
the transmission system long-term planning. Simulation
studies and tests results on the well-known transmission
network such as: Garver and IEEE 24-bus 46-bus Sothern
Brazilian and Southeast Network of Iran, systems are
carried out to show the significant performance as well as
the effectiveness of the proposed algorithm.
