Mauricio Granada Echeverri

Optimización multiobjetivo usando un algoritmo genético y un operador elitista basado en un ordenamiento no-dominado (nsga-ii)

This article presents basic concepts of the multiobjective optimization, focused towards the description of the algorithm NSGA-II, which is known in the specialized literature due to its good performance and the few necessary changes with respect to the mono-objective algorithm to be implemented appropriately.

Fluxo de potência AC para operação independente de áreas interligadas

This paper adjusts a mathematical decomposition approach to the AC power flow problem in power systems with interconnected areas operated by diferent transmission system operators (TSO). The proposed strategy allows finding the operation point of a particular area without explicit knowledge of network data of the other interconnected areas, being only necessary to exchange border information related to the tie-lines between areas. The methodology is based on the decomposition of the first-order optimality conditions of the AC power flow, which is formulated as a nonlinear programming problem. To allow better visualization of the concept of independent operation of each TSO, an artificial neural network have been used to simulate the border information calculation of the interconnected TSOs. A multi-area Power Flow tool can be seen as a basic building block able to address a large number of problems under a multi-TSO competitive market philosophy. The IEEE RTS-96 power system is used in order to show the operation and effectiveness of the decentralized AC Power Flow.

A heuristic algorithm based on tabu search for vehicle routing problems with backhauls

Article history: Received January 16, 2017 Received in revised format: May 22, 2017 Accepted May 28, 2017 Available online May 28, 2017 In this paper, a heuristic algorithm based on Tabu Search Approach for solving the Vehicle Routing Problem with Backhauls (VRPB) is proposed. The problem considers a set of customers divided in two subsets: Linehaul and Backhaul customers. Each Linehaul customer requires the delivery of a given quantity of product from the depot, whereas a given quantity of product must be picked up from each Backhaul customer and transported to the depot. In the proposed algorithm, each route consists of one sub-route in which only the delivery task is done, and one sub-route in which only the collection process is performed. The search process allows obtaining a correct order to visit all the customers on each sub-route. In addition, the proposed algorithm determines the best connections among the sub-routes in order to obtain a global solution with the minimum traveling cost. The efficiency of the algorithm is evaluated on a set of benchmark instances taken from the literature. The results show that the computing times are greatly reduced with a high quality of solutions. Finally, conclusions and suggestions for future works are presented. Growing Science Ltd. All rights reserved. 8

Técnica de descomposición aplicada al problema de flujo de potencia óptimo multi-área.

This paper presents a method for the decentralized solution of the optimal power flow (OPF) problem of interconnected power systems. The OPF model is solved in a decentralized framework, consisting of regions, where the company in each area operate its system independently of the other areas, obtaining an optimal coordinated but decentralized solution. The proposed scheme is based on an augmented Lagrangian approach using the auxiliary problem principle (APP).

SOLUCIÓN DESCENTRALIZADA DEL PROBLEMA DE PLANEAMIENTO ÓPTIMO DE REACTIVOS EN SISTEMAS DE POTENCIA MULTI-AREAS

This paper describes a method for the decentralized solution of the optimal reactive power flow (ORPF) problem in interconnected power systems. The ORPF model is solved in a decentralized framework, consisting of regions, where the transmission system operator in each area operates its system independently of the other areas, obtaining an optimal coordinated but decentralized solution. The proposed scheme is based on an augmented Lagrangian approach using the auxiliary problem principle (APP). An implementation of an interior point method is described to solve the decoupled problem in each area.

Optimización Multiobjetivo Usando Colonia De Hormigas Para Ubicar Condensadores En Sistemas De Distribución

This paper intends to change the location and sizing of capacitors optimization methodology with multi objective criteria. The first objective is the reduction of power losses, and the second is the investment cost. The ant colony optimization is used, adapting its exploration mechanism using the dominance concept. The algorithm is tested on one system from specialized literature, obtaining high quality results.

PLANEAMIENTO DE SUBESTACIONES Y ALIMENTADORES EN SISTEMAS DE DISTRIBUCIÓN USANDO PROGRAMACIÓN ENTERA

This paper presents a mathematical methodology used to solve the power distribution planning problem which includes the location and sizing of the new substations and resizing the old ones; existing feeders reconductorizing, and routing and selection of the new conductors on the new feeders. To solve the mathematical problem a Branch and Bound algorithm is used. The model is Lineal Mixed Integer Programming type, considering that it is a difficult problem due to its combinatorial characteristics, and its high computational complexity. To test the proposed algorithm a well documented power distribution system is used, and high quality results were obtained.