University of Surrey

Test tubes in the lab Research in the ATI Dance Research

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

Alanis, Dimitrios, Botsinis, Panagiotis, Babar, Zunaira, Nguyen, Hung, Chandra, Daryus, Ng, Soon Xin and Hanzo, Lajos (2018) Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming IEEE Transactions on Vehicular Technology, 67 (8). pp. 7856-7860.

Quantum-aided Multi-Objective Routing Optimization.pdf - Version of Record
Available under License Creative Commons Attribution.

Download (250kB) | Preview


Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multi-objective 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 the EQPO algorithm by introducing a back-tracing process. We also demonstrate that the improved algorithm, namely the Back-Tracing-Aided EQPO (BTA-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 part of the optimal Pareto front.

Item Type: Article
Divisions : Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :
Alanis, Dimitrios
Botsinis, Panagiotis
Babar, Zunaira
Chandra, Daryus
Ng, Soon Xin
Hanzo, Lajos
Date : 2 April 2018
Funders : Engineering and Physical Sciences Research Council (EPSRC)
DOI : 10.1109/TVT.2018.2822626
Copyright Disclaimer : © 2018 IEEE. This work is licensed under a Creative Commons Attribution 3.0 License. For more information, see
Uncontrolled Keywords : Quantum Computing; QoS; Dynamic Programming; Pareto Optimality; Routing; Multi-objective Optimization; Complexity theory; Pareto optimization; Heuristic algorithms; Dynamic programming; Quality of service; Measurement
Depositing User : Clive Harris
Date Deposited : 09 Apr 2018 10:36
Last Modified : 11 Dec 2018 11:24

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800