Buscar
Mostrando ítems 71-80 de 1892
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
An MILP model for the analysis of operation of energy storage devices in distribution systems
(2017-01-04)
This paper presents a mixed-integer linear programming model to define the optimal operation of energy storage devices in radial distribution systems. The objective considered is the reduction of the energy purchase cost ...
An MILP Model for the Analysis of Operation of Energy Storage Devices in Distribution Systems
(Ieee, 2016-01-01)
This paper presents a mixed-integer linear programming model to define the optimal operation of energy storage devices in radial distribution systems. The objective considered is the reduction of the energy purchase cost ...
An Unambiguous Distance-Based MIQP Model to Solve Economic Dispatch Problems with Disjoint Operating Zones
(2016-01-01)
This letter presents an unambiguous distance-based mixed-integer quadratic programming (UDB-MIQP) model to solve economic dispatch problems with disjoint operating zones. By considering the distances among the prohibited ...
School redistricting: Eembedding GIS tools with integer programming
(2004)
The paper deals with a school redistricting problem in which blocks of a city must be assigned to schools according to diverse criteria. Previous approaches are reviewed and some desired properties of a good school districting ...
Branch and bound algorithm for transmission network expansion planning using DC model
(2007-12-01)
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...
Branch and bound algorithm for transmission network expansion planning using DC model
(2007-12-01)
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of ...