In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programming 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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Applying Quantum Computing to Solve Multicommodity Network Flow Problem


    Contributors:


    Publication date :

    2025-04-01


    Size :

    4702958 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    The congested multicommodity network design problem

    Dimitris C Paraskevopoulos | Online Contents | 2016


    Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications

    Snežana MLADENOVIĆ / Ivana STEFANOVIĆ / Slađana JANKOVIĆ et al. | DOAJ | 2024

    Free access

    The multicommodity maximal covering network design problem

    Viswanath, K. / Peeta, S. | IEEE | 2002


    THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM

    Viswanath, K. / Peeta, S. / IEEE | British Library Conference Proceedings | 2002


    The Multicommodity-Ring Location Routing Problem

    Gianessi, Paolo | Online Contents | 2016