Redesign of the Last Mile Delivery Network Using Quantum Alternating Operator Ansatz

This paper presents an approach for solving the last mile delivery network redesign problem on universal gate-based quantum computing architectures. We formulate the problem as a quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm. We define mixers, by using and extending existing families of mixing operators, to constrain search to a feasible subspace depending on the hard constraints of the studied problem. Our study examines the effectiveness of utilizing this approach on multiple problem instances of different sizes.