{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:24:13Z","timestamp":1761989053075,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319541563"},{"type":"electronic","value":"9783319541570"}],"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-54157-0_4","type":"book-chapter","created":{"date-parts":[[2017,2,18]],"date-time":"2017-02-18T08:11:54Z","timestamp":1487405514000},"page":"46-60","source":"Crossref","is-referenced-by-count":22,"title":["Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Julian","family":"Blank","sequence":"first","affiliation":[]},{"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[]},{"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,19]]},"reference":[{"key":"4_CR1","unstructured":"Ishibushi, H., Klamroth, K., Mostaghim, S., Naujoks, B., Poles, S., Purshouse, R., Rudolph, G., Ruzika, S., Sayin, S., Wiecek, M.M., Yao, X.: Multiobjective Optimization for Interwoven Systems. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"4_CR2","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2007)"},{"key":"4_CR3","unstructured":"Lagoudakis, M.G.: The 0\u20131 Knapsack Problem - An Introductory Survey (1996)"},{"key":"4_CR4","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: IEEE Congress on Evolutionary Computation, pp. 1037\u20131044. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"key":"4_CR5","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 Annual Conference on Genetic and Evolutionary Computation, ser. GECCO 2014, pp. 477\u2013484. ACM, New York (2014). http:\/\/doi.acm.org\/10.1145\/2576768.2598249","DOI":"10.1145\/2576768.2598249"},{"key":"4_CR6","unstructured":"Reinelt, G.: TSPLIB - A t.s.p. library. Universit\u00e4t Augsburg, Institut f\u00fcr Mathematik, Augsburg. Technical report 250 (1990)"},{"key":"4_CR7","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, ser. GECCO 2015, pp. 385\u2013392. ACM, New York (2015). http:\/\/doi.acm.org\/10.1145\/2739480.2754716","DOI":"10.1145\/2739480.2754716"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Przybylek, M.R., Wierzbicki, A.: Socially inspired algorithms for the travelling thief problem. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, ser. GECCO 2014, pp. 421\u2013428. ACM, New York (2014). http:\/\/doi.acm.org\/10.1145\/2576768.2598367","DOI":"10.1145\/2576768.2598367"},{"key":"4_CR9","unstructured":"Birkedal, R.: Design, implementation, comparison of randomized search heuristics for the traveling thief problem, Master\u2019s thesis. Technical University of Denmark, Department of Applied Mathematics, Computer Science, Richard Petersens Plads, Building 324, DK-2800 Kgs. Lyngby, Denmark, compute@compute.dtu.dk (2015). http:\/\/www.compute.dtu.dk\/English.aspx"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Mei, Y., Li, X., Salim, F., Yao, X.: Heuristic evolution with genetic programming for traveling thief problem. In: IEEE Congress on Evolutionary Computation, CEC 2015, Sendai, Japan, 25\u201328 May 2015, pp. 2753\u20132760 (2015). http:\/\/dx.doi.org\/10.1109\/CEC.2015.7257230","DOI":"10.1109\/CEC.2015.7257230"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the travelling thief problem. Soft Comput., 1\u201316 (2014). http:\/\/dx.doi.org\/10.1007\/s00500-014-1487-2","DOI":"10.1007\/s00500-014-1487-2"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Mei, Y., Li, X., Yao, X.: Improving efficiency of heuristics for the large scale traveling thief problem. In: Proceedings of the Simulated Evolution, Learning - 10th International Conference, SEAL 2014, Dunedin, New Zealand, 15\u201318 December 2014, pp. 631\u2013643 (2014). http:\/\/dx.doi.org\/10.1007\/978-3-319-13563-2_53","DOI":"10.1007\/978-3-319-13563-2_53"},{"key":"4_CR13","unstructured":"Wachter, C.: Solving the travelling thief problem with an evolutionary algorithm. Diplomarbeit, Technischen Universitt Wien (2015)"},{"issue":"1","key":"4_CR14","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). http:\/\/dx.doi.org\/10.1287\/ijoc.15.1.82.15157","journal-title":"INFORMS J. Comput."},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2000","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Fonseca, V.G., Fonseca, C.M.: The attainment-function approach to stochastic multiobjective optimizer assessment and comparison. In: Experimental Methods for the Analysis of Optimization Algorithms, pp. 103\u2013130. Springer, Heidelberg (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-02538-9_5","DOI":"10.1007\/978-3-642-02538-9_5"},{"issue":"3","key":"4_CR17","doi-asserted-by":"crossref","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":"4_CR18","unstructured":"Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and their Application, pp. 224\u2013230. L.E. Associates Inc., Mahwah (1987)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54157-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T17:42:25Z","timestamp":1601660545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54157-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319541563","9783319541570"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54157-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}