{"id":"https://openalex.org/W2897791123","doi":"https://doi.org/10.1109/cec.2018.8477853","title":"The Thief Orienteering Problem: Formulation and Heuristic Approaches","display_name":"The Thief Orienteering Problem: Formulation and Heuristic Approaches","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2897791123","doi":"https://doi.org/10.1109/cec.2018.8477853","mag":"2897791123"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2018.8477853","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086393146","display_name":"Andr\u00e9 Gustavo dos Santos","orcid":"https://orcid.org/0000-0002-5743-3523"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andre G. Santos","raw_affiliation_strings":["Departamento de Inform\u00e1tica Universidade, Federal de Vi\u00e7osa Vi\u00e7osa, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica Universidade, Federal de Vi\u00e7osa Vi\u00e7osa, MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030567361","display_name":"Jonatas B. C. Chagas","orcid":"https://orcid.org/0000-0001-7965-8419"},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jonatas B.C. Chagas","raw_affiliation_strings":["Departamento de Computa\u00e7\u00e3o, Universidade Federal de Ouro Preto Ouro Preto, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computa\u00e7\u00e3o, Universidade Federal de Ouro Preto Ouro Preto, MG, Brazil","institution_ids":["https://openalex.org/I10824318"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4939,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89232737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9910488128662109},{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.891150712966919},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6664501428604126},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.6282991766929626},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6191890835762024},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5867624282836914},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5237831473350525},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5067806839942932},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5041264295578003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47428399324417114},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4722580015659332},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4554029703140259},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44556957483291626},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42356234788894653},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4146849513053894},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33838987350463867}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9910488128662109},{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.891150712966919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6664501428604126},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.6282991766929626},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6191890835762024},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5867624282836914},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5237831473350525},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5067806839942932},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5041264295578003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47428399324417114},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4722580015659332},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4554029703140259},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44556957483291626},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42356234788894653},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4146849513053894},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33838987350463867},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2018.8477853","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2018.8477853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1493919779","https://openalex.org/W1502125971","https://openalex.org/W1963856664","https://openalex.org/W1963938442","https://openalex.org/W1965587495","https://openalex.org/W1981190164","https://openalex.org/W1999883971","https://openalex.org/W2022637272","https://openalex.org/W2054291117","https://openalex.org/W2072175042","https://openalex.org/W2113873983","https://openalex.org/W2153386665","https://openalex.org/W2157321006","https://openalex.org/W2163428398","https://openalex.org/W2166843422","https://openalex.org/W2168079536","https://openalex.org/W2194264221","https://openalex.org/W2488761445","https://openalex.org/W2514338168","https://openalex.org/W2740106388","https://openalex.org/W2963752350","https://openalex.org/W3204855000","https://openalex.org/W4302438478","https://openalex.org/W6645709637","https://openalex.org/W6726283942","https://openalex.org/W6726497591"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W2889442766","https://openalex.org/W1483913682","https://openalex.org/W1538797328","https://openalex.org/W2048876360","https://openalex.org/W2020081923","https://openalex.org/W2993365626","https://openalex.org/W2412614002","https://openalex.org/W1969981152","https://openalex.org/W2087209118"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"the":[3,30,62,72,79,83,91,96,107,113],"Thief":[4],"Orienteering":[5,17],"Problem":[6,18,22],"(ThOP),":[7],"a":[8,27,33,38,46,116,148],"multi-component":[9],"problem":[10,92],"that":[11,143],"combines":[12],"two":[13,124],"classic":[14],"combinatorial":[15],"problems:":[16],"(OP)":[19],"and":[20,36,55,65,85,99,122,133],"Knapsack":[21],"(KP).":[23],"In":[24],"this":[25],"problem,":[26],"person":[28],"(called":[29],"thief)":[31],"carries":[32],"capacitated":[34],"knapsack":[35,63,73,108],"has":[37,52],"time":[39],"limit":[40],"to":[41,71,94,101,105],"collect":[42,86,102],"items":[43,100],"distributed":[44],"in":[45,103],"set":[47],"of":[48,90,151],"cities.":[49],"The":[50,88],"thief":[51,80],"fixed":[53],"start":[54],"end":[56],"points,":[57],"begins":[58],"his":[59],"journey":[60],"with":[61,67],"empty,":[64],"travels":[66],"speed":[68],"inversely":[69],"proportional":[70],"weight.":[74],"While":[75],"there":[76],"is":[77,93],"time,":[78],"may":[81],"visit":[82],"cities":[84],"items.":[87],"aim":[89],"determine":[95],"thief's":[97],"route":[98],"order":[104],"maximize":[106],"profit.":[109],"We":[110],"formally":[111],"describe":[112],"ThOP":[114],"by":[115],"mixed":[117],"integer":[118],"non-linear":[119],"programming":[120],"formulation":[121],"present":[123],"heuristic":[125],"approaches":[126],"based":[127],"on":[128],"Iterated":[129],"Local":[130],"Search":[131],"(ILS)":[132],"Biased":[134],"Random-Key":[135],"Genetic":[136],"Algorithm":[137],"(BRKGA)":[138],"metaheuristics.":[139],"Our":[140],"results":[141],"showed":[142],"BRKGA":[144],"outperformed":[145],"ILS":[146],"for":[147],"large":[149],"majority":[150],"instances.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}