Membrane algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3850 LNCS, Issue , 2006, Pages 55-66

  Nishida, Taishin Y ^a  

^a TOYAMA PREFECTURAL UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

APPROXIMATE ALGORITHMS; MEMBRANE ALGORITHMS; MEMBRANE SEPARATED REGIONS; SOLUTION TRANSPORTING MECHANISM;

COMPUTATIONAL METHODS;

EID: 33745653892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603047_4     Document Type: Conference Paper

References (17)

1. C.A. Floudas, P.M. Pardalos, eds.: Encyclopedia of Optimization. Kluwer, Dordrecht, 2001.
2. C. Igel, M. Toussaint: On classes of functions for which No Free Lunch results hold. Information Processing Letters, 86 (2003), 317-321.
3. K. Konishi et al.: An application of temperature parallel simulated annealing to the travelling salesman problem and its experimental analysis. Trans. IEICS D-I, J80-DI (1997), 127-136 (in Japanese).
4. K. Maekawa et al.: A solution of travelling salesman problem by genetic algorithm. SICE, 31 (1995), 598-605 (in Japanese).
5. K. Maekawa et al.: A genetic solution for the travelling salesman problem by means of a thermodynamical selection rule. SICE, 33 (1997), 939-946 (in Japanese).
6. Y. Nakamichi et al.: The effects of diversity control based on random selection in ant colony optimization. Journal of IPSJ, 43 (2002), 2939-2947 (in Japanese).
7. T.Y. Nishida: An application of P-system: A new algorithm for NP-complete optimization problems. In Proceedings of The 8th World Multi-Conference on Systems, Cybernetics and Informatics (N. Callaos et al., eds.), 2004, vol V, 109-112.
8. T.Y. Nishida: An approximate algorithm for NP-complete optimization problems exploiting P-systems. In Proceedings of Brainstorming Workshop on Uncertainty in Membrane Computing, Palma de Majorca, 2004, 185-192.
9. T.Y. Nishida: Membrane algorithms. Approximate algorithms for NP-complete optimization problems. In Application of Membrane Computing (G. Ciobanu, Gh. Pǎun, M.J. Pérez-Jiménez, eds.), Springer, Berlin, 2005, 301-312.
10. T.Y. Nishida: URL http://www.comp.pu-toyama.ac.jp/nishida/.
11. Gh. Pǎun: Computing with membranes. Journal of Computer and System Sciences, 61 (2000), 108-143.
12. G. Reinelt: TSPLIB, URL http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/.
13. M. Tomassini: Parallelism and evolutionary algorithms. IEEE Trans. Evolutionary Computation, 6 (2002), 443-462.
14. M. Tomassini: Spatially Structured Evolutionary Algorithms. Springer, Berlin, 2005.
15. T. Tanaka et al.: Performance comparisons of two Hopfield neural networks for large-scale travelling salesman problem. Journal IPSJ, 38 (1997), 2157-2164.
16. D.H. Wolpert, W.G. Macready: No Free Lunch Theorem for optimization. IEEE Transactions on Evolutionary Computation, 1 (1997), 67-82.
17. M. Yoneda: URL http://www.mikilab.doshisha.ac.jp/dia/research/person/ yoneda/research/2002_7_10/SA/07-sareslut.html