Skip to main content
Top

2017 | OriginalPaper | Chapter

A Family of Ant Colony P Systems

Authors : Ping Guo, Mingzhe Zhang, Jing Chen

Published in: Bio-inspired Computing: Theories and Applications

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Ant colony algorithm is a kind of bionic evolutionary algorithm, which is widely used in the field of optimization. Membrane computing is a new computing model, which has the characteristics of distributed, maximal parallelism and non-deterministic. Different with the most current researches that use ant colony algorithm as the sub-algorithm in the framework of the membrane algorithm, this paper considers the realizing ant colony algorithm completely by evolution rules, and we design new ant colony P system \(\varPi _{ACS}\), which includes the membrane structure and evolutionary rules. This paper not only provides a new way to realize the ant colony algorithm, but also lays a foundation for building a general framework for solving optimization problems in membrane computing.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Dorigo, M.: Optimization, learning and natural algorithms. Thesis Politecnico Di Milano Italy (1992) Dorigo, M.: Optimization, learning and natural algorithms. Thesis Politecnico Di Milano Italy (1992)
2.
go back to reference Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)CrossRef Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)CrossRef
3.
go back to reference Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73–81 (1997)CrossRef Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73–81 (1997)CrossRef
4.
go back to reference Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15(2), 169–176 (2014)CrossRef Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15(2), 169–176 (2014)CrossRef
5.
go back to reference Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(4), 333–346 (2010)CrossRef Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(4), 333–346 (2010)CrossRef
6.
go back to reference Parpinelli, R.S., Lopes, H.S., Freitas, A.A.: Classification-rule discovery with an ant colony algorithm. In: Khosrow-Pour, M. (ed.) Encyclopedia of Information Science and Technology, 1st edn., pp. 420–424. Idea Group, Hershey (2005). ISBN 1-59140-553-X Parpinelli, R.S., Lopes, H.S., Freitas, A.A.: Classification-rule discovery with an ant colony algorithm. In: Khosrow-Pour, M. (ed.) Encyclopedia of Information Science and Technology, 1st edn., pp. 420–424. Idea Group, Hershey (2005). ISBN 1-59140-553-X
7.
go back to reference Tian, J., Yu, W., Xie, S.: An ant colony optimization algorithm for image edge detection. In: 2010 International Conference on Artificial Intelligence and Computational Intelligence, vol. 2, no. 5, pp. 751–756. IEEE Computer Society (2010) Tian, J., Yu, W., Xie, S.: An ant colony optimization algorithm for image edge detection. In: 2010 International Conference on Artificial Intelligence and Computational Intelligence, vol. 2, no. 5, pp. 751–756. IEEE Computer Society (2010)
8.
go back to reference Fajjari, I., Aitsaadi, N., Pujolle, G., et al.: VNE-AC: virtual network embedding algorithm based on ant colony metaheuristic. In: IEEE International Conference on Communications, vol. 34, no. 17, pp. 1–6 (2011) Fajjari, I., Aitsaadi, N., Pujolle, G., et al.: VNE-AC: virtual network embedding algorithm based on ant colony metaheuristic. In: IEEE International Conference on Communications, vol. 34, no. 17, pp. 1–6 (2011)
11.
12.
go back to reference Bernardini, F., Gheorghe, M.: Cell communication in tissue P systems: universality results. Soft Comput. 9(9), 640–649 (2005)CrossRefMATH Bernardini, F., Gheorghe, M.: Cell communication in tissue P systems: universality results. Soft Comput. 9(9), 640–649 (2005)CrossRefMATH
13.
go back to reference Kishan, S.N.: Universality results for P systems based on brane calculi operation. Theor. Comput. Sci. 371(1–2), 83–105 (2007)MathSciNet Kishan, S.N.: Universality results for P systems based on brane calculi operation. Theor. Comput. Sci. 371(1–2), 83–105 (2007)MathSciNet
14.
go back to reference Nishida, T.Y.: Membrane algorithm with brownian subalgorithm and genetic subalgorithm. Int. J. Found. Comput. S. 18(6), 1353–1360 (2007)CrossRefMATHMathSciNet Nishida, T.Y.: Membrane algorithm with brownian subalgorithm and genetic subalgorithm. Int. J. Found. Comput. S. 18(6), 1353–1360 (2007)CrossRefMATHMathSciNet
15.
go back to reference Zhao, J., Wang, N.: Hybrid optimization method based on membrane computing. Ind. Eng. Chem. Res. 50(3), 1691–1704 (2011)CrossRef Zhao, J., Wang, N.: Hybrid optimization method based on membrane computing. Ind. Eng. Chem. Res. 50(3), 1691–1704 (2011)CrossRef
16.
go back to reference Wang, X., Zhang, G., Zhao, J., et al.: A modified membrane-inspired algorithm based on particle swarm optimization for mobile robot path planning. Int. J. Comput. Commun. Control 10(6), 732–745 (2015)CrossRef Wang, X., Zhang, G., Zhao, J., et al.: A modified membrane-inspired algorithm based on particle swarm optimization for mobile robot path planning. Int. J. Comput. Commun. Control 10(6), 732–745 (2015)CrossRef
17.
go back to reference Xiao, J., Huang, Y., Cheng, Z., et al.: A hybrid membrane evolutionary algorithm for solving constrained optimization problems. Int. J. Light Electron. Opt. 125(2), 897–902 (2014)CrossRef Xiao, J., Huang, Y., Cheng, Z., et al.: A hybrid membrane evolutionary algorithm for solving constrained optimization problems. Int. J. Light Electron. Opt. 125(2), 897–902 (2014)CrossRef
18.
go back to reference Zhang, G., Cheng, J., Gheorghe, M., et al.: A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problems. Appl. Soft Comput. 13(3), 1528–1542 (2013)CrossRef Zhang, G., Cheng, J., Gheorghe, M., et al.: A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problems. Appl. Soft Comput. 13(3), 1528–1542 (2013)CrossRef
21.
go back to reference Yang, J., Zhuang, Y.: An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem. Appl. Soft Comput. 10(2), 653–660 (2010)CrossRef Yang, J., Zhuang, Y.: An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem. Appl. Soft Comput. 10(2), 653–660 (2010)CrossRef
22.
go back to reference Tuba, M., Jovanovic, R., Jovanovic, R.: Improved ACO algorithm with pheromone correction strategy for the traveling salesman problem. Int. J. Comput. Commun. Control 8(3), 477–485 (2013)CrossRef Tuba, M., Jovanovic, R., Jovanovic, R.: Improved ACO algorithm with pheromone correction strategy for the traveling salesman problem. Int. J. Comput. Commun. Control 8(3), 477–485 (2013)CrossRef
23.
go back to reference Guo, P., Liu, Z.J.: An ant system based on moderate search for TSP. Comput. Sci. Inf. Syst. 9(4), 1533–1551 (2012)CrossRef Guo, P., Liu, Z.J.: An ant system based on moderate search for TSP. Comput. Sci. Inf. Syst. 9(4), 1533–1551 (2012)CrossRef
Metadata
Title
A Family of Ant Colony P Systems
Authors
Ping Guo
Mingzhe Zhang
Jing Chen
Copyright Year
2017
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-7179-9_14

Premium Partner