Banknote screening method, device and equipment and storage medium

Abstract

The application relates to the technical field of finance, and discloses a banknote screening method, device, equipment and storage medium, the method comprising the following steps: determining a to-be-supplemented amount value according to a standard amount value and a current related amount value of a target user; when the to-be-supplemented amount value is greater than a preset threshold value, obtaining amount values corresponding to each banknote of the target user; sequentially arranging each banknote of the target user according to the amount values to obtain a banknote set; and obtaining a reference banknote group from the banknote set according to the to-be-supplemented amount value. According to the application, when the to-be-supplemented amount value is greater than the threshold value, the amount values corresponding to each banknote of the user are automatically obtained, and the banknotes are sorted according to the amount values, so that the reference banknote group can be determined from the sorted banknote set, and compared with the existing manual banknote selection method, the efficiency of banknote screening combination is improved.

Description

Technical Field

[0001] This invention relates to the field of financial technology, and in particular to a method, apparatus, device, and storage medium for screening bank bills. Background Technology

[0002] A bank acceptance bill is a type of bank negotiable instrument, which is a bill issued by an accepting bank and accepted by the bank after review, guaranteeing unconditional payment of a specified amount to the payee or holder on a designated date. Bank acceptance bills enable online transactions and financial transactions such as bill-backed loans. Therefore, banks or fund providers wishing to purchase bills can screen the accepting bills held by the holders according to their own business needs, finding a combination of bills that meets their requirements.

[0003] However, since the amount and quantity of accepted bills vary greatly among different bill holders, the screening criteria for bills corresponding to the business needs of the pre-purchasers also vary. The existing screening and combination methods for accepted bills can only rely on manual processing, which is inefficient.

[0004] Therefore, there is an urgent need for a bank bill screening method to solve the technical problem of how to effectively improve the efficiency of bank bill screening. Summary of the Invention

[0005] The main objective of this invention is to provide a method, apparatus, equipment, and storage medium for screening bank bills, aiming to solve the technical problem that existing methods for screening and combining accepted bills rely solely on manual labor, resulting in slow bill screening speed.

[0006] To achieve the above objectives, the present invention provides a method for screening bank bills, the method comprising the following steps:

[0007] The amount to be filled is determined based on the standard amount and the target user's current relevant amount.

[0008] When the amount to be filled is greater than a preset threshold, the amount corresponding to each ticket of the target user is obtained;

[0009] Arrange the tickets of the target user in order of their monetary value to obtain an arranged ticket set;

[0010] A reference bill combination is obtained from the arranged bill set based on the amount to be filled.

[0011] Optionally, obtaining a reference note combination based on the amount to be filled in the arranged note set includes:

[0012] Obtain the number of tickets in the arranged ticket set, and combine it with the amount to be filled to construct an improved knapsack problem model;

[0013] Solve the improved knapsack problem model and obtain a set of reference ticket combinations based on the model solution results.

[0014] Optionally, obtaining the number of tickets in the arranged ticket set and combining it with the amount to be filled to construct an improved back knapsack problem model includes:

[0015] Abstract each ticket in the arranged ticket set into an object to be packed, and abstract the knapsack capacity based on the amount to be filled, and construct an improved knapsack problem model.

[0016] Solving the improved knapsack problem model and obtaining a reference ticket combination based on the model solution results includes:

[0017] The improved knapsack problem model is solved using a dynamic programming algorithm, and a set of reference ticket combinations is obtained based on the solution results.

[0018] Optionally, the formula expression for the improved back knapsack problem model is:

[0019]

[0020] Among them, a i Let y be the amount corresponding to each bill, n be the number of bills in the arranged bill set, and y be the amount of each bill. i Retain tickets for the arranged ticket set, where S(a) is the total ticket amount of the target user, and M is the amount to be filled;

[0021] The improved knapsack problem model is solved using a dynamic programming algorithm, and a reference ticket combination set is obtained based on the model solution results, including:

[0022] The improved knapsack problem model is solved using a dynamic programming algorithm, and a reference set of ticket combinations is obtained by retaining tickets from the permuted ticket set.

[0023] Optionally, after solving the improved knapsack problem model using a dynamic programming algorithm and obtaining a reference set of ticket combinations based on the tickets retained in the permutation set, the process includes:

