1. Adachi, N., & Yoshida, Y. (1995). Accelerating genetic algorithms: Protected chromosomes and parallel processing. In Proceedings of the first international conference on genetic algorithms in engineering systems: innovations and applications, (p. 414). Sheffield, UK.
2. Adaptive selection methods for genetic algorithms;Baker,1985
3. A hybrid heuristic for the traveling salesman problem;Baraglia;IEEE Transactions on Evolutionary Computation,2001
4. A new rank based version of the ant systems – A computational study;Bullnheimer;Central European Journal for Operations Research and Economics,1997
5. Chien, C.Y., & Chen, S.M. (2009). A new method for solving the traveling salesman problem based on parallelized genetic ant colony systems. In Proceedings of the 2009 international conference on machine learning and cybernetics (pp. 2828–2833). Baoding, Hebei, China.