{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:24:00Z","timestamp":1761989040263},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319554525"},{"type":"electronic","value":"9783319554532"}],"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-55453-2_2","type":"book-chapter","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T05:12:42Z","timestamp":1488949962000},"page":"18-29","source":"Crossref","is-referenced-by-count":8,"title":["A Genetic Algorithm for Multi-component Optimization Problems: The Case of the Travelling Thief Problem"],"prefix":"10.1007","author":[{"given":"Daniel K. S.","family":"Vieira","sequence":"first","affiliation":[]},{"given":"Gustavo L.","family":"Soares","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o A.","family":"Vasconcelos","sequence":"additional","affiliation":[]},{"given":"Marcus H. S.","family":"Mendes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Przyby\u014fek, M.R., Wierzbicki, A.: Socially inspired algorithms for the travelling thief problem. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, pp. 421\u2013428. ACM (2014)","DOI":"10.1145\/2576768.2598367"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bonyadi, M., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 1037\u20131044, June 2013","DOI":"10.1109\/CEC.2013.6557681"},{"key":"2_CR4","first-page":"162","volume":"85","author":"L Davis","year":"1985","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. IJCAI 85, 162\u2013164 (1985)","journal-title":"IJCAI"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, pp. 385\u2013392. ACM (2015)","DOI":"10.1145\/2739480.2754716"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-30698-8_3","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"N Louren\u00e7o","year":"2016","unstructured":"Louren\u00e7o, N., Pereira, F.B., Costa, E.: An evolutionary approach to the full optimization of the traveling thief problem. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 34\u201345. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30698-8_3"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-319-13563-2_53","volume-title":"Simulated Evolution and Learning","author":"Y Mei","year":"2014","unstructured":"Mei, Y., Li, X., Yao, X.: Improving efficiency of heuristics for the large scale traveling thief problem. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 631\u2013643. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-13563-2_53"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 477\u2013484. ACM, New York (2014). http:\/\/doi.acm.org\/10.1145\/2576768.2598249","DOI":"10.1145\/2576768.2598249"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-44427-7_25","volume-title":"Swarm Intelligence","author":"M Wagner","year":"2016","unstructured":"Wagner, M.: Stealing items more efficiently with ants: a swarm intelligence approach to the travelling thief problem. In: Dorigo, M., Birattari, M., Li, X., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ohkura, K., Pinciroli, C., St\u00fctzle, T. (eds.) ANTS 2016. LNCS, vol. 9882, pp. 273\u2013281. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-44427-7_25"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/BFb0056924","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"J Watson","year":"1998","unstructured":"Watson, J., Ross, C., Eisele, V., Denton, J., Bins, J., Guerra, C., Whitley, D., Howe, A.: The traveling salesrep problem, edge assembly crossover, and 2-opt. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 823\u2013832. Springer, Heidelberg (1998). doi: 10.1007\/BFb0056924"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55453-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T08:10:28Z","timestamp":1498378228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55453-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319554525","9783319554532"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55453-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}