Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8291
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhongsheng, Shi | - |
dc.contributor.author | Kumar, Rajiv | - |
dc.contributor.author | Tomar, Ravi | - |
dc.date.accessioned | 2022-11-11T14:10:46Z | - |
dc.date.available | 2022-11-11T14:10:46Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8291 | - |
dc.description.abstract | The study focuses on the route design of the transmission line and has an important influence on the comprehensive benefit of the transmission line. This study proposes the research of multi-objective optimization of power grid based on ant colony algorithm to optimize transmission lines. Firstly, the basic principle of the ant colony algorithm is introduced, and the mathematical model of the ant colony algorithm is presented. Secondly, the ant colony algorithm is applied to multiobjective optimization of transmission line path. The results show that the corresponding shortest path length after the test is 11 734. The multi-objective ant colony algorithm can optimize the transmission line path well, speed up the search speed, and improve the quality of the solution. The method proposed in this study has certain reliability and validity. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Ant colony algorithm | en_US |
dc.subject | Multi-objective optimization | en_US |
dc.subject | Path optimization | en_US |
dc.subject | Smart grid | en_US |
dc.title | Multi-Objective Optimization of Smart Grid Based on Ant Colony Algorithm | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Multi-Objective Optimization of Smart Grid Based on Ant Colony Algorithm.pdf | 1.91 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.