{"id":"https://openalex.org/W4389366529","doi":"https://doi.org/10.1145/3628797.3628990","title":"Simulated Annealing with Dynamic Programming-based Vertex Insertion for Efficiently Solving the Traveling Thief Problem","display_name":"Simulated Annealing with Dynamic Programming-based Vertex Insertion for Efficiently Solving the Traveling Thief Problem","publication_year":2023,"publication_date":"2023-12-06","ids":{"openalex":"https://openalex.org/W4389366529","doi":"https://doi.org/10.1145/3628797.3628990"},"language":"en","primary_location":{"id":"doi:10.1145/3628797.3628990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3628797.3628990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Symposium on Information and Communication Technology","raw_type":"proceedings-article"},"type":"article","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/A5102956716","display_name":"Hoang Nguyen","orcid":"https://orcid.org/0009-0004-2141-3610"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Hoang Nguyen","raw_affiliation_strings":["University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100768612","display_name":"Nam Phong Pham Le","orcid":"https://orcid.org/0009-0006-1822-9761"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nam Le","raw_affiliation_strings":["University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029421157","display_name":"Khang Tran","orcid":"https://orcid.org/0000-0001-7250-4863"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Khang Tran","raw_affiliation_strings":["University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081219326","display_name":"Ngoc Hoang Luong","orcid":"https://orcid.org/0000-0002-6768-1950"},"institutions":[{"id":"https://openalex.org/I123565023","display_name":"Vietnam National University Ho Chi Minh City","ror":"https://ror.org/00waaqh38","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Ngoc Hoang Luong","raw_affiliation_strings":["University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Information Technology, Vietnam and Vietnam National University Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I123565023"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102956716"],"corresponding_institution_ids":["https://openalex.org/I123565023"],"apc_list":null,"apc_paid":null,"fwci":0.2076,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61116205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"165","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.9983999729156494,"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.9930999875068665,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8907142877578735},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7572672367095947},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7101430892944336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6082319021224976},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.530485212802887},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5240997076034546},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47843411564826965},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.45066913962364197},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.43522605299949646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33526137471199036},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3291803002357483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30580586194992065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27246445417404175}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8907142877578735},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7572672367095947},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7101430892944336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6082319021224976},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.530485212802887},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5240997076034546},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47843411564826965},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.45066913962364197},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.43522605299949646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33526137471199036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3291803002357483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30580586194992065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27246445417404175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3628797.3628990","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3628797.3628990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Symposium on Information and Communication Technology","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":17,"referenced_works":["https://openalex.org/W1603508565","https://openalex.org/W1796917439","https://openalex.org/W1965587495","https://openalex.org/W1973312791","https://openalex.org/W1985871111","https://openalex.org/W2029374654","https://openalex.org/W2042986967","https://openalex.org/W2072175042","https://openalex.org/W2140425706","https://openalex.org/W2157321006","https://openalex.org/W2210692376","https://openalex.org/W2488761445","https://openalex.org/W2771632251","https://openalex.org/W2962814375","https://openalex.org/W3150536012","https://openalex.org/W4205311249","https://openalex.org/W4230781079"],"related_works":["https://openalex.org/W1966986652","https://openalex.org/W2142105839","https://openalex.org/W1563501581","https://openalex.org/W4389887952","https://openalex.org/W2367132302","https://openalex.org/W2572756133","https://openalex.org/W1563568831","https://openalex.org/W2135149549","https://openalex.org/W4294358747","https://openalex.org/W1604040598"],"abstract_inverted_index":{"Many":[0],"real-world":[1],"optimization":[2,27],"problems":[3],"today":[4],"are":[5],"challenging":[6],"to":[7,10,32,93],"solve":[8],"due":[9],"their":[11],"inclusion":[12],"of":[13,37],"multiple":[14],"interdependent":[15],"NP-Hard":[16,43],"subproblems.":[17],"The":[18],"Traveling":[19,46],"Thief":[20],"Problem":[21,48,53],"(TTP),":[22],"a":[23,65],"relatively":[24],"new":[25],"combinatorial":[26],"problem,":[28],"has":[29],"been":[30],"proposed":[31],"better":[33],"model":[34],"these":[35],"types":[36],"problems.":[38],"TTP":[39,85],"comprises":[40],"two":[41],"well-known":[42],"problems:":[44],"the":[45,51,58],"Salesman":[47],"(TSP)":[49],"and":[50,100],"Knapsack":[52],"(KP).":[54],"This":[55],"paper":[56],"introduces":[57],"SAVI":[59,80],"algorithm,":[60],"utilizing":[61],"Simulated":[62],"Annealing":[63],"with":[64],"Vertex":[66],"Insertion":[67],"procedure":[68],"that":[69,79],"is":[70,105],"efficiently":[71,82],"implemented":[72],"via":[73],"Dynamic":[74],"Programming.":[75],"Experimental":[76],"results":[77],"show":[78],"runs":[81],"across":[83],"various":[84],"test":[86],"cases,":[87],"yielding":[88],"highly":[89],"competitive":[90],"outcomes":[91],"compared":[92],"other":[94],"state-of-the-art":[95],"algorithms,":[96],"especially":[97],"on":[98],"medium":[99],"large-sized":[101],"instances.":[102],"Source":[103],"code":[104],"available":[106],"at":[107],"https://github.com/ELO-Lab/SAVI.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}