SDGP: A developmental approach for traveling salesman problems

Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, CIPLS 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013

Volumn , Issue , 2013, Pages 78-85

  Ouyang, Jin ^a   Weise, Thomas ^a   Devert, Alexandre ^a   Chiang, Raymond ^b,c  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DEVELOPMENTAL GENETIC PROGRAMMING; GENOTYPE-PHENOTYPE MAPPING; NUMERICAL SIMULATION EXPERIMENT; PROBLEM SIZE; STATE-OF-THE-ART APPROACH; SYMMETRIC TRAVELING SALESMAN PROBLEMS; TREE-BASED;

ARTIFICIAL INTELLIGENCE; GENETIC PROGRAMMING; ITERATIVE METHODS;

TRAVELING SALESMAN PROBLEM;

EID: 84885005068     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIPLS.2013.6595203     Document Type: Conference Paper

References (28)

1. B. F. Voigt, Der Handlungsreisende. Voigt: Ilmenau, Germany, 1832.
2. D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study, ser. Princeton Series in Applied Mathematics. Princeton University Press: Princeton, NJ, USA, February 2007.
3. F. Greco, Ed., Traveling Salesman Problem. IN-TECH Education and Publishing: Vienna, Austria, 2008.
4. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy-Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley Interscience: Chichester, West Sussex, UK, 1985.
5. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press: Cambridge, MA, USA, 1992.
6. R. Poli, W. B. Langdon, and N. F. McPhee, A Field Guide to Genetic Programming. Lulu Enterprises UK Ltd: London, UK, 2008.
7. T. Weise, Global Optimization Algorithms-Theory and Application. it-weise.de (self-published): Germany, 2009. (Online). Available: http://www.it-weise.de/projects/book.pdf
8. W. J. Cook, D. G. Espinoza, and M. Goycoolea, "Computing with Domino-Parity Inequalities for the TSP," Georgia Institute of Technology, Industrial and Systems Engineering: Atlanta, GA, USA, Tech. Rep., 2005. (Online). Available: http://www.dii.uchile.cl/?daespino/PApers/DP paper.pdf
9. W. J. Cook, "Results of Concorde for TSPLib Benchmark," 2003. (Online). Available: http://www.tsp.gatech.edu/concorde/ benchmarks/bench99.html
10. G. Reinelt, "TSPLIB," 1995. (Online). Available: http: //comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
11. V. Chvatal, "The Traveling Salesman Problem," October 2008. (Online). Available: http://users.encs.concordia.ca/?chvatal/tsp/ tsp.html
12. R. Chiong, Ed., Nature-Inspired Algorithms for Optimisation, ser. Studies in Computational Intelligence. Springer-Verlag: Berlin/Heidelberg, April 30, 2009, vol. 193/2009.
13. K. Jung and B. Moon, "Toward Minimal Restriction of Genetic Encoding and Crossovers for the Two-Dimensional Euclidean TSP," vol. 6, no. 6, pp. 557-565, 2002.
14. T. Sẗutzle and H. H. Hoos, "MAX-MIN Ant System and Local Search for the Traveling Salesman Problem," in IEEE International Conference on Evolutionary Computation (CEC'97). IEEE, 1997, pp. 309-314.
15. C. M. White and G. G. Yen, "A Hybrid Evolutionary Algorithm for Traveling Salesman Problem," in Proceedings of the IEEE Congress on Evolutionary Computation (CEC'04), vol. 2. IEEE, 2004, pp. 1473-1478.
16. P. Chang, W. Huang, and Z. Zhang, "A Puzzle-Based Genetic Algorithm with Block Mining and Recombination Heuristic for the Traveling Salesman Problem," Journal of Computer Science and Technology (JCST), vol. 27, no. 5, pp. 937-949, 2012.
17. X. Yao, "An Empirical Study of Genetic Operators in Genetic Algorithms," Microprocessing and Microprogramming, vol. 38, no. 1-5, pp. 707-714, September 1993. Onlin. Available: http://www.cs.bham.ac.uk/?xin/papers/ euro93 final.pdf
18. A. Devert, T. Weise, and K. Tang, "A Study on Scalable Representations for Evolutionary Optimization of Ground Structures," Evolutionary Computation, vol. 20, no. 3, pp. 453-472, 2012.
19. P. J. Bentley and S. P. Kumar, "The Ways to Grow Designs: A Comparison of Embryogenies for an Evolutionary Design Problem," in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99). Morgan Kaufmann, 1999, pp. 35-43.
20. C. Ryan, J. J. Collins, and M. O'Neill, "Grammatical Evolution: Evolving Programs for an Arbitrary Language," in Proceedings of the First European Workshop on Genetic Programming (EuroGP'98). Springer, 1998, pp. 83-95.
21. X. Yao and Y. Shi, "A Preliminary Study on Designing Artificial Neural Networks Using Co-Evolution," in IEEE Singapore International Conference on Intelligent Control and Instrumentation (SICICI'95). IEEE, 1995, pp. 149-154.
22. X. Yao, "Evolving Artificial Neural Networks," Proceedings of the IEEE, vol. 87, no. 9, pp. 1423-1447, 1999.
23. A. Devert, "Building Processes Optimization: Toward an Artificial Ontogeny based Approach," Ph.D. dissertation, Universite Paris-Sud, Ecole Doctorale d'Informatique, 2009.
24. G. Tao and Z. Michalewicz, "Inver-over Operator for the TSP," in Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V). Springer, 1998, pp. 803-812.
25. D. S. Johnson and L. A. McGeoch, "Experimental Analysis of Heuristics for the STSP," in The Traveling Salesman Problem and its Variations. Kluwer, 2002, pp. 369-443.
26. N. Christofides, "Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem," Carnegy Mellon University, Management Sciences Research Report 388 / CS-93-13, 1976.
27. R. C. Prim, "Shortest Connection Networks and Some Generalizations," Bell System Technical Journal, vol. 36, no. 6, pp. 1389-1401, 1957.
28. V. Jarnk, "O Jistem Problemu Minimalnm: (Z Dopisu Panu O. Bor °uskovi)," Prace Moravske Prrodovedecke Spolecnosti, vol. 6, pp. 57-63, 1930.