{"id":"https://openalex.org/W2962699644","doi":"https://doi.org/10.1145/3205455.3205488","title":"Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem","display_name":"Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem","publication_year":2018,"publication_date":"2018-07-02","ids":{"openalex":"https://openalex.org/W2962699644","doi":"https://doi.org/10.1145/3205455.3205488","mag":"2962699644"},"language":"en","primary_location":{"id":"doi:10.1145/3205455.3205488","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205455.3205488","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Evolutionary_computation_plus_dynamic_programming_for_the_Bi-objective_travelling_thief_problem/20797057","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004675401","display_name":"Junhua Wu","orcid":"https://orcid.org/0000-0002-5888-1643"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Junhua Wu","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082401107","display_name":"Sergey Polyakovskiy","orcid":"https://orcid.org/0000-0001-9489-1972"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sergey Polyakovskiy","raw_affiliation_strings":["Deakin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Deakin University","institution_ids":["https://openalex.org/I149704539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056886268","display_name":"Markus Wagner","orcid":"https://orcid.org/0000-0002-3124-0061"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Markus Wagner","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.939,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.97711268,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"777","last_page":"784"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"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.991100013256073,"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.8626575469970703},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7910209894180298},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.720016360282898},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6926243305206299},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.6916277408599854},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6636227369308472},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6338439583778381},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6316522359848022},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5804804563522339},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5544070601463318},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.48854145407676697},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.46512576937675476},{"id":"https://openalex.org/keywords/evolutionary-programming","display_name":"Evolutionary programming","score":0.41692695021629333},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.38509121537208557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3028624653816223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26769110560417175}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8626575469970703},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7910209894180298},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.720016360282898},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6926243305206299},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.6916277408599854},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6636227369308472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6338439583778381},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6316522359848022},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5804804563522339},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5544070601463318},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.48854145407676697},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.46512576937675476},{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.41692695021629333},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.38509121537208557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3028624653816223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26769110560417175},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":4,"locations":[{"id":"doi:10.1145/3205455.3205488","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205455.3205488","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/133270","is_oa":false,"landing_page_url":"https://hdl.handle.net/2440/133270","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/3205455.3205488","raw_type":"Conference paper"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30112243","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:figshare.com:article/20797057","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Evolutionary_computation_plus_dynamic_programming_for_the_Bi-objective_travelling_thief_problem/20797057","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/20797057","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Evolutionary_computation_plus_dynamic_programming_for_the_Bi-objective_travelling_thief_problem/20797057","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1504762824","https://openalex.org/W1796917439","https://openalex.org/W1910133440","https://openalex.org/W1965587495","https://openalex.org/W1973312791","https://openalex.org/W2017708378","https://openalex.org/W2029374654","https://openalex.org/W2037976546","https://openalex.org/W2072175042","https://openalex.org/W2106378689","https://openalex.org/W2126105956","https://openalex.org/W2140425706","https://openalex.org/W2157321006","https://openalex.org/W2394065949","https://openalex.org/W2488761445","https://openalex.org/W2490616118","https://openalex.org/W2514338168","https://openalex.org/W2531392548","https://openalex.org/W2588290279","https://openalex.org/W2613485998","https://openalex.org/W2624850819","https://openalex.org/W2734470269","https://openalex.org/W2735235715","https://openalex.org/W2741264135","https://openalex.org/W2771632251","https://openalex.org/W2962995556","https://openalex.org/W2963752350","https://openalex.org/W4243958534","https://openalex.org/W4251742697","https://openalex.org/W4255263603","https://openalex.org/W6821788377"],"related_works":["https://openalex.org/W2362402143","https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W1984036937","https://openalex.org/W4376138746","https://openalex.org/W4312198704","https://openalex.org/W4220987199","https://openalex.org/W2361554335","https://openalex.org/W2141056356","https://openalex.org/W2040371063"],"abstract_inverted_index":{"This":[0,80],"research":[1],"proposes":[2],"a":[3,19,37,73,76,103],"novel":[4,106],"indicator-based":[5],"hybrid":[6],"evolutionary":[7,78],"approach":[8,58,130],"that":[9,42,128],"combines":[10],"approximate":[11],"and":[12,52,108],"exact":[13,61],"algorithms.":[14],"We":[15],"apply":[16],"it":[17],"to":[18,31,96,111,133],"new":[20],"bi-criteria":[21],"formulation":[22],"of":[23,84,105,114,119,124,142],"the":[24,32,48,53,60,66,85,93,115,129,135,139,143],"travelling":[25,49,70],"thief":[26],"problem,":[27],"which":[28],"is":[29,131],"known":[30],"Evolutionary":[33],"Computation":[34],"community":[35],"as":[36,72],"benchmark":[38],"multi-component":[39],"optimisation":[40],"problem":[41,51,71],"interconnects":[43],"two":[44,116],"classical":[45],"NP-hard":[46],"problems:":[47],"salesman":[50],"0-1":[54],"knapsack":[55],"problem.":[56,144],"Our":[57],"employs":[59],"dynamic":[62,94],"programming":[63],"algorithm":[64],"for":[65,138],"underlying":[67],"packing":[68],"while":[69],"subroutine":[74],"within":[75],"bi-objective":[77],"algorithm.":[79],"design":[81],"takes":[82],"advantage":[83],"data":[86],"extracted":[87],"from":[88],"Pareto":[89],"fronts":[90],"generated":[91],"by":[92],"program":[95],"achieve":[97],"better":[98],"solutions.":[99],"Furthermore,":[100],"we":[101],"develop":[102],"number":[104],"indicators":[107],"selection":[109],"mechanisms":[110],"strengthen":[112],"synergy":[113],"algorithmic":[117],"components":[118],"our":[120],"approach.":[121],"The":[122],"results":[123,137],"computational":[125],"experiments":[126],"show":[127],"capable":[132],"outperform":[134],"state-of-the-art":[136],"single-objective":[140],"case":[141]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}