[0024] Extract the candidate tickets from the reference ticket combination set, and construct a search tree structure based on the candidate tickets;

[0025] The target ticket combination is determined by traversing the reference ticket combination set of the search tree structure using a backtracking algorithm.

[0026] Optionally, after arranging the tickets for the target user in order of their monetary value to obtain an arranged ticket set, the process includes:

[0027] Obtain the amount value corresponding to the first-order ticket in the arranged ticket set to obtain the minimum ticket amount for the target user;

[0028] Compare the minimum value of the invoice amount with the value of the amount to be filled;

[0029] When the minimum value of the bill amount is greater than the amount to be filled, the bill corresponding to the minimum value of the bill amount is determined as the target bill.

[0030] Optionally, after determining the amount to be filled based on the standard amount and the target user's current relevant amount, the process includes:

[0031] Obtain the total invoice amount of the target user and compare the total invoice amount of the target user with the amount to be filled;

[0032] When the total amount of the bills for the target user is less than the amount to be filled, all the bills for the target user are determined to be the target bills.

[0033] In addition, to achieve the above objectives, the present invention also proposes a bank bill screening device, the device comprising: a difference calculation module, a face value acquisition module, a bill sorting module, and a combination determination module;

[0034] The difference calculation module is used to determine the amount to be filled based on the standard amount and the target user's current relevant amount.

[0035] The face value acquisition module is used to acquire the amount value corresponding to each bill of the target user when the amount to be filled is greater than a preset threshold.

[0036] The ticket sorting module is used to sort the tickets of the target user in order of their monetary value to obtain a sorted ticket set;

[0037] The combination determination module is used to obtain a reference combination of bills in the arranged bill set based on the amount to be filled.

[0038] In addition, to achieve the above objectives, the present invention also proposes a bank bill screening device, which includes a memory, a processor, and a bank bill screening program stored in the memory and executable on the processor. The bank bill screening program is configured to implement the bank bill screening method described above.

[0039] In addition, to achieve the above objectives, the present invention also proposes a storage medium storing a bank bill screening program, which, when executed by a processor, implements the bank bill screening method as described above.

[0040] This invention determines the amount to be filled based on a standard amount and the target user's current relevant amount. When the amount to be filled exceeds a preset threshold, it acquires the amount corresponding to each of the target user's tickets. The tickets are then arranged in order of their amount values ​​to obtain a sorted ticket set. Finally, a reference ticket combination is obtained from the sorted ticket set based on the amount to be filled. Because this invention automatically acquires the amount corresponding to each user's ticket when the amount to be filled exceeds a threshold and sorts the tickets based on their amount values, a reference ticket combination can be determined from the sorted ticket set. Compared to existing manual ticket selection methods, this improves the efficiency of ticket selection and combination. Attached Figure Description

[0041] Figure 1 This is a schematic diagram of the structure of a bank bill screening device in the hardware operating environment involved in the embodiments of the present invention;

[0042] Figure 2 This is a flowchart illustrating the first embodiment of the bank bill screening method of the present invention;

[0043] Figure 3 This is a flowchart illustrating the second embodiment of the bank bill screening method of the present invention;

[0044] Figure 4 A schematic diagram of the search tree structure constructed for solving the knapsack problem;

[0045] Figure 5 This is a flowchart illustrating the third embodiment of the bank bill screening method of the present invention;

[0046] Figure 6 This is a structural block diagram of the first embodiment of the bank bill screening device of the present invention.

[0047] The realization of the objective, functional features and advantages of the present invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0048] It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of the invention.

[0049] Reference Figure 1 , Figure 1 This is a schematic diagram of the structure of a bank bill screening device in the hardware operating environment involved in the embodiments of the present invention.

[0050] like Figure 1As shown, the bank note screening device may include: a processor 1001, such as a central processing unit (CPU), a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and an input unit such as a keyboard; optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wireless-Fidelity (Wi-Fi) interface). The memory 1005 may be high-speed random access memory (RAM) or stable non-volatile memory (NVM), such as a disk storage device. Optionally, the memory 1005 may also be a storage device independent of the aforementioned processor 1001.

