Terminal assignment in a communications network using genetic algorithms
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Heuristic algorithms for the terminal assignment problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
A portable and scalable algorithm for a class of constrained combinatorial optimization problems
Computers and Operations Research
Genetic Programming and Evolvable Machines
A review of particle swarm optimization. Part I: background and development
Natural Computing: an international journal
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
Evolutionary Computation
Natural Computing: an international journal
Automatic image pixel clustering with an improved differential evolution
Applied Soft Computing
International Journal of High Performance Computing Applications
Synchronous parallelization of Particle Swarm Optimization with digital pheromones
Advances in Engineering Software
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Computers and Operations Research
Genetic particle swarm optimization based on estimation of distribution
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
A mixed neural-genetic algorithm for the broadcast scheduling problem
IEEE Transactions on Wireless Communications
IEEE Transactions on Evolutionary Computation
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Automatic Clustering Using an Improved Differential Evolution Algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Guaranteed convergence in a class of Hopfield networks
IEEE Transactions on Neural Networks
Swarm optimisation algorithms applied to large balanced communication networks
Journal of Network and Computer Applications
Formulation of document summarization as a 0-1 nonlinear programming problem
Computers and Industrial Engineering
PSO with path relinking for resource allocation using simulation optimization
Computers and Industrial Engineering
| Hi-index | 0.00 |
Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA), named DPSO-EDA, for TEAP. EDAs sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from personal best solutions of all particles into the PSO, and therefore each particle has comprehensive learning and search ability. In the DPSO-EDA, a modified constraint handling method based on Hopfield neural network (HNN) is also introduced to fit nicely into the framework of the PSO and thus utilize the merit of the PSO. The DPSO-EDA adopts the asynchronous updating scheme. Further, the DPSO-EDA is applied to a problem directly related to TEAP, the task assignment problem (TAAP), in order to show that the DPSO-EDA can be generalized to other related combinatorial optimization problems. Simulation results on several problem instances show that the DPSO-EDA is better than previous methods.