Computational Intelligence - August 2014 - 52

Acknowledgment

The authors at UBRI would like to acknowledge support from
the National Natural Science Foundation of China under
Grants 61175065, 61329302, and 61150110488, the Technological Fund of Anhui Province for Outstanding Youth under
Grant 1108085J16, the Special Financial Grant 201104329
from the China Postdoctoral Science Foundation, the Chinese
Academy of Sciences (CAS) Fellowship for Young International Scientists 2011Y1GB01, and the European Union 7th
Framework Program under Grant 247619. The second author
would like to acknowledge support from the University of
Newcastle Faculty of Science and Information Technology's
Strategic Initiatives Research Fund (Grant Code 10.31415).
The experiments reported in this paper were executed on the
supercomputing system in the Supercomputing Center of University of Science and Technology of China.
References

[1] C. Blum, R. Chiong, M. Clerc, K. A. De Jong, Z. Michalewicz, F. Neri, and T. Weise,
"Evolutionary optimization," in Variants of Evolutionary Algorithms for Real-World Applications, R. Chiong, T. Weise, and Z. Michalewicz, Eds. Berlin, Germany: Springer-Verlag,
2011, ch. 1, pp. 1-29.
[2] D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study. Princeton, NJ: Princeton Univ. Press, 2007.
[3] E. L. G. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: Wiley Interscience,
1985.
[4] G. Z. Gutin and A. P. Punnen, Eds., The Traveling Salesman Problem and its Variations (Combinatorial Optimization, vol. 12). Norwell, MA: Kluwer Academic Publishers,
2002.
[5] W. J. Cook. (2013). World TSP. [Online]. Available: http://www.math.uwaterloo.
ca/tsp/world/
[6] N. Hansen, A. Auger, S. Finck, and R. Ros, "Real-parameter blackbox optimization
benchmarking: Experimental setup," INRIA Futurs, Équipe TAO, Univ. Paris Sud, Orsay, France, Tech. Rep. RR-6828, Mar. 24, 2012.
[7] D. A. D. Tompkins and H. H. Hoos, "UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAXSAT," in Proc. Revised Selected Papers 7th Int. Conf. Theory Applications Satisfiability Testing, Vancouver, Canada, May
5-13, 2004, vol. 3542, pp. 306-320.
[8] H. H. Hoos and T. Stützle, Stochastic Local Search: Foundations and Applications. San
Francisco, CA: Morgan Kaufmann, 2005.
[9] D. S. Johnson and L. A. McGeoch. (2008). 8th DIMACS implementation challenge:
The traveling salesman problem. [Online]. Available: http://dimacs.rutgers.edu/Challenges/TSP/
[10] K. Tang, Z. Yang, and T. Weise, "Special session on evolutionary computation for
large scale global optimization at 2012 IEEE world congress on computational intelligence (CEC@WCCI-2012)," Nature Inspired Comput. Applicat. Lab., Univ. Sci. Technol. China, Hefei, China, Tech. Rep., June 14, 2012.
[11] T. Bartz-Beielstein, "SPOT: An R package for automatic and interactive tuning of
optimization algorithms by sequential parameter optimization," Cologne Univ. Appl.
Sci., Gummersbach, Germany, Tech. Rep. CIOP TR 05-10, 2010.
[12] T. Chen, K. Tang, G. Chen, and X. Yao, "Analysis of computational time of simple
estimation of distribution algorithms," IEEE Trans. Evol. Comput., vol. 14, no. 1, pp.
1-22, 2010.
[13] J. Lässig and D. Sudholt, "Experimental supplements to the theoretical analysis of
migration in the island model," in Parallel Problem Solving from Nature XI (Lecture Notes
in Computer Science, vol. 6238). Kraków, Poland: Springer, Sept. 11-15, 2010, pp.
224-233.
[14] J. Lässig and K. H. Hoffmann, "Threshold-selecting strategy for best possible ground
state detection with genetic algorithms," Phys. Rev. E, vol. 79, no. 4, p. 046702, 2009.
[15] G. Reinelt, "TSPLIB-A traveling salesman problem library," ORSA J. Comput., vol.
3, no. 4, pp. 376-384, 1991.
[16] D. S. Johnson and L. A. McGeoch, "Experimental analysis of heuristics for the STSP,"
in The Traveling Salesman Problem and its Variations [4]. Dordrecht, The Netherlands: Kluwer Academic Publishers, 2002, ch. 9, pp. 369-443.
[17] D. S. Johnson, G. Z. Gutin, L. A. McGeoch, A. Yeo, W. Zhang, and A. Zverovitch,
"Experimental analysis of heuristics for the ATSP," in The Traveling Salesman Problem and
its Variations [4]. Dordrecht, The Netherlands: Kluwer Academic Publishers, 2002, ch.
10, pp. 445-487.

52

IEEE ComputatIonal IntEllIgEnCE magazInE | august 2014

