{"id":"https://openalex.org/W7139921212","doi":"https://doi.org/10.48550/arxiv.2603.18038","title":"Advanced Quantum Annealing for the Bi-Objective Traveling Thief Problem: An $\\varepsilon$-Constraint-based Approach","display_name":"Advanced Quantum Annealing for the Bi-Objective Traveling Thief Problem: An $\\varepsilon$-Constraint-based Approach","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7139921212","doi":"https://doi.org/10.48550/arxiv.2603.18038"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.18038","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18038","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.18038","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101695705","display_name":"Nguy\u1ec5n Ho\u00e0ng Vi\u1ec7t","orcid":"https://orcid.org/0009-0009-1336-1773"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Viet, Nguyen Hoang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130244868","display_name":"Nguyen Xuan Tung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tung, Nguyen Xuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130240487","display_name":"Trinh Van Chien","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Van Chien, Trinh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130223775","display_name":"Won-Joo Hwang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hwang, Won-Joo","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101695705"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.4153999984264374,"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.4153999984264374,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.23999999463558197,"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.07779999822378159,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.8925999999046326},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.6227999925613403},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5891000032424927},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5521000027656555},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5443000197410583},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5059000253677368},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.461899995803833},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4560999870300293},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4481000006198883}],"concepts":[{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.8925999999046326},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7260000109672546},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.6227999925613403},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5891000032424927},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5521000027656555},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5443000197410583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5216000080108643},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5059000253677368},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.461899995803833},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4481000006198883},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3231000006198883},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.3208000063896179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3172000050544739},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C62064638","wikidata":"https://www.wikidata.org/wiki/Q553878","display_name":"Design for manufacturability","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C2983394010","wikidata":"https://www.wikidata.org/wiki/Q19885330","display_name":"Continuous variable","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.28029999136924744},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C192353077","wikidata":"https://www.wikidata.org/wiki/Q4682635","display_name":"Adiabatic quantum computation","level":4,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.18038","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18038","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.18038","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18038","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.45577380061149597,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,16,28,37,48,78,84,93,126,152,170,194],"Bi-Objective":[4],"Traveling":[5],"Thief":[6],"Problem":[7],"(BI-TTP),":[8],"a":[9,88,110,132,143,159,180],"challenging":[10],"multi-objective":[11],"optimization":[12,18],"problem":[13,53,86],"that":[14,72,193],"requires":[15],"simultaneous":[17],"of":[19,112],"travel":[20],"cost":[21],"and":[22,42,51,103,201],"item":[23],"profit.":[24],"Conventional":[25],"methods":[26],"for":[27],"BI-TTP":[29],"often":[30],"face":[31],"severe":[32],"scalability":[33],"issues":[34],"due":[35],"to":[36,163],"complex":[38],"interdependence":[39],"between":[40],"routing":[41],"packing":[43],"decisions,":[44],"as":[45,47],"well":[46],"inherent":[49],"complexity":[50],"large":[52],"size.":[54],"These":[55],"difficulties":[56],"render":[57],"classical":[58],"computing":[59],"approaches":[60,204],"increasingly":[61],"inapplicable.":[62],"To":[63],"tackle":[64],"this,":[65],"we":[66,82],"propose":[67],"an":[68,122],"advanced":[69],"hybrid":[70],"approach":[71,177],"combines":[73],"quantum":[74,144,153],"annealing":[75,145],"(QA)":[76,146],"with":[77,118],"$\\varepsilon$-constraint":[79],"method.":[80],"Specifically,":[81],"reformulate":[83],"bi-objective":[85],"into":[87,121,131],"single-objective":[89],"formulation":[90,128],"by":[91],"restricting":[92],"second":[94],"objective":[95],"through":[96],"adjustable":[97],"$\\varepsilon$-levels,":[98],"determined":[99],"within":[100],"established":[101],"upper":[102],"lower":[104],"bounds.":[105],"The":[106,148],"resulting":[107],"subproblem":[108],"involves":[109],"sum":[111],"fractional":[113],"terms,":[114],"which":[115],"is":[116,129],"reformulated":[117],"auxiliary":[119],"variables":[120],"equivalent":[123,127],"form.":[124],"Subsequently,":[125],"transformed":[130],"Quadratic":[133],"Unconstrained":[134],"Binary":[135],"Optimization":[136],"(QUBO)":[137],"model,":[138],"enabling":[139],"direct":[140],"solution":[141,185],"via":[142],"solver.":[147],"solutions":[149],"obtained":[150],"from":[151],"annealer":[154],"are":[155],"subsequently":[156],"refined":[157],"using":[158],"tailored":[160],"heuristic":[161],"procedure":[162],"further":[164],"enhance":[165],"overall":[166],"performance.":[167],"By":[168],"leveraging":[169],"flexibility":[171],"in":[172,205],"selecting":[173],"$\\varepsilon$":[174],"parameters,":[175],"our":[176],"effectively":[178,197],"captures":[179],"broad":[181],"Pareto":[182],"front,":[183],"enhancing":[184],"diversity.":[186],"Experimental":[187],"results":[188],"on":[189],"benchmark":[190],"instances":[191],"demonstrate":[192],"proposed":[195],"method":[196],"balances":[198],"two":[199],"objectives":[200],"outperforms":[202],"baseline":[203],"time":[206],"efficiency.":[207]},"counts_by_year":[],"updated_date":"2026-03-21T06:36:02.116451","created_date":"2026-03-21T00:00:00"}