Applying Quantum Computing to Solve Multicommodity Network Flow Problem

In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programing model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comp...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Niu Chence, Rastogi, Purvi, Soman, Jaikishan, Tamuli, Kausik, Dixit, Vinayak V
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 07.02.2024
Subjects
Mixed integer
Quantum computing
Vehicle routing
Online AccessGet full text

Cover

More Information
Summary:In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programing model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.
ISSN:2331-8422