{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:06:18Z","timestamp":1729670778885,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/icnc.2012.6234747","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T19:43:57Z","timestamp":1342727037000},"page":"1242-1246","source":"Crossref","is-referenced-by-count":2,"title":["The continuous selective generalized traveling salesman problem: An efficient ant colony system"],"prefix":"10.1109","author":[{"given":"Mou","family":"Lian-Ming","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"245","article-title":"Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem","author":"pintea","year":"2006","journal-title":"Proc of International Conference Bio-Inspired Computing-Theory and Applications (BIC-TA) Wuhan China"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.advwatres.2006.08.004"},{"key":"18","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/j.pnsc.2008.03.028","article-title":"An ant colony optimization method for generalized TSP problem","volume":"18","author":"yang","year":"2008","journal-title":"Progress in Natural Science"},{"key":"15","first-page":"87","author":"matei","year":"2010","journal-title":"An Efficient Genetic Algorithm for Solving the Generalized Traveling Salesman Problem"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9111-6"},{"key":"14","first-page":"62","article-title":"A New Approach for Solving the Generalized Traveling Salesman Problem","volume":"6373","author":"pop","year":"2010","journal-title":"LNCS"},{"key":"11","first-page":"36","article-title":"Effective neighborhood structures for the generalized traveling salesman problem","volume":"4972","author":"hu","year":"2008","journal-title":"LNCS"},{"key":"12","article-title":"A Memetic Algorithm with a Large Neighborhood Crossover Operator for the Generalized Traveling Salesman Problem","author":"bontoux","year":"2009","journal-title":"Computers & Operations Research"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"3","first-page":"185","article-title":"Mathematical model of scheduling clients through welfare agencies","volume":"8","author":"saskena","year":"1970","journal-title":"Journal of the Canadian Operational Research Society"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00099-X"},{"key":"2","first-page":"43","article-title":"The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem","volume":"b2","author":"henry-labordere","year":"1969","journal-title":"RAIRO Operations Research"},{"key":"1","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"srivastava","year":"1969","journal-title":"CORS J"},{"key":"10","first-page":"36","article-title":"Effective Neighborhood Structures for the Generalized Traveling Salesman Problem","volume":"4972","author":"bin","year":"2008","journal-title":"LNCS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.057"},{"key":"6","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-540-73556-4_18","article-title":"Exact algorithms for generalized combinatorial optimization problems","volume":"4616","author":"pop","year":"2007","journal-title":"Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.378"},{"key":"4","first-page":"61","article-title":"Generalized Traveling Salesman through n sets of nodes: An integer programming approach","volume":"21","author":"laporte","year":"1983","journal-title":"INFOR"},{"key":"9","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(97)00142-2","article-title":"An efficient composite heuristic for the Symmetric Generalized Traveling Salesman Problem","volume":"108","author":"renaud","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/CCIS.2011.6045099"}],"event":{"name":"2012 8th International Conference on Natural Computation (ICNC)","start":{"date-parts":[[2012,5,29]]},"location":"Chongqing, Sichuan, China","end":{"date-parts":[[2012,5,31]]}},"container-title":["2012 8th International Conference on Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6227653\/6234502\/06234747.pdf?arnumber=6234747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:37:56Z","timestamp":1497980276000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6234747\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icnc.2012.6234747","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}