{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T22:17:42Z","timestamp":1778883462006,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319687582","type":"print"},{"value":"9783319687599","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_8","type":"book-chapter","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T02:33:42Z","timestamp":1507862022000},"page":"87-96","source":"Crossref","is-referenced-by-count":2,"title":["ACO-iRBA: A Hybrid Approach to TSPN with Overlapping Neighborhoods"],"prefix":"10.1007","author":[{"given":"Yuanlong","family":"Qin","sequence":"first","affiliation":[]},{"given":"Bo","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"issue":"3","key":"8_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, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197\u2013218 (1994)","journal-title":"Discrete Appl. Math."},{"key":"8_CR2","unstructured":"Dumitrescu, A., Mitchell, J. S.: Approximation algorithms for TSP with neighborhoods in the plane. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 38\u201346. Society for Industrial and Applied Mathematics (2001)"},{"issue":"1","key":"8_CR3","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, M.J., Levcopoulos, C., Overmars, M.H., van der Stappen, A.F.: TSP with neighborhoods of varying size. J. Algorithms 57(1), 22\u201336 (2005)","journal-title":"J. Algorithms"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Jang, D.S., Chae, H.J., Choi, H.L.: Optimal control-based UAV path planning with dynamically-constrained TSP with neighborhoods. arXiv preprint arXiv:1612.06008 (2016)","DOI":"10.23919\/ICCAS.2017.8204468"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Isaacs, J.T., Klein, D.J., Hespanha, J.P.: Algorithms for the traveling salesman problem with neighborhoods involving a Dubins vehicle. In: American Control Conference, pp. 1704\u20131709 (2011)","DOI":"10.1109\/ACC.2011.5991501"},{"key":"8_CR6","first-page":"1","volume":"10","author":"W Wang","year":"2016","unstructured":"Wang, W., Shi, H.S., Wu, D.J., Huang, P.Y., Gao, B.J., Wu, F.P., Xu, D., Chen, X.J.: VD-PSO: an efficient mobile sink routing algorithm in wireless sensor networks. Peer-to-Peer Netw. Appl. 10, 1\u201310 (2016)","journal-title":"Peer-to-Peer Netw. Appl."},{"issue":"9","key":"8_CR7","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.: On the optimal robot routing problem in wireless sensor networks. IEEE Trans. Knowl. Data Eng. 19(9), 1252\u20131261 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"8_CR8","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.: The travelling salesman problem with neighbourhoods: MINLP solution. Optim. Methods Softw. 28(2), 364\u2013378 (2013)","journal-title":"Optim. Methods Softw."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Alatartsev, S., Augustine, M., Ortmeier, F.: Constricting insertion heuristic for traveling salesman problem with neighborhoods. In: ICAPS (2013)","DOI":"10.1609\/icaps.v23i1.13539"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Klette, R., B\u00fclow, T.: Critical edges in simple cube-curves. In: 9th International Conference on Discrete Geometry for Computer Imagery, pp. 467\u2013478 (2000)","DOI":"10.1007\/3-540-44438-6_38"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.: Touring a sequence of polygons. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 473\u2013482 (2003)","DOI":"10.1145\/780542.780612"},{"key":"8_CR12","unstructured":"Pan, X., Li, F., Klette, R.: Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons. Department of Computer Science, University of Auckland, pp. 175\u2013178 (2010)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Li, F., Klette, R.: Rubberband algorithms for solving various 2D or 3D shortest path problems. In: Computing: Theory and Applications, pp. 9\u201319. IEEE Press (2007)","DOI":"10.1109\/ICCTA.2007.113"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2014.06.019","volume":"556","author":"A Ahadi","year":"2014","unstructured":"Ahadi, A., Mozafari, A., Zarei, A.: Touring a sequence of disjoint polygons: complexity and extension. Theoret. Comput. Sci. 556, 45\u201354 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR15","unstructured":"Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D.: Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 160\u2013165 (1986)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73\u201381 (1997)","journal-title":"Biosystems"},{"key":"8_CR17","unstructured":"Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: 2003 International Conference on Machine Learning and Cybernetics, pp. 1583\u20131585 (2003)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Wong, L.P., Low, M.Y. H., Chong, C.S.: A bee colony optimization algorithm for traveling salesman problem. In: AICMS 2008 Second Asia International Conference on Modeling and Simulation, pp. 818\u2013823 (2008)","DOI":"10.1109\/AMS.2008.27"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Alatartsev, S., Mersheeva, V., Augustine, M., Ortmeier, F.: On optimizing a sequence of robotic tasks. In: 2013 IEEE\/RSJ International Conference Intelligent Robots and Systems (IROS), pp. 217\u2013223 (2013)","DOI":"10.1109\/IROS.2013.6696356"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T03:15:26Z","timestamp":1693106126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}