CN111695981A

CN111695981A - Resource transfer method, device and storage medium

Info

Publication number: CN111695981A
Application number: CN201910190728.8A
Authority: CN
Inventors: 王谨平; 杨崇灵; 黄平财; 周天冀; 周骑; 谢敏; 王康; 潘秋菊; 杜柏松; 王晓桐; 刘爽; 王东峰; 张琦
Original assignee: Beijing Sankuai Online Technology Co Ltd
Current assignee: Beijing Sankuai Online Technology Co Ltd
Priority date: 2019-03-13
Filing date: 2019-03-13
Publication date: 2020-09-22
Also published as: WO2020181858A1

Abstract

The application discloses a resource transfer method, a resource transfer device and a storage medium, and belongs to the field of data processing. The method comprises the following steps: acquiring a plurality of resource transfer paths of a target resource; based on the sequencing results of the multiple resource transfer paths, sequentially acquiring the weight of a compatible set of each resource transfer path, wherein the compatible set of any resource transfer path is a set with the maximum weight in a set formed by mutually compatible paths, and the mutually compatible paths are paths which are not mutually overlapped in time in any resource transfer path and all resource transfer paths before any resource transfer path; and taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as a target compatible set, and transferring the target resources based on the target compatible set. The method and the device can efficiently and accurately transfer the weighted resources, and improve the resource utilization rate.

Description

Resource transfer method, device and storage medium

Technical Field

The present application relates to the field of data processing, and in particular, to a resource transfer method, device and storage medium.

Background

The resource transfer method has important influence on the efficiency, cost and utilization rate of resources. For example, the resource is a reserve payment of the third-party payment mechanism, and when the user performs payment operations such as withdrawal, surcharge, settlement and the like through the third-party payment mechanism, the third-party payment mechanism withdraws money from the bank account through the corresponding reserve payment account. However, the bank accounts corresponding to the spare payment accounts are different, and the support conditions of different banks for the spare payment are different. In consideration of the factors of improving the time efficiency of making a payment, saving the making cost, improving the utilization rate of the reserve payment and the like, a proper resource transfer method is necessary to allocate funds in the reserve payment account.

In the related technology, an optimal resource transfer path set meeting the weight requirement is screened out from a resource transfer path set consisting of a plurality of resource transfer paths through a cyclic brute force allocation algorithm, and funds are allocated according to the optimal resource transfer path set.

However, the optimal resource transfer path set meeting the weight requirement is screened from the resource transfer path set through a cyclic brute force allocation algorithm, so that the time consumption is long, and the allocation timeliness is influenced.

Disclosure of Invention

The embodiment of the application provides a resource transfer method, a resource transfer device and a storage medium, which can solve the technical problem. The technical scheme is as follows:

in one aspect, an embodiment of the present application provides a resource transfer method, where the method includes:

acquiring a plurality of resource transfer paths of a target resource;

based on the sequencing results of the plurality of resource transfer paths, sequentially obtaining the weight of a compatible set of each resource transfer path, wherein the compatible set of any resource transfer path is a set with the maximum weight in a set formed by mutually compatible paths, and the mutually compatible paths are paths which are not mutually overlapped in time in any resource transfer path and all resource transfer paths before any resource transfer path;

and taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as a target compatible set, and transferring the target resources based on the target compatible set.

Optionally, the obtaining the weight of the compatible set of each resource transfer path based on the sorting result of the plurality of resource transfer paths includes:

for any resource transfer path, acquiring the weight of a first compatible set and the weight of a second compatible set of the resource transfer path based on the sequencing result of the resource transfer paths;

acquiring the weight of the compatible set of any resource transfer path according to the following formula based on the weight of the first compatible set and the weight of the second compatible set;

wherein j is the jth resource transfer path; v. of_jTransferring a weight for the jth resource; OPT (p (j)) is a weight of a third compatibility set, the third compatibility set comprising: the set with the largest weight in the set formed by the paths compatible with each other and the jth resource transfer path in the

resource transfer paths

1,2, … …, j-1; v. of_j+ OPT (p (j)) is the weight of the first compatibility set; OPT (j-1) is a weight of the second compatibility set, the second compatibility set comprising: the set with the largest weight in the set formed by the mutually compatible paths in the

resource transfer paths

1,2, … … and j-1; opt (j) is the weight of the compatible set of the jth resource transfer path.

Optionally, before the obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting result of the plurality of resource transfer paths, the method further includes:

based on the sequencing results of the plurality of resource transfer paths, acquiring the starting time and the ending time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path;

acquiring a first set of all resource transfer paths which are not mutually overlapped with the time of any resource transfer path based on the starting time and the ending time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path;

and acquiring the third compatible set with the maximum weight in a set formed by mutually compatible paths in the first set.

based on the sequencing results of the plurality of resource transfer paths, acquiring the starting time and the ending time of each resource transfer path in all resource transfer paths before any resource transfer path;

and acquiring the second compatible set based on the starting time and the ending time of each resource transfer path in all resource transfer paths before any resource transfer path.

Optionally, the transferring the target resource based on the target compatible set includes:

determining a starting time and a terminating time of each resource transfer path in the target compatible set;

and transferring the target resource based on the starting time and the ending time of each resource transfer path in the target compatible set.

Optionally, after obtaining the multiple resource transfer paths of the target resource, the method further includes:

acquiring the starting time or the ending time of each resource transfer path in the plurality of resource transfer paths;

and sequencing the resource transfer paths according to the sequence of the starting time or the ending time of each resource transfer path in the resource transfer paths to obtain the sequencing results of the resource transfer paths.

In another aspect, an embodiment of the present application provides a resource transfer apparatus, where the apparatus includes:

the first acquisition module is used for acquiring a plurality of resource transfer paths of the target resource;

