In this paper I will present two different genetic and ant colony algorithms for solving a classic computer science problem: shortest path problems. I will first give a brief discussion on the general topics of the shortest path problem, genetic and ant colony algorithms.I will conclude by making some observations on the advantages and disadvantages of using genetic and ant colony algorithms to solve the shortest path problem and my opinion on the usefulness of the solutions and the future of this area of computer science
Comments: 17 Pages.
[v1] 2019-06-29 06:30:52
Unique-IP document downloads: 20 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.