{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:01:39Z","timestamp":1729659699703,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/cipls.2013.6595203","type":"proceedings-article","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T15:56:20Z","timestamp":1379606180000},"page":"78-85","source":"Crossref","is-referenced-by-count":4,"title":["SDGP: A developmental approach for traveling salesman problems"],"prefix":"10.1109","author":[{"given":"Jin","family":"Ouyang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Devert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond","family":"Chiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"35","article-title":"The Ways to grow designs: A comparison of embryogenies for an evolutionary design problem","author":"bentley","year":"1999","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99)"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/0165-6074(93)90215-7"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00054"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1331070"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1275-3"},{"key":"13","first-page":"557","volume":"6","author":"jung","year":"2002","journal-title":"Toward Minimal Restriction of Genetic Encoding and Crossovers for the Two-Dimensional Euclidean TSP"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592327"},{"journal-title":"The Traveling Salesman Problem","year":"2008","author":"chvatal","key":"11"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00267-0","volume":"193","author":"chiong","year":"2009","journal-title":"Nature-inspired Algorithms for Optimisation"},{"key":"21","first-page":"149","article-title":"A Preliminary study on designing artificial neural networks using co-evolution","author":"yao","year":"1995","journal-title":"IEEE Singapore International Conference on Intelligent Control and Instrumentation (SICICI'95) IEEE"},{"key":"20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0055930","article-title":"Grammatical evolution: Evolving programs for an arbitrary language","author":"ryan","year":"1998","journal-title":"Proceedings of the First European Workshop on Genetic Programming (EuroGP'98)"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/5.784219"},{"journal-title":"Building processes optimization Toward an artificial ontogeny based approach","year":"2009","author":"devert","key":"23"},{"key":"24","first-page":"803","article-title":"Inver-over operator for the tsp","author":"tao","year":"1998","journal-title":"Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V)"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48213-4_9"},{"journal-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","year":"1976","author":"christofides","key":"26"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"28","first-page":"57","article-title":"Ojistem problemu minimaln-m: (Z Dopisu Panu O. Bor \ufffduskovi)","volume":"6","author":"jarnk","year":"1930","journal-title":"Prace Moravske Prirodovedecke Spolecnosti"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.5772\/66"},{"key":"2","article-title":"The Traveling salesman problem: A computational study, ser","author":"applegate","year":"2007","journal-title":"Princeton Series in Applied Mathematics"},{"journal-title":"TSPLIB","year":"1995","author":"reinelt","key":"10"},{"journal-title":"Der Handlungsreisende","year":"1832","author":"voigt","key":"1"},{"journal-title":"Global Optimization Algorithms - Theory and Application","year":"2009","author":"weise","key":"7"},{"journal-title":"A Field Guide to Genetic Programming","year":"2008","author":"poli","key":"6"},{"journal-title":"Genetic Programming On the Programming of Computers by Means of Natural Selection","year":"1992","author":"koza","key":"5"},{"journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization","year":"1985","author":"lawler","key":"4"},{"year":"0","key":"9"},{"key":"8","article-title":"Computing with domino-parity inequalities for the tsp","author":"cook","year":"2005","journal-title":"Georgia Institute of Technology Industrial and Systems Engineering Atlanta"}],"event":{"name":"2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","start":{"date-parts":[[2013,4,16]]},"location":"Singapore, Singapore","end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6588694\/6595191\/06595203.pdf?arnumber=6595203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T13:07:49Z","timestamp":1646572069000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6595203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/cipls.2013.6595203","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}