Multi-start stochastic competitive Hopfield neural network for frequency assignment problem in satellite communications

被引:16
作者
Wang, Jiahai [1 ]
Cai, Yiqiao [1 ]
Yin, Jian [1 ]
机构
[1] Sun Yat Sen Univ, Guangzhou Higher Educ Mega Ctr, Dept Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Competitive Hopfield neural network; Stochastic dynamics; Multi-start strategy; Dynamic weighting coefficient; Frequency assignment problem; Combinatorial optimization problem; COMBINATORIAL OPTIMIZATION; MODEL; ALGORITHM;
D O I
10.1016/j.eswa.2010.06.027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The objective of the frequency assignment problem (FAP) is to minimize cochannel interference between two satellite systems by rearranging frequency assignment. In this paper, we first propose a competitive Hopfield neural network (CHNN) for FAP. Then we propose a stochastic CHNN (SCHNN) for the problem by introducing stochastic dynamics into the CHNN to help the network escape from local minima. In order to further improve the performance of the SCHNN, a multi-start strategy or re-start mechanism is introduced into the SCHNN. The multi-start strategy or re-start mechanism super-imposed on the SCHNN is characterized by alternating phases of cooling and reheating the stochastic dynamics, thus provides a means to achieve an effective dynamic or oscillating balance between intensification and diversification during the search. Furthermore, dynamic weighting coefficient setting strategy is adopted in the energy function to satisfy the constraints and improve the objective of the problem simultaneously. The proposed multi-start SCHNN (MS-SCHNN) is tested on a set of benchmark problems and a large number of randomly generated instances. Simulation results show that the MS-SCHNN is better than several typical neural network algorithms such as GNN, TCNN, NCNN and NCNN-VT, and metaheuristic algorithm such as hybrid SA. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:131 / 145
页数:15
相关论文
共 28 条
[1]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308
[2]   CHAOTIC SIMULATED ANNEALING BY A NEURAL-NETWORK MODEL WITH TRANSIENT CHAOS [J].
CHEN, LN ;
AIHARA, K .
NEURAL NETWORKS, 1995, 8 (06) :915-930
[3]   A neural model for the p-median problem [J].
Dominguez, Enrique ;
Munoz, Jose .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (02) :404-416
[4]   A gradual neural-network approach for frequency assignment in satellite communication systems [J].
Funabiki, N ;
Nishikawa, S .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1997, 8 (06) :1359-1370
[5]  
Funaibiki N, 1999, IEICE T FUND ELECTR, VE82A, P815
[6]   Design and analysis of maximum Hopfield networks [J].
Galán-Marín, G ;
Muñoz-Pérez, J .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (02) :329-339
[7]   Modelling competitive Hopfield networks for the maximum clique problem [J].
Galán-Marín, G ;
Mérida-Casermeiro, E ;
Muñoz-Pérez, J .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (04) :603-624
[8]  
HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141
[9]   NEURONS WITH GRADED RESPONSE HAVE COLLECTIVE COMPUTATIONAL PROPERTIES LIKE THOSE OF 2-STATE NEURONS [J].
HOPFIELD, JJ .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA-BIOLOGICAL SCIENCES, 1984, 81 (10) :3088-3092
[10]   NEURAL NETWORKS AND PHYSICAL SYSTEMS WITH EMERGENT COLLECTIVE COMPUTATIONAL ABILITIES [J].
HOPFIELD, JJ .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA-BIOLOGICAL SCIENCES, 1982, 79 (08) :2554-2558