References
- Anghinolfi, D. and Paolucci, M.; "A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times," European Journal of Operations Research, 193 : 73-85. 2009. https://doi.org/10.1016/j.ejor.2007.10.044
- Chandrasekaran, S., Ponnambalam, S. G., Suresh, R. K., and Vijayakumar, N.; "An Application of particle swarm optimization algorithm to permutation flow shop scheduling problems to minimize makespan, total flowtime and completion time variance," 2006 IEEE International Conference on Automation Science and Engineering, 513-518, 2006.
- Cunkas, M and Ozsaglam, M. A.; "A Comparative Study on Particle Swarm Optimization and Genetic Algorithms for Traveling Salesman Problems," Cybernetics and Systems : An International Journal 40 : 490-507, 2009. https://doi.org/10.1080/01969720903068435
- Davis, L.; "Applying Adaptive Algorithms to Epistatic Domains," Proceedings of the International Joint Conference on Artificial Intelligence, 162-164, 1985.
- Goldberg, D. E. and Lingle, R.; "Alleles, Loci, and the TSP," Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 154-159, 1985.
- Hu, X., Eberhart, R. C., and Shi, Y.; "Swarm Intelligence for Permutation Optimization : A Case Study of n-Queens Problem," 2003 IEEE Swarm Intelligence Symposium, 243-246, 2003.
- Johnson, D. S. and McGeoch, L. A.; "The Traveling Salesman Problem : A Case Study in Local Optimization," Local Search in Combinatorial Optimization, Aarts, EHL and Lenstra, JK(Ed.) John Whiley and Sons, London, 215-310, 1997.
- Kennedy, J. and Eberhart, R. C.; "Particle Swarm Optimization," Proceeding of the 1995 IEEE International Conference on Neural Networks, 1942-1948, 1995.
- Liao, Ching-Jong, Tseng, Chao-Tang, and Luarn, Pin; "A discrete version of particle swarm optimization for flowshop scheduling problems," Computers and OR 34 : 3099-3111, 2007. https://doi.org/10.1016/j.cor.2005.11.017
- Marinakis, Y. and Marinaki, M.; "A Hybrid geneticParticle Swarm Optimization Algorithms for the Vehicle Routing Problem," Expert Systems with Applications, 37 : 1446-1455, 2010. https://doi.org/10.1016/j.eswa.2009.06.085
- Oliver, I. M., Smith, D. J., and Holland, J. R. C.; "A Study of Permutation Crossover Operators on the traveling Salesman Problem," Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 224-230, 1987.
- Pang W., Wang K., Zhou C., Dong L.; "Fuzzy discrete particle swarm optimization for traveling salesman problem," Proceedings of the fourth international conference on computing and information technology(CIT'04), 796-800, 2004.
- Potvin, J. Y.; "Genetic Algorithms for the Traveling Salesman Problem," Annals of Operations Research, 63 : 339-370, 1996.
- Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., and Wang, Q. X.; "Particle Swarm Optimization-based algorithms for TSP and generalized TSP ," Information Processing Letters, 103 : 169-176, 2007. https://doi.org/10.1016/j.ipl.2007.03.010
- Tasgetiren, F., Sevkli, M., Lian, Y. C., and Gencyilmaz, G.; "Particle Swarm Optimization algorithm for single machine weighted tardiness problem," Proceedings IEEE congress on evolutionary computation, 1412-1419, 2004.
- Zhong, Wei-Liang, Zhang, Jung, and Chen, Wei-Neng; "A novel discrete particle swarm optimization to solve traveling salesman problem," Proceedings IEEE Congress on Evolutionary Computation, 3283-3287, 2007.
- TSPLIB: http://comopt.ifi.uni-heidelberg.de/sofiware/TSPLIB95/.