{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:53Z","timestamp":1761611333925},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T00:00:00Z","timestamp":1377907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s13042-013-0195-z","type":"journal-article","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T01:10:49Z","timestamp":1377825049000},"page":"375-383","source":"Crossref","is-referenced-by-count":58,"title":["An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks"],"prefix":"10.1007","volume":"6","author":[{"given":"Wei-Lun","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deze","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rung-Ching","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,31]]},"reference":[{"issue":"3","key":"195_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"EM Arkin","year":"1994","unstructured":"Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discrete Appl Math 55(3):197\u2013218","journal-title":"Discrete Appl Math"},{"key":"195_CR2","doi-asserted-by":"crossref","unstructured":"Chiu KM, Liu JS (2011) Robot routing using clustering-based parallel genetic algorithm with migration. In: IEEE workshop on merging fields of computational intelligence and sensor technology (CompSens) (2011), pp 42\u201349","DOI":"10.1109\/MFCIST.2011.5949511"},{"key":"195_CR3","doi-asserted-by":"crossref","unstructured":"Comarela G, Gon\u00e7alves K, Pappa GL, Almeida J, Almeida V (2011) Robot routing in sparse wireless sensor networks with continuous ant colony optimization. In: Proceedings of the 13th annual conference companion on genetic and evolutionary computation (GECCO \u201911). ACM, New York, pp 599\u2013606","DOI":"10.1145\/2001858.2002055"},{"issue":"1","key":"195_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","volume":"57","author":"M Berg De","year":"2005","unstructured":"De Berg M, Gudmundsson J, Katz MJ, Levcopoulos C, Overmars MH, van der Stappen AF (2005) Tsp with neighborhoods of varying size. J Algorithms 57(1):22\u201336","journal-title":"J Algorithms"},{"issue":"1","key":"195_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella L (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"195_CR6","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. Bradford Company, Scituate","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"195_CR7","doi-asserted-by":"crossref","unstructured":"Elbassioni K, Fishkin AV, Mustafa NH, Sitters R (2005) Approximation algorithms for euclidean group tsp. In: Proceedings of the 32nd international colloquim on automata, languages and programming (ICALP). Springer, Lisbon, Portugal,\u00a0pp 1115\u20131126","DOI":"10.1007\/11523468_90"},{"issue":"3","key":"195_CR8","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.cor.2011.06.007","volume":"39","author":"WF Gao","year":"2012","unstructured":"Gao WF, Liu SY (2012) A modified artificial bee colony algorithm. Comput Oper Res 39(3):687\u2013697","journal-title":"Comput Oper Res"},{"issue":"2","key":"195_CR9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1080\/10556788.2011.648932","volume":"28","author":"I Gentilini","year":"2013","unstructured":"Gentilini I, Margot F, Shimada K (2013) The travelling salesman problem with neighbourhoods: Minlp solution. Optim Methods Softw 28(2):364\u2013378","journal-title":"Optim Methods Softw"},{"issue":"1","key":"195_CR10","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (abc) algorithm. Appl Soft Comput 8(1):687\u2013697","journal-title":"Appl Soft Comput"},{"key":"195_CR11","doi-asserted-by":"crossref","unstructured":"Karaboga D, Okdem S, Ozturk C (2010) Cluster based wireless sensor network routings using artificial bee colony algorithm. In: Proceedings of the 2010 international conference on autonomous and intelligent systems (AIS \u201910). pp 1\u20135","DOI":"10.1109\/AIS.2010.5547042"},{"key":"195_CR12","doi-asserted-by":"crossref","unstructured":"Li L, Cheng Y, Tan L, Niu B (2011) A discrete artificial bee colony algorithm for tsp problem. In: Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications (ICIC\u201911). Springer-Verlag, Berlin, pp 566\u2013573.doi: 10.1007\/978-3-642-24553-4_75","DOI":"10.1007\/978-3-642-24553-4_75"},{"issue":"2","key":"195_CR13","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"issue":"6","key":"195_CR14","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J Little","year":"1963","unstructured":"Little J, Murty K, Sweeney D, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11(6):972\u2013989","journal-title":"Oper Res"},{"key":"195_CR15","unstructured":"Papadimitriou C (1997) The euclidean traveling salesman problem is np-complete, vol 4. Elsevier, pp 237\u2013244. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397577900123"},{"issue":"4","key":"195_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00037-005-0200-3","volume":"14","author":"S Safra","year":"2006","unstructured":"Safra S, Schwartz O (2006) On the complexity of approximating tsp with neighborhoods and related problems. Comput Complex 14(4):281\u2013307","journal-title":"Comput Complex"},{"issue":"1","key":"195_CR17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MWC.2009.4804365","volume":"16","author":"O Tekdas","year":"2009","unstructured":"Tekdas O, Isler V, Lim JH, Terzis A (2009) Using mobile robots to harvest data from sensor fields. Wirel Commun 16(1):22\u201328","journal-title":"Wirel Commun"},{"issue":"12","key":"195_CR18","doi-asserted-by":"crossref","first-page":"2292","DOI":"10.1016\/j.comnet.2008.04.002","volume":"52","author":"J Yick","year":"2008","unstructured":"Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw 52(12):2292\u20132330","journal-title":"Comput Netw"},{"issue":"9","key":"195_CR19","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1109\/TKDE.2007.1062","volume":"19","author":"B Yuan","year":"2007","unstructured":"Yuan B, Orlowska M, Sadiq S (2007) On the optimal robot routing problem in wireless sensor networks. IEEE Trans Knowl Data Eng 19(9):1252\u20131261","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-013-0195-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-013-0195-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-013-0195-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T16:54:46Z","timestamp":1563814486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-013-0195-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,31]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s13042-013-0195-z","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,31]]}}}