[18] W. J. Cook. (2011). Traveling salesman problem. [Online]. Available: http://www.
tsp.gatech.edu/
[19] M. S. Boddy and T. L. Dean, "Solving time-dependent planning problems," Dept.
Comput. Sci., Brown Univ., Rhode Island, Providence, Tech. Rep. CS-89-03, Feb.
1989.
[20] D. S. Johnson and L. A. McGeoch, "The traveling salesman problem: A case study in
local optimization," in Local Search in Combinatorial Optimization. Princeton, NJ: Princeton
Univ. Press, 1995, pp. 215-310.
[21] O. J. Dunn, "Multiple comparisons among means," J. Amer. Stat. Assoc., vol. 56, no.
293, pp. 52-64, 1961.
[22] J. Demšar, "Statistical comparisons of classifiers over multiple data sets," J. Mach.
Learn. Res., vol. 7, pp. 1-30, Jan. 2006.
[23] S. García and F. Herrera, "An extension on 'Statistical comparisons of classifiers
over multiple data sets' for all pairwise comparisons," J. Mach. Learn. Res., vol. 9, pp.
2677-2694, Dec. 2008.
[24] H. H. Hoos and T. Stützle, "Evaluating Las Vegas algorithms-Pitfalls and remedies," in Proc. 14th Conf. Uncertainty Artificial Intelligence, July 24-26, 1998, pp. 238-245.
[25] T. Fawcett, "An introduction to ROC analysis," Pattern Recognit. Lett., vol. 27, no.
8, pp. 861-874, 2006.
[26] A. P. Bradley, "The use of the area under the ROC curve in the evaluation of machine learning algorithms," Pattern Recognit., vol. 30, no. 7, pp. 1145-1159, 1997.
[27] P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, "Genetic
algorithms for the travelling salesman problem: A review of representations and operators," J. Artif. Intell. Res., vol. 13, no. 2, pp. 129-170, 1999.
[28] K. Beck, JUnit Pocket Guide. Sebastopol, CA: O'Reilly, 2009.
[29] J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with
Applications to Biology, Control, and Artificial Intelligence. Ann Arbor, MI: Univ. Michigan
Press, 1975.
[30] D. B. Fogel, "An evolutionary approach to the traveling salesman problem," Biol.
Cybern., vol. 60, no. 2, pp. 139-144, 1988.
[31] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. London,
U. K.: Springer-Verlag, 1996.
[32] T. Weise, M. Wan, K. Tang, P. Wang, A. Devert, and X. Yao, "Frequency fitness assignment," IEEE Trans. Evol. Comput., vol. 18, no. 2, pp. 226-243, Apr. 2014.
[33] K. A. de Jong, Evolutionary Computation: A Unified Approach. Cambridge, MA: MIT
Press, 2006, vol. 4.
[34] T. Bäck, D. B. Fogel, and Z. Michalewicz, Eds., Handbook of Evolutionary Computation.
London, U.K.: Oxford Univ. Press, 1997.
[35] T. Weise. (2009). Global optimization algorithms-Theory and application. [Online]. Available: http://www.it-weise.de/projects/book.pdf
[36] M. Dorigo, M. Birattari, and T. Stützle, "Ant colony optimization-Artificial ants
as a computational intelligence technique," IEEE Comput. Intell. Mag., vol. 1, no. 4, pp.
28-39, 2006.
[37] P. Larrañaga and J. A. Lozano, Eds., Estimation of Distribution Algorithms-A New Tool
for Evolutionary Computation (Genetic Algorithms and Evolutionary Computation). Berlin
Heidelberg, Germany: Springer-Verlag, 2001, vol. 2.
[38] L. D. Whitley, T. Starkweather, and D. Fuquay, "Scheduling problems and traveling
salesman: The genetic edge recombination operator," in Proc. 3rd Int. Conf. Genetic Algorithms, Fairfax, VA, June 4-7, 1989, pp. 133-140.
[39] M. Guntsch and M. Middendorf, "Applying population based ACO to dynamic optimization problems," in Ant Colonies to Artificial Ants-Proc. 3rd Int. Workshop Ant Colony
Optimization, Brussels, Belgium, Sept. 12-14, 2002, vol. 2463, pp. 111-122.
[40] S. Tsutsui, "Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram," in Proc. 7th Int. Conf. Parallel Problem Solving
Nature (PPSN VII), Granada, Spain, Sept. 7-11, 2002, vol. 2439, pp. 224-233.
[41] S. Tsutsui, "Parallelization of an evolutionary algorithm on a platform with multicore processors," in Proc. Artificial Evolution: Revised Selected Papers 9th Int. Conf. Evolution
Artificielle, Strasbourg, France, Oct. 26-28, 2009, vol. 5975, pp. 61-73.
[42] K. Helsgaun, "General k-opt submoves for the Lin-Kernighan TSP heuristic," Math.
Program. Comput., vol. 1, nos. 2-3, pp. 119-163, 2009.
[43] P. Hansen, N. Mladenovi´c, and J. A. M. Pérez, "Variable neighbourhood search:
Methods and applications," Ann. Oper. Res., vol. 175, no. 1, pp. 367-407, 2010.
[44] L. D. Whitley and W. Chen, "Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT," in Proc. Genetic Evolutionary Computation Conf.
ACM, Philadelphia, PA, July 7-11, 2012, pp. 1357-1364.
[45] Y. Ong, M. H. Lim, and X. Chen, "Memetic computation-Past, present & future
[Research Frontier]," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 24-31, 2010.
[46] M. Hutter and S. Legg, "Fitness uniform optimization," IEEE Trans. Evol. Comput.,
vol. 10, no. 5, pp. 568-589, 2006.
[47] J. Ouyang, T. Weise, A. Devert, and R. Chiong, "SDGP: A developmental approach
for traveling salesman problems," in Proc. IEEE Symp. Computational Intelligence Production
Logistics Systems, IEEE Computer Society Press, Singapore, Apr. 15-19, 2013, pp. 78-85.
[48] S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the travelingsalesman problem," Oper. Res., vol. 21, no. 2, pp. 498-516, 1973.
http://www http://tsp.gatech.edu/ http://www.math.uwaterloo http://www.it-weise.de/projects/book.pdf http://dimacs.rutgers.edu/Chal
Table of Contents for the Digital Edition of Computational Intelligence - August 2014
