会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 17. 发明申请
    • DECENTRALISED QUBO SOLVER AND CRYPTOCURRENCY GENERATION
    • WO2023081084A1
    • 2023-05-11
    • PCT/US2022/048360
    • 2022-10-31
    • MASTERCARD INTERNATIONAL INCORPORATED
    • MARIELLA, Nicola
    • H04L9/00G06N10/60G06N5/01G06N7/01
    • A routing optimization computer implemented method is provided, comprising the steps: (a) determining, by the classical computer, a non-convex sub- problem and a convex sub-problem of a constrained, optimization problem, the constrained optimization problem comprising: a binary variable indicative of a vehicle visiting a plurality of nodes; and a continuous variable representative of a time at which the vehicle arrives at each of the plurality of nodes; wherein the continuous variable is fixed for the non-convex sub-problem and the binary variable is fixed for the convex sub-problem; (b) generating, by the classical computer, a smart contract corresponding to the non-convex sub-problem; (c) transmitting, by the classical computer, the smart contract to a distributed ledger; (d) broadcasting, by the distributed ledger, the smart contract to a plurality of solvers; (e) receiving, at the distributed ledger, a first binary solution to the non-convex sub-problem from a first solver; (f) receiving, at the distributed ledger, a further binary solution to the non- convex sub-problem from a second solver; (g) determining, by a decision mechanism of the distributed ledger, a more suitable solution of the first binary solution and the further binary' solution; (h) transmitting, by the distributed ledger to the solver of the more suitable binary solution, a payment associated with the smart contract; (1) transmitting, by the distributed ledger to the classical computer, the more suitable binary solution; (j) determining, by the classical computer, a time solution to the convex sub-problem using the more suitable binary solution as the binary variable; (k) repeating steps (b) to (c), using the time solution as the continuous variable, until a threshold is met; and (1) mapping the binary solution and the time solution to the constrained optimization problem, thereby providing an optimized routing.