{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:02Z","timestamp":1742912762650,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623948"},{"type":"electronic","value":"9783319623955"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62395-5_45","type":"book-chapter","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:52:59Z","timestamp":1499302379000},"page":"652-668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Hybrid Evolutionary Approach for Solving the Traveling Thief Problem"],"prefix":"10.1007","author":[{"given":"Mahdi","family":"Moeini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Schermer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Wendt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,7]]},"reference":[{"issue":"4","key":"45_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1162\/evco.1996.4.4.361","volume":"4","author":"T Blickle","year":"1996","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evol. Comput. 4(4), 361\u2013394 (1996)","journal-title":"Evol. Comput."},{"key":"45_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: IEEE Congress on Evolutionary Computation (CEC), pp. 1037\u20131044 (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Przybyoek, M.R., Wierzbicki, A.: Socially inspired algorithms for the travelling thief problem. In: GECCO 2014, pp. 421\u2013428 (2014)","DOI":"10.1145\/2576768.2598367"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Chand, S., Wagner, M.: Fast heuristics for the multiple traveling thieves problem In: GECCO 2016, pp. 293\u2013300 (2016)","DOI":"10.1145\/2908812.2908841"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"El Yafrani, M., Ahiod, B.: Population-based vs. single-solution heuristics for the travelling thief problem. In: GECCO 2016, pp. 317\u2013324 (2016)","DOI":"10.1145\/2908812.2908847"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: GECCO 2015, pp. 385\u2013392 (2015)","DOI":"10.1145\/2739480.2754716"},{"volume-title":"Encyclopedia of Optimization","year":"2009","key":"45_CR7","unstructured":"Floudas, C.A., Pardalos, P.M. (eds.): Encyclopedia of Optimization. Springer, New York (2009)"},{"key":"45_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics. Springer, New York (2010)"},{"key":"45_CR9","doi-asserted-by":"publisher","unstructured":"Goeke, D., Moeini, M., Poganiuch, D.: A variable neighborhood search heuristic for the maximum ratio clique problem. Comput. Oper. Res. 1\u20139 (2017, forthcoming). doi:10.1016\/j.cor.2017.01.010","DOI":"10.1016\/j.cor.2017.01.010"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, B.C., Prakash, V.P.: Greedy heuristics for the travelling thief problem. In: 39th National Systems Conference (NSC), pp. 1\u20135 (2015)","DOI":"10.1109\/NATSYS.2015.7489116"},{"key":"45_CR11","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-17509-6_7","volume-title":"Operations Research and Enterprise Systems","author":"S Gueye","year":"2015","unstructured":"Gueye, S., Michel, S., Moeini, M.: Adjacency variables formulation for the minimum linear arrangement problem. In: Pinson, E., Valente, F., Vitoriano, B. (eds.) ICORES 2014. CCIS, vol. 509, pp. 95\u2013107. Springer, Cham (2015). doi:10.1007\/978-3-319-17509-6_7"},{"key":"45_CR12","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, Cham (2014). doi:10.1007\/978-3-319-13563-2_53"},{"key":"45_CR13","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), pp. 2753\u20132760 (2015)","DOI":"10.1109\/CEC.2015.7257230"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-014-1487-2","volume":"20","author":"Y Mei","year":"2016","unstructured":"Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the travelling thief problem. Soft. Comput. 20(1), 157\u2013172 (2016)","journal-title":"Soft. Comput."},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, N., Pereira, F.B., Costa, E.: An evolutionary approach to the full optimization of the traveling thief problem. In: EvoCOP, pp. 34\u201345 (2016)","DOI":"10.1007\/978-3-319-30698-8_3"},{"key":"45_CR16","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: GECCO 2014, pp. 477\u2013484 (2014)","DOI":"10.1145\/2576768.2598249"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Neumann, F.: Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems. In: CPAIOR, pp. 332\u2013346 (2015)","DOI":"10.1007\/978-3-319-18008-3_23"},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.ejor.2016.09.035","volume":"258","author":"S Polyakovskiy","year":"2017","unstructured":"Polyakovskiy, S., Neumann, F.: The packing while traveling problem. Eur. J. Oper. Res. 258, 424\u2013439 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"45_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"4","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 4(3), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"45_CR20","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, Cham (2016). doi:10.1007\/978-3-319-44427-7_25"},{"key":"45_CR21","unstructured":"Wagner, M., Lindauer, M., Misir, M., Nallaperuma, S., Hutter, F.: A case study of algorithm selection for the traveling thief problem. arXiv:1609.00462v1, pp. 1\u201323 (2016)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62395-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:29:34Z","timestamp":1710332974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62395-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623948","9783319623955"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62395-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}