Self-organizing and self-evolving neurons: A new neural network for optimization

IEEE Transactions on Neural Networks

Volumn 18, Issue 2, 2007, Pages 385-396

  Wu, Sitao ^a   Chow, Tommy W S ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Particle swarm optimization (PSO); Self organizing and self evolving neurons (SOSENs); Self organizing map (SOM); Simulated annealing (SA)

Indexed keywords

COMPUTATIONAL EFFICIENCY; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; SELF ORGANIZING MAPS; SIMULATED ANNEALING;

PARTICLE SWARM OPTIMIZATION; SELF-ORGANIZING AND SELF-EVOLVING NEURONS; SELF-ORGANIZING MIGRATING ALGORITHM;

NEURAL NETWORKS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; FEEDBACK SYSTEM; INFORMATION RETRIEVAL; METHODOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FEEDBACK; INFORMATION STORAGE AND RETRIEVAL; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED;

EID: 34047179107     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2006.887556     Document Type: Article

References (50)

1. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
2. S. A. Kravitz and R. A. Rutenbar, "Placement by simulated annealing on a multiprocessor," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 6, no. 4, pp. 534-549, Jul. 1987.
3. M. Duque-Antón, D. Kunz, and B. Rüber, "Channel assignment for cellular radio using simulated annealing," IEEE Trans. Veh. Technol., vol. 42, no. 1, pp. 14-21, Feb. 1993.
4. A. Bevilacqua, "A methodological approach to parallel simulated annealing on an SMP system," J. Parallel Distrib. Comput., vol. 62, pp. 1548-1570, 2002.
5. J. R. A. Allwright and D. B. Carpenter, "A distributed implementation of simulated annealing for the traveling sales man problem," Parallel Comput., vol. 10, pp. 335-338, 1989.
6. P. Banerjee, M. Jones, and J. Sargent, "Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors," IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 1, pp. 91-106, Jan. 1990.
7. A. Casotto, F. Romeo, and A. Sangiovanni-Vincentelli, "A parallel simulated annealing algorithm for the place of macro-cell," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 6, no. 5, pp. 838-847, May 1987.
8. Sohn, "Parallel N-ary speculative computation of simulated annealing," IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 10, pp. 997-1005, Oct. 1995.
9. P. R. Ragot and G. Dreyfus, "A problem independent parallel implementation of simulated annealing: Models and experiments," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 9, no. 8, pp. 827-835, Aug. 1990.
10. R. Diekmann, R. Lüling, and J. Simon, "Problem independent distributed simulated annealing and its applications," in Lecture Notes in Economics and Mathematical Systems. Berlin, Germany: Springer-Verlag, 1993, vol. 396, pp. 17-44.
11. S. Gupta and L. Bic, "Distributed adaptive simulated annealing for synthesis design space exploration" Univ. California, Irvine, CA, Tech. Rep. 99-05, 1999.
12. S. M. Bhandarkar, S. Machaka, S. Chirravuri, and J. Arlond, "Parallel Computing for chromosome reconstruction via ordering of DNA sequences," Parallel Comput., vol. 24, no. 12-13, pp. 1177-1204, 1998.
13. K.-W. Chu, Y. Deng, and J. Reinitz, "Parallel simulated annealing by mixing of states," J. Comput. Phys., vol. 148, pp. 646-662, 1999.
14. H. Chen, N. S. Flann, and D. W. Watson, "Parallel genetic simulated annealing: A massively parallel SIMD algorithm," IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 2, pp. 126-136, Feb. 1998.
15. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Berlin, Germany: Springer-Verlag, 1994.
16. G. Rudolf, "Convergence properties of canonical genetic algorithms," IEEE Trans. Neural Netw., vol. 5, no. 1, pp. 96-101, Jan. 1994.
17. K. Jeong and J. J. Lee, "Adaptive simulated annealing genetic algorithm for system identification," Eng. Applicat. Artif. Intell., vol. 9, no. 5, pp. 523-532, 1996.
18. H. C. Huang, J. S. Pan, Z. M. Lu, S. H. Sun, and H. M. Hang, "Vector quantization based on genetic simulated annealing," Signal Process., vol. 81, pp. 1513-1523, 2001.
19. M. Kolonko, "Some new results on simulated annealing applied to job shop scheduling problem," Eur. J. Oper. Res., vol. 113, pp. 123-136, 1999.
20. P. Wong and S. Y. W. Wong, "Hybrid genetic/simulated annealing approach to short-term multiple-fuel-constrained generation scheduling," IEEE Trans. Power Syst., vol. 12, no. 2, pp. 776-784, May 1997.
21. M. E. Aydin and T. C. Fogarty, "A distributed evolutionary simulated annealing algorithm for combinational optimization problems," J. Heuristics, vol. 10, pp. 269-292, 2004.
22. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
23. H.-G. Beyer, The Theory of Evolution Strategies. Berlin, Germany: Springer-Verlag, 2001.
24. D.Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. Piscataway, NJ: IEEE Press, 1996.
25. Dorigo, V. Maniezzo, and A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 26, no. 1, pp. 29-41, Feb. 1996.
26. J. Lampinen and R. Storn, "Differential evolution," in New Optimization Techniques in Engineering, G. Onwubolu and B. V. Babu, Eds. Heidelberg, Germany: Springer-Verlag, 2004, pp. 123-166.
27. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," in Proc. IEEE Int. Conf. Neural Netw., Perth, Australia, Nov. 1995, pp. 1942-1948.
28. P. Moscato, C. Cotta, and A. Mendes, "Memetic algorithms," in New Optimization Techniques in Engineering, G. Onwubolu and B. V. Babu, Eds. Heidelberg, Germany: Springer-Verlag, 2004, pp. 53-85.
29. I.-S. Oh, J.-S. Lee, and B.-R. Moon, "Hybrid genetic algorithms for feature selection," IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 11, pp. 1424-1437, Nov. 2004.
30. T. Kohonen, Self-Organizing Maps. Berlin, Germany: Springer-Verlag, 1997.
31. Zelinka, "SOMA-self-organizing migrating algorithm," in New Optimization Techniques in Engineering, G. Onwubolu and B. V. Babu, Eds. Heidelberg, Germany: Springer-Verlag, 2004, pp. 167-217.
32. Y. Shi and R. C. Eberhart, "Empirical study of particle swarm optimization," in Proc. IEEE Int. Congr. Evol. Comput., 1999, vol. 3, pp. 101-106.
33. S. Jung and B.-R. Moon, "Toward minimal restriction of genetic encoding and crossovers for the two-dimensional euclidean TSP," IEEE Trans. Evol. Comput., vol. 6, no. 6, pp. 557-565, Dec. 2002.
34. H.-K. Tsai, J.-M. Yang, Y.-F. Tsai, and C.-Y. Kao, "An evolutionary algorithm for large traveling salesman problems," IEEE Trans. Syst., Man, Cybern., B, Cybern., vol. 34, no. 4, pp. 1718-1829, Aug. 2004.
35. H. Braun, "On traveling salesman problems by genetic algorithm," in Proc. Workshop Parallel Problem Solving from Nature, 1990, pp. 129-133.
36. P. Jog, J. Suh, and D. Gucht, "The effect of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 110-115.
37. S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, no. 4598, pp. 498-516, 1973.
38. Helsgaun, "An effective implementation of the lin-kernighan traveling salesman heuristic," Eur. J. Oper. Res., vol. 126, pp. 106-130, 2000.
39. G. Reinelt, "TSPLIB-A traveling salesman library," ORSA J. Comput., vol. 3, pp. 376-384, 1991.
40. Katzela and M. Naghshineh, "Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey," IEEE Personal Commun., vol. 3, no. 3, pp. 10-30, Jun. 1996.
41. W. C. Y. Lee, Mobile Cellular Telecommunications Systems. New York: McGraw-Hill, 1989.
42. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, "Channel assignment problem in a cellular system and a new coloring problem of networks," IEICE Trans. Commun. Electron. Inf. Syst., vol. 74, no. 10, pp. 2983-2989, 1991.
43. H. G. Sandalidis and P. Stavroulakis, "Heuristics for solving fixed-channel assignment problems," in Handbook of Wireless Networks and Mobile Computing, Stojmenovic, Ed. New York: Wiley, 2002, pp. 51-70.
44. W. Wang and C. K. Rushforth, "An adaptive local-search algorithm for the channel-assignment problem (CAP)," IEEE Trans. Veh. Technol., vol. 45, no. 3, pp. 459-466, Aug. 1995.
45. S. Matsui, I. Watanabe, and K.-I. Tokoro, "Application of the parameter-free genetic algorithm to the fixed channel assignment problem," Syst. Comput. Jpn., vol. 36, no. 4, pp. 350-359, 2005.
46. F. Glover and M. Laguna, Tabu Search. Boston, MA: Kluwer, 1997.
47. S. Wu and T. W. S. Chow, "PRSOM: A new visualization method by hybridizing multi-dimensional scaling and self-organizing map," IEEE Trans. Neural Netw., vol. 16, no. 6, pp. 1362-1380, Nov. 2005.
48. E. Berglund and J. Sitte, "The parameterless self-organizing map algorithm," IEEE Trans. Neural Netw., vol. 17, no. 2, pp. 305-316, Mar. 2006.
49. J. Vesanto and E. Alhoniemi, "Clustering of the self-organizing map," IEEE Trans. Neural Netw., vol. 11, no. 3, pp. 586-600, May 2000.
50. T. W. S. Chow and S. Wu, "An online cellular probabilistic self-organizing map for static and dynamical data sets," IEEE Trans. Circuit Syst. I, Reg. Papers, vol. 51, no. 4, pp. 732-747, Apr. 2004.