[0051] Those skilled in the art will understand that Figure 1 The structure shown does not constitute a limitation on bank bill screening equipment and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0052] like Figure 1 As shown, the memory 1005, which serves as a storage medium, may include an operating system, a network communication module, a user interface module, and a bank bill screening program.

[0053] exist Figure 1 In the bank bill screening device shown, the network interface 1004 is mainly used for data communication with the network server; the user interface 1003 is mainly used for data interaction with the user; the processor 1001 and the memory 1005 in the bank bill screening device of the present invention can be set in the bank bill screening device, and the bank bill screening device calls the bank bill screening program stored in the memory 1005 through the processor 1001 and executes the bank bill screening method provided in the embodiment of the present invention.

[0054] This invention provides a method for screening bank bills, referring to... Figure 2 , Figure 2 This is a flowchart illustrating the first embodiment of the bank bill screening method of the present invention.

[0055] In this embodiment, the bank bill screening method includes the following steps:

[0056] Step S10: Determine the amount to be filled based on the standard amount and the target user's current relevant amount.

[0057] It should be noted that the method in this embodiment can be applied in scenarios where bank drafts need to be screened to obtain a combination of drafts that meet current business needs, or in other scenarios where draft screening is required for draft management. The executing entity of this embodiment can be a computing service device with draft screening, data processing, network communication, and program execution functions, such as a personal computer, tablet computer, or draft screening device, or other electronic devices that perform the same or similar functions. The following description uses the aforementioned bank draft screening device (hereinafter referred to as the screening device) as an example to illustrate this embodiment and the following embodiments.

[0058] Understandably, the specific implementation process of this embodiment can be illustrated by taking the scenario of ensuring the balance of the account rights pool by screening the bills held by the bill holder, i.e., the user. Balancing the account rights pool can be a process by which a bank manages the bank acceptance bills held by a user to ensure that the maximum amount the bank can finance under this financing transaction is not less than the amount of the user's collateral. Specifically, the maximum amount the bank can finance and the amount of the user's collateral can be considered as the user's account rights pool under this financing transaction. When the maximum amount the bank can finance is less than the amount of the user's collateral, in order to reduce risk, a combination of bills can be screened from multiple bank acceptance bills held by the user to obtain a combination of bills used to make up the difference in the balance.

[0059] It is understandable that the target user can be a user who currently conducts this financing business with the bank, that is, the target user can be a holder of multiple bank acceptance bills.

[0060] It should be noted that the above standard amount value may be the maximum amount that the target user can finance under this financing business, the above current relevant amount value may be the total amount of the target user's collateral already pledged at the current bank, and the amount to be filled may be the difference between the standard amount value and the relevant amount value, which can be regarded as the specific value of the above water level balance difference.

[0061] In practice, when the screening device obtains the maximum amount of financing available from the bank for the user's current financing business and determines the total amount of the user's collateral already pledged at the current bank, it determines the amount to be filled by calculating the difference between the two amounts. This gives the specific value of the balance difference in the user's account equity pool at the current bank, so that the user's bank acceptance bills can be screened based on the balance difference.

[0062] Step S20: When the amount to be filled is greater than a preset threshold, obtain the amount value corresponding to each ticket of the target user.

[0063] Understandably, the amount to be filled can be calculated as: Amount to be filled = Standard amount - Target user's current relevant amount.

[0064] Understandably, this preset threshold can be a critical condition value pre-set by the bank to determine whether to screen bank acceptance bills for users. For example, considering risk factors, it is necessary to ensure that the maximum amount a user can be financed by the bank under this financing business is not less than the amount of the user's collateral, so this preset threshold can be set to 0 or any positive value.

[0065] It should be noted that since the above-mentioned amount to be filled can be the difference between the standard amount and the target user's current relevant amount, when the amount to be filled is less than the preset threshold, it means that the user's maximum bank financing amount is less than the amount of the user's pledged collateral. In this case, the risk of the bank undertaking the user's financing business is low, so the bank does not need to screen bills from the user's bank acceptance bills.

[0066] It should be noted that when the amount to be filled is greater than or equal to the preset threshold, it means that the user's maximum bank financing amount is greater than or equal to the amount of the user's pledged collateral. In this case, the bank assumes the risk of the user's financing business. Therefore, the bank needs to screen bills from the user's bank acceptance bills to fill the water level balance difference and thus reduce the risk.

