{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:54:37Z","timestamp":1773809677624,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s11590-021-01824-y","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T08:03:21Z","timestamp":1636358601000},"page":"2313-2331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficiently solving the thief orienteering problem with a max\u2013min ant colony optimization approach"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7965-8419","authenticated-orcid":false,"given":"Jonatas B. C.","family":"Chagas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3124-0061","authenticated-orcid":false,"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"1824_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"2003","unstructured":"Aarts, E., Aarts, E.H., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)"},{"key":"1824_CR2","doi-asserted-by":"publisher","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-race and iterated f-race: An overview. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss M. (eds) Experimental Methods for the Analysis of Optimization Algorithms, pp. 311\u2013336. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9_13","DOI":"10.1007\/978-3-642-02538-9_13"},{"key":"1824_CR3","doi-asserted-by":"publisher","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, Cancun, Mexico (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557681","DOI":"10.1109\/CEC.2013.6557681"},{"key":"1824_CR4","doi-asserted-by":"publisher","unstructured":"Bonyadi, M.R., Michalewicz, Z., Wagner, M., Neumann, F.: Evolutionary computation for multicomponent problems: opportunities and future directions. In: Datta, S., Davim, J. (eds) Optimization in Industry, pp. 13\u201330. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-01641-8_2","DOI":"10.1007\/978-3-030-01641-8_2"},{"issue":"6","key":"1824_CR5","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.orl.2020.08.011","volume":"48","author":"JB Chagas","year":"2020","unstructured":"Chagas, J.B., Wagner, M.: Ants can orienteer a thief in their robbery. Oper. Res. Lett. 48(6), 708\u2013714 (2020)","journal-title":"Oper. Res. Lett."},{"key":"1824_CR6","doi-asserted-by":"crossref","unstructured":"Chand, S., Wagner, M.: Fast heuristics for the multiple traveling thieves problem. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 293\u2013300. ACM (2016)","DOI":"10.1145\/2908812.2908841"},{"key":"1824_CR7","unstructured":"Chen, C., Cheng, S.F., Gunawan, A., Misra, A., Dasgupta, K., Chander, D.: Traccs: a framework for trajectory-aware coordinated urban crowd-sourcing. In: Bigham, J.P., Parkes, D.C. (eds.) Second AAAI Conference on Human Computation and Crowdsourcing (HCOMP). AAAI (2014). http:\/\/www.aaai.org\/Library\/HCOMP\/hcomp14contents.php"},{"key":"1824_CR8","unstructured":"Dorigo, M., Di\u00a0Caro, G.: Ant colony optimization: a new meta-heuristic. In: IEEE Congress on Evolutionary Computation (CEC), vol.\u00a02, pp. 1470\u20131477. IEEE (1999)"},{"key":"1824_CR9","doi-asserted-by":"crossref","unstructured":"Fa\u00eada, L.M., Santos, A.G.: A genetic algorithm for the thief orienteering problem. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185848"},{"key":"1824_CR10","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 385\u2013392. ACM (2015)","DOI":"10.1145\/2739480.2754716"},{"issue":"2","key":"1824_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Gonzalez, J.J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10(2), 133\u2013148 (1998)","journal-title":"INFORMS J. Comput."},{"key":"1824_CR12","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Le\u00a0Bodic, P., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., Witzig, J.: The SCIP Optimization Suite 7.0. ZIB-Report 20-10, Zuse Institute Berlin (2020). http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-78023"},{"key":"1824_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logist. 34, 307\u2013318 (1987)","journal-title":"Naval Res. Logist."},{"issue":"2","key":"1824_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1824_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., Martello, S.: Routing problems with loading constraints. Top 18(1), 4\u201327 (2010)","journal-title":"Top"},{"key":"1824_CR16","doi-asserted-by":"publisher","first-page":"106808","DOI":"10.1016\/j.cie.2020.106808","volume":"149","author":"H Kim","year":"2020","unstructured":"Kim, H., Kim, B.I., Jin Noh, D.: The multi-profit orienteering problem. Comput. Ind. Eng. 149, 106808 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"1824_CR17","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"1824_CR18","doi-asserted-by":"publisher","unstructured":"Maher, S., Miltenberger, M., Pedroso, J.P., Rehfeldt, D., Schwarz, R., Serrano, F.: PySCIPOpt: mathematical programming in python with the SCIP optimization suite. In: Mathematical Software\u2014ICMS 2016, pp. 301\u2013307. Springer International Publishing (2016). https:\/\/doi.org\/10.1007\/978-3-319-42432-3_37","DOI":"10.1007\/978-3-319-42432-3_37"},{"key":"1824_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-19759-9_5","volume-title":"Algorithmic Aspects of Cloud Computing","author":"F Neumann","year":"2019","unstructured":"Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L., Wu, J.: A fully polynomial time approximation scheme for packing while traveling. In: Disser, Y., Verykios, V.S. (eds.) Algorithmic Aspects of Cloud Computing, pp. 59\u201372. Springer, Berlin (2019)"},{"issue":"2","key":"1824_CR20","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/trsc.2019.0923","volume":"54","author":"C Orlis","year":"2020","unstructured":"Orlis, C., Bianchessi, N., Roberti, R., Dullaert, W.: The team orienteering problem with overlaps: an application in cash logistics. Transp. Sci. 54(2), 470\u2013487 (2020)","journal-title":"Transp. Sci."},{"key":"1824_CR21","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: Genetic and Evolutionary Computation Conference (GECCO), pp. 477\u2013484. ACM (2014)","DOI":"10.1145\/2576768.2598249"},{"key":"1824_CR22","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Neumann, F.: Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems. In: International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems (CPAIOR), pp. 332\u2013346. Springer (2015)","DOI":"10.1007\/978-3-319-18008-3_23"},{"key":"1824_CR23","doi-asserted-by":"crossref","unstructured":"Santos, A.G., Chagas, J.B.: The thief orienteering problem: formulation and heuristic approaches. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1191\u20131199. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477853"},{"issue":"8","key":"1824_CR24","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max\u2013min ant system. Fut. Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Fut. Gener. Comput. Syst."},{"key":"1824_CR25","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"P Toth","year":"1990","unstructured":"Toth, P., Martello, S.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990)"},{"key":"1824_CR26","doi-asserted-by":"publisher","first-page":"100712","DOI":"10.1016\/j.swevo.2020.100712","volume":"57","author":"D Trachanatzi","year":"2020","unstructured":"Trachanatzi, D., Rigakis, M., Marinaki, M., Marinakis, Y.: A firefly algorithm for the environmental prize-collecting vehicle routing problem. Swarm Evol. Comput. 57, 100712 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"1824_CR27","doi-asserted-by":"crossref","unstructured":"Wagner, M.: Stealing items more efficiently with ants: a swarm intelligence approach to the travelling thief problem. In: International Conference on Swarm Intelligence (ANTS), pp. 273\u2013281. Springer (2016)","DOI":"10.1007\/978-3-319-44427-7_25"},{"issue":"3","key":"1824_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","volume":"24","author":"M Wagner","year":"2018","unstructured":"Wagner, M., Lindauer, M., M\u0131s\u0131r, M., Nallaperuma, S., Hutter, F.: A case study of algorithm selection for the traveling thief problem. J. Heuristics 24(3), 295\u2013320 (2018)","journal-title":"J. Heuristics"},{"key":"1824_CR29","doi-asserted-by":"crossref","unstructured":"Wu, J., Wagner, M., Polyakovskiy, S., Neumann, F.: Exact approaches for the travelling thief problem. In: Asia-Pacific Conference on Simulated Evolution and Learning, pp. 110\u2013121. Springer (2017)","DOI":"10.1007\/978-3-319-68759-9_10"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01824-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01824-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01824-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T12:55:10Z","timestamp":1665060910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01824-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1824"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01824-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"25 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}