a second obtaining module, configured to sequentially obtain, based on a result of the sorting of the multiple resource transfer paths, a weight of a compatible set of each resource transfer path, where a compatible set of any resource transfer path is a set with a largest weight in a set formed by mutually compatible paths, and the mutually compatible paths are paths in which time does not overlap with each other in the any resource transfer path and all resource transfer paths before the any resource transfer path;

and the transfer module is used for taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as a target compatible set and transferring the target resources based on the target compatible set.

Optionally, the second obtaining module includes:

a first obtaining unit, configured to, for any resource transfer path, obtain, based on an ordering result of the multiple resource transfer paths, a weight of a first compatible set and a weight of a second compatible set of the any resource transfer path;

a second obtaining unit, configured to obtain a weight of a compatible set of the any resource transfer path according to the following formula based on the weight of the first compatible set and the weight of the second compatible set;

resource transfer paths

Optionally, before the first obtaining unit performs, based on the sorting result of the plurality of resource transfer paths, obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path, the second obtaining module further includes:

a third obtaining unit, configured to obtain, based on a result of the sorting of the multiple resource transfer paths, a start time and an end time of each of the resource transfer paths in the any resource transfer path and all resource transfer paths before the any resource transfer path;

a fourth obtaining unit, configured to obtain, based on the any resource transfer path and a start time and an end time of each resource transfer path in all resource transfer paths before the any resource transfer path, a first set of all resource transfer paths that do not overlap with a time of the any resource transfer path;

a fifth obtaining unit, configured to obtain the third compatible set with a largest weight in a set composed of mutually compatible paths in the first set.

a sixth obtaining unit, configured to obtain, based on a result of the sorting of the multiple resource transfer paths, a start time and an end time of each resource transfer path in all resource transfer paths before the any resource transfer path;

a seventh obtaining unit, configured to obtain the second compatible set based on a start time and an end time of each resource transfer path in all resource transfer paths before the any resource transfer path.

Optionally, the transfer module includes:

a first determining unit, configured to determine a start time and an end time of each resource transfer path in the target compatible set;

a transfer unit, configured to transfer the target resource based on a start time and an end time of each resource transfer path in the target compatible set.

Optionally, after the first obtaining module executes the plurality of resource transfer paths for obtaining the target resource, the apparatus further includes:

a third obtaining module, configured to obtain a start time or an end time of each resource transfer path in the multiple resource transfer paths;

and the fourth obtaining module is configured to sort the multiple resource transfer paths according to the sequence of the start time or the end time of each resource transfer path in the multiple resource transfer paths, so as to obtain a result of sorting the multiple resource transfer paths.

In another aspect, an embodiment of the present application provides a resource transfer apparatus, where the apparatus includes a processor and a memory, where the memory stores at least one instruction, and the instruction is loaded and executed by the processor to implement the resource transfer method according to any one of the above mentioned methods.

In another aspect, an embodiment of the present application provides a computer-readable storage medium, where at least one instruction is stored, and the instruction is loaded and executed by a processor to implement the resource transfer method according to any one of the above-mentioned methods.

The beneficial effects brought by the technical scheme provided by the embodiment of the application at least comprise:

the weight of the compatible set of each resource transfer path is sequentially acquired based on the sequencing results of the plurality of resource transfer paths, so that the incompatible set can be prevented from being processed, any resource transfer path can be prevented from being processed for multiple times in the same way, the timeliness and the accuracy of resource transfer are improved, the influence of the resource transfer path with the weight is avoided, and the application range of the method is expanded. By taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as the target compatible set, the target resources can be accurately transferred based on the target compatible set, and the utilization rate of the target resources is improved.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a diagram illustrating the flow of funds between a bank account and a money bag bank account, according to an exemplary embodiment;

FIG. 2 is a schematic diagram of an implementation environment shown in accordance with an exemplary embodiment;

FIG. 3 is a flow diagram illustrating a method of resource transfer in accordance with an exemplary embodiment;

FIG. 4 is a schematic diagram illustrating a funds transfer model according to an exemplary embodiment;

FIG. 5 is a diagram illustrating a ranked fund transfer task according to an exemplary embodiment;

FIG. 6 is a diagram illustrating a weighted maximum target compatible subset in accordance with an exemplary embodiment;

FIG. 7 is a functional architecture diagram illustrating a funds transfer service + payment gateway in accordance with an exemplary embodiment;

FIG. 8 is a schematic diagram illustrating a configuration of a resource transfer device in accordance with an exemplary embodiment;

FIG. 9 is a schematic diagram illustrating a second acquisition module, according to an example embodiment;

FIG. 10 is a schematic diagram illustrating a second acquisition module, according to an exemplary embodiment;

FIG. 11 is a block diagram illustrating a second acquisition module in accordance with an exemplary embodiment;

FIG. 12 is a schematic diagram illustrating the structure of a transfer module in accordance with an exemplary embodiment;

FIG. 13 is a block diagram illustrating an apparatus for resource transfer in accordance with an exemplary embodiment;

fig. 14 is a block diagram illustrating a terminal according to an exemplary embodiment;

fig. 15 is a schematic diagram illustrating a configuration of a server according to an example embodiment.

Detailed Description

Unless defined otherwise, all technical terms used in the examples of the present application have the same meaning as commonly understood by one of ordinary skill in the art. To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

