An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem
Summary :
In this paper, we propose a new parallel algorithm for cellular radio channel assignment problem that can help the expanded maximum neural network escape from local minima by introducing a transient chaotic neurodynamics. The goal of the channel assignment problem, which is an NP-complete problem, is to minimize the total interference between the assigned channels needed to satisfy all of the communication needs. The expanded maximum neural model always guarantees a valid solution and greatly reduces search space without a burden on the parameter-tuning. However, the model has a tendency to converge to local minima easily because it is based on the steepest descent method. By adding a negative self-feedback to expanded maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm then is fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the expanded maximum neural network and the chaotic neurodynamics. Simulations on benchmark problems demonstrate the superior performance of the proposed algorithm over other heuristics and neural network methods.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.8 pp.2092-2099
- Publication Date
- 2004/08/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Nonlinear Problems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jiahai WANG, Zheng TANG, Hiroki TAMURA, Xinshun XU, "An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 8, pp. 2092-2099, August 2004, doi: .
Abstract: In this paper, we propose a new parallel algorithm for cellular radio channel assignment problem that can help the expanded maximum neural network escape from local minima by introducing a transient chaotic neurodynamics. The goal of the channel assignment problem, which is an NP-complete problem, is to minimize the total interference between the assigned channels needed to satisfy all of the communication needs. The expanded maximum neural model always guarantees a valid solution and greatly reduces search space without a burden on the parameter-tuning. However, the model has a tendency to converge to local minima easily because it is based on the steepest descent method. By adding a negative self-feedback to expanded maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm then is fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the expanded maximum neural network and the chaotic neurodynamics. Simulations on benchmark problems demonstrate the superior performance of the proposed algorithm over other heuristics and neural network methods.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_8_2092/_p
Copy
@ARTICLE{e87-a_8_2092,
author={Jiahai WANG, Zheng TANG, Hiroki TAMURA, Xinshun XU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem},
year={2004},
volume={E87-A},
number={8},
pages={2092-2099},
abstract={In this paper, we propose a new parallel algorithm for cellular radio channel assignment problem that can help the expanded maximum neural network escape from local minima by introducing a transient chaotic neurodynamics. The goal of the channel assignment problem, which is an NP-complete problem, is to minimize the total interference between the assigned channels needed to satisfy all of the communication needs. The expanded maximum neural model always guarantees a valid solution and greatly reduces search space without a burden on the parameter-tuning. However, the model has a tendency to converge to local minima easily because it is based on the steepest descent method. By adding a negative self-feedback to expanded maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm then is fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the expanded maximum neural network and the chaotic neurodynamics. Simulations on benchmark problems demonstrate the superior performance of the proposed algorithm over other heuristics and neural network methods.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2092
EP - 2099
AU - Jiahai WANG
AU - Zheng TANG
AU - Hiroki TAMURA
AU - Xinshun XU
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2004
AB - In this paper, we propose a new parallel algorithm for cellular radio channel assignment problem that can help the expanded maximum neural network escape from local minima by introducing a transient chaotic neurodynamics. The goal of the channel assignment problem, which is an NP-complete problem, is to minimize the total interference between the assigned channels needed to satisfy all of the communication needs. The expanded maximum neural model always guarantees a valid solution and greatly reduces search space without a burden on the parameter-tuning. However, the model has a tendency to converge to local minima easily because it is based on the steepest descent method. By adding a negative self-feedback to expanded maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm then is fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the expanded maximum neural network and the chaotic neurodynamics. Simulations on benchmark problems demonstrate the superior performance of the proposed algorithm over other heuristics and neural network methods.
ER -
English
