Agent route optimization using quantum computing

A method for determining an optimized quantity of agents and routes for the agents using quantum computing, the method comprising:

• receiving, using a classical computing system, geographic data comprising a collection of locations within a geographic region to be visited by a plurality of agents;
• determining, using the classical computing system, that a quantity of locations included within the collection of locations fails to satisfy a threshold location quantity condition;
• splitting, using the classical computing system, the collection of locations into a plurality of sets of locations, wherein a quantity of locations included within each of the plurality of sets of locations satisfies the threshold location quantity condition;
• for each of the plurality of sets of locations:
• generating, using the classical computing system, a sequence objective function to identify a sequence with which the set of locations are to be visited that minimizes a total distance traveled;
• inputting the sequence objective function and a set of sequence conditions to a quantum computing system to determine a sequence solution comprising the identified sequence;
• generating, using the classical computing system, an agent quantity objective function to identify a minimum quantity of agents to visit the set of locations based on the sequence solution;
• generating, using the classical computing system, a temporal duration objective function to identify a plurality of subsets of locations of the set of locations to be visited by one or more of the plurality of agents based on the sequence solution, wherein each of the plurality of subsets of locations is assigned to one of the plurality of agents to minimize an amount of time for that agent to visit the subset of locations;
• and
• inputting the agent quantity objective function, the temporal duration objective function, and a set of agent-quantity conditions to the quantum computing system to determine an optimized solution comprising the minimum quantity of agents, the subset of locations to be traveled to by each of the agents in the minimized amount of time, and an order with which the agent is to travel to each of subset of locations;
• and
• generating, using the classical computing system, a global solution based on the optimized solution determined for each of the plurality of sets of locations.

A system for determining an optimized quantity of agents and routes for the agents using quantum computing, the system comprising:

• memory storing computer program instructions;
• and
• one or more processors programmed with the computer program instructions to:
• determine a plurality of locations within a geographic region to be visited by a plurality of agents;
• generate a sequence objective function to identify a sequence with which the plurality of locations are to be visited that minimizes a total distance traveled;
• input the sequence objective function and a set of sequence conditions into a quantum computing system to determine a sequence solution comprising the identified sequence;
• generate an agent quantity objective function to identify a minimum quantity of agents from the plurality of agents to visit the plurality of locations based on the sequence solution;
• generate a temporal duration objective function to identify a plurality of subsets of locations to be visited by the minimum quantity of agents based on the sequence solution, wherein each of the plurality of subsets of locations is assigned to one of the minimum quantity of agents to minimize an amount of time for that agent to visit the subset of locations;
• and
• input the agent quantity objective function, the temporal duration objective function, and a set of agent-quantity conditions to the quantum computing system to determine an optimized solution comprising the minimum quantity of agents, the subset of locations to be traveled to by each of the minimum quantity of agents in the minimized amount of time, and an order with which the agent is to travel to the subset of locations.

A non-transitory computer-readable medium storing computer program instructions that, when executed by one or more processors, effectuate operations comprising:

• determining a plurality of locations within a geographic region to be visited by a plurality of agents;
• generating a sequence objective function to identify a sequence with which the plurality of locations are to be visited that minimizes a total distance traveled;
• inputting the sequence objective function and a set of sequence conditions into a quantum computing system to determine a sequence solution comprising the identified sequence;
• generating an agent quantity objective function to identify a minimum quantity of agents from the plurality of agents to visit the plurality of locations based on the sequence solution;
• generating a temporal duration objective function to identify a plurality of subsets of locations to be visited by the minimum quantity of agents based on the sequence solution, wherein each of the plurality of subsets of locations is assigned to one of the minimum quantity of agents to minimize an amount of time for that agent to visit the subset of locations;
• and
• inputting the agent quantity objective function, the temporal duration objective function, and a set of agent-quantity conditions to the quantum computing system to determine an optimized solution comprising the minimum quantity of agents, the subset of locations to be traveled to by each of the minimum quantity of agents in the minimized amount of time, and an order with which the agent is to travel to the subset of locations.