{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:22:27Z","timestamp":1761988947350,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319306971"},{"type":"electronic","value":"9783319306988"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30698-8_3","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T13:32:10Z","timestamp":1458307930000},"page":"34-45","source":"Crossref","is-referenced-by-count":11,"title":["An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem"],"prefix":"10.1007","author":[{"given":"Nuno","family":"Louren\u00e7o","sequence":"first","affiliation":[]},{"given":"Francisco B.","family":"Pereira","sequence":"additional","affiliation":[]},{"given":"Ernesto","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","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":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., 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. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Roman Przybyoek, M., 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":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)"},{"key":"3_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":"3_CR6","unstructured":"Goldberg, D.E., Lingle, R.: Alleles, loci, and the traveling salesman problem. In: Proceedings of the first International Conference on Genetic Algorithms and their Applications pp. 154\u2013159 (1985)"},{"key":"3_CR7","first-page":"215","volume":"1","author":"DS Johnson","year":"1997","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. Local Search Comb. Optim. 1, 215\u2013310 (1997)","journal-title":"Local Search Comb. Optim."},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manage. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manage. Sci."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Browne, W.N., Whigham, P., Zhang, M., Bui, L.T., Ishibuchi, H., Jin, Y., Li, X., Shi, Y., Singh, P., Tan, K.C., Tang, K. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 631\u2013643. Springer, Heidelberg (2014)"},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"key":"3_CR11","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, pp. 477\u2013484. ACM (2014)","DOI":"10.1145\/2576768.2598249"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: Tspliba traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-012-9177-2","volume":"14","author":"DR White","year":"2013","unstructured":"White, D.R., McDermott, J., Castelli, M., Manzoni, L., Goldman, B.W., Kronberger, G., Ja\u015bkowski, W., OReilly, U.M., Luke, S.: Better gp benchmarks: community survey results and proposals. Genet. Program. Evolvable Mach. 14(1), 3\u201329 (2013)","journal-title":"Genet. Program. Evolvable Mach."}],"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-30698-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T04:36:08Z","timestamp":1498278968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30698-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319306971","9783319306988"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30698-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}