A Quantum Particle Swarm-Inspired Algorithm for Dynamic Vehicle Routing Problem

In order to solve the scheduling of dynamic vehicle routing problem, this paper establishes the simulation model to minimize the cost and stability value and maximize the loading rate. Then a quantum particle swarm-inspired algorithm is proposed. At first, it introduces the method based on the DCSC (double chains structure coding) including vehicle allocation chain and goods chain. Finally, the proposed method is applied to a dynamic simulation and the result of comparing with other classical algorithms verifies its effectiveness.