A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem

Authors:
S. Salcedo-Sanz;Xin Yao
Affiliations:
Sch. of Comput. Sci., Univ. of Birmingham, UK;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2004

Citing 0
Cited 29

Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments

Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
A heuristics based approach for cellular mobile network planning

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Network partition for switched industrial Ethernet using genetic algorithm

Engineering Applications of Artificial Intelligence
Assignment of cells to switches in a cellular mobile network using a hybrid Hopfield network-genetic algorithm approach

Applied Soft Computing
Optimal switch location in mobile communication networks using hybrid genetic algorithms

Applied Soft Computing
Greedy Algorithms for Client Assignment in Large-Scale Distributed Virtual Environments

Simulation
Solving terminal allocation problem using simulated annealing arithmetic

WSEAS TRANSACTIONS on SYSTEMS
Evolutionary codings and operators for the terminal assignment problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Client assignment problem in distributed virtual environments

International Journal of Computers and Applications
Solving assignment problem of cellular mobile network using iterative local search algorithm

Proceedings of the International Conference and Workshop on Emerging Trends in Technology
A genetic algorithm with switch-device encoding for optimal partition of switched industrial Ethernet networks

Journal of Network and Computer Applications
Pattern recalling analysis of English alphabets using Hopfield model of feedback neural network with evolutionary searching

International Journal of Business Information Systems
Discrete differential evolution algorithm for solving the terminal assignment problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
A high order neural network to solve crossbar switch problem

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II
Using the bees algorithm to assign terminals to concentrators

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems

Computers and Industrial Engineering
Targeting cells to switch assignment of cellular mobile network using heuristic algorithm

ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
A novel grouping heuristic algorithm for the switch location problem based on a hybrid dual harmony search technique

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Genetic and local search algorithms applied to balanced communication networks

Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
A hybrid estimation of distribution algorithm for CDMA cellular system design

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A novel grouping harmony search algorithm for the multiple-type access node location problem

Expert Systems with Applications: An International Journal
A hybrid DE algorithm with a multiple strategy for solving the terminal assignment problem

SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Study of Hopfield neural network with sub-optimal and random GA for pattern recalling of English characters

Applied Soft Computing
A parallel cooperative co-evolutionary genetic algorithm for the composite saas placement problem in cloud computing

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Swarm optimisation algorithms applied to large balanced communication networks

Journal of Network and Computer Applications
On cost-efficient optimisation of universal mobile telecommunications system access subsystem using extended evolutionary heuristic algorithm

International Journal of Mobile Network Design and Innovation
TSOIA: An efficient node selection algorithm facing the uncertain process for Internet of Things

Journal of Network and Computer Applications
Performance evaluation of Hopfield neural networks for overlapped English characters by using genetic algorithms

International Journal of Hybrid Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a hybrid Hopfield network-genetic algorithm (GA) approach to tackle the terminal assignment (TA) problem. TA involves determining minimum cost links to form a communications network, by connecting a given set of terminals to a given collection of concentrators. Some previous approaches provide very good results if the cost associated with assigning a single terminal to a given concentrator is known. However, there are situations in which the cost of a single assignment is not known in advance, and only the cost associated with feasible solutions can be calculated. In these situations, previous algorithms for TA based on greedy heuristics are no longer valid, or fail to get feasible solutions. Our approach involves a Hopfield neural network (HNN) which manages the problem's constraints, whereas a GA searches for high quality solutions with the minimum possible cost. We show that our algorithm is able to achieve feasible solutions to the TA in instances where the cost of a single assignment in not known in advance, improving the results obtained by previous approaches. We also show the applicability of our approach to other problems related to the TA.