Different methods of resource transfer have important impacts on the efficiency, cost, and utilization of resources. For example, the resource is a reserve payment for a third party payment authority. The third party payment institution has a number of collection and payment services, and the funds it receives can be used as a reserve payment. When the user carries out payment operations such as withdrawal, surcharge, settlement and the like through the third-party payment mechanism, the third-party payment mechanism carries out payment to the bank account through the corresponding prepared payment account. When funds are transferred from the back-up account to the target bank account, the funds may be transferred to a plurality of different banks. For example, fig. 1 shows a schematic diagram of fund circulation between a certain bank account and a certain money-bag bank account, as shown in fig. 1, a prepared payment account (fund pool account) pays a first depositor, the first depositor pays an ACS (Accounting Data Centralized System, central bank Accounting Data Centralized System) account, and the ACS account pays a first payee through internet mapping or internet. Or the spare payment account withdraws money from the first deposit and management user, and the first deposit and management user withdraws money from the first payee and payment user through the Unionpay. Or the spare payment account withdraws money from the first deposit and management account, the first deposit and management account withdraws money from the second deposit and management account, and the second deposit and management account withdraws money from the bank union internal account, the second deposit and payment account, the third deposit and payment account, the fourth deposit and payment account or the third deposit and management account. The ACS account, the first deposit and management account, the second deposit and management account, the first payment and receipt account, the second payment and receipt account, the third payment and receipt account, the fourth payment and receipt account, the third deposit and receipt account and the like can be deposited and paid in other modes. For example, as shown in fig. 1, the second payee, the third depositor, and the fourth payee are respectively paid by the remittance user a, the remittance user B, the remittance user C, and the remittance user D. The time and cost of fund circulation are different for different banks, and the utilization rate of the back-up payment is also different. In view of the above, the embodiment of the application provides a resource transfer method to improve the time efficiency of making a money, save the money making cost, improve the money making experience, improve the utilization rate of the spare payment, and the like.

FIG. 2 is a schematic diagram of an implementation environment, as shown in FIG. 2, including: at least one terminal 21 and a server 22, wherein the terminal 21 can be connected with the server 22 in a communication way, and at least one terminal 21 realizes information interchange through the server 22.

The terminal 21 may be any electronic product capable of performing human-Computer interaction with a user through one or more modes such as a keyboard, a touch pad, a touch screen, a remote controller, voice interaction or handwriting equipment, for example, a PC (Personal Computer), a mobile phone, a smart phone, a PDA (Personal Digital Assistant), a wearable device, a pocket PC (pocket PC), a tablet Computer, and the like.

The server 22 may be a server, a server cluster composed of a plurality of servers, or a cloud computing service center.

It should be understood by those skilled in the art that the terminal 21 and the server 22 are only examples, and other existing or future terminals or servers may be suitable for the present application, and are included within the scope of the present application and are herein incorporated by reference.

In order to facilitate understanding, the resource transfer method provided in the embodiment of the present application is described with fund as a resource and fund allocation as resource transfer.

Fig. 3 is a resource transfer method provided according to an exemplary embodiment, which may be applied to a terminal or a server in the above-described implementation environment. As shown in fig. 3, the method includes:

and 31, acquiring a plurality of resource transfer paths of the target resource.

And the terminal or the server acquires a plurality of resource transfer paths between the starting time and the ending time of the transfer of the target resource according to the target resource and takes the plurality of resource transfer paths as the target resource.

The target resource may be any resource that needs to be transferred, for example, a resource that needs to be transferred in a payment transaction, and the like. The transfer, start time and end time of different resources are different. And aiming at the determined target resource, the terminal or the server acquires the starting time and the ending time of the target resource transfer after analyzing the target resource. Furthermore, according to the starting time and the ending time of the target resource transfer, a plurality of stored resource transfer paths between the starting time and the ending time of the target resource transfer are directly acquired, and a plurality of resource transfer paths between the starting time and the ending time of the target resource transfer in other equipment can also be acquired.

And transferring the target resource according to the set of resource transfer paths by selecting one or more resource transfer paths. Wherein a resource transfer path may be understood as a transfer of a resource from one location to another.

Optionally, after performing step 31, the method provided in the embodiment of the present application further includes:

step a, acquiring the starting time or the ending time of each resource transfer path in a plurality of resource transfer paths.

The terminal or the server can obtain the starting time, the ending time and the weight of each resource transfer path, and then establish a database or a resource transfer model comprising a plurality of resource transfer paths according to the starting time, the ending time and the weight of each resource transfer path. When the terminal or the server obtains the start time or the end time of each resource transfer path in the later period, the start time or the end time can be directly obtained according to the resource transfer model.

The starting time of the resource transfer path refers to: an upstream location in each resource transfer path receives a time for the resource. The termination time of the resource transfer path refers to: downstream locations in each resource transfer path receive the time of the resource. Here, "upstream" and "downstream" are both defined based on the direction of circulation of the resource.

The weight refers to the importance of a factor or metric to the target resource. In an alternative embodiment, the method for obtaining the weight may be: and analyzing the target resource, determining an influence scheduling index, and converting the scheduling index into the weight of the target resource. Among them, the scheduling metrics include but are not limited to: time, cost, utilization of resources.

For the case where the resource is a fund, the "resource transfer path" corresponds to a "fund allocation path". Fig. 4 is a fund allocation model, which uses time as a horizontal axis and a rectangle as a fund allocation path, and sequentially includes a fund allocation path a, a fund allocation path b, a fund allocation path c, a fund allocation path d, a fund allocation path e, a fund allocation path f, a fund allocation path g, and a fund allocation path h from top to bottom. The length between the starting time and the ending time of the resource transfer path is the length of a rectangle.

When the fund needs to be transferred from the third-party payment account to the payment account of the receiving and paying user, the fund needs to be transferred from the third-party payment account to the deposit and management account, from the deposit and management account to the ACS account, from the ACS account to the internet connection and from the internet connection to the payment account of the receiving and paying user in sequence. Each account and each account can be regarded as a resource transfer path, and a set of transfer paths among a plurality of accounts and accounts can be regarded as a set of resource transfer paths.

And b, sequencing the resource transfer paths according to the sequence of the starting time or the ending time of each resource transfer path in the resource transfer paths to obtain the sequencing results of the resource transfer paths.

In scenario 1, when the weights of each resource transfer path are the same, the resource transfer paths may be sorted according to the sequence of the start time or the end time of each resource transfer path.

