Application of genetic algorithm to a parallel path selection problem

被引：4

作者：

Sannomiya, N ^{[1
]}

Tatemura, K ^{[1
]}

机构：

[1] NIPPON STEEL INFORMAT & COMMUN SYST INC,CHUO KU,TOKYO 104,JAPAN

来源：

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE | 1996年 / 27卷 / 02期

关键词：

D O I：

10.1080/00207729608929213

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Optimal selection of multiple parallel paths connecting the starting and arrival nodes is considered. The objective is to minimize the length of the longest path among multiple paths. The constraint is that duplication of the nodes belonging to each path is not allowed. The basic idea of the proposed method is to decompose the network into several subnetworks and to obtain the shortest path for each subnetwork. The genetic algorithm is applied for the decomposition procedure. It is observed from numerical results that the proposed methods is efficient from the viewpoints of the accuracy of the solution and the computation time.

引用

页码：269 / 274

页数：6