Applying Bio-inspired Techniques to the p-Median Problem

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.

[1]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[2]  B. M. Khumawala An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[3]  Luiz Antonio Nogueira Lorena,et al.  Constructive Genetic Algorithm for Clustering Problems , 2001, Evolutionary Computation.

[4]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[5]  Michelle R. Hribar,et al.  A dynamic programming heuristic for the P-median problem , 1997 .

[6]  José Muñoz-Pérez,et al.  An Efficient Neural Network Algorithm for the p-Median Problem , 2002, IBERAMIA.

[7]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[8]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[9]  Miguel Toro,et al.  Advances in Artificial Intelligence — IBERAMIA 2002 , 2002, Lecture Notes in Computer Science.

[10]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[11]  Y. Kochetov,et al.  LARGE NEIGHBORHOOD SEARCH FOR THE P-MEDIAN PROBLEM , 2003 .

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Zvi Drezner,et al.  An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  Sebastián Lozano,et al.  Kohonen maps for solving a class of location-allocation problems , 1998, Eur. J. Oper. Res..

[16]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[17]  M. Goodchild,et al.  Discrete space location-allocation solutions from genetic algorithms , 1986 .

[18]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[19]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[20]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[21]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[22]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.