In scenario 2, when the weight of each resource transfer path is different, that is, when the weight is taken, the resource transfer paths may be sorted according to the sequence of the termination time of each resource transfer path, so as to accurately determine whether there is overlap between any two resource transfer paths. For example, the weight of some resource transfer paths is the age, and the weight of some resource transfer paths is the cost.

For example, as shown in fig. 5, the fund transfer model is a schematic diagram in which a plurality of fund transfer paths are sorted according to the sequence of termination time. The plurality of fund transfer paths sequentially comprise the following steps according to the sequence of termination time: a fund transfer path 1, a fund transfer path 2, a fund transfer path 3, a fund transfer path 4, a fund transfer path 5, a fund transfer path 6, a fund transfer path 7 and a fund transfer path 8.

And step 32, sequentially obtaining the weight of the compatible set of each resource transfer path based on the sequencing result of the plurality of resource transfer paths, wherein the compatible set of any resource transfer path is a set with the maximum weight in a set formed by mutually compatible paths, and the mutually compatible paths are paths which are not mutually overlapped in time in any resource transfer path and all resource transfer paths before any resource transfer path.

It should be noted that: in the embodiment of the present application, "resource transfer path" may be abbreviated as "path". Compatible means that the times of the paths do not overlap each other. The weight of a compatibility set refers to the sum of the weights of each path in the compatibility set.

The fact that the times do not overlap with each other means that: the termination time of one resource transfer path is less than or equal to the start time of another resource transfer path. For example, as shown in fig. 5, the ending time of the fund transfer path 1 is less than the starting time of the fund transfer path 6, and the time of the fund transfer path 1 and the fund transfer path 6 do not overlap with each other. The ending time of the fund transfer and allocation path 1 is equal to the starting time of the fund transfer and allocation path 4, the ending time of the fund transfer and allocation path 4 is equal to the starting time of the fund transfer and allocation path 8, and the time of the fund transfer and allocation path 1, the time of the fund transfer and allocation path 4 and the time of the fund transfer and allocation path 8 are not overlapped with each other.

Optionally, step 32 includes, but is not limited to, the following sub-steps:

step 321, for any resource transfer path, obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sequencing result of the plurality of resource transfer paths.

Wherein the first compatible set comprises: any resource transfer path and a third compatible set, wherein the third compatible set comprises a set with the maximum weight in a set formed by mutually compatible paths in the first set, and the first set comprises a set of all resource transfer path combinations which are before any resource transfer path and do not overlap with the time of any resource transfer path; the second compatibility set includes: a compatible set of resource transfer paths preceding any resource transfer path.

Optionally, before obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting result of the plurality of resource transfer paths, step 32 further includes:

step 32a, based on the sequencing result of the multiple resource transfer paths, obtaining the start time and the end time of any resource transfer path and each resource transfer path in all resource transfer paths before any resource transfer path.

The terminal or the server may obtain the start time and the end time of any resource transfer path and each resource transfer path in all resource transfer paths before any resource transfer path according to the resource transfer model.

And step 32b, acquiring a first set of all resource transfer paths which are not mutually overlapped with the time of any resource transfer path based on the starting time and the ending time of any resource transfer path and each resource transfer path in all resource transfer paths before any resource transfer path.

The terminal or the server may obtain, as the first set, a set of all resource transfer paths that are located before any resource transfer path and that do not overlap with any resource transfer path in time, according to the start time and the end time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path.

For example, as shown in fig. 5, the fund transfer path that does not overlap with the time of the fund transfer path 8 includes: a fund transfer path 5, a fund transfer path 4, a fund transfer path 3, a fund transfer path 2, a fund transfer path 1, then the first set of fund transfer paths 8 may be {1,2,3,4,5 }.

And step 32c, acquiring a third compatible set with the maximum weight in the set formed by the mutually compatible paths in the first set.

There may be a plurality of sets formed by the mutually compatible paths in the first set, the weights corresponding to each set are different, and the set with the largest weight in the sets formed by the mutually compatible paths in the first set is taken as a third compatible set.

step 32A, based on the sequencing result of the multiple resource transfer paths, obtaining the start time and the end time of each resource transfer path in all the resource transfer paths before any resource transfer path.

The execution method of step 32A is similar to that of step 32A, and is not described herein again.

And step 32B, acquiring a second compatible set based on the starting time and the ending time of each resource transfer path in all the resource transfer paths before any resource transfer path.

The second compatible set is the compatible set of the resource transfer paths preceding any resource transfer path.

322, acquiring the weight of the compatible set of any resource transfer path according to the following formula based on the weight of the first compatible set and the weight of the second compatible set;

wherein j is the jth resource transfer path; v. of_jTransferring the weight of the path for the jth resource; OPT (p (j)) is a weight of a third compatibility set, the third compatibility set comprising: the set with the largest weight in the set formed by the paths compatible with each other and the jth resource transfer path in the

resource transfer paths

1,2, … … and j-1; v. of_j+ OPT (p (j)) is the weight of the first compatibility set; the OPT (j-1) is a weight of a second compatibility set, the second compatibility set comprising: the set with the largest weight in the set formed by the mutually compatible paths in the

resource transfer paths

For example, when j is 1, OPT (1) is v₁；

When j is 2, OPT (2) is max { v ═ 2₂+OPT(0)，v₁}＝max{v₂，v₁}；

……。

Further, it may be determined whether the compatible set of the jth resource transfer path contains the jth resource transfer path according to the following two scenarios:

scene 1: if the jth resource transfer path is selected, these resource transfer paths { p (i) +1, p (i) +2, … … } are not used, and the compatible set of jth resource transfer paths is included in {1,2, … …, p (i) }.

As shown in fig. 5, if the compatible set of the fund allocation path 6 includes the fund allocation path 6, and the closest and compatible to the fund allocation path 6 is the fund allocation path 2, then { p (2) +1 ═ 3, p (2) +2 ═ 4, … … } is not included in the compatible set of the fund allocation path 6. The compatible set of funds transfer path 6 is contained in {1,2, … …, p (i), j }.

