CLASSICAL HYBRID SOLUTION TO MULTI-STOP ROUTING

Organization Name

Inventor(s)

Dastgeer Shaikh of Plainsboro Township NJ US

CLASSICAL HYBRID SOLUTION TO MULTI-STOP ROUTING

This abstract first appeared for US patent application 20250124366 titled 'CLASSICAL HYBRID SOLUTION TO MULTI-STOP ROUTING

Original Abstract Submitted

relational routing data tables are converted into graphs comprising nodes and vertices. the nodes can include origins and destinations associated with routes, while the vertices represent route parameters. route segments can then be mapped from the graphs. for an origin-destination input, a set of shortest parameterized paths among the route segments is identified. these shortest parameterized paths includes route segments weighted over a range of route parameters. within a solution domain, an optimal solution can be generated by filtering the shortest parameterized path based on a set of one or more selected parameters to generate an optimal solution. a classical threshold determines whether the optimal solution is generated using a classical computing process or a quantum computing process.