CoChat

Quantum-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming

Open access

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

Pareto optimality is capable of striking the optimal tradeoff amongst the diverse conflicting quality-of-service requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multiobjective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circumventing this problem. In this context, the so-called evolutionary quantum Pareto optimization (EQPO) algorithm has been proposed, which is capable of identifying most of the optimal routes at a near-polynomial complexity versus the number of nodes. As a benefit, we improve both the EQPO algorithms by introducing a back-tracing process. We also demonstrate that the improved algorithm, namely the back-tracing-aided EQPO algorithm, imposes a negligible complexity overhead, while substantially improving our performance metrics, namely the relative frequency of finding all Pareto-optimal solutions and the probability that the Pareto-optimal solutions are, indeed, a part of the optimal Pareto front.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tvt.2018.2822626

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Cited by

See all 17

Metadata

Authors
Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L.
Affiliations
University of Southampton (GB)
Venue
IEEE Transactions on Vehicular Technology
Published
2018-08
Volume
67
Issue
8
Pages
7856-7860
ISSN
  • 0018-9545 (ISSN-L)
  • 1939-9359
OpenAlex
W2795477603
Cited by
17
References
13
Citations by year
2025: 3 · 2024: 1 · 2023: 5 · 2022: 3 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 1
FWCI
0.93
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Vehicular Technology (publishedVersion, cc-by)
  • ePrints Soton (University of Southampton) (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
ERC's Advanced Fellow QuantCom
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
  • Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
Keywords
Pareto optimality, multi-hop wireless networks, Pareto front, algorithmic complexity

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming. https://app.cochat.ai/papers/10.1109/tvt.2018.2822626
The paper
Alanis, D., Botsinis, P., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2018). Quantum-Aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2018.2822626

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.