Abstract
A new type of approximate algorithms for optimization problems, called membrane algorithms, is proposed, which can be seen as an application of membrane computing to evolutionary computing. A membrane algorithm consists of several membrane separated regions, where subalgorithms and tentative solutions to the optimization problem to be solved are placed, as well as a solution transporting mechanism between adjacent regions. The subalgorithms improve tentative solutions simultaneously. After that, the best and worst solutions in a region are sent to adjacent inner and outer regions, respectively. By repeating this process, a good solution will appear in the innermost region. The algorithm terminates if a terminate condition is satisfied. A simple condition of this type is the number of iterations, while a little more sophisticated condition becomes true if the good solution is not changed during a predetermined period. Computer experiments show that such algorithms are rather efficient in solving the travelling salesman problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Floudas, C.A., Pardalos, P.M. (eds.): Encyclopedia of Optimization. Kluwer, Dordrecht (2001)
Igel, C., Toussaint, M.: On classes of functions for which No Free Lunch results hold. Information Processing Letters 86, 317–321 (2003)
Konishi, K., et al: An application of temperature parallel simulated annealing to the travelling salesman problem and its experimental analysis. Trans. IEICS D-I J80-DI, 127–136 (1997) (in Japanese)
Maekawa, K., et al.: A solution of travelling salesman problem by genetic algorithm. SICE 31, 598–605 (1995) (in Japanese)
Maekawa, K., et al.: A genetic solution for the travelling salesman problem by means of a thermodynamical selection rule. SICE 33, 939–946 (1997) (in Japanese)
Nakamichi, Y., et al.: The effects of diversity control based on random selection in ant colony optimization. Journal of IPSJ 43, 2939–2947 (2002) (in Japanese)
Nishida, T.Y.: An application of P-system: A new algorithm for NP-complete optimization problems. In: Callaos, N., et al. (eds.) Proceedings of The 8th World Multi-Conference on Systems, Cybernetics and Informatics, vol. V, pp. 109–112 (2004)
Nishida, T.Y.: An approximate algorithm for NP-complete optimization problems exploiting P-systems. In: Proceedings of Brainstorming Workshop on Uncertainty in Membrane Computing, Palma de Majorca, pp. 185–192 (2004)
Nishida, T.Y.: Membrane algorithms. Approximate algorithms for NP-complete optimization problems. In: Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds.) Application of Membrane Computing, pp. 301–312. Springer, Berlin (2005)
Nishida, T.Y.: URL, http://www.comp.pu-toyama.ac.jp/nishida/
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Reinelt, G.: TSPLIB, URL, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Trans. Evolutionary Computation 6, 443–462 (2002)
Tomassini, M.: Spatially Structured Evolutionary Algorithms. Springer, Berlin (2005)
Tanaka, T., et al.: Performance comparisons of two Hopfield neural networks for large-scale travelling salesman problem. Journal IPSJ 38, 2157–2164 (1997)
Wolpert, D.H., Macready, W.G.: No Free Lunch Theorem for optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
Yoneda, M.: http://www.mikilab.doshisha.ac.jp/dia/research/person/yoneda/research/2002_7_10/SA/07-sareslut.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nishida, T.Y. (2006). Membrane Algorithms. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2005. Lecture Notes in Computer Science, vol 3850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603047_4
Download citation
DOI: https://doi.org/10.1007/11603047_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30948-2
Online ISBN: 978-3-540-32340-2
eBook Packages: Computer ScienceComputer Science (R0)