The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?". This optimization can be solved using variational circuits, especially the Quantum Approximate Optimization Algorithm. In this project, a sample of VRP problem is solved using the QAOA approach in Qiskit.
Thank you for your submission! There's still time to populate your submission with code, presentation material, etc. Please make any final adjustments before the deadline tonight at 17h00 EST!
Team Name:
IrrationalQuanta
Project Description:
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?". This optimization can be solved using variational circuits, especially the Quantum Approximate Optimization Algorithm. In this project, a sample of VRP problem is solved using the QAOA approach in Qiskit.
Presentation:
https://github.com/Amey-2002/QAOA-Vehicle-Routing-Problem/blob/main/QHack_22-VRP_using_QAOA.pdf
Source code:
https://github.com/Amey-2002/QAOA-Vehicle-Routing-Problem
Which challenges/prizes would you like to submit your project for?
IBM Qiskit Challenge Hybrid Algorithms Challenge QAOA challenge Young Scientist challenge