[0067] Understandably, since the target user can be a holder of multiple bank acceptance bills, they can hold several bills with varying face values. After obtaining the monetary value of each bill held by the target user, the total monetary value of the target user's bills can also be obtained.

[0068] Step S30: Arrange the tickets of the target user in order of their monetary value to obtain an arranged ticket set.

[0069] In practice, the tickets of the target user can be arranged in ascending order of amount value to obtain an ordered set of tickets.

[0070] Step S40: Obtain a reference bill combination in the arranged bill set based on the amount to be filled.

[0071] It should be noted that the aforementioned reference bill combination can be a combination of bank acceptance bills held by the target user used to fill the water level balance difference, obtained by screening from the permutation bill set. A knapsack problem model can be introduced to quickly screen the reference bill combination set that meets the condition of filling the water level balance difference from the permutation bill set. Specifically, step S40 includes:

[0072] Step S401: Obtain the number of tickets in the arranged ticket set, and combine it with the amount to be filled to construct an improved knapsack problem model;

[0073] Understandably, the knapsack problem model can be a mathematical model applicable to integer programming problems. The knapsack problem can be a combinatorial optimization problem, described as follows: given a set of objects, each of which has its own weight and price, within a limited total weight, select the combination of items that maximizes the total price of the objects.

[0074] Furthermore, in order to generate an improved knapsack problem model based on the current scenario, step S401 includes:

[0075] Step S401': Abstract each ticket in the arranged ticket set into an object to be packed, and obtain the knapsack capacity based on the amount to be filled, and construct an improved knapsack problem model.

[0076] In a practical implementation, each ticket in the arranged ticket set can be abstracted as an object to be packed, and the knapsack capacity can be abstracted based on the amount to be filled. An improved knapsack problem model can then be constructed and introduced into the process of selecting reference ticket combinations.

[0077] Step S402: Solve the improved knapsack problem model and obtain a set of reference ticket combinations based on the model solution results.

[0078] It's important to note that methods for solving the knapsack problem can include dynamic programming and greedy algorithms. The greedy algorithm's basic idea is to select the optimal choice at each step without considering its impact on subsequent steps; therefore, it's only applicable to knapsack problems with low time complexity. Dynamic programming, on the other hand, decomposes the entire selection process into smaller subproblems, then combines the results obtained from solving these subproblems into a final solution. This approach is suitable for solving knapsack problems with higher time complexity.

[0079] Therefore, a dynamic programming algorithm can be used to solve the improved knapsack problem model, and a reference ticket combination set can be obtained based on the model solution result. Step S402 includes:

[0080] Step S402': Solve the improved knapsack problem model using a dynamic programming algorithm, and obtain a set of reference ticket combinations based on the model solution results.

[0081] In practical implementation, dynamic programming algorithms can be introduced to solve the improved knapsack problem model constructed above, thereby increasing the solution speed and enabling a faster acquisition of a set of reference bill combinations that meet the conditions. This set of reference bill combinations can contain one or more combinations of bank acceptance bills held by the target user that meet the conditions for filling the water level balance difference.

[0082] This embodiment determines the amount to be filled based on a standard amount and the target user's current relevant amount. When the amount to be filled is greater than a preset threshold, it obtains the amount corresponding to each of the target user's tickets. The tickets of the target user are arranged in order of their amount values ​​to obtain a sorted ticket set. A reference ticket combination is obtained from the sorted ticket set based on the amount to be filled. Because this embodiment automatically obtains the amount corresponding to each of the user's tickets when the amount to be filled is greater than the threshold and sorts the tickets based on their amount values, a reference ticket combination can be determined from the sorted ticket set. Furthermore, it introduces a knapsack problem model and a dynamic programming algorithm to obtain a ticket combination that meets the condition for filling the water level balance difference based on the model's solution results. Compared to existing manual ticket selection methods, this improves the efficiency of ticket selection and combination.

[0083] refer to Figure 3 , Figure 3 This is a flowchart illustrating the second embodiment of the bank bill screening method of the present invention. Based on the above embodiment, a second embodiment of the bank bill screening method of the present invention is proposed.

[0084] To provide a detailed explanation of the specific solution process for the improved knapsack problem model in the current scenario, step S402' includes:

