Optimal placement and sizing from standpoint of the investor of Photovoltaics Grid-Connected Systems using Binary Particle Swarm Optimization

M. Gómez, A. López and F. Jurado

Applied Energy, 2010, vol. 87, issue 6, 1918 pages

Abstract: This paper introduces a Binary Particle Swarm Optimization based method to accomplish optimal location and size of a Photovoltaics Grid-Connected System (PVGCS) for distributed power generation. The main technical constraint is the maximum installed peak power, which is limited for utilities Power Distributor Company. The fitness function to be optimized is the profitability index. A fair comparison between the proposed algorithm and other methods is performed. For such goal, convergence curves of the average profitability index versus number of iterations are computed. The proposed algorithm reaches a better solution than genetic algorithms when considering similar computational cost (similar number of evaluations).

Keywords: Binary; Particle; Swarm; Optimization; PVGCS; Photovoltaic; Distributed; power; generation; Profitability; index (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0306-2619(10)00003-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:appene:v:87:y:2010:i:6:p:1911-1918

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/405891/bibliographic
http://www.elsevier. ... 405891/bibliographic

Access Statistics for this article

Applied Energy is currently edited by J. Yan

More articles in Applied Energy from Elsevier
Bibliographic data for series maintained by Catherine Liu ().