No Access
Swarm Intelligence Models: Ant Colony Systems Applied to BNF Grammars Rule Derivation
https://doi.org/10.1142/S0129054120400079Cited by:0 (Source: Crossref)
Abstract
Ant Colony Systems have been widely employed in optimization issues primarily focused on path finding optimization, such as Traveling Salesman Problem. The main advantage lies in the choice of the edge to be explored, defined using the idea of pheromone. This article proposes the use of Ant Colony Systems to explore a Backus-Naur form grammar whose elements are solutions to a given problem. Similar studies, without using Ant Colonies, have been used to solve optimization problems, such as Grammatical Swarm (based on Particle Swarm Optimization) and Grammatical Evolution (based on Genetic Algorithms). Proposed algorithm opens the way to a new branch of research in Swarm Intelligence, which until now has been almost non-existent, using ant colony algorithms to solve problems described by a grammar.
Communicated by Erzsébet Csuhaj-Varjú and Florin Manea
References
- 1. , Revised report on the algorithm language algol 60, Commun. ACM 6 (1963) 1–17. Crossref, Web of Science, Google Scholar
- 2. , Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics 18(1) (2004) 41–48. Crossref, Web of Science, Google Scholar
- 3. D. Chu and A. Zomaya, Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model, Parallel Evolutionary Computations, eds. N. Nedjah, L. d. M. Mourelle and E. Alba (Springer, Berlin, Heidelberg, 2006), pp. 177–198. Google Scholar
- 4. , Foundations in Grammatical Evolution for Dynamic Environments, 1st edn. (Springer Publishing Company, Incorporated, 2009). Crossref, Google Scholar
- 5. , The ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics, Part B 26(1) (1996) 29–41. Crossref, Web of Science, Google Scholar
- 6. , Ant Colony Optimization (Bradford Company, Scituate, MA, USA, 2004). Crossref, Google Scholar
- 7. , A comparative study of the improvement of performance using a pso modified by aco applied to tsp, Appl. Soft Comput. 25 (2014) 234–241. Crossref, Web of Science, Google Scholar
- 8. , A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems, Proceedings of the Fifth International Conference on Genetic Algorithms, ed. 375–382 (11, 1993). Google Scholar
- 9. L. Georgiou and W. J. Teahan, Grammatical evolution and the santa fe trail problem, ICEC 2010 — Proceedings of the International Conference on Evolutionary Computation, [Part of the International Joint Conference on Computational Intelligence IJCCI 2010], Valencia, Spain, October 24–26, 2010, eds. J. Filipe and J. Kacprzyk (SciTePress, 2010), pp. 10–19. Google Scholar
- 10. , A graph-based ant system and its convergence, Future Generation Computer Systems 16(8) (2000) 873–888. Crossref, Web of Science, Google Scholar
- 11. , Routing in optical multistage networks with limited crosstalk using ant colony optimization, International Journal of Foundations of Computer Science 16(2) (2005) 301–320. Link, Web of Science, Google Scholar
- 12. , Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks (1995), pp. 1942–1948. Crossref, Google Scholar
- 13. ,
Representation of events in nerve nets and finite automata , Automata Studies, eds. C. Shannon and J. McCarthy (Princeton University Press, Princeton, NJ, 1956), pp. 3–41. Crossref, Google Scholar - 14. , Backus normal form vs. backus naur form, Commun. ACM 7 (1964) 735–736. Crossref, Web of Science, Google Scholar
- 15. F. Kollin and A. Bavey, Ant colony optimization algorithms: Pheromone techniques for tsp (2017). Google Scholar
- 16. , Genetic programming as a means for programming computers by natural selection, Statistics and Computing 4(2) (1994) 87–112. Crossref, Web of Science, Google Scholar
- 17. , Introduction to genetic programming tutorial: From the basics to human-competitive results, Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7–11, 2010, Companion Material, eds. M. Pelikan and J. Branke (ACM, 2010), pp. 2137–2262. Crossref, Google Scholar
- 18. , Hybrid ant colony algorithms for path planning in sparse graphs, Soft Comput. 12(10) (2008) 981–994. Crossref, Web of Science, Google Scholar
- 19. , Grammatical evolution, IEEE Transactions on Evolutionary Computation 5 (2001) 349–358. Crossref, Web of Science, Google Scholar
- 20. , Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language (Kluwer Academic Publishers, Norwell, MA, USA, 2003). Crossref, Google Scholar
- 21. , Teaching ebnf first in cs 1, SIGCSE Bull. 26 (1994) 300–303. Crossref, Google Scholar
- 22. M. Pelikan and J. Branke (eds.), Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7–11, 2010, Companion Material (ACM, 2010). Google Scholar
- 23. , Grammatical Evolution: Evolving Programs for an Arbitrary Language,
Genetic Programming: First European Workshop, EuroGP’98 Paris, France, April 14–15, 1998 Proceedings , eds. W. Banzhaf, R. Poli, M. Schoenauer and T. C. Fogarty (Springer, Berlin, Heidelberg, 1998), pp. 83–96. Google Scholar
| Remember to check out the Most Cited Articles! |
|---|
|
Check out these Handbooks in Computer Science |