[0085] Step S4021: Solve the improved knapsack problem model using a dynamic programming algorithm, and obtain a reference ticket combination set by retaining tickets in the arranged ticket set.

[0086] It should be noted that the steps to obtain the original knapsack model based on the current scene can be as follows:

[0087] In a set of bills, the number of bills is n, and the amount corresponding to the i-th bill is a. i If the amount to be filled is M, then the original knapsack model obtained based on the current scene model can be represented as:

[0088]

[0089]

[0090] make The above formula can then be expressed as:

[0091] min f(x)

[0092]

[0093] Since the total amount of tickets for the target user is constant when the ticket set is determined, S(a) is the total amount of tickets for the target user, and let y i =(1-x i If )∈{0,1}, then:

[0094]

[0095]

[0096] Furthermore, due to Therefore, the formula for the improved knapsack problem model is:

[0097]

[0098]

[0099] Among them, a i Let y be the amount corresponding to each bill, n be the number of bills in the arranged bill set, and y be the amount of each bill. i The tickets are reserved for the arranged ticket set, where S(a) is the total ticket amount of the target user, and M is the amount to be filled.

[0100] It should be noted that in the improved knapsack problem model described above, the knapsack capacity is abstracted as the difference between the total value of the target user's tickets S(a) and the amount to be filled. Each ticket is abstracted as an item whose value and weight are equal to the corresponding amount. Solving this improved knapsack problem model yields the ticket y retained in the permutation set of tickets. i .

[0101] Understandably, the solution obtained from solving this improved knapsack problem model is to arrange the remaining tickets in the ticket set, which are tickets that cannot be used as ticket combinations to compensate for the water level balance difference in the ticket set. Therefore, by removing these remaining tickets from the ticket set, a reference ticket combination set that can be used to fill the water level balance difference condition can be obtained.

[0102] It should be noted that, since the reference bill combination set obtained from the solution value of the improved knapsack problem model satisfies the condition for filling the water level balance difference, further considering that the target bill combination can be obtained by screening as few bank acceptance bills held by the target users as possible to further improve the screening speed of bills, after step S4021, the following is also included:

[0103] Step S4022: Extract the candidate tickets from the reference ticket combination set, and construct a search tree structure based on the candidate tickets.

[0104] It should be noted that the solution space can be obtained based on the solution value definition of the improved knapsack problem model described above, and this solution space can be constructed as a search tree structure that is easy to search.

[0105] Step S4023: Use a backtracking algorithm to traverse the reference ticket combination set of the search tree structure to determine the target ticket combination.

[0106] It should be noted that the backtracking algorithm is an optimal search method that searches the solution space starting from a defined node using a depth-first strategy. Specifically, when searching to any node in the solution space, it is determined whether the subtree rooted at that node contains a solution to the problem. If not, the search of the subtree rooted at that node is skipped, and backtracking is performed to the next higher-level node. If so, the search continues at that node using the depth-first strategy. During the search process, pruning functions can also be used to reduce the number of searches and avoid ineffective searches.

[0107] Specifically, it can be combined with Figure 4 To explain, Figure 4 A schematic diagram of the search tree structure constructed for solving the knapsack problem.

[0108] exist Figure 4 For example, if the number of items is 4, the knapsack capacity is 6, the item weights are [2, 3, 4, 1], and their values ​​are [1, 2, 5, 3], the optimal solution to this knapsack problem using dynamic programming is 6. When solving using backtracking, a binary tree is built according to the item order, with the first item as the root node. The search binary tree is generated recursively, meaning that items listed earlier are prioritized in the optimal solution. Figure 4 The 1 and 0 on the middle fork indicate whether to put the item into the backpack. Figure 4 The items in A are arranged in the order of [1, 2, 3, 5]. Therefore, the optimal solution 6 is obtained by combining items with corresponding values ​​of [1, 2, 3]. Figure 4 The items in B are arranged in the order of [5, 1, 2, 3]. Therefore, the optimal solution 6 is obtained by combining items with a value of [5, 1].