Scene 2: if the jth resource transfer path is not selected, then the compatible set of jth resource transfer paths is included in {1,2, … …, j-1 }.

It will be appreciated that when the weight v of the first compatibility set is_jWhen + OPT (P (j)) is greater than the weight OPT (j-1) of the second compatibility set, the weight v of the first compatibility set_j+ OPT (p (j)) is the weight of the compatible set of any resource transfer path, and the first compatible set is the compatible set of any resource transfer path. When the weight v of the first compatibility set_jWhen + OPT (p (j)) is smaller than the weight OPT (j-1) of the second compatible set, the weight OPT (j-1) of the second compatible set is the weight of the compatible set of any resource transfer path, and the second compatible set is the compatible set of any resource transfer path.

In the compatible set of any resource transfer path, the multiple paths do not overlap with each other, and after the multiple paths are sequenced according to the time sequence, a continuous total resource transfer path can be formed, or discontinuous multiple paths can be formed, so that the resources can be transferred.

And step 33, taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as a target compatible set, and transferring the target resources based on the target compatible set.

When the terminal or the server acquires the compatible set of any resource transfer path according to the step 32, the weight of the compatible set is stored at the same time, so that the terminal or the server can efficiently acquire the target compatible set with the maximum weight in the later period.

As shown in fig. 6, taking the compatible set of the fund transfer path 8 as an example, the terminal and the server gradually obtain the compatible set of the fund transfer path 8 based on step 32, and store the weight:

