Quantum Annealing with ε-Constraint Method for Bi-Objective Traveling Thief Problem

First quantum computing approach to the Bi-Objective Traveling Thief Problem: hybrid QA + ε-constraint converts BI-TTP to QUBO, achieving up to 8.1× speedup over classical MOEAs (NSGA-II, U-NSGA-III) with superior Pareto front coverage.

#QuantumAnnealing #CombnatorialOptimization #Research

Traveling Salesman Problem: Cost-Based Arc Filtering for Classical and Quantum Optimization

A CAF preprocessing method reduces TSP decision variables by ~30%, cutting classical solver time by 32% and quantum hybrid optimality gaps by ~29%. Enables D-Wave hybrid solver to tackle TSPLIB instances up to 15 nodes.

#QuantumAnnealing #CombnatorialOptimization #Research