This repository has been archived by the owner on Dec 21, 2022. It is now read-only.
Vehicle Routing Problem using QAOA #108
Labels
Hybrid Algorithms Challenge
More details here: https://github.com/XanaduAI/QHack/blob/master/Open_Hackathon.md#hybrid-algorithms
IBM Qiskit Challenge
More details here: https://github.com/XanaduAI/QHack/blob/master/Open_Hackathon.md#ibm-qiskit-challe
QAOA Challenge
More details here: https://github.com/XanaduAI/QHack/blob/master/Open_Hackathon.md#qaoa-challenge
Young Scientist Challenge
More details here: https://github.com/XanaduAI/QHack/blob/master/Open_Hackathon.md#young-scientist-c
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
The text was updated successfully, but these errors were encountered: