Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm

Intelligent transportation systems (ITS) are a critical component of Industry 4.0 and 5.0, particularly having applications in logistic management. One of their crucial utilization is in supply-chain management and scheduling for optimally routing transportation of goods by vehicles at a given set of locations. This paper discusses the broader problem of vehicle traffic management, more popularly known as the Vehicle Routing Problem (VRP), and investigates the possible use of near-term quantum devices for solving it. For this purpose, the authors give the Ising formulation for VRP and some of its constrained variants. Then, they present a detailed procedure to solve VRP by minimizing its corresponding Ising Hamiltonian using a hybrid quantum-classical heuristic called Quantum Approximate Optimization Algorithm (QAOA), implemented on the IBM Qiskit platform. They compare the performance of QAOA with classical solvers such as CPLEX on problem instances of up to 15 qubits. They find that performance of QAOA has a multifaceted dependence on the classical optimization routine used, the depth of the ansatz parameterized by 𝑝, initialization of variational parameters, and problem instance itself.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01898383
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 7 2023 2:24PM