{"id":"https://openalex.org/W2588290279","doi":"https://doi.org/10.1007/978-3-319-54157-0_4","title":"Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms","display_name":"Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2588290279","doi":"https://doi.org/10.1007/978-3-319-54157-0_4","mag":"2588290279"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-54157-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-54157-0_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5047107500","display_name":"Julian Blank","orcid":"https://orcid.org/0000-0002-2227-6476"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Julian Blank","raw_affiliation_strings":["Otto-von-Guericke University, 39106, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke University, 39106, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Michigan State University, East Lansing, Michigan, 48824, USA"],"affiliations":[{"raw_affiliation_string":"Michigan State University, East Lansing, Michigan, 48824, USA","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064569017","display_name":"Sanaz Mostaghim","orcid":"https://orcid.org/0000-0002-9917-5227"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanaz Mostaghim","raw_affiliation_strings":["Otto-von-Guericke University, 39106, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke University, 39106, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047107500"],"corresponding_institution_ids":["https://openalex.org/I95793202"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":8.0099,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.97893338,"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":"46","last_page":"60"},"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.9995999932289124,"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.9995999932289124,"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.9976999759674072,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9926999807357788,"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.9253672957420349},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9140640497207642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6544963121414185},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6427491903305054},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6213310956954956},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6015695333480835},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6004677414894104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5986039042472839},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5701555609703064},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5319291353225708},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4793858528137207},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4643011689186096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4091809391975403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3049636781215668}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9253672957420349},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9140640497207642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6544963121414185},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6427491903305054},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6213310956954956},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6015695333480835},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6004677414894104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5986039042472839},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5701555609703064},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5319291353225708},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4793858528137207},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4643011689186096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4091809391975403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3049636781215668},{"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.1007/978-3-319-54157-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-54157-0_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W99032621","https://openalex.org/W307896644","https://openalex.org/W626292722","https://openalex.org/W1504762824","https://openalex.org/W1538348021","https://openalex.org/W1796917439","https://openalex.org/W1965587495","https://openalex.org/W1973312791","https://openalex.org/W2029374654","https://openalex.org/W2072175042","https://openalex.org/W2126105956","https://openalex.org/W2140425706","https://openalex.org/W2156293131","https://openalex.org/W2157321006","https://openalex.org/W4242361212"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2362402143","https://openalex.org/W1984036937","https://openalex.org/W2171568915","https://openalex.org/W2265604726","https://openalex.org/W8433631"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}