Browsing by Author "Flores, Wilfredo"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Publication AC dynamic transmission expansion planning using a hybrid optimization algorithm(IEEE Computer Society, 2020) Morquecho, Edgar; Torres Contreras, Santiago Patricio; Matute, Nelson; Astudillo Salinas, Darwin Fabián; López Quizhpi, Julio César; Flores, WilfredoDynamic Transmission Expansion Planning (DTEP) seeks to answer where, how many, and when new infrastructure should be added to the electrical system. The goal is to allow a correct and efficient operation along the planning horizon. In this research work, a load shedding formulation extended for the multistage alternating current (AC) model with the co-optimization of shunt compensation is proposed. A novel hybrid meta-heuristic is used as optimization technique to solve the DTEP problem. Solutions were obtained from IEEE 24-bus test system. For comparative purposes, the problem was also solved using static (STEP) and quasi-dynamic (QTEP) approaches.Publication Improving the AC transmission expansion planning by using initial solutions algorithms(IEEE Computer Society, 2020) Matute, Nelson; Flores, Wilfredo; López Quizhpi, Julio César; Astudillo Salinas, Darwin Fabián; Morquecho, Edgar; Torres Contreras, Santiago PatricioInitial Solutions (IS) are decisive in meta-heuristics based optimization problems since they impact the performance of the optimization process. This research work proposes and compares some random and deterministic algorithms to create initial solutions based on existing expansion planning criteria to solve the AC Transmission Expansion Planning (TEP) problem. The TEP is formulated as a full non-convex optimization problem using the AC network representation. A local version of the Particle Swarm Optimization (LPSO) technique is employed to solve the TEP problem. The Garver 6-bus and IEEE 24-bus test systems are used to evaluate the IS algorithms performance. It is shown that these algorithms have great potential to improve the robustness and computational effort of meta-heuristics.
