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...

Currently, distribution systems are continuously evolving towards modern and flexible structures while integrating promising renewable energy resources (RERs). In this regard, an optimal network constraint-based expansion planning model combined with integration framework of intermittent RERs is proposed in work to improve the topological flexibility networks (DNs). Specifically, best investmen...

regarding the nature of non-linear discrete placement, and in order to determine the optimal capacity of the substation, the goal in the present study will be a number of local optimum points. in this research, the problem of optimal placement posts to reduce power losses by considering distributed generation (dg). in formulating the objective function, geographical distribution density in the ...

This paper presents an optimization model and its application to a generation expansion planning problem. The proposed model has a generalized network structure and is exploited effectively by Benders’ decomposition algorithm, where a master problem generates trial expansion plans and a set of subproblems compute production cost and system reliability for the trial plan. The applicability of ou...

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...

Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...