Applying Quantum Computing to Solve Multicommodity Network Flow Problem

2024/02/07 by Niu Chence, Chence, Niu, Purvi Rastogi +7 · 1 citation
Computer Science · #FOS: Mathematics #Optimization and Control (math.OC) #Quantum Computing Algorithms and Architecture

paper · pdf · doi:10.48550/arxiv.2402.04758

openalex publication_date 2024/02/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• From Cables to Qubits: A Decomposed Variational Quantum Optimization Pipeline

Related

• Supply Chain Logistics with Quantum and Classical Annealing Algorithms
• Quantum Annealing based Hybrid Strategies for Real Time Route Optimization
• Quantum Computing in Transport Science: A Review
• Quantum Annealing for Vehicle Routing Problem with weighted Segment
• Quantum computing for transport optimization