[0109] It should be noted that, by Figure 4 A and Figure 4As can be seen from B, when introducing a backtracking algorithm to solve the knapsack problem, since it is a depth-first search, items at the top of the list will be placed into the knapsack first, thus forming the optimal solution to the problem. Therefore, in this embodiment, since the tickets in the above-mentioned arrangement set are already arranged in order of their monetary value, and can be specifically sorted in ascending order of monetary value, by using a backtracking algorithm to traverse the reference ticket combination set of the search tree structure, and obtaining the solution value of the improved knapsack problem under the condition of "filtering to obtain as few bank acceptance bills held by the target user as possible", the target ticket combination can be obtained.

[0110] Understandably, the solution to the improved knapsack problem is to arrange the remaining tickets in the ticket set, which are the tickets that cannot be used as a ticket combination to compensate for the water level balance difference. Therefore, under the conditions introduced above, the goal is to maximize the number of tickets retained in the arranged ticket set, thereby minimizing the number of tickets in the reference ticket combination obtained by removing these retained tickets from the arranged ticket set to compensate for the water level balance difference, thus determining the final target ticket combination.

[0111] This embodiment employs a dynamic programming algorithm to solve the improved knapsack problem model. A reference set of ticket combinations is obtained by retaining tickets from the permuted ticket set. Because this embodiment specifically constructs the formula expression for the improved knapsack problem model and introduces a backtracking algorithm after obtaining the solution value, the determined target ticket combinations are interpretable, further improving the efficiency of ticket selection and combination.

[0112] refer to Figure 5 , Figure 5 This is a flowchart illustrating the third embodiment of the bank bill screening method of the present invention. Based on the above embodiments, a third embodiment of the bank bill screening method of the present invention is proposed.

[0113] Since the user holds several tickets with varying face values, meaning the monetary value corresponding to each ticket for the target user may vary, further considering boundary cases, step S30 includes:

[0114] Step S31: Obtain the amount value corresponding to the first-order ticket in the arranged ticket set to obtain the minimum ticket amount for the target user.

[0115] It should be noted that since the tickets in this arrangement set can be sorted in ascending order of amount, the ticket in the first position is the ticket corresponding to the minimum amount in this arrangement set, thus obtaining the minimum ticket amount for the target user.

[0116] Step S32: Compare the minimum value of the bill amount with the value of the amount to be filled.

[0117] Step S33: When the minimum value of the bill amount is greater than the amount to be filled, determine the bill corresponding to the minimum value of the bill amount as the target bill.

[0118] It should be noted that after obtaining the minimum value of the bill amount of the target user, the minimum value of the bill amount is compared with the amount to be filled. If the minimum value of the bill amount is greater than the amount to be filled, then any bill among the multiple bank acceptance bills held by the target user can be used as a bill to make up for the water level balance difference.

[0119] In practice, the bill with the smallest value among several bank acceptance bills held by the target user can be directly selected as the target bill to fill the water level balance difference.

[0120] Furthermore, considering the low face value of several notes held by the target user, leading to another boundary problem, step S10 includes:

[0121] Step S11: Obtain the total amount of the invoices of the target user and compare the total amount of the invoices of the target user with the amount to be filled.

[0122] Step S12: When the total amount of the bills of the target user is less than the amount to be filled, all the bills of the target user are determined as target bills.

[0123] It should be noted that, since the total value of the bills held by the target user can be the sum of the face values ​​of several bank acceptance bills of different face values ​​held by the target user, when the total value of the bills held by the target user is less than the amount to be filled, even if all the bank acceptance bills held by the target user cannot fill the water level balance difference as the final bill combination, all the bills held by the target user can still be used as the target bills.

[0124] Furthermore, if the number of bank acceptance bills held by the target user is unique, then all of the target user's bills, i.e., the unique bills, can be identified as the target bills.

[0125] This embodiment obtains the minimum amount of the target user's bills by acquiring the amount corresponding to the first-ranked bill in the arranged bill set; compares the minimum amount with the amount to be filled; when the minimum amount is greater than the amount to be filled, the bill corresponding to the minimum amount is determined as the target bill; or, it acquires the total amount of the target user's bills and compares it with the amount to be filled; when the total amount is less than the amount to be filled, all of the target user's bills are determined as the target bills. Since this embodiment considers two boundary cases where the face value of several bills held by the target user is higher than the amount to be filled and lower than the total amount, it determines the composition of the target bills under these two boundary cases, broadening the applicable scenarios of this bill screening method and further improving the reliability of the determined target bill combination.

