Solving Vehicle Routing Problem using QAOA algorithm

An Indian scientists team has published a paper describing the usage of Quantum Approximate Optimization Algorithm (QAOA), which is a quantum-classical heuristic, to solve a combinatorial optimization and integer programming task known as Vehicle Routing Problem (VRP).

They outline the Ising formulation for VRP and present a detailed procedure to solve VRP by minimizing its simulated Ising Hamiltonian using IBM Qiskit platform. For example they have attempted to find solutions for the VRP problems: (4,2), (5,2), and (5,3), where each (n, k) represents a VRP problem with n locations and k vehicles.

They found that the performance of QAOA is largely limited by the problem instance.

Read more.