Transmission expansion planning (TEP), the determination of new transmission lines to be added an existing power network, is a key element in system planning. Using classical optimization define most suitable reinforcements desirable alternative. However, extent under-study problems growing, because uncertainties introduced by renewable generation or electric vehicles (EVs) and larger sizes und...

This paper presents a new heuristic algorithm useful for long-term planning of survivable WDM networks. A multi-period model is formulated that combines network topology design and capacity expansion. The ability to determine network expansion schedules of this type becomes increasingly important to the telecommunications industry and to its customers. The solution technique consists of a Genet...

This paper proposes a novel method for transmission network expansion planning (TNEP) that take into account uncertainties in loads and renewable energy resources. The goal of TNEP is to minimize the expansion cost of candidate lines without any load curtailment. A robust linear optimization algorithm is adopted to minimize the load curtailment with uncertainties considered under feasible expan...

As the share of wind energy in power system increases, consideration of these resources in power system planning, particularly in Transmission Expansion Planning (TEP) is becoming more and more important. In this paper, a Probabilistic Multi-Objective Transmission Expansion Planning (PMO-TEP) is presented to find the optimal node for connecting the large scale distant wind farm to the network f...

This paper presents an algorithm for the microgrid planning as an alternative to the co-optimization of generation and transmission expansion planning in electric power systems. The integration of microgrids in distribution systems will offer a decentralized control of local resources for satisfying the network reliability and the power quality required by local loads. The objective in this pap...

In classical linear network flow (LNF) problems, a network consists of multiple source and sink nodes, where each node is a sink node or a source node, but not both. Usually, there is only one kind of commodity flow and the goal is to find flow schedules and routes such that all sink nodes’ flow demands are satisfied and the total flow transmission cost is minimized. We develop a capacity expan...