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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Applying Quantum Computing to Solve Multicommodity Network Flow Problem


    Beteiligte:
    Niu, Chence (Autor:in) / Rastogi, Purvi (Autor:in) / Soman, Jaikishan (Autor:in) / Tamuli, Kausik (Autor:in) / Dixit, Vinayak (Autor:in)


    Erscheinungsdatum :

    01.04.2025


    Format / Umfang :

    4702958 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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

    Freier Zugriff

    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