[0126] Furthermore, this embodiment of the invention also proposes a storage medium storing a bank bill screening program, which, when executed by a processor, implements the bank bill screening method as described above.

[0127] In addition, refer to Figure 6 , Figure 6 This is a structural block diagram of the first embodiment of the bank bill screening device of the present invention; the present invention also proposes a bank bill screening device, the device comprising: a difference calculation module 601, a face value acquisition module 602, a bill sorting module 603, and a combination determination module 604.

[0128] The difference calculation module 601 is used to determine the amount to be filled based on the standard amount value and the target user's current relevant amount value.

[0129] The face value acquisition module 602 is used to acquire the amount value corresponding to each bill of the target user when the amount to be filled is greater than a preset threshold.

[0130] The ticket sorting module 603 is used to sort the tickets of the target user in order of their monetary value to obtain a sorted ticket set;

[0131] The combination determination module 604 is used to obtain a reference combination of bills in the arranged bill set based on the amount to be filled.

[0132] Furthermore, the combination determination module 604 is also used to obtain the number of tickets in the arranged ticket set, and combine it with the amount to be filled to construct an improved knapsack problem model; solve the improved knapsack problem model, and obtain a reference ticket combination set based on the model solution result.

[0133] Furthermore, the combination determination module 604 is also used to abstract each ticket in the arranged ticket set as an object to be packed, abstract the knapsack capacity according to the amount to be filled, and construct an improved knapsack problem model; use a dynamic programming algorithm to solve the improved knapsack problem model, and obtain a reference ticket combination set according to the model solution result.

[0134] This embodiment determines the amount to be filled based on a standard amount and the target user's current relevant amount. When the amount to be filled is greater than a preset threshold, it obtains the amount corresponding to each of the target user's tickets. The tickets of the target user are arranged in order of their amount values ​​to obtain a sorted ticket set. A reference ticket combination is obtained from the sorted ticket set based on the amount to be filled. Because this embodiment automatically obtains the amount corresponding to each of the user's tickets when the amount to be filled is greater than the threshold and sorts the tickets based on their amount values, a reference ticket combination can be determined from the sorted ticket set. Furthermore, it introduces a knapsack problem model and a dynamic programming algorithm to obtain a ticket combination that meets the condition for filling the water level balance difference based on the model's solution results. Compared to existing manual ticket selection methods, this improves the efficiency of ticket selection and combination.

[0135] Based on the first embodiment of the bank bill screening device of the present invention, a second embodiment of the bank bill screening device of the present invention is proposed.

[0136] In this embodiment, the combination determination module 604 is used to solve the improved back knapsack problem model using a dynamic programming algorithm, and to obtain a reference ticket combination set based on the tickets retained in the permutation ticket set. The formula expression for the improved back knapsack problem model is: Among them, a i Let y be the amount corresponding to each bill, n be the number of bills in the arranged bill set, and y be the amount of each bill. i The tickets are reserved for the arranged ticket set, where S(a) is the total ticket amount of the target user, and M is the amount to be filled.

[0137] Furthermore, the combination determination module 604 is also used to extract the candidate tickets from the reference ticket combination set, construct a search tree structure based on the candidate tickets, and use a backtracking algorithm to traverse the reference ticket combination set of the search tree structure to determine the target ticket combination.

[0138] The bill sorting module 603 is used to obtain the amount value corresponding to the bill located in the first order in the sorted bill set, and obtain the minimum bill amount of the target user; compare the minimum bill amount with the amount to be filled; and when the minimum bill amount is greater than the amount to be filled, determine the bill corresponding to the minimum bill amount as the target bill.

[0139] The difference calculation module 601 is used to obtain the total amount of the bills of the target user and compare the total amount of the bills of the target user with the amount to be filled; when the total amount of the bills of the target user is less than the amount to be filled, all the bills of the target user are determined to be target bills.

[0140] Other embodiments or specific implementations of the bank bill screening device of the present invention can be referred to the above-described method embodiments, and will not be repeated here.

[0141] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or system. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or system that includes that element.

