This repository provides a solution to the standard Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). In a CVRPTW, we aim to optimize the routes of a fleet of vehicles serving customers ...

Abstract: The Knapsack Problem (KP) continues to be widely used in academic examples and research nowadays. In this paper, we review the KP and compare different solvers based on Quantum Annealing (QA ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...