  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.
