Multistage Distribution Network Planning by Spanning Tree-Based Genetic Algorithm

被引：0

作者：

Ouyang, Wu ^{[1
]}

Cheng, Haozhong ^{[1
]}

Zhang, Xiubin ^{[1
]}

Yao, Liangzhong

Wang, Chun ^{[2
]}

机构：

[1] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200240, Peoples R China

[2] Nanchang Univ, Dept Elect Engn & Automat, Nanchang 330031, Jianxi, Peoples R China

来源：

INTERNATIONAL REVIEW OF ELECTRICAL ENGINEERING-IREE | 2009年 / 4卷 / 02期

关键词：

Distribution network planning; Multistage planning; Target network; Spanning free; Genetic algorithm; DISTRIBUTION EXPANSION PROBLEM; DIRECTED GRAPH FORMULATION; DISTRIBUTION-SYSTEMS; BRANCH-EXCHANGE; MODEL; GENERATION; MULTIYEAR;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents a spanning free-based genetic algorithm (st-GA) to solve optimal multistage distribution network planning. According to the topological characteristic of distribution network, it is derived that the target network contains the message of each building stage for every candidate branch and its size. Thus, the multistage distribution network planning can be transformed into a problem of searching the optimal fat-get network with the minimum total costs in the whole planning horizon. Moreover, st-GA with two specialized genetic operators can guarantee the topological feasibility and high heritability of each solution generated and overcome the deficiencies of existing GAs applied for distribution network planning. Finally, the case study is implemented to demonstrate the usefulness and effectiveness of the proposed method. Copyright (C) 2009 Praise Worthy Prize S.r.l. - All rights reserved

引用

页码：220 / 227

页数：8

共 50 条

[1] A Spanning Tree-based Genetic Algorithm for Distribution Network Reconfiguration
Gautam, Mukesh
Bhusal, Narayan
Benidris, Mohammed
Louis, Sushil J.
[J]. 2020 IEEE INDUSTRY APPLICATIONS SOCIETY ANNUAL MEETING, 2020,
[2] A spanning tree-based genetic algorithm for bicriteria topological network design
Gen, M
Ida, K
Kim, J
[J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 15 - 20
[3] Bicriteria network design using a spanning tree-based genetic algorithm
J. R. Kim
M. Gen
K. Ida
[J]. Artificial Life and Robotics, 1999, 3 (2) : 65 - 72
[4] Spanning tree-based genetic algorithm for bicriteria transportation problem
Gen, M
Li, YZ
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (3-4) : 531 - 534
[5] Discovery of synergistic genetic network: A minimum spanning tree-based approach
Chatterjee, Prantik
Pal, Nikhil Ranjan
[J]. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2016, 14 (01)
[6] Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach
Syarif, A
Yun, Y
Gen, M
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2002, 43 (1-2) : 299 - 314
[7] Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm
Jo, Jung-Bok
Li, Yinzhen
Gen, Mitsuo
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (02) : 290 - 298
[8] Solving Reliable OCST Problems through Spanning Tree-based Genetic Algorithm
Kim, Jong Ryul
Jeong, Do-Un
[J]. THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 915 - 920
[9] Solving multi-objective transportation problem by spanning tree-based genetic algorithm
Gen, M
Li, YZ
Ida, K
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (12) : 2802 - 2810
[10] A hybrid spanning tree-based genetic/simulated annealing algorithm for a closed-loop logistics network design problem
Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, Tehran, Iran
不详
[J]. Int. J. Appl. Decis. Sci., 4 (400-426):

← 1 2 3 4 5 →