Application of Nondominated Sorting Genetic Algorithm for Multiobjective Optimal Design of Distribution Transformer
DOI:
https://doi.org/10.37591/.v6i3.3119Abstract
Abstract
In today’s competitive environment, transformer manufacturers are faced with the exigent task of yielding optimum performance at lowest cost. Considering the aspect of energy shortage and increase in its cost, the complexity of achieving the optimal balance between transformer manufacturing costs and transformer performance is a herculean task, demanding great amount of attempts to reach satisfactory results. To cater with the problem of minimizing transformer losses and cost simultaneously, this paper deals with multiobjective optimization of distribution transformer using binary coded nondominated sorting genetic algorithm (NSGA-II). The design procedure takes into account three objectives: active part cost, no-load losses and load losses of a distribution transformer. Elitist nondominated sorting and crowding distance are used to obtain pareto optimal solutions. Results indicate the potential of NSGA-II in maintaining diversity among solutions. To enable the decision maker (DM) to make a choice between different pareto-optimal solutions, TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) technique is then suggested for obtaining best compromise solution among nondominated solutions. The effectiveness of the proposed method has been demonstrated on 100 kVA distribution transformer.
Keywords: Multiobjective optimal transformer design, Pareto-optimal solutions, NSGA-II, TOPSIS
Downloads
Published
Issue
Section
License
Journal Title:
Title of the Paper:
Corresponding Author’s Information:
Name: Address:
E-mail:
Contact Number:
It is herein agreed that: The copyright to the above-listed unpublished and original article is transferred to STM Journals.
This copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature.
I/We declare that above manuscript is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
I/ We warrant(s) that his/her/their contribution is original, except for such excerpts from copyrighted works as may be included with the permission of the copyright holder and author thereof, that it contains no libelous statements, and does not infringe on any copyright, trademark, patent, statutory right, or propriety right of others.
I/We will not publish his/her/their above said contribution anywhere else without the prior written permission of the publisher unless it has been changed substantially. I/We also agree to the authorship of the article in the following order: Author(s) Name Signature(s)
1. ________________
2. ________________
3. ________________
4. ________________
The author(s) agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal (comments if any to the editor can be added below).
