{"id":"https://openalex.org/W1973312791","doi":"https://doi.org/10.1007/s00500-014-1487-2","title":"On investigation of interdependence between sub-problems of the Travelling Thief Problem","display_name":"On investigation of interdependence between sub-problems of the Travelling Thief Problem","publication_year":2014,"publication_date":"2014-10-16","ids":{"openalex":"https://openalex.org/W1973312791","doi":"https://doi.org/10.1007/s00500-014-1487-2","mag":"1973312791"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-014-1487-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-014-1487-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-014-1487-2.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00500-014-1487-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073282655","display_name":"Yi Mei","orcid":"https://orcid.org/0000-0003-0682-1363"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Yi Mei","raw_affiliation_strings":["School of Computer Science and Information Technology, RMIT University, Melbourne, VIC, 3000, Australia","School of Computer Science and Information Technology, RMIT University, Melbourne, Australia 3000#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Melbourne, VIC, 3000, Australia","institution_ids":["https://openalex.org/I82951845"]},{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Melbourne, Australia 3000#TAB#","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100369719","display_name":"Xiaodong Li","orcid":"https://orcid.org/0000-0003-0346-1526"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiaodong Li","raw_affiliation_strings":["School of Computer Science and Information Technology, RMIT University, Melbourne, VIC, 3000, Australia","School of Computer Science and Information Technology, RMIT University, Melbourne, Australia 3000#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Melbourne, VIC, 3000, Australia","institution_ids":["https://openalex.org/I82951845"]},{"raw_affiliation_string":"School of Computer Science and Information Technology, RMIT University, Melbourne, Australia 3000#TAB#","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK","School of Computer Science, University of Birmingham, Birmingham, UK, B15 2TT#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK, B15 2TT#TAB#","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073282655"],"corresponding_institution_ids":["https://openalex.org/I82951845"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2743,"currency":"EUR","value_usd":2958},"fwci":11.8555,"has_fulltext":true,"cited_by_count":65,"citation_normalized_percentile":{"value":0.98490608,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"20","issue":"1","first_page":"157","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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.9987999796867371,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9929999709129333,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.871965765953064},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8663042783737183},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7019902467727661},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.6695724725723267},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5986144542694092},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5696560144424438},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5326862931251526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4936119318008423},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.449980765581131},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.44303417205810547},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.439166396856308},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4377746880054474},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.30681440234184265}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.871965765953064},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8663042783737183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7019902467727661},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6695724725723267},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5986144542694092},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5696560144424438},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5326862931251526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4936119318008423},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.449980765581131},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.44303417205810547},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.439166396856308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4377746880054474},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.30681440234184265},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00500-014-1487-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-014-1487-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-014-1487-2.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},{"id":"pmh:oai:alma.61RMIT_INST:11247848450001341","is_oa":false,"landing_page_url":"http://doi.org/10.1007/s00500-014-1487-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/27486279","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8e851b6a-d36b-42e8-bdb4-1fda4e0e86c2","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/8e851b6a-d36b-42e8-bdb4-1fda4e0e86c2","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mei, Y, Li, X & Yao, X 2016, 'On investigation of interdependence between sub-problems of the Travelling Thief Problem', Soft Computing, vol. 20, no. 1, pp. 157-172. https://doi.org/10.1007/s00500-014-1487-2","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/8e851b6a-d36b-42e8-bdb4-1fda4e0e86c2","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/on-investigation-of-interdependence-between-subproblems-of-the-travelling-thief-problem(8e851b6a-d36b-42e8-bdb4-1fda4e0e86c2).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00500-014-1487-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00500-014-1487-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00500-014-1487-2.pdf","source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2841756755","display_name":"Evolutionary Approximation Algorithms for Optimisation: Algorithm Design and Complexity Analysis","funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5881288010","display_name":null,"funder_award_id":"Discovery Grant","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5904918521","display_name":null,"funder_award_id":"EP/I010297/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1973312791.pdf","grobid_xml":"https://content.openalex.org/works/W1973312791.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W99032621","https://openalex.org/W102487131","https://openalex.org/W177097005","https://openalex.org/W1555689267","https://openalex.org/W1591506270","https://openalex.org/W1603508565","https://openalex.org/W1805994660","https://openalex.org/W1814328155","https://openalex.org/W1963686580","https://openalex.org/W1964589465","https://openalex.org/W1965587495","https://openalex.org/W1974403532","https://openalex.org/W1990902176","https://openalex.org/W1991770896","https://openalex.org/W2004239209","https://openalex.org/W2013497292","https://openalex.org/W2032932574","https://openalex.org/W2038768372","https://openalex.org/W2042986967","https://openalex.org/W2045492613","https://openalex.org/W2048490243","https://openalex.org/W2055569927","https://openalex.org/W2056826275","https://openalex.org/W2069442678","https://openalex.org/W2079178535","https://openalex.org/W2106378689","https://openalex.org/W2116725038","https://openalex.org/W2116872250","https://openalex.org/W2117522162","https://openalex.org/W2120921169","https://openalex.org/W2128856718","https://openalex.org/W2137143026","https://openalex.org/W2145418868","https://openalex.org/W2154929945","https://openalex.org/W2155262811","https://openalex.org/W2161676453","https://openalex.org/W2478359813","https://openalex.org/W2906795987","https://openalex.org/W4236483317","https://openalex.org/W4252684946","https://openalex.org/W4256333068"],"related_works":["https://openalex.org/W1483913682","https://openalex.org/W4249611560","https://openalex.org/W2354313438","https://openalex.org/W2005493932","https://openalex.org/W2138107807","https://openalex.org/W2087209118","https://openalex.org/W2376421450","https://openalex.org/W2889442766","https://openalex.org/W2993365626","https://openalex.org/W2257135682"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"the":[4,38,41,51,58,62,66,90,96,101,111,134,147,151],"interdependence":[5,152],"between":[6,103,153],"sub-problems":[7,55,97,154],"in":[8,61,105,155],"a":[9,16,26,119],"complex":[10],"overall":[11,157],"problem":[12,18,52,158],"is":[13,25,47,70,89,110],"investigated":[14,79],"using":[15],"benchmark":[17],"called":[19],"Travelling":[20,29],"Thief":[21],"Problem":[22,31,35],"(TTP),":[23],"which":[24],"combination":[27],"of":[28,139,149],"Salesman":[30],"(TSP)":[32],"and":[33,99,136],"Knapsack":[34],"(KP).":[36],"First,":[37],"analysis":[39],"on":[40],"mathematical":[42],"formulation":[43],"shows":[44],"that":[45,94,115,125],"it":[46],"impossible":[48],"to":[49,57],"decompose":[50],"into":[53],"independent":[54],"due":[56],"non-linear":[59],"relationship":[60],"objective":[63],"function.":[64],"Therefore,":[65],"algorithm":[67],"for":[68,86],"TTP":[69,117],"not":[71],"straightforward":[72],"although":[73],"each":[74,106],"sub-problem":[75],"alone":[76],"has":[77],"been":[78],"intensively.":[80],"Then,":[81],"two":[82],"meta-heuristics":[83],"are":[84],"proposed":[85],"TTP.":[87,160],"One":[88],"Cooperative":[91],"Co-evolution":[92],"(CC)":[93],"solves":[95,116],"separately":[98],"transfers":[100],"information":[102],"them":[104],"generation.":[107],"The":[108,121],"other":[109],"Memetic":[112],"Algorithm":[113],"(MA)":[114],"as":[118],"whole.":[120],"comparative":[122],"results":[123,131],"showed":[124],"MA":[126],"consistently":[127],"obtained":[128],"much":[129],"better":[130],"than":[132],"both":[133],"standard":[135],"dynamic":[137],"versions":[138],"CC":[140],"within":[141],"comparable":[142],"computational":[143],"budget.":[144],"This":[145],"indicates":[146],"importance":[148],"considering":[150],"an":[156],"like":[159]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}