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.
Applying Quantum Computing to Solve Multicommodity Network Flow Problem
IEEE Transactions on Intelligent Transportation Systems ; 26 , 4 ; 5094-5101
2025-04-01
4702958 byte
Article (Journal)
Electronic Resource
English
The congested multicommodity network design problem
Online Contents | 2016
|Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications
DOAJ | 2024
|THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM
British Library Conference Proceedings | 2002
|The Multicommodity-Ring Location Routing Problem
Online Contents | 2016
|