[0142] The sequence numbers of the above embodiments of the present invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0143] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as a read-only memory image (ROM) / random access memory (RAM), magnetic disk, optical disk), and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0144] The above are merely preferred embodiments of the present invention and do not limit the scope of the patent. Any equivalent structural or procedural transformations made based on the description and drawings of the present invention, or direct or indirect applications in other related technical fields, are similarly included within the scope of patent protection of the present invention.

Claims

1. A method for screening bank drafts, characterized in that, The method includes: The amount to be filled is determined based on the standard amount and the target user's current relevant amount. When the amount to be filled is greater than a preset threshold, the amount corresponding to each ticket of the target user is obtained; Arrange the tickets of the target user in order of their monetary value to obtain an arranged ticket set; A reference bill combination is obtained from the arranged bill set based on the amount to be filled; The step of obtaining a reference bill combination based on the amount to be filled in the arranged bill set includes: Abstracting each ticket in the arranged ticket set as an object to be packed, and abstracting the knapsack capacity based on the amount to be filled, an improved knapsack problem model is constructed. The formula expression of the improved knapsack problem model is as follows: in, Let n be the amount corresponding to each bill, and n be the number of bills in the arranged bill set. Retain the tickets in the aforementioned ticket set. M represents the total amount of invoices for the target user, and M represents the amount to be filled. The improved knapsack problem model is solved using a dynamic programming algorithm, and a reference set of ticket combinations is obtained by retaining tickets from the permuted ticket set.

2. The bank draft screening method as described in claim 1, characterized in that, The step of solving the improved knapsack problem model using dynamic programming, and obtaining a reference set of ticket combinations based on the tickets retained in the permuted ticket set, includes: Extract the candidate tickets from the reference ticket combination set, and construct a search tree structure based on the candidate tickets; The target ticket combination is determined by traversing the reference ticket combination set of the search tree structure using a backtracking algorithm.

3. The bank draft screening method as described in claim 1, characterized in that, The step of arranging the tickets of the target user in order of their monetary value to obtain an arranged ticket set includes: Obtain the amount value corresponding to the first-order ticket in the arranged ticket set to obtain the minimum ticket amount for the target user; Compare the minimum value of the bill amount with the value of the amount to be filled; When the minimum value of the bill amount is greater than the amount to be filled, the bill corresponding to the minimum value of the bill amount is determined as the target bill.

4. The bank draft screening method as described in claim 1, characterized in that, After determining the amount to be filled based on the standard amount and the target user's current relevant amount, the process includes: Obtain the total invoice amount of the target user and compare the total invoice amount of the target user with the amount to be filled; When the total amount of the target user's invoices is less than the amount to be filled, all invoices of the target user are determined as target invoices.

5. A bank draft screening device, characterized in that, The device includes: a difference calculation module, a face value acquisition module, a bill sorting module, and a combination determination module; The difference calculation module is used to determine the amount to be filled based on the standard amount and the target user's current relevant amount. The face value acquisition module is used to acquire the amount value corresponding to each bill of the target user when the amount to be filled is greater than a preset threshold. The ticket sorting module is used to arrange the tickets of the target user in order of their monetary value to obtain a sorted ticket set; The combination determination module is used to obtain a reference combination of bills in the arranged bill set based on the amount to be filled; The combination determination module is further used to abstract each ticket in the arranged ticket set as an object to be packed, abstract the knapsack capacity based on the amount to be filled, and construct an improved knapsack problem model. The formula expression of the improved knapsack problem model is as follows: in, Let n be the amount corresponding to each bill, and n be the number of bills in the arranged bill set. Retain the tickets in the aforementioned ticket set. M represents the total amount of invoices for the target user, and M represents the amount to be filled. The combination determination module is also used to solve the improved knapsack problem model using a dynamic programming algorithm, and to obtain a reference ticket combination set based on the tickets retained in the arranged ticket set.

6. A bank draft screening device, characterized in that, The bank bill screening device includes: a memory, a processor, and a bank bill screening program stored in the memory and executable on the processor, wherein the bank bill screening program, when executed by the processor, implements the bank bill screening method as described in any one of claims 1 to 4.

7. A storage medium, characterized in that, The storage medium stores a bank bill screening program, which, when executed by a processor, implements the bank bill screening method as described in any one of claims 1 to 4.

Images