17542484. QUANTUM-CLASSICAL SOLUTION STACK FOR VEHICLE ROUTING PROBLEM simplified abstract (INTERNATIONAL BUSINESS MACHINES CORPORATION)

From WikiPatents
Jump to navigation Jump to search

QUANTUM-CLASSICAL SOLUTION STACK FOR VEHICLE ROUTING PROBLEM

Organization Name

INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor(s)

Vaibhaw Kumar of Frederick MD (US)

Dimitrios Alevras of West Chester PA (US)

Imed Othmani of Yorktown Heights NY (US)

QUANTUM-CLASSICAL SOLUTION STACK FOR VEHICLE ROUTING PROBLEM - A simplified explanation of the abstract

This abstract first appeared for US patent application 17542484 titled 'QUANTUM-CLASSICAL SOLUTION STACK FOR VEHICLE ROUTING PROBLEM

Simplified Explanation

The patent application describes a method and system for generating an efficient route for servicing a set of nodes using both classical and quantum computers. Here are the key points:

  • The system receives information about the nodes that need to be serviced.
  • Parameters of each node, such as location, priority, or time window, are determined.
  • The capacity of each vehicle involved in the servicing is also determined.
  • Feasible routes are generated by a classical computer based on the parameters of each node and the capacity of the vehicles.
  • The set of feasible routes is divided into a number of bags.
  • These bags are then sent to a quantum computer for calculating the most efficient combination of routes that cover all the nodes.

Potential applications of this technology:

  • Logistics and transportation companies can use this system to optimize their delivery routes, reducing fuel consumption and improving efficiency.
  • Service providers, such as maintenance or repair teams, can benefit from optimized routes that minimize travel time and maximize the number of serviced nodes.
  • Emergency response teams can use this system to quickly determine the most efficient routes for reaching affected areas or individuals.

Problems solved by this technology:

  • Traditional methods of generating routes may not consider all the parameters of each node or the capacity of the vehicles, leading to suboptimal routes.
  • Manual route planning can be time-consuming and prone to human error, especially when dealing with a large number of nodes and complex constraints.
  • Quantum computing allows for more complex calculations and optimization, enabling the generation of highly efficient routes.

Benefits of this technology:

  • Improved efficiency and cost savings by generating optimized routes that minimize travel time and maximize resource utilization.
  • Reduced environmental impact through optimized routes that minimize fuel consumption and emissions.
  • Faster response times for emergency services, leading to potentially saving lives and minimizing damage.


Original Abstract Submitted

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.

Retrieved from "http://wikipatents.org/index.php?title=17542484._QUANTUM-CLASSICAL_SOLUTION_STACK_FOR_VEHICLE_ROUTING_PROBLEM_simplified_abstract_(INTERNATIONAL_BUSINESS_MACHINES_CORPORATION)&oldid=25758"