Trip Planning Based on subQUBO Annealing
The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels. Meanwhile, Ising machines have attracted attention due to their efficiency in solving combinatorial optimization problems. The Ising m...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10247510/ |
| Tags: |
No Tags, Be the first to tag this record!
|