Abstract
In earlier studies a genetic algorithm (GA) extended with the dynamic memory model has shown remarkable performance on real-world-like problems. In this paper we experiment with routing in communication networks and show that the dynamic memory GA performs remarkable well compared to ant colony optimization algorithms that are specially designed for this problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have