Applying bio-inspired techniques to the p-median problem

Authors:
E. Domínguez;J. Muñoz
Affiliations:
Department of Computer Science, E.T.S.I.Informatica, University of Malaga, Malaga, Spain;Department of Computer Science, E.T.S.I.Informatica, University of Malaga, Malaga, Spain
Venue:
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Year:
2005

Citing 3
Cited 0

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An Efficient Neural Network Algorithm for the p-Median Problem

IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Constructive Genetic Algorithm for Clustering Problems

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neural networks (NNs) and genetic algorithms (GAs) are the two most popular bio-inspired techniques. Criticism of these approaches includes the tendency of recurrent neural networks to produce infeasible solutions, the lack of generalize of the self-organizing approaches, and the requirement of tuning many internal parameters and operators of genetic algorithms. This paper proposes a new technique which enables feasible solutions, removes the tuning phase, and improves solutions quality of typical combinatorial optimization problems as the p-median problem. Moreover, several biology inspired approaches are analyzed for solving traditional benchmarks.