References
- S. Lin and B.W. Kernighan, "An Effective Heuristic Algorithm for the Traveling Salesman Problem," Bell Telephone Laboratories, Incorporated, Murray Hill, N.J. 1971.
- M.R. Garey and D.S. Johson, "A Guide to the Theory of NP-Completeness", Computers and Intractability, Freeman, 1979.
- B. Freisleben and P. Merz, "Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC96, IEEE Press, pp.616-621, 1996. https://doi.org/10.1109/ICEC.1996.542671
- Zhong Yiwen, Yang Xiangang, Ning zhengyuan. "A Discrete Particle Swarm Optimization Algorithm for Solving Traveling alesman Problem," System Engineering and Theory Practice, pp.88-94, 2006.
- L.M Gambardella and M. Dorigo, "Ant Colony System: A cooperative Learning Approach to the Traveling Salesman Problem," IEEE Transactions on Evolutionary Computation, Vol.1, No.1, 1997. https://doi.org/10.1109/4235.585892
- Christian Blum and Andrea Roli, "Metaheuristics in combinatorial optimization: overview and Conceptual comparison," ACM Computing Surveys, Vol.35, pp.268-308, 2003. https://doi.org/10.1145/937503.937505
- L. Bianchi, M. Dorigo, L.M. Gambarella, and W.J. Gutjahr, "A survey on metaheuristics for Stochastic combinatorial optimization," Natural Computing, 2008.
- Sarayut Nonsiri an Siriporn Supratid, "Modifying Ant Colony Optimization," IEEE conference on soft computing in industrial applications, 2008. https://doi.org/10.1109/SMCIA.2008.5045942
- X. Hu, R.C. Eberhart, and Y. Shi, "Swarm Intelligence for permutation Optimization: a case study of n-queens problem," in proceedings of the IEEE Swarm Intelligence Symposium, Indianapolis, USA, April, pp.243-246, 2003. https://doi.org/10.1109/SIS.2003.1202275
- 고성범, "Mine 알고리즘: 인간의 행동을 모방한 메타휴리스틱", 정보처리논문지, 제16-B권 제5호, pp.411-426, 2009. https://doi.org/10.3745/KIPSTB.2009.16B.5.411
- Solis, F.J. and Wets R.J. "Minimization by random search techniques," Mathematics of operations research, Vol.6, No.1, pp.19-30, 1981. https://doi.org/10.1287/moor.6.1.19
- Moscato, P. "Memetic algorithms: A short introduction," In corne, D., et al, eds: New Ideas in Optimization. McGraw Hill, pp.219-234, 1999.
- Puchinger, J., Raidl, G.R., "Modules and Algorithms for Three-stage two-dimensional bin Packing," European Journal of Operational Research, Feature Issue on Cutting and Packing, 2006.
- TSPLIB - A Traveling Salesman Problem Library.http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
- D.E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," Addison-Wesley, 1989.
- Z. Michalewicz, "Genetic Algorithms + Data structure = Evolution Program," Springer-Verlag, 1992.
- Dorigo M., Maniezzo V., Colorni A., "The Ant System: Optimization by a Colony of Cooperating Agents," IEEE trans. Syst. Man Cybern B 26, pp.29-41, 1996. https://doi.org/10.1109/3477.484436
- Dorigo M., Gambardella L.M., " Ant Colony System: A Cooperative Learning Approach," IEEE Trans. Evol. Comp.1, pp.53-66, 1997. https://doi.org/10.1109/4235.585892
- Raed Abu Zitar, Huessein Hiyassat, "Optimizating the parameters of Ant colony Algorithm Using the Genetics," Enformatika Transaction on Engineering, Computing and Technology VI, December, pp.228-231, 2004.
- J. Kennedy and R. Eberhart, "Particle Swarm Optimization," IEEE conference of Neural Network, Vol.IV, pp.1942-1948, 1995.
- J. Kennedy, "The Particle Swarm: Social adaptation of knowledge," IEEE conference of Evolutionary Computing, pp.303-308, 1997. https://doi.org/10.1109/ICEC.1997.592326
- X.H. Shi, Y.C. Liang, H.P. Lee, C. Lu, and L.M. Wang, "An improved GA and novel PSO-GA-based hybrid algorithm," Information Processing Letters, 1993.
- 고성범, "인터넷기반 의사결정 공간의 설계" GS 인터비젼, 2010.
- J. De Vicente, J. Lanchares, R. Hermida, "Placement by Thermodynamic Simulated Annealing," Physics Letters A, Vol.317, Issue 5-6, pp.415-423, 2003. https://doi.org/10.1016/j.physleta.2003.08.070