{"id":"https://openalex.org/W2488761445","doi":"https://doi.org/10.1145/2908812.2908847","title":"Population-based vs. Single-solution Heuristics for the Travelling Thief Problem","display_name":"Population-based vs. Single-solution Heuristics for the Travelling Thief Problem","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2488761445","doi":"https://doi.org/10.1145/2908812.2908847","mag":"2488761445"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908847","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","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/A5027127671","display_name":"Mohamed El Yafrani","orcid":"https://orcid.org/0000-0003-4322-826X"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Mohamed El Yafrani","raw_affiliation_strings":["Mohammed V University in Rabat, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mohammed V University in Rabat, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081271044","display_name":"Bela\u00efd Ahiod","orcid":"https://orcid.org/0009-0005-4499-4259"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Bela\u00efd Ahiod","raw_affiliation_strings":["Mohammed V University in Rabat, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mohammed V University in Rabat, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":3.8789,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.95493336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"317","last_page":"324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9969000220298767,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8276071548461914},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7793233394622803},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7217060327529907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7094178199768066},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.68459153175354},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6372087001800537},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6075099110603333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5741562247276306},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5533596277236938},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4534105062484741},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.4524978995323181},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.43513041734695435},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.4172821640968323},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3858685791492462},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28567391633987427},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24399727582931519}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8276071548461914},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7793233394622803},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7217060327529907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7094178199768066},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.68459153175354},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6372087001800537},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6075099110603333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5741562247276306},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5533596277236938},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4534105062484741},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.4524978995323181},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.43513041734695435},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.4172821640968323},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3858685791492462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28567391633987427},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24399727582931519},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2908812.2908847","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2908812.2908847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1504762824","https://openalex.org/W1508419498","https://openalex.org/W1513229450","https://openalex.org/W1516301787","https://openalex.org/W1568268653","https://openalex.org/W1603508565","https://openalex.org/W1796917439","https://openalex.org/W1965587495","https://openalex.org/W1973312791","https://openalex.org/W1974082921","https://openalex.org/W1999856734","https://openalex.org/W2024060531","https://openalex.org/W2029374654","https://openalex.org/W2050841472","https://openalex.org/W2052165970","https://openalex.org/W2072175042","https://openalex.org/W2102281241","https://openalex.org/W2119862569","https://openalex.org/W2140425706","https://openalex.org/W2157321006","https://openalex.org/W2163528881","https://openalex.org/W2293987903","https://openalex.org/W2912127016","https://openalex.org/W2959792658","https://openalex.org/W2976664243","https://openalex.org/W4236788560","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3119729126","https://openalex.org/W2249602273","https://openalex.org/W3185953120","https://openalex.org/W2163647484","https://openalex.org/W2107915862","https://openalex.org/W1990478250","https://openalex.org/W144563559","https://openalex.org/W2129420617","https://openalex.org/W3217012897","https://openalex.org/W1988808191"],"abstract_inverted_index":{"The":[0,22,63,96],"Travelling":[1,26],"Thief":[2],"Problem":[3,28,32],"(TTP)":[4],"is":[5,65,72],"an":[6],"optimization":[7,20],"problem":[8,23],"introduced":[9],"in":[10],"order":[11],"to":[12,93],"provide":[13],"a":[14,55,66,73],"more":[15],"realistic":[16],"model":[17],"for":[18,50,106],"real-world":[19],"problems.":[21],"combines":[24],"the":[25,30,35,52,70],"Salesman":[27],"and":[29,33,46,69,80,91],"Knapsack":[31],"introduces":[34],"notion":[36],"of":[37],"interdependence":[38],"between":[39],"sub-problems.":[40],"In":[41],"this":[42],"paper,":[43],"we":[44],"study":[45],"compare":[47],"different":[48],"approaches":[49],"solving":[51],"TTP":[53,108],"from":[54],"metaheuristics":[56],"perspective.":[57],"Two":[58,83],"heuristic":[59,75],"algorithms":[60,86,102],"are":[61,87,103],"proposed.":[62],"first":[64],"Memetic":[67],"Algorithm,":[68],"second":[71],"single-solution":[74],"empowered":[76],"by":[77],"Hill":[78],"Climbing":[79],"Simulated":[81],"Annealing.":[82],"other":[84],"state-of-the-art":[85],"briefly":[88],"revisited,":[89],"analyzed,":[90],"compared":[92],"our":[94,101],"algorithms.":[95],"obtained":[97],"results":[98],"prove":[99],"that":[100],"very":[104],"efficient":[105],"many":[107],"instances.":[109]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":9}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}