A recurrent neural network for solving the shortest path problem

被引：46

作者：

Wang, J ^{[1
]}

机构：

[1] CHINESE UNIV HONG KONG,DEPT MECH & AUTOMAT ENGN,SHATIN,NEW TERR,HONG KONG

来源：

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS | 1996年 / 43卷 / 06期

关键词：

D O I：

10.1109/81.503260

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the shortest path problem is presented, The recurrent neural network is able to generate optimal solutions to the shortest path problem. The performance of the recurrent neural network is demonstrated by means of three illustrative examples. The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation.

引用

页码：482 / 486

页数：5

共 12 条

[1] A FAST DISTRIBUTED SHORTEST-PATH ALGORITHM FOR A CLASS OF HIERARCHICALLY CLUSTERED DATA-NETWORKS [J].

ANTONIO, JK ;

HUANG, GM ;

TSAI, WK .

IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (06) :710-724

[2]

BAZARAA MS, 1977, LINEAR PROGRAMMING N, P483

[3]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[4] CONTROL AND OPTIMIZATION METHODS IN COMMUNICATION-NETWORK PROBLEMS [J].

EPHREMIDES, A ;

VERDU, S .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1989, 34 (09) :930-942

[5]

FAHNER G, 1991, P INT JOINT C NEUR N, V1, P153

[6]

HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141

[7] SHORTEST-PATH PLANNING IN DISCRETIZED WORKSPACES USING DOMINANCE RELATION [J].

JUN, ST ;

SHIN, KG .

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1991, 7 (03) :342-350

[8] NEURAL NETWORKS FOR ROUTING COMMUNICATION TRAFFIC. [J].

Rauch, Herbert E. ;

Winarske, Theo .

IEEE Control Systems Magazine, 1988, 8 (02) :26-31

[9] SIMPLE NEURAL OPTIMIZATION NETWORKS - AN A/D CONVERTER, SIGNAL DECISION CIRCUIT, AND A LINEAR-PROGRAMMING CIRCUIT [J].

TANK, DW ;

HOPFIELD, JJ .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1986, 33 (05) :533-541

[10] A K-SHORTEST PATH ALGORITHM FOR ADAPTIVE ROUTING IN COMMUNICATIONS NETWORKS [J].

TOPKIS, DM .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (07) :855-859

← 1 2 →