Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14015
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKUMAR, MAHENDRA-
dc.date.accessioned2012-06-28T10:08:40Z-
dc.date.available2012-06-28T10:08:40Z-
dc.date.issued2012-06-28-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/14015-
dc.description.abstractEconomic load dispatch problem allocates loads to plants at minimum cost while meeting the constraints. It is done by an optimization problem which minimizes the total fuel cost of all committed plants while meeting the demand and system constraints. There are various objectives of power system- cost of generation, transmission losses and environment pollution etc. In this work, the cost of generation, transmission losses and environment pollution have been considered as objectives for optimization. The Multiobjective Economic Load Dispatch (MOELD) problem is formulated using weighting method and a noninferior set is generated in 3D space by varying weights for IEEE 14 bus system. Ideal Point (IP) is the one where all the objectives are minimum and it is impossible to achieve this point because of conflicting nature of the objectives, therefore an attempt is made to minimize the Euclidean distance between the Ideal Point (IP) and set of noninferior solutions. This gives the Target Point (TP) or the best compromise solution in 3D space.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD 859;80-
dc.subjectECONOMIC LOAD DISPATCHen_US
dc.subjectIEEEen_US
dc.subject14 BUS SYSTEMen_US
dc.subject3D SPACEen_US
dc.subjectTARGET POINTen_US
dc.subjectIDEAL POINTen_US
dc.titleECONOMIC LOAD DISPATCH FOR IEEE 14 BUS SYSTEM IN 3D SPACEen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Control and Instumentation Engineering

Files in This Item:
File Description SizeFormat 
front page mahendra.pdfCOVER98.05 kBAdobe PDFView/Open
mahendra final.pdfMAIN755.78 kBAdobe PDFView/Open
graph.pdfGRAPH387.3 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.