Quantum-classical solution stack for vehicle routing problem

• Main Authors: Othmani, Imed, Kumar, Vaibhaw, Alevras, Dimitrios
• Format: Patent
• Language: English
• Published: 14.11.2023
• Subjects: CALCULATING; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS; COMPUTING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; PHYSICS; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR

A method and system of generating a route includes receiving information regarding a set of nodes to be serviced. One or more parameters of each node are determined. A capacity of each of the one or more vehicles is determined. A classical computer is used to generate a set of feasible routes based on the one or more parameters of each node and the capacity of each of the one or more vehicles. A number of bags N to divide the set of feasible routes is determined. The feasible routes are distributed into the N bags. The N bags are sent to a quantum computer to calculate a most efficient combination of feasible routes that cover all nodes to be serviced.