{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T01:10:12Z","timestamp":1743383412097,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642309755"},{"type":"electronic","value":"9783642309762"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30976-2_21","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T16:58:11Z","timestamp":1339520291000},"page":"173-181","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Simple Candidate Set Method for Symmetric TSP and Its Application in MAX-MIN Ant System"],"prefix":"10.1007","author":[{"given":"Miao","family":"Deng","sequence":"first","affiliation":[]},{"given":"Jihong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yongsheng","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Guangming","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","first-page":"1","volume":"26","author":"D. Marco","year":"1996","unstructured":"Marco, D., Vittorio, M., Alberto, C.: Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics\u2013Part B\u00a026(1), 1\u201313 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics\u2013Part B"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Akira, H., Syuhei, M., Takumi, I., Tetsuyuki, T.: Ant Colony Optimization Using Exploratory Ants for Constructing Partial Solutions. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20137 (2010)","DOI":"10.1109\/CEC.2010.5586009"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Ayan, A., Deepyaman, M., Aritra, B., Janarthanan, R., Amit, K.: Extension of Max-Min Ant System with Exponential Pheromone Deposition Rule. In: 16th IEEE International Conference on Advanced Computing and Communication, pp. 1\u20138 (2008)","DOI":"10.1109\/ADCOM.2008.4760419"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Zhaojun, Z., Zuren, F.: A Novel Max-Min Ant System Algorithm for Traveling. In: IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS, pp. 508\u2013511 (2009)","DOI":"10.1109\/ICICISYS.2009.5357792"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"S. Thomas","year":"2000","unstructured":"Thomas, S., Holger, H.H.: MAX\u2013MIN Ant System. Future Generation Computer Systems\u00a016, 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"21_CR6","unstructured":"TSPLIB, http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"H. Keld","year":"2009","unstructured":"Keld, H.: General k-opt submoves for the Lin\u2013Kernighan TSP Heuristic. Mathematical Programming Computation\u00a01, 119\u2013163 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45724-0_22","volume-title":"Ant Algorithms","author":"M. Randall","year":"2002","unstructured":"Randall, M., Montgomery, J.: Candidate Set Strategies for Ant Colony Optimisation. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol.\u00a02463, pp. 243\u2013249. Springer, Heidelberg (2002)"},{"key":"21_CR9","first-page":"488","volume":"27","author":"Z.A. Othman","year":"2009","unstructured":"Othman, Z.A., Rais, H.M., Hamdan, A.R.: Strategies DACS3 Increasing its Performances. European Journal of Scientific Research\u00a027, 488\u2013499 (2009)","journal-title":"European Journal of Scientific Research"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Rais, H.M., Othman, Z.A., Hamdan, A.R.: Reducing Iteration Using Candidate List. In: International Symposium on Information Technology (ITSim 2008), vol.\u00a03, pp. 1\u20138. IEEEXplore (2008)","DOI":"10.1109\/ITSIM.2008.4632052"},{"issue":"3","key":"21_CR11","first-page":"89","volume":"12","author":"W. Chaoxue","year":"2006","unstructured":"Chaoxue, W., Duwu, C., Yikun, Z., Zhurong, W.: A Novel Ant Colony System Based on Delauney Triangulation and Self-adaptive Mutation for TSP. International Journal of Information Technology\u00a012(3), 89\u201399 (2006)","journal-title":"International Journal of Information Technology"},{"key":"21_CR12","unstructured":"ASOTSP software package, http:\/\/iridia.ulb.ac.be\/dorigo\/ACO\/aco-code\/public-software.html"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30976-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:28:25Z","timestamp":1743380905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30976-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642309755","9783642309762"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30976-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}