{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T01:04:21Z","timestamp":1783040661362,"version":"3.54.6"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/nabic.2010.5716308","type":"proceedings-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T19:03:54Z","timestamp":1298055834000},"page":"7-12","source":"Crossref","is-referenced-by-count":14,"title":["ABC-GSX: A hybrid method for solving the Traveling Salesman Problem"],"prefix":"10.1109","author":[{"given":"A","family":"Banharnsakun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T","family":"Achalakul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B","family":"Sirinaovakul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/AMS.2008.27"},{"key":"ref11","author":"karaboga","year":"2005","journal-title":"An Idea Based on Honey Bee Swarm for Numerical Optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-009-9127-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-005-0019-6"},{"key":"ref14","first-page":"283","article-title":"A Fast TSP Solver using GA on JAVA","volume":"1","author":"sengoku","year":"1998","journal-title":"Proc 3rd Int Symp on Artificial Life and Robotics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.03.010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2007.08.006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.06.040"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1142\/6867"},{"key":"ref5","author":"gr\u00f6tschel","year":"1993","journal-title":"Ulysses 2000 In Search of Optimal Solutions to Hard Combinatorial Problems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SMCIA.2008.5045942"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2008.421"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2004.07.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2004.07.006"},{"key":"ref9","first-page":"3283","article-title":"A Novel Discrete Particle Swarm Optimization to Solve Traveling Salesman Problem","author":"zhong","year":"2007","journal-title":"Proc IEEE Int Conf Evol Comput (CEC)"}],"event":{"name":"2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC 2010)","location":"Fukuoka","start":{"date-parts":[[2010,12,15]]},"end":{"date-parts":[[2010,12,17]]}},"container-title":["2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5710537\/5716265\/05716308.pdf?arnumber=5716308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T07:10:21Z","timestamp":1490080221000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5716308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/nabic.2010.5716308","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}