OPT(8)＝max{v₈+OPT(5)，v₇}＝max{v₈+max[v₅，v₄]，v₇}＝max{v₈+max[v₅，max(v₄+v₁，v₃)]，v₇if v is₄+v₁Greater than v₃And v is₄+v₁Greater than v₅，v₈+v₄+v₁Greater than v₇Then, the set {1,4,8} formed by the fund allocation path 1, the fund allocation path 4 and the fund allocation path 8 is used as the compatible set of the fund allocation path 8, and the weight thereof is the maximum, and the compatible set of the fund allocation path 8 is used as the target compatible set, and the weight of the target compatible set is v₁+v₄+v₈。

Optionally, transferring the target resource based on the target compatible set includes, but is not limited to, the following sub-steps:

step 331, determining the start time and the end time of each resource transfer path in the target compatible set.

When the terminal or the server acquires the weight of the compatible set of any resource transfer path, the corresponding first compatible set or second compatible set is stored at the same time, and after the target compatible set is determined, the starting time and the ending time of each resource transfer path in the corresponding first compatible set or second compatible set can be acquired correspondingly.

Step 332, transferring the target resource based on the starting time and the ending time of each resource transfer path in the target compatible set.

And the terminal or the server executes all the resource transfer paths according to the starting time and the ending time of each resource transfer path in the target compatible set and the sequence of time so as to realize the transfer of the target resources.

According to the resource transfer method provided by the embodiment of the application, the weight of the compatible set of each resource transfer path is sequentially acquired based on the sequencing results of the plurality of resource transfer paths, so that the incompatible set can be prevented from being processed, any resource transfer path can be prevented from being subjected to multiple identical processes, the timeliness and the accuracy of resource transfer are improved, the influence of the resource transfer paths with the weight is avoided, and the application range of the method is expanded. By taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as the target compatible set, the target resources can be accurately transferred based on the target compatible set, and the utilization rate of the target resources is improved.

Further, the complexity of the search time of the cyclic brute force dialing algorithm provided by the related art is O (n × n), and the complexity of the time of the resource transfer method provided by the embodiment of the present application is O (n × logn). If the initial sequences of the corresponding multiple resource transfer paths during the target resource transfer are the sequences sequenced according to the termination time, the time complexity can be reduced to O (n), the time complexity of the method is low, and the timeliness and the accuracy of the target resource transfer can be improved.

On the premise that the weight is a unit value, a greedy scheduling algorithm provided by the related art can acquire an optimal resource transfer path set, but in a resource transfer path with weight (the weights of a plurality of resource transfer tasks are respectively different), the optimal resource transfer path set cannot be acquired, so that the resource utilization rate cannot reach the optimal value. The resource transfer method provided by the embodiment of the application is not influenced by the resource transfer path with the weight, and the optimal compatible resource transfer path set can be obtained, so that the resource utilization rate is optimal.

For the resource being the reserve payment of the third party payment mechanism, fig. 7 shows a functional architecture diagram of a fund transfer service + payment gateway, as shown in fig. 7, the fund transfer service includes: the method comprises the following steps of allocating engines (the allocating engines comprise order management, transaction distribution and order inquiry), allocation timing tasks, allocation rule configuration, allocation monitoring, account basic information (the account basic information comprises ACS, a first internet connection, a first bank, a second bank, a third bank, a fourth bank, a second bank and a fifth bank), and other services (other services comprise takeaway, intelligent payment and the like). The payment includes a payment product and a payment core, wherein the payment product includes: payment by agency, cash withdrawal, card verification, refund, card verification and fund transfer. The payment core comprises: payment transaction engine (payment transaction engine includes order management, transaction distribution, order query, etc.), list configuration (list configuration includes acceptance blacklist), CALLER (visitor) information (CALLER information includes withdrawal, check card, payment by agency, refund, fund transfer, etc.), and payment monitoring. The payment gateway includes: the system comprises a gateway engine (the gateway engine comprises order management, order inquiry, transaction distribution and bill inquiry), payment routing, channel queuing management, channel capacity configuration, bank merchant numbers, gateway monitoring and bank channels (the bank channels comprise a first internet connection full channel and a first bank connection, wherein the first internet connection full channel comprises a first bank connection extranet, a first bank connection full channel, a first bank extranet, a second internet connection full channel, a third bank connection and the like. By means of mutual matching of various functions in the fund transfer service, payment and payment gateway and the resource transfer method provided by the embodiment of the application, effective fund transfer can be achieved.

Fig. 8 is a schematic structural diagram illustrating a resource transfer apparatus according to an exemplary embodiment, where, as shown in fig. 8, the apparatus includes:

the first obtaining module 81 is configured to obtain a plurality of resource transfer paths of the target resource.

A second obtaining module 82, configured to sequentially obtain, based on a sorting result of the multiple resource transfer paths, a weight of a compatible set of each resource transfer path, where the compatible set of any resource transfer path is a set with a largest weight in a set formed by mutually compatible paths, and the mutually compatible paths are paths in which time does not overlap with each other in any resource transfer path and all resource transfer paths before any resource transfer path.

The transferring module 83 is configured to use a compatible set with the largest weight in the compatible sets of each resource transferring path as a target compatible set, and transfer the target resource based on the target compatible set.

Optionally, as shown in fig. 9, the second obtaining module 82 includes:

a first obtaining unit 91, configured to obtain, for any resource transfer path, a weight of the first compatible set and a weight of the second compatible set of any resource transfer path based on an ordering result of the plurality of resource transfer paths.

A second obtaining unit 92, configured to obtain a weight of a compatible set of any resource transfer path according to the following formula based on the weight of the first compatible set and the weight of the second compatible set;

resource transfer paths

Optionally, as shown in fig. 10, before the first obtaining unit 91 performs obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting result of the plurality of resource transfer paths, the second obtaining module 82 further includes:

a third obtaining unit 101, configured to obtain, based on a sorting result of the multiple resource transfer paths, a start time and an end time of any resource transfer path and each resource transfer path in all resource transfer paths before any resource transfer path.

A fourth obtaining unit 102, configured to obtain a first set of all resource transfer paths that do not overlap with a time of any resource transfer path based on a start time and an end time of each resource transfer path in any resource transfer path and all resource transfer paths before any resource transfer path.

A fifth obtaining unit 103, configured to obtain a third compatible set with a largest weight in a set composed of mutually compatible paths in the first set.

Optionally, as shown in fig. 11, before the first obtaining unit 91 performs obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the sorting result of the plurality of resource transfer paths, the second obtaining module 82 further includes:

a sixth obtaining unit 111, configured to obtain, based on a sorting result of the multiple resource transfer paths, a start time and an end time of each resource transfer path in all resource transfer paths before any resource transfer path;

a seventh obtaining unit 112, configured to obtain the second compatible set based on the start time and the end time of each resource transfer path in all resource transfer paths before any resource transfer path.

Alternatively, as shown in fig. 12, the transfer module 83 includes:

a first determining unit 121, configured to determine a start time and an end time of each resource transfer path in the target compatible set.

A transferring unit 122, configured to transfer the target resource based on the start time and the end time of each resource transfer path in the target compatible set.

Optionally, as shown in fig. 13, before the first obtaining module 81 executes the multiple resource transfer paths for obtaining the target resource, the apparatus provided in the embodiment of the present application further includes:

a third obtaining module 131, configured to obtain a start time or an end time of each resource transfer path in the multiple resource transfer paths.

The fourth obtaining module 132 is configured to sort the multiple resource transfer paths according to the sequence of the start time or the end time of each resource transfer path in the multiple resource transfer paths, so as to obtain a result of sorting the multiple resource transfer paths.

According to the resource transfer device provided by the embodiment of the application, the weight of the compatible set of each resource transfer path is sequentially obtained based on the sequencing results of the plurality of resource transfer paths, so that the incompatible set can be prevented from being processed, any resource transfer path can be prevented from being subjected to multiple identical processes, the timeliness and the accuracy of resource transfer are improved, the influence of the resource transfer paths with the weight is avoided, and the application range of the method is expanded. By taking the compatible set with the maximum weight in the compatible sets of each resource transfer path as the target compatible set, the target resources can be accurately transferred based on the target compatible set, and the utilization rate of the target resources is improved.

Referring to fig. 14, a schematic structural diagram of a terminal 1400 of a resource transfer method provided by an embodiment of the present disclosure is shown. The terminal 1400 may be a portable mobile terminal such as: a smart phone, a tablet computer, an MP3 player (Moving Picture Experts Group Audio Layer III, motion video Experts compression standard Audio Layer 3), an MP4 player (Moving Picture Experts Group Audio Layer IV, motion video Experts compression standard Audio Layer 4), a notebook computer, or a desktop computer. Terminal 1400 can also be referred to as user equipment, a portable terminal, a laptop terminal, a desktop terminal, or other names.

In general, terminal 1400 includes: a processor 1401, and a memory 1402.

Processor 1401 may include one or more processing cores, such as a 4-core processor, a 7-core processor, and so forth. The processor 1401 may be implemented in at least one hardware form of DSP (Digital Signal Processing), FPGA (Field-Programmable Gate Array), and PLA (Programmable Logic Array). Processor 1401 may also include a main processor and a coprocessor, where the main processor is a processor for processing data in an awake state, and is also referred to as a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 1401 may be integrated with a GPU (Graphics Processing Unit), which is responsible for rendering and drawing content that the display screen needs to display. In some embodiments, processor 1401 may further include an AI (Artificial Intelligence) processor for processing computing operations related to machine learning.

Memory 1402 may include one or more computer-readable storage media, which may be non-transitory. Memory 1402 may also include high speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 1402 is used to store at least one instruction for execution by processor 1401 to implement the method of resource transfer provided by the method embodiments herein.

In some embodiments, terminal 1400 may further optionally include: a peripheral device interface 1403 and at least one peripheral device. The processor 1401, the memory 1402, and the peripheral device interface 1403 may be connected by buses or signal lines. Each peripheral device may be connected to the peripheral device interface 1403 via a bus, signal line, or circuit board. Specifically, the peripheral device includes: at least one of radio frequency circuitry 1404, a display 1405, a camera 1406, audio circuitry 1407, a positioning component 1408, and a power supply 1409.

The peripheral device interface 1403 can be used to connect at least one peripheral device related to I/O (Input/Output) to the processor 1401 and the memory 1402. In some embodiments, the processor 1401, memory 1402, and peripheral interface 1403 are integrated on the same chip or circuit board; in some other embodiments, any one or both of the processor 1401, the memory 1402, and the peripheral device interface 1403 may be implemented on a separate chip or circuit board, which is not limited in this embodiment.

The Radio Frequency circuit 1404 is used for receiving and transmitting RF (Radio Frequency) signals, also called electromagnetic signals. The radio frequency circuitry 1404 communicates with communication networks and other communication devices via electromagnetic signals. The rf circuit 1404 converts an electrical signal into an electromagnetic signal to transmit, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 1404 includes: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and so forth. The radio frequency circuit 1404 may communicate with other terminals via at least one wireless communication protocol. The wireless communication protocols include, but are not limited to: metropolitan area networks, various generation mobile communication networks (2G, 3G, 4G, and 5G), Wireless local area networks, and/or WiFi (Wireless Fidelity) networks. In some embodiments, the radio frequency circuit 1404 may further include NFC (Near Field Communication) related circuits, which are not limited in this application.

The display screen 1405 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display screen 1405 is a touch display screen, the display screen 1405 also has the ability to capture touch signals at or above the surface of the display screen 1405. The touch signal may be input to the processor 1401 for processing as a control signal. At this point, the display 1405 may also be used to provide virtual buttons and/or virtual keyboards, also referred to as soft buttons and/or soft keyboards. In some embodiments, the display 1405 may be one, providing the front panel of the terminal 1400; in other embodiments, display 1405 may be at least two, respectively disposed on different surfaces of terminal 1400 or in a folded design; in still other embodiments, display 1405 may be a flexible display disposed on a curved surface or on a folded surface of terminal 1400. Even further, the display 1405 may be arranged in a non-rectangular irregular figure, i.e., a shaped screen. The Display 1405 can be made of LCD (Liquid Crystal Display), OLED (Organic Light-Emitting Diode), and the like.

The camera assembly 1406 is used to capture images or video. Optionally, camera assembly 1406 includes a front camera and a rear camera. Generally, a front camera is disposed at a front panel of the terminal, and a rear camera is disposed at a rear surface of the terminal. In some embodiments, the number of the rear cameras is at least two, and each rear camera is any one of a main camera, a depth-of-field camera, a wide-angle camera and a telephoto camera, so that the main camera and the depth-of-field camera are fused to realize a background blurring function, and the main camera and the wide-angle camera are fused to realize panoramic shooting and VR (Virtual Reality) shooting functions or other fusion shooting functions. In some embodiments, camera assembly 1406 may also include a flash. The flash lamp can be a monochrome temperature flash lamp or a bicolor temperature flash lamp. The double-color-temperature flash lamp is a combination of a warm-light flash lamp and a cold-light flash lamp, and can be used for light compensation at different color temperatures.

The audio circuit 1407 may include a microphone and a speaker. The microphone is used for collecting sound waves of a user and the environment, converting the sound waves into electric signals, and inputting the electric signals to the processor 1401 for processing or inputting the electric signals to the radio frequency circuit 1404 to realize voice communication. For stereo capture or noise reduction purposes, multiple microphones may be provided, each at a different location of terminal 1400. The microphone may also be an array microphone or an omni-directional pick-up microphone. The speaker is then used to convert electrical signals from the processor 1401 or the radio frequency circuit 1404 into sound waves. The loudspeaker can be a traditional film loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, the speaker can be used for purposes such as converting an electric signal into a sound wave audible to a human being, or converting an electric signal into a sound wave inaudible to a human being to measure a distance. In some embodiments, the audio circuit 1407 may also include a headphone jack.

The positioning component 1408 serves to locate the current geographic position of the terminal 1400 for navigation or LBS (location based Service). The positioning component 1408 may be a positioning component based on the GPS (global positioning System) of the united states, the beidou System of china, the graves System of russia, or the galileo System of the european union.

Power supply 1409 is used to power the various components of terminal 1400. The power source 1409 may be alternating current, direct current, disposable or rechargeable. When the power source 1409 comprises a rechargeable battery, the rechargeable battery can support wired or wireless charging. The rechargeable battery may also be used to support fast charge technology.

In some embodiments, terminal 1400 also includes one or more sensors 1410. The one or more sensors 1410 include, but are not limited to: acceleration sensor 1411, gyroscope sensor 1412, pressure sensor 1413, fingerprint sensor 1414, optical sensor 1415, and proximity sensor 1416.

The acceleration sensor 1411 may detect the magnitude of acceleration on three coordinate axes of a coordinate system established with the terminal 1400. For example, the acceleration sensor 1411 may be used to detect components of the gravitational acceleration in three coordinate axes. The processor 1401 can control the display 1405 to display a user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 1411. The acceleration sensor 1411 may also be used for the acquisition of motion data of a game or a user.

The gyro sensor 1412 may detect a body direction and a rotation angle of the terminal 1400, and the gyro sensor 1412 and the acceleration sensor 1411 may cooperate to collect a 3D motion of the user on the terminal 1400. The processor 1401 can realize the following functions according to the data collected by the gyro sensor 1412: motion sensing (such as changing the UI according to a user's tilting operation), image stabilization at the time of photographing, game control, and inertial navigation.

Pressure sensors 1413 may be disposed on the side frames of terminal 1400 and/or underlying display 1405. When the pressure sensor 1413 is disposed on the side frame of the terminal 1400, the user's holding signal of the terminal 1400 can be detected, and the processor 1401 performs left-right hand recognition or shortcut operation according to the holding signal collected by the pressure sensor 1413. When the pressure sensor 1413 is disposed at the lower layer of the display screen 1405, the processor 1401 controls the operability control on the UI interface according to the pressure operation of the user on the display screen 1405. The operability control comprises at least one of a button control, a scroll bar control, an icon control and a menu control.

The fingerprint sensor 1414 is used for collecting a fingerprint of a user, and the processor 1401 identifies the user according to the fingerprint collected by the fingerprint sensor 1414, or the fingerprint sensor 1414 identifies the user according to the collected fingerprint. Upon recognizing that the user's identity is a trusted identity, processor 1401 authorizes the user to perform relevant sensitive operations including unlocking the screen, viewing encrypted information, downloading software, paying for, and changing settings, etc. Fingerprint sensor 1414 may be disposed on the front, back, or side of terminal 1400. When a physical button or vendor Logo is provided on terminal 1400, fingerprint sensor 1414 may be integrated with the physical button or vendor Logo.

The optical sensor 1415 is used to collect ambient light intensity. In one embodiment, processor 1401 may control the display brightness of display 1405 based on the ambient light intensity collected by optical sensor 1415. Specifically, when the ambient light intensity is high, the display luminance of the display screen 1405 is increased; when the ambient light intensity is low, the display brightness of the display screen 1405 is reduced. In another embodiment, the processor 1401 can also dynamically adjust the shooting parameters of the camera assembly 1406 according to the intensity of the ambient light collected by the optical sensor 1415.

Proximity sensor 1416, also known as a distance sensor, is typically disposed on the front panel of terminal 1400. The proximity sensor 1416 is used to collect the distance between the user and the front surface of the terminal 1400. In one embodiment, when proximity sensor 1416 detects that the distance between the user and the front face of terminal 1400 is gradually decreased, processor 1401 controls display 1405 to switch from a bright screen state to a dark screen state; when proximity sensor 1416 detects that the distance between the user and the front face of terminal 1400 is gradually increasing, display 1405 is controlled by processor 1401 to switch from the sniff state to the brighten state.

Those skilled in the art will appreciate that the configuration shown in fig. 14 is not intended to be limiting with respect to terminal 1400 and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components may be employed.

Fig. 15 is a schematic structural diagram of a server 1500 according to an embodiment of the present application, where the server 1500 may generate a relatively large difference due to different configurations or performances, and may include one or more processors (CPUs) 1501 and one or more memories 1502, where at least one instruction is stored in the memory 1502, and the at least one instruction is loaded and executed by the processor 1501 to implement the resource transfer method provided by each method embodiment. Of course, the server may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input/output, and the server may also include other components for implementing the functions of the device, which are not described herein again.

In an example embodiment, a computer device is also provided, the computer device comprising a processor and a memory, the memory having at least one instruction stored therein. At least one instruction is configured to be executed by one or more processors to implement any of the above-described resource transfer methods.

In an exemplary embodiment, a computer-readable storage medium is also provided, in which at least one instruction is stored, the at least one instruction, when executed by a processor of a computer device, implementing any of the above-described resource transfer methods.

Alternatively, the computer-readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

All the above optional technical solutions may adopt any combination form to disclose the optional embodiments, and are not described herein again.

The above description is only exemplary of the present application and should not be taken as limiting the scope of the present application, and any modifications, equivalents, improvements and the like that are within the spirit and principle of the present application should be included in the scope of the present application.

Claims

1. A method of resource transfer, the method comprising:

acquiring a plurality of resource transfer paths of a target resource;

2. The method according to claim 1, wherein the obtaining the weight of the compatible set of each resource transfer path based on the ordering result of the plurality of resource transfer paths comprises:

wherein j is the jth resource transfer path; v. of_jTransferring a weight for the jth resource; OPT (p (j)) is a weight of a third compatibility set, the third compatibility set comprising: resource transfer paths 1,2, … …, j-1 compatible with each other and with the jth resource transfer pathThe set with the largest weight; v. of_j+ OPT (p (j)) is the weight of the first compatibility set; OPT (j-1) is a weight of the second compatibility set, the second compatibility set comprising: the set with the largest weight in the set formed by the mutually compatible paths in the resource transfer paths 1,2, … … and j-1; opt (j) is the weight of the compatible set of the jth resource transfer path.

3. The method according to claim 2, wherein before obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the ordering result of the plurality of resource transfer paths, further comprising:

4. The method according to claim 2, wherein before obtaining the weight of the first compatible set and the weight of the second compatible set of any resource transfer path based on the ordering result of the plurality of resource transfer paths, further comprising:

5. The method of any of claims 1-4, wherein transferring the target resource based on the target compatible set comprises:

6. The method according to any one of claims 1-4, wherein after obtaining the plurality of resource transfer paths for the target resource, the method further comprises:

7. An apparatus for resource transfer, the apparatus comprising:

8. The apparatus of claim 7, wherein the second obtaining module comprises:

wherein j is the jth resource transfer path; v. of_jTransferring a weight for the jth resource; OPT (p (j)) is a weight of a third compatibility set, the third compatibility set comprising: the set with the largest weight in the set formed by the paths compatible with each other and the jth resource transfer path in the resource transfer paths 1,2, … …, j-1; v. of_j+ OPT (p (j)) is the weight of the first compatibility set; OPT (j-1) is a weight of the second compatibility set, the second compatibility set comprising: the set with the largest weight in the set formed by the mutually compatible paths in the resource transfer paths 1,2, … … and j-1; opt (j) is the weight of the compatible set of the jth resource transfer path.

9. An apparatus for resource transfer, the apparatus comprising a processor and a memory, the memory having stored therein at least one instruction that is loaded and executed by the processor to implement the method for resource transfer as claimed in any one of claims 1-6.

10. A computer-readable storage medium having stored therein at least one instruction which is loaded and executed by a processor to implement the method of resource transfer as claimed in any one of claims 1 to 6.