Efficient Quantum Algorithm for Generating Feasible Routes in the Fleet Sizing Vehicle Routing Problem with Time Windows
A greedy quantum algorithm that generates feasible routes for the Fleet Sizing Vehicle Routing Problem with Time Windows by leveraging information from all samples obtained from the quantum annealer.