CN115311094B - Acceptance draft combination method and device, electronic equipment and readable storage medium - Google Patents
Acceptance draft combination method and device, electronic equipment and readable storage medium Download PDFInfo
- Publication number
- CN115311094B CN115311094B CN202211244331.0A CN202211244331A CN115311094B CN 115311094 B CN115311094 B CN 115311094B CN 202211244331 A CN202211244331 A CN 202211244331A CN 115311094 B CN115311094 B CN 115311094B
- Authority
- CN
- China
- Prior art keywords
- acceptance
- draft
- combination
- bill
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/906—Clustering; Classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The application provides a combination method, a device, electronic equipment and a readable storage medium for acceptance draft, wherein the method comprises the following steps: according to the total amount of the ticket surfaces in the query conditions, candidate acceptance bills with the ticket surface amount not larger than the total amount of the ticket surfaces are queried from all the acceptance bills; clustering the candidate acceptance bills with the same bill face amount to the same bill category; performing binary optimization on the draft category information corresponding to each draft category to obtain first combination information of each first acceptance draft combination generated after grouping the candidate acceptance drafts under the draft category; and inputting the query conditions and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query conditions. The method is beneficial to improving the combination efficiency aiming at the acceptance draft.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for combining acceptance drafts, an electronic device, and a readable storage medium.
Background
With the development of the internet and artificial intelligence, the convenience of leaving home on the internet and the intelligent application of accurate positioning deepen the dependence of people on the online platform. All walks of life have been integrated into the embrace of the internet, and the exchange of receipt has also begun to change from traditional paper transactions to online transactions.
At present, the main online transaction modes for accepting the draft are as follows: the bill holder with the acceptance bill utilizes the on-line platform to quote and issue the bill information of the acceptance bill. The fund party who wants to buy the acceptance draft finds the acceptance draft meeting the self-demand through the online platform according to the self-purchase demand. After finding the acceptance draft meeting the self requirement, the fund party carries out order receiving on the online platform so that the platform sends an order receiving request to the ticket holder. After the ticket holder confirms the bill receiving request (i.e. agrees to sell the acceptance bill held by the ticket holder), the fund holder makes a money to the third party payment channel of the bank. The fund side makes a successful payment and informs the ticket holder of carrying the book, after the ticket holder finishes carrying the book, the fund side signs up the receipt and remittance, and finally the bank unseals the fund so as to deposit the fund from the bank into the account of the ticket holder and the order is finished.
When a fund party searches for an acceptance bill meeting the needs of the fund party on an online platform, the fund party usually selects a plurality of acceptance bills from the online platform through the fund party (namely manual operation) and combines the acceptance bills into an acceptance bill with the appointed bill amount. For example, if the fund party wants to combine the designated nominal amount of money into one hundred thousand denominations, the fund party can select one acceptance bill with twenty thousand denominations, one acceptance bill with thirty thousand denominations and one acceptance bill with fifty thousand denominations from the online platform, and then combine the designated nominal amount of money into one hundred thousand. When the fund party manually selects the acceptance draft combination meeting the self requirement from all the acceptance drafts in the whole online platform (namely, when the acceptance drafts are combined in a selection mode), the problem of low combination efficiency when the fund party combines can be caused because a great number of acceptance drafts exist in the online platform.
Disclosure of Invention
In view of the above, an object of the present application is to provide a method and an apparatus for combining acceptance drafts, an electronic device and a readable storage medium, so as to improve the combining efficiency of the acceptance drafts.
In a first aspect, the present application provides a combined method of accepting money orders, comprising:
acquiring a query condition input by a target user; the query conditions include: a total nominal amount of the acceptance draft to be combined, and any one or more of: the first number of the acceptance draft to be combined, the information of an acceptance person, the remaining acceptance duration and the flaw condition;
according to the total amount of the ticket faces and the amount of a single ticket face of each acceptance bill stored in a database, inquiring candidate acceptance bills of which the amount of the single ticket face is not more than the total amount of the ticket faces from all the acceptance bills;
clustering the candidate acceptance money orders with the same money amount to the same money order category according to the money amount of the single money of each candidate acceptance money order;
performing binary optimization on the draft category information corresponding to each draft category to obtain first combination information of each first acceptance draft combination generated after grouping the candidate acceptance drafts under the draft category; wherein the money order category information comprises a second number of the candidate acceptance money orders under the money order category and the single ticket amount; the first combination information comprises a third number of the candidate acceptance bills contained in the first acceptance bill combination and a combination bill amount corresponding to the first acceptance bill combination; the combined ticket amount is less than the ticket total amount;
and inputting the query conditions and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query conditions.
With reference to the first aspect, the present application provides a first possible implementation manner of the first aspect, wherein the money order category information further includes a per-preset-amount deduction average value; the first combined information also comprises a first total withholding amount of each preset amount; the second combination information of the second acceptance draft combination comprises a second per-preset money deduction total amount;
after the first combination information of each first acceptance draft combination corresponding to the query condition and each draft category is input into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query condition, the method further comprises the following steps:
and according to the second per-preset-amount deduction total amount of each second acceptance bill combination, selecting the second per-preset-amount deduction total amount with the maximum value from the second acceptance bill combinations as a target acceptance bill combination.
With reference to the first possible implementation manner of the first aspect, the present application provides a second possible implementation manner of the first aspect, wherein after the selecting, as the target acceptance draft combination, the second total deduction amount per preset amount from the second acceptance draft combination according to the second total deduction amount per preset amount of each of the second acceptance draft combinations, the method further includes:
sending target combination information for representing the target acceptance draft combination to a user side according to address information of the user side of the target user; the target combination information includes first draft information for each target acceptance draft in the target acceptance draft combination.
With reference to the second possible implementation manner of the first aspect, the present application provides a third possible implementation manner of the first aspect, where the obtaining a query condition input by a target user includes:
receiving the query condition sent by the user side; the query condition is generated by the user side in response to the input operation of the target user;
based on the receiving time of the query condition and the theme, arranging the query condition into a first queue corresponding to the theme according to the receiving time;
and acquiring the first query condition arranged in the first queue from the first queue.
With reference to the second possible implementation manner of the first aspect, the present application provides a fourth possible implementation manner of the first aspect, wherein after the sending, to the user side of the target user, target combination information for representing the target acceptance draft combination according to the address information of the user side of the target user, the method further includes:
after receiving an electronic acceptance bill order which is sent by the user side and aims at the target acceptance bill combination, locking each target acceptance bill in the target acceptance bill combination;
upon receiving information indicative of a successful transaction for the target acceptance draft combination, changing a current status of each of the target acceptance drafts in the target acceptance draft combination to an order completed status.
With reference to the second possible implementation manner of the first aspect, the present application provides a fifth possible implementation manner of the first aspect, wherein after the first combination information of each first acceptance draft combination corresponding to each draft category and the query condition are input into a two-dimensional expense knapsack algorithm, and a plurality of second acceptance draft combinations satisfying the query condition are obtained, the method further includes:
sending second combination information of each second acceptance draft combination to the user side according to the address information of the user side so as to be selected by the target user; the second combined information further includes: second draft information for each of the plurality of second acceptance drafts in the second acceptance draft combination.
In a second aspect, the present application also provides a combination for accepting a draft, comprising:
the acquisition module is used for acquiring the query condition input by the target user; the query conditions include: a total nominal amount of the acceptance draft to be combined, and any one or more of: the first number of the acceptance draft to be combined, the information of an acceptance person, the residual acceptance duration and the flaw condition;
the query module is used for querying candidate acceptance bills of which the single bill surface sum is not more than the ticket surface total sum from all the acceptance bills according to the bill surface total sum and the single bill surface sum of each acceptance bill stored in the database;
the clustering module is used for clustering the candidate acceptance bills with the same single bill surface amount to the same bill category according to the single bill surface amount of each candidate acceptance bill;
the binary optimization module is used for carrying out binary optimization on the draft category information corresponding to each draft category aiming at each draft category to obtain first combination information of each first acceptance draft combination generated after the candidate acceptance drafts under the draft category are grouped; wherein the money order category information comprises a second number of the candidate acceptance money orders and the single ticket amount under the money order category; the first combination information comprises a third number of the candidate acceptance bills contained in the first acceptance bill combination and a combination bill amount corresponding to the first acceptance bill combination; the combined ticket amount is less than the ticket total amount;
and the input module is used for inputting the query conditions and the first combination information of each first acceptance bill combination corresponding to each bill category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance bill combinations meeting the query conditions.
With reference to the second aspect, the present application provides a first possible implementation manner of the second aspect, wherein the money order category information further includes a per-preset-amount deduction average value; the first combined information also comprises a first total withholding amount of each preset amount; the second combination information of the second acceptance draft combination comprises a second per-preset money deduction total amount; the device further comprises:
and the selection module is used for inputting the query conditions and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense backpack algorithm through the input module, obtaining a plurality of second acceptance draft combinations meeting the query conditions, and then selecting the second acceptance draft combination with the largest deduction total sum per preset sum as a target acceptance draft combination from the second acceptance draft combinations according to the second deduction total sum per preset sum of each second acceptance draft combination.
In combination with the first possible implementation manner of the second aspect, the present application provides a second possible implementation manner of the second aspect, wherein the apparatus further includes:
the first sending module is used for sending target combination information for representing the target acceptance bill combination to the user side according to address information of the user side of the target user after the selecting module selects the second sum of interest deduction from the second acceptance bill combination according to the second sum of interest deduction total sum of each second preset sum of each second acceptance bill combination as the target acceptance bill combination; the target combination information includes first draft information for each target acceptance draft in the target acceptance draft combination.
With reference to the second possible implementation manner of the second aspect, the present application provides a third possible implementation manner of the second aspect, wherein when the obtaining module is configured to obtain the query condition input by the target user, the obtaining module is specifically configured to:
receiving the query condition sent by the user side; the query condition is generated by the user side in response to the input operation of the target user;
based on the receiving time of the query condition and the theme, arranging the query condition into a first queue corresponding to the theme according to the receiving time;
and acquiring the first query condition arranged in the first queue from the first queue.
With reference to the second possible implementation manner of the second aspect, the present application provides a fourth possible implementation manner of the second aspect, wherein the apparatus further includes:
the receiving module is used for locking each target acceptance draft in the target acceptance draft combination after receiving an electronic acceptance draft order which is sent by the user terminal and aims at the target acceptance draft combination after the first sending module sends target combination information which is used for representing the target acceptance draft combination to the user terminal according to address information of the user terminal of the target user;
a change module for changing a current status of each of the target acceptance draft combinations to an order completed status upon receiving information indicating that the transaction for the target acceptance draft combination was successful.
In combination with the second possible implementation manner of the second aspect, the present application provides a fifth possible implementation manner of the second aspect, wherein the apparatus further includes:
the second sending module is used for sending the second combination information of each second acceptance draft combination to the user side according to the address information of the user side after the input module inputs the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense backpack algorithm to obtain a plurality of second acceptance draft combinations meeting the query condition so as to be selected by the target user; the second combined information further includes: second draft information for each of the plurality of second acceptance drafts in the second acceptance draft combination.
In a third aspect, the present application further provides an electronic device, including: a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor, the processor and the memory communicate with each other via the bus when the electronic device is running, and the machine-readable instructions, when executed by the processor, perform the steps of any one of the possible implementations of the first aspect.
In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, where the computer program is executed by a processor to perform the steps in any one of the possible implementations of the first aspect.
After the query condition input by a target user is obtained, candidate acceptance bills of which the single bill sum is not more than the bill sum total are automatically queried from all acceptance bills stored in a database according to the bill sum total contained in the query condition, so that the candidate acceptance bills are combined in the subsequent step, and the step is favorable for reducing the calculation amount of an electronic bill platform in the subsequent combination process. In addition, in the application, the candidate acceptance drafts are automatically combined through the electronic bill platform according to the query conditions so as to combine a second acceptance draft combination meeting the query conditions. Compare in prior art through artifical manual combination's mode, the mode of this application is favorable to reducing manual work volume, improves artifical combination efficiency.
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
FIG. 1 illustrates a flow chart of a method of assembling an acceptance draft provided by an embodiment of the present application;
fig. 2 is a schematic diagram illustrating first combined information provided by an embodiment of the present application;
FIG. 3 is a schematic diagram of an embodiment of a combination acceptance draft apparatus;
fig. 4 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. The components of the embodiments of the present application, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
The problem that in the prior art, when the acceptance drafts are manually combined, the combination efficiency is low is considered. Based on the method, the device, the electronic equipment and the readable storage medium, the combination method, the device, the electronic equipment and the readable storage medium for the acceptance draft are provided, and the combination efficiency of the acceptance draft is improved. The following is a description by way of example.
The first embodiment is as follows:
to facilitate an understanding of the present embodiment, a detailed description of a method for assembling an acceptance draft disclosed in the embodiments of the present application will be given. The method is applied to an electronic bill platform, fig. 1 shows a flow chart of a combination method for accepting a money order provided by the embodiment of the application, and as shown in fig. 1, the method comprises the following steps:
s101: acquiring a query condition input by a target user; the query conditions include: a nominal total amount of the acceptance draft to be combined, and any one or more of: the first number of the acceptance draft to be combined, the information of the acceptance person, the remaining acceptance duration and the flaw condition.
In this embodiment, the acceptance draft is embodied as an electronic version of an electronic acceptance draft. The target user is a user who wants to purchase an acceptance draft. The total amount of the ticket face is the total amount of the acceptance bills which are combined by the target user, and the total amount of the ticket face can be the sum of single denominations of a plurality of acceptance bills. Illustratively, if the target user wants to combine the acceptance bills of one hundred thousand denominations, the total amount of the bills is one hundred thousand, and specifically, the target user may consist of two acceptance bills of one ten thousand denominations, one acceptance bill of three million denominations and one acceptance bill of five ten thousand denominations. It should be noted that there are various specific combinations, and this embodiment is not an example.
The first number of sheets is the number of acceptance bills included in the acceptance bill combination that the target user wants to combine. The information of the acceptance persons of the acceptance draft is used for representing the information of the acceptance person of each acceptance draft, each acceptance draft corresponds to one acceptance person, and the acceptance persons corresponding to different acceptance drafts can be the same acceptance person or different acceptance persons; the same acceptor may correspond to one or more acceptance drafts.
The remaining acceptance period of the acceptance draft is specifically how long it will be, the acceptor of the acceptance draft being required to make the payment. The defect condition of the acceptance draft is used for indicating whether the acceptance draft has defects, and normally, the acceptance draft combination which the target user wants to combine does not want to include the acceptance draft with defects, so the defect condition of the acceptance draft input by the target user is generally defect-free.
In a possible implementation manner, when the step S101 is executed to acquire the query condition input by the target user, the following steps S1011 to S1013 may be specifically executed:
s1011: receiving a query condition sent by a user side; the query condition is generated by the user side in response to the input operation of the target user.
In this embodiment, the target user inputs the query condition in the user terminal of the target user. The user side can be an electronic device of the target user, such as a mobile phone, a tablet computer, a desktop computer and the like.
S1012: and arranging the query conditions into a first queue corresponding to the topic according to the receiving time based on the receiving time of the query conditions and the topic.
After receiving the query condition sent by the user side, the electronic bill platform arranges the query condition to the tail of the first queue of the theme corresponding to the query condition. In this embodiment, since a plurality of processes may be run in the electronic ticket platform, the electronic ticket platform may receive information of other subjects in addition to the query condition, and thus a plurality of queues may exist in the electronic ticket platform, the query condition needs to be arranged in the first queue under the subject corresponding to the query condition. The first queue may specifically be a kafka queue.
S1013: the first query condition queued in the first queue is obtained from the first queue.
The first queue contains query conditions input by a plurality of target users, wherein the query conditions input by different target users can be the same or different. The arrangement sequence of the query conditions in the first queue can be ordered according to the receiving time sequence of the query conditions received by the electronic bill platform. The first query condition in the first queue is the query condition with the earliest receiving time in the current first queue.
S102: and inquiring candidate acceptance bills with the single bill surface sum not more than the total bill surface sum from all the acceptance bills according to the total bill surface sum and the single bill surface sum of each acceptance bill stored in the database.
In this embodiment, a plurality of acceptance bills are stored in the database, and the sum of a single bill surface of the selected candidate acceptance bills is not more than (i.e. less than or equal to) the total sum of bill surfaces. There are also multiple candidate acceptance drafts. The database is a real-time database, and the acceptance bills in the database can be synchronized in real time from the service hall.
S103: and clustering the candidate acceptance bills with the same bill surface amount to the same bill category according to the bill surface amount of each candidate acceptance bill.
Illustratively, if there are 100 candidate acceptance bills, wherein there are 10 candidate acceptance bills with a single bill surface amount of ten thousand, 20 candidate acceptance bills with a single bill surface amount of twenty thousand, 20 candidate acceptance bills with a single bill surface amount of forty thousand, 40 candidate acceptance bills with a single bill surface amount of fifty thousand, and 10 candidate acceptance bills with a single bill surface amount of one hundred thousand.
Then, clustering the candidate acceptance bills with the same bill surface sum under the same bill category to obtain six bill categories, wherein the six bill categories are respectively the bill category 1 and comprise 10 candidate acceptance bills with the same bill surface sum of ten thousand; the draft category 2 comprises 20 candidate acceptance drafts with single draft and twenty thousand money sum; the draft category 3 comprises 20 candidate acceptance drafts with a single draft and a face sum of forty thousand; the draft category 4 comprises 40 candidate acceptance drafts with a single draft and a face sum of fifty thousand; the draft category 5 contains 10 candidate acceptance drafts with a single draft having a face value of one hundred thousand.
S104: performing binary optimization on the draft category information corresponding to each draft category to obtain first combination information of each first acceptance draft combination generated after grouping the candidate acceptance drafts under the draft category; wherein, the money order category information comprises a second number of candidate acceptance money orders under the money order category and the single money amount; the first combination information comprises a third number of candidate acceptance bills contained in the first acceptance bill combination and a combination bill amount corresponding to the first acceptance bill combination; the sum of the combined ticket surface is less than the total sum of the ticket surfaces.
In this embodiment, for the money order category N, the money order category information corresponding to the money order category N includes: the second number M of candidate acceptance bills under the bill category N, and the sum V of the single bill. Wherein the sum of the single ticket surface of the M candidate acceptance bills is V. After binary optimization is performed on the draft category information of the draft category N, the following information is obtained:
wherein each numerical value in the set represents: and grouping the candidate acceptance bills under the bill category N to generate a third number of the candidate acceptance bills contained in each first acceptance bill combination.
Illustratively, when the second number M of candidate acceptance drafts under draft category N is 1, k is 0, the set is {1}, and there are 1 sets of first acceptance draft combinations. When the second number M is 2, k is 0, the set is {1,1}, there are 2 sets of first acceptance draft combinations. When the second number M is 3, k is 1, the set is {1,2}, there are 2 sets of first acceptance draft combinations. When the second sheet M is 4, k is 1, the set is {1,2,1}, there are 3 sets of first acceptance draft combinations. When the second number M is 5, k is 1, the set is {1,2}, and there are 3 sets of first acceptance draft combinations. When the second number M is 6, k is 1, the set is {1,2,3}, there are 3 sets of first acceptance draft combinations. When the second sheet M is 7, k is 2, the set is {1,2,4}, there are 3 sets of first acceptance draft combinations. When the second number M is 8, k is 2, the set is {1,2,4,1}, there are 4 sets of first acceptance draft combinations. As can be seen, k is a natural number.
The number of the first acceptance draft combinations is k +1 or k +2. Specifically, the number of first acceptance draft combinations is k +1 when the following formula is satisfied:
if the above formula cannot be satisfied, the number of the first acceptance draft combinations is k +2.
In this embodiment, after binary optimization is performed on the draft category information of the draft category N, the following information is obtained:
wherein each value in the set represents: and grouping the candidate acceptance bills under the bill category N to generate combined bill surface sum corresponding to each first acceptance bill combination. The combined bill sum corresponding to each group of first acceptance bill combination is less than the bill sum.
For example, the embodiment in the accepting step S103 is described by taking the draft category 5 as an example. Fig. 2 is a schematic diagram illustrating first combined information provided in an embodiment of the present application, where for a money order category 5, the money order category information corresponding to the money order category 5 includes: the second number M of candidate acceptance bills under the bill category 5 is 10, and the sum V of the single bill is one hundred thousand. After binary optimization is performed on the draft category information of the draft category 5, the following information is obtained:
as shown in fig. 2, the information in the collection indicates that 10 discrete candidate acceptance drafts under the draft category 5 were grouped to obtain four first acceptance draft combinations, a, b, c, d, respectively. Wherein, the third number corresponding to the first acceptance and exchange bill combination a is 1, the third number corresponding to the first acceptance and exchange bill combination b is 2, the third number corresponding to the first acceptance and exchange bill combination c is 4, and the third number corresponding to the first acceptance and exchange bill combination d is 3. In this embodiment, the sum of the third number of sheets (i.e., 1+2+4+ 3) corresponding to all first acceptance bill combinations under the bill category 5 is the same as the second number of sheets (i.e., 10) of the candidate acceptance bill under the bill category 5.
After binary optimization is performed on the draft category information of the draft category 5, the following information is obtained:
as shown in fig. 2, the information within the collection represents a combined nominal amount for each first acceptance draft combination. Specifically, the first acceptance draft combination a contains 1 candidate acceptance drafts with a single draft amount of one hundred thousand, so that the combined draft amount corresponding to the first acceptance draft combination a is 10 thousand. The first acceptance bill combination b contains 2 candidate acceptance bills with single bill surface sum of one hundred thousand, so that the bill surface sum of the combination corresponding to the first acceptance bill combination b is 20 ten thousand. The first acceptance bill combination c comprises 4 candidate acceptance bills with single bill surface sum of one hundred thousand, so that the combined bill surface sum corresponding to the first acceptance bill combination c is 40 ten thousand. The first acceptance bill combination d contains 3 candidate acceptance bills with a single bill surface amount of one hundred thousand, so that the bill surface amount of a combination corresponding to the first acceptance bill combination d is 30 thousand.
S105: and inputting the query conditions and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query conditions.
After binary optimization, the problem is transformed into a two-dimensional cost knapsack problem. And inputting the query conditions and the first combination information of each first acceptance bill combination corresponding to each bill category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance bill combinations meeting the query conditions.
Each of the first acceptance draft categories may correspond to a plurality of first acceptance draft combinations, each of the first acceptance draft combinations corresponding to one of the first combination information.
In a possible embodiment, after the step S105 is executed to input the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category into the two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query condition, the following steps may be further executed:
s106: according to the address information of the user side, sending second combination information of each second acceptance draft combination to the user side for the target user to select; the second combined information further includes: second draft information for each of the plurality of second acceptance drafts in the second acceptance draft combination.
When a plurality of second acceptance draft combinations are available, second combination information of all the second acceptance draft combinations is sent to the user side, the target user can view the second combination information of all the second acceptance draft combinations through the user side, and a group of second acceptance draft combinations meeting the requirements of the target user is selected from all the second acceptance draft combinations according to the second combination information of all the second acceptance draft combinations. And returning a selection result (such as the identifier of the selected second acceptance bill combination) to the electronic bill platform, and after receiving the selection result of the user side, the electronic bill platform locks each acceptance bill in the second acceptance bill combination to prevent each acceptance bill in the second acceptance bill combination from being purchased by other target users.
In this embodiment, each of the second acceptance draft combinations corresponds to a respective one of the second draft information. The second draft information at least comprises the draft number of the acceptance draft, the draft date, the information of the acceptance person, the single draft amount and the like.
In another possible implementation, the money order category information further includes a per-preset money deduction mean value corresponding to the money order category; the first combined information also comprises a first total deduct amount of each preset amount; the second combination information of the second acceptance draft combination comprises a second per-preset money deduction total amount; after the step S105 is executed, the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category are input into the two-dimensional expense knapsack algorithm, and a plurality of second acceptance draft combinations meeting the query condition are obtained, the method may further specifically be executed according to the following steps:
s107: and according to the second per-preset-amount deduction total amount of each second acceptance bill combination, selecting the second per-preset-amount deduction total amount which is the largest from the second acceptance bill combinations as a target acceptance bill combination.
In this embodiment, each candidate acceptance draft under the same draft category corresponds to each default deduction value of money. The per-preset-amount deduction mean value corresponding to the money order category is the mean value of per-preset-amount deduction values of each candidate acceptance money order under the money order category. In step S104, the deduction average value of each preset amount corresponding to the money order type N is w. After binary optimization is performed on the draft category information of the draft category N, the following information is obtained:
wherein each value in the set represents: and grouping the candidate acceptance bills under the bill category N to generate a first per-preset money deduction total amount of each first acceptance bill combination.
For example, the embodiment in the accepting step S104 is described by taking the draft category 5 as an example. Assuming that the preset money in the deduction mean value of each preset money corresponding to the bill type 5 is more than one hundred thousand, the deduction mean value of each preset money is more than one hundred thousand deduction mean values. In this embodiment, if the average of every hundred thousand deductions corresponding to the draft category 5 may be specifically 6%, the following information is obtained after binary optimization is performed on the draft category information of the draft category 5:
as shown in fig. 2, the information in the set represents a first total deducted amount per preset amount (specifically, a first total deducted amount per hundred thousand in this embodiment) corresponding to each first acceptance draft combination. Wherein, the first total withholding amount per preset amount corresponding to the first acceptance draft combination a is 2 0 × V × w =1 × 10 × 6% =600. The first total withholding amount per preset amount corresponding to the first acceptance bill combination b is specifically 2 1 × V × w =2 × 10 × 6% =1200. The first total withholding amount per preset amount corresponding to the first acceptance bill combination c is specifically 2 2 × V × w =4 × 10 × 6% =1200. The first total withholding amount per preset amount corresponding to the first acceptance draft combination d is (M-2) 0 -2 1 -⋯-2 k ) X V × w = (10-1-2-4) × 10 ten thousand × 6% =1800.
In this embodiment, when the first combination information further includes a first per-preset-amount deduction total amount, the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category are input to the two-dimensional fee knapsack algorithm, and the obtained second combination information corresponding to each second acceptance draft combination satisfying the query condition includes a second per-preset-amount deduction total amount corresponding to each second acceptance draft combination. Each second acceptance bill combination corresponds to second combination information, and each second combination information comprises a second per-preset money deduction total amount of the second acceptance bill combination.
Wherein the second per-preset-amount deduction total amount corresponding to each second acceptance draft combination is determined according to the first per-preset-amount deduction total amount corresponding to each first acceptance draft combination. For example, if the second acceptance draft combination B includes a first acceptance draft combination B and a second acceptance draft combination c, that is, the second acceptance draft combination B includes 6 candidate acceptance drafts (2 in the first acceptance draft combination B and 4 in the second acceptance draft combination c) with a single draft amount of one hundred thousand. Then, the second deduct total amount per preset amount (specifically, the second deduct total amount per hundred thousand in this embodiment) corresponding to the second acceptance bill combination B is 3600 (1200 + 2400).
Assume that if the target user wants to purchase the second acceptance draft combination B, then the amount that the target user actually needs to pay (the actual amount spent) is 60 ten thousand-3600= 596400. 60 of which are the total of 6 candidate acceptance bills with a single bill surface amount of one hundred thousand.
In this embodiment, the total amount of the bills corresponding to all the second acceptance draft combinations is the same (determined by the query condition), so that the largest total amount of the deduction of the second preset amount is selected from all the second acceptance draft combinations as the target acceptance draft combination according to the total amount of the deduction of the second preset amount corresponding to each second acceptance draft combination.
Illustratively, the number of the second acceptance draft combinations is specifically 5, and is B, C, D, E and F, wherein the total deduction amount per the second preset amount corresponding to each second acceptance draft combination is 3600, 6000, 800, 4600 and 5500 respectively. Then when the total amount of the corresponding ticket of the second acceptance draft combination is 60 ten thousand, then when the second acceptance draft combination B is purchased, the cost is actually required 596400; when a second acceptance draft combination C is purchased, the actual cost is 594000; when a second acceptance draft combination D is purchased, the actual cost is 599200; when a second acceptance draft combination E is purchased, the actual cost is 595400; when the second acceptance draft combination F is purchased, the actual cost is 594500;
it can be seen that as the total amount deducted per the second preset amount is larger, the amount actually required to be spent by the target user is smaller. Thus, in this embodiment, since the second total deduction amount per preset amount corresponding to the target acceptance draft combination (in this example, the second acceptance draft combination C) is the largest (in this example, 6000), the target user can purchase the target acceptance draft combination with the least amount of money on the premise that the acceptance draft combination meeting the query condition is purchased, compared with the purchase of other second acceptance draft combinations.
It should be noted that, in the present embodiment, after step S105 is executed, step S106 or step S107 may be executed continuously.
In a possible embodiment, after the step S107 is executed, according to the second total deduction amount per preset amount of each second acceptance draft combination, the combination with the highest second total deduction amount per preset amount is selected from the second acceptance draft combinations as the target acceptance draft combination, the following steps may be further executed:
s108: according to the address information of the user side of the target user, target combination information used for representing the target acceptance draft combination is sent to the user side; the target combination information includes first draft information for each target acceptance draft in the target acceptance draft combination.
After determining the target acceptance draft combination, in this embodiment, only the target combination information corresponding to the target acceptance draft combination may be sent to the user side of the target user. In the target acceptance draft combination, each target acceptance draft corresponds to one piece of first draft information. The first draft information at least comprises the draft number, the drawing date, the information of the acceptance person, the surface amount of a single draft and the like of the target acceptance draft.
Specifically, after the target acceptance bill combination is selected, the target combination information of the target acceptance combination is placed at the tail part of the second queue according to the selection time, and the target combination information arranged at the head in the current second queue is sent to the user side of the corresponding target user according to the selection time of the target combination information of the target acceptance combination corresponding to each target user in the second queue.
In a possible embodiment, after the step S108 is executed, the target combination information for representing the target acceptance draft combination is sent to the user terminal according to the address information of the user terminal of the target user, and the following steps may be further executed:
s1091: and after receiving an electronic acceptance bill order which is sent by a user end and aims at the target acceptance bill combination, locking each target acceptance bill in the target acceptance bill combination.
After the user of the target user receives the target combination information for the target acceptance draft combination, the user may generate an electronic acceptance draft order for the target acceptance draft combination in response to the confirmation operation of the target user to purchase the target acceptance draft in the target acceptance draft combination.
Or the user side of the target user is provided with an automatic order receiving function, and after the user side receives the target combination information of the target acceptance bill combination, the user side automatically executes order placing operation aiming at each target acceptance bill in the target acceptance bill combination so as to automatically generate an electronic acceptance bill order aiming at the target acceptance bill combination. This approach is beneficial to avoid the situation where the target acceptance draft is purchased by other target users because the target users do not view the user side in time.
And when the user terminal generates an electronic acceptance draft order aiming at the target acceptance draft combination, the electronic acceptance draft order is sent to the electronic bill platform. After the electronic bill platform receives the electronic acceptance bill order, according to the bill number of the target acceptance bill in the electronic acceptance bill order, the current state of each target acceptance bill in the target acceptance bill combination is changed into the state in the order, so that each target acceptance bill in the target acceptance bill combination is locked, and other target users are prevented from purchasing the target acceptance bills.
S1092: upon receiving the information indicating that the transaction for the target acceptance draft combination was successful, the current status of each of the target acceptance drafts in the target acceptance draft combination is changed to an order completed status.
In this embodiment, after receiving an electronic acceptance draft order for a target acceptance draft combination sent by a user side of a target user, the electronic billing platform sends an order receiving request to a ticket holding user side of a ticket holder of the target acceptance draft for each target acceptance draft, and after confirming the order receiving request (i.e., agreeing to sell the target acceptance draft held by the ticket holder), the target user makes a payment to a bank third-party payment channel. The target user successfully makes a money and informs the ticket holder to carry out a book, after the ticket holder finishes carrying the book, the target user signs the target acceptance draft, and finally the bank unlocks the fund so as to make the fund transfer from the bank to the account of the ticket holder, and the transaction is finished. For each target acceptance draft in the target acceptance draft combination, after the electronic billing platform receives information indicating that the transaction for the target acceptance draft in the target acceptance draft combination was successful, the current status of the target acceptance draft is changed to an order completed status.
In this embodiment, the information received by the electronic ticket platform for indicating that the transaction for the target acceptance draft combination is successful may be specifically sent by the ticket holding user terminal of the ticket holder, or may be sent by the user terminal of the target user.
Example two:
based on the same technical concept, the embodiment of the present application further provides a combination device for accepting the money order, and fig. 3 shows a schematic structural diagram of the combination device for accepting the money order provided by the embodiment of the present application, as shown in fig. 3, the device includes:
an obtaining module 301, configured to obtain a query condition input by a target user; the query conditions include: a total nominal amount of the acceptance draft to be combined, and any one or more of: the first number of the acceptance draft to be combined, the information of an acceptance person, the remaining acceptance duration and the flaw condition;
the query module 302 is configured to query candidate acceptance bills, of which the single bill amount is not greater than the total bill amount, from all the acceptance bills according to the total bill amount and the single bill amount of each acceptance bill stored in the database;
the clustering module 303 is configured to cluster the candidate acceptance drafts with the same single-ticket amount to the same draft category according to the single-ticket amount of money of each candidate acceptance draft;
a binary optimization module 304, configured to perform binary optimization on the draft category information corresponding to each draft category to obtain first combination information of each first acceptance draft combination generated after grouping the candidate acceptance drafts under the draft category; wherein the money order category information comprises a second number of the candidate acceptance money orders under the money order category and the single ticket amount; the first combination information comprises a third number of the candidate acceptance bills contained in the first acceptance bill combination and a combination bill amount corresponding to the first acceptance bill combination; the combined ticket amount is less than the ticket total amount;
an input module 305, configured to input the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense knapsack algorithm, so as to obtain a plurality of second acceptance draft combinations meeting the query condition.
Optionally, the money order category information further includes a deduction mean value of each preset money amount; the first combined information also comprises a first total withholding amount of each preset amount; the second combination information of the second acceptance draft combination comprises a second per-preset money deduction total amount; the device further comprises:
and a selecting module, configured to, after the input module 305 inputs the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query condition, select, from the second acceptance draft combinations, a target acceptance draft combination that is the highest sum of deductions per second preset sum of money according to a second sum of deductions per second preset sum of money of each second acceptance draft combination.
Optionally, the apparatus further comprises:
the first sending module is used for sending target combination information for representing the target acceptance bill combination to the user side according to address information of the user side of the target user after the selecting module selects the second money deduction total amount from each second acceptance bill combination according to the second money deduction total amount of each second preset money deduction total amount of each second acceptance bill combination and takes the largest money deduction total amount from each second preset money deduction total amount as the target acceptance bill combination; the target combination information includes first draft information for each target acceptance draft in the target acceptance draft combination.
Optionally, when the obtaining module 301 is configured to obtain a query condition input by a target user, the obtaining module is specifically configured to:
receiving the query condition sent by the user side; the query condition is generated by the user side in response to the input operation of the target user;
based on the receiving time of the query condition and the theme, arranging the query condition into a first queue corresponding to the theme according to the receiving time;
and acquiring the first query condition arranged in the first queue from the first queue.
Optionally, the apparatus further comprises:
the receiving module is used for locking each target acceptance draft in the target acceptance draft combination after receiving an electronic acceptance draft order which is sent by the user terminal and aims at the target acceptance draft combination after the first sending module sends target combination information which is used for representing the target acceptance draft combination to the user terminal according to address information of the user terminal of the target user;
a change module for changing a current status of each of the target acceptance draft combinations to an order completed status upon receiving information indicating that the transaction for the target acceptance draft combination was successful.
Optionally, the apparatus further comprises:
a second sending module, configured to send, according to the address information of the user side, second combination information of each second acceptance draft combination to the user side for the target user to select, after the input module 305 inputs the query condition and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense backpack algorithm to obtain a plurality of second acceptance draft combinations satisfying the query condition; the second combined information further includes: second draft information for each of the plurality of second acceptance drafts in the second acceptance draft combination.
Example three:
based on the same technical concept, an embodiment of the present application further provides an electronic device, and fig. 4 shows a schematic structural diagram of the electronic device provided in the embodiment of the present application, and as shown in fig. 4, the electronic device 400 includes: a processor 401, a memory 402 and a bus 403, wherein the memory stores machine-readable instructions executable by the processor, when the electronic device is operated, the processor 401 and the memory 402 communicate with each other through the bus 403, and the processor 401 executes the machine-readable instructions to execute the method steps described in the first embodiment.
Example four:
based on the same technical concept, a computer-readable storage medium is further provided in a fourth embodiment of the present application, where a computer program is stored on the computer-readable storage medium, and the computer program is executed by a processor to perform the method steps in the first embodiment.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the apparatus, the electronic device and the computer-readable storage medium described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the modules is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, an electronic ticket platform, or a network device) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Finally, it should be noted that: the above-mentioned embodiments are only specific embodiments of the present application, and are used to illustrate the technical solutions of the present application, but not to limit the technical solutions, and the scope of the present application is not limited to the above-mentioned embodiments, although the present application is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope disclosed in the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the exemplary embodiments of the present application, and are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (7)
1. A method of assembling an acceptance draft, the method comprising:
acquiring a query condition input by a target user; the query conditions include: a total nominal amount of the acceptance draft to be combined, and any one or more of: the first number of the acceptance draft to be combined, the information of an acceptance person, the remaining acceptance duration and the flaw condition;
according to the total amount of the ticket faces and the amount of a single ticket face of each acceptance bill stored in a database, inquiring candidate acceptance bills of which the amount of the single ticket face is not more than the total amount of the ticket faces from all the acceptance bills;
clustering the candidate acceptance money orders with the same money amount to the same money order category according to the money amount of the single money of each candidate acceptance money order;
performing binary optimization on the money order category information corresponding to each money order category to obtain first combination information of each first acceptance money order combination generated after grouping the candidate acceptance money orders under the money order category; the money order type information comprises a second number of the candidate money order, the single money amount and a per-preset money deduction mean value under the money order type; the first combination information comprises a third number of the candidate acceptance bills contained in the first acceptance bill combination, a combined bill amount corresponding to the first acceptance bill combination and a first per-preset-amount deduction total amount; the combined ticket surface sum is less than the ticket surface total sum; inputting the query conditions and the first combination information of each first acceptance bill combination corresponding to each bill category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance bill combinations meeting the query conditions; the second combination information of the second acceptance draft combination comprises a second per-preset money deduction total amount;
according to a second per-preset-amount deduction total amount of each second acceptance bill combination, selecting the second per-preset-amount deduction total amount which is the largest from the second acceptance bill combinations as a target acceptance bill combination; wherein the more the second total withholding amount per preset amount, the less the amount spent by the target user;
sending target combination information for representing the target acceptance draft combination to a user side according to address information of the user side of the target user; the target combination information includes first draft information for each target acceptance draft in the target acceptance draft combination.
2. The method of claim 1, wherein the obtaining of the query condition input by the target user comprises:
receiving the query condition sent by the user side; the query condition is generated by the user side in response to the input operation of the target user;
based on the receiving time and the theme of the query condition, arranging the query condition into a first queue corresponding to the theme according to the receiving time;
and acquiring the first query condition arranged in the first queue from the first queue.
3. The method of claim 1, wherein after sending the target combination information representing the target acceptance draft combination to the user terminal according to the address information of the user terminal of the target user, the method further comprises:
after receiving an electronic acceptance bill order which is sent by the user side and aims at the target acceptance bill combination, locking each target acceptance bill in the target acceptance bill combination;
upon receiving information indicative of a successful transaction for the target acceptance draft combination, changing a current status of each of the target acceptance drafts in the target acceptance draft combination to an order completed status.
4. The method of claim 1, wherein the step of inputting the first combination information of each first acceptance draft combination corresponding to the query condition and each draft category into a two-dimensional fare backpack algorithm to obtain a plurality of second acceptance draft combinations satisfying the query condition further comprises:
sending second combination information of each second acceptance draft combination to the user side according to the address information of the user side so as to be selected by the target user; the second combined information further includes: second draft information for each acceptance draft in the second acceptance draft combination.
5. An acceptance order assembly, said assembly comprising:
the acquisition module is used for acquiring query conditions input by a target user; the query conditions include: a total nominal amount of the acceptance draft to be combined, and any one or more of: the first number of the acceptance draft to be combined, the information of an acceptance person, the remaining acceptance duration and the flaw condition;
the query module is used for querying candidate acceptance bills of which the single bill surface sum is not more than the bill surface total sum from all the acceptance bills according to the bill surface total sum and the single bill surface sum of each acceptance bill stored in the database;
the clustering module is used for clustering the candidate acceptance bills with the same single bill surface amount to the same bill category according to the single bill surface amount of each candidate acceptance bill;
the binary optimization module is used for carrying out binary optimization on the draft category information corresponding to each draft category aiming at each draft category to obtain first combination information of each first acceptance draft combination generated after the candidate acceptance drafts under the draft category are grouped; the money order category information comprises a second number of the candidate acceptance money orders under the money order category, the single money amount and the deduction average value of each preset money amount; the first combination information comprises a third number of the candidate acceptance bills contained in the first acceptance bill combination, a combined bill amount corresponding to the first acceptance bill combination and a first per-preset-amount deduction total amount; the combined ticket amount is less than the ticket total amount;
the input module is used for inputting the query conditions and the first combination information of each first acceptance draft combination corresponding to each draft category into a two-dimensional expense knapsack algorithm to obtain a plurality of second acceptance draft combinations meeting the query conditions; the second combination information of the second acceptance draft combination comprises a second per-preset money deduction total amount;
the selecting module is used for selecting the second sum-per-preset deduction total sum which is the largest from the second acceptance bill combinations as a target acceptance bill combination according to the second sum-per-preset deduction total sum of each second acceptance bill combination;
the first sending module is used for sending target combination information used for representing the target acceptance draft combination to the user side according to the address information of the user side of the target user; the target combination information includes first draft information for each target acceptance draft in the target acceptance draft combination.
6. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over the bus when the electronic device is operating, the machine-readable instructions, when executed by the processor, performing the steps of the method of any one of claims 1 to 4.
7. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, is adapted to carry out the steps of the method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211244331.0A CN115311094B (en) | 2022-10-12 | 2022-10-12 | Acceptance draft combination method and device, electronic equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211244331.0A CN115311094B (en) | 2022-10-12 | 2022-10-12 | Acceptance draft combination method and device, electronic equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115311094A CN115311094A (en) | 2022-11-08 |
| CN115311094B true CN115311094B (en) | 2022-12-27 |
Family
ID=83868311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211244331.0A Active CN115311094B (en) | 2022-10-12 | 2022-10-12 | Acceptance draft combination method and device, electronic equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115311094B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106023413A (en) * | 2016-06-28 | 2016-10-12 | 刘泽生 | Automatic verifying system and automatic verifying method for paper-based bankers' acceptance bill |
| CN109242688A (en) * | 2018-09-11 | 2019-01-18 | 上海豆伴互联网金融信息服务有限公司 | Electronics acceptance bill transaction platform, system, method and medium |
| CN109978684A (en) * | 2019-04-11 | 2019-07-05 | 深圳微众税银信息服务有限公司 | A kind of bank acceptance checking method, system and relevant device |
| CN111967985A (en) * | 2020-10-23 | 2020-11-20 | 四川川投云链科技有限公司 | Block chain-based acceptance draft management method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10339134B2 (en) * | 2015-09-30 | 2019-07-02 | Walmart Apollo, Llc | System, method, and non-transitory computer-readable storage media for generating normalization candidates for a search query |
-
2022
- 2022-10-12 CN CN202211244331.0A patent/CN115311094B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106023413A (en) * | 2016-06-28 | 2016-10-12 | 刘泽生 | Automatic verifying system and automatic verifying method for paper-based bankers' acceptance bill |
| CN109242688A (en) * | 2018-09-11 | 2019-01-18 | 上海豆伴互联网金融信息服务有限公司 | Electronics acceptance bill transaction platform, system, method and medium |
| CN109978684A (en) * | 2019-04-11 | 2019-07-05 | 深圳微众税银信息服务有限公司 | A kind of bank acceptance checking method, system and relevant device |
| CN111967985A (en) * | 2020-10-23 | 2020-11-20 | 四川川投云链科技有限公司 | Block chain-based acceptance draft management method |
Non-Patent Citations (1)
| Title |
|---|
| 迪迦 •奥特曼.01背包问题 图解+详细解析 （转载）.《https://qwq1503.blog.csdn.net/article/details/107113456》.2020,第1-4页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115311094A (en) | 2022-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107330788B (en) | Block chain digital asset transaction matching method, system, device and medium | |
| WO2007103940A2 (en) | Least cost network routing for electronic transactions | |
| CN100385458C (en) | Portable card reader and card settlement system | |
| JP2006073031A5 (en) | ||
| CN107430749A (en) | Settlement processing device, method and computer program | |
| JP6409115B1 (en) | Automatic journal server and automatic journal program | |
| CN107689009A (en) | Annuity data processing method, device, server and storage medium | |
| CN108764876A (en) | A kind of transaction processing method and server | |
| JP2012242953A (en) | Bank account transaction system and bank account transaction method for aligning number of deposit balance in predetermined pattern | |
| CN109615492B (en) | Accounting voucher generation method and system | |
| CN112101929A (en) | Cooperative payment method, system, storage medium and cooperative payment platform | |
| CN113222568B (en) | Shipping service settlement method, platform, equipment, medium and product | |
| CN115311094B (en) | Acceptance draft combination method and device, electronic equipment and readable storage medium | |
| CN113191899A (en) | Fee management system | |
| CN111369347A (en) | Service processing method, device, equipment and storage medium | |
| CN116091258A (en) | Data processing method and device for account checking management | |
| CN115082173A (en) | Account checking processing method and device, computer equipment and storage medium | |
| CN111028025B (en) | Bill data processing method, device, equipment and medium based on big data | |
| CN112308719B (en) | Virtual resource acquisition method, device, server and storage medium | |
| CN111696248B (en) | Banknote exchange method and device, electronic equipment and computer readable storage medium | |
| WO2021200976A1 (en) | Money processing device | |
| JP4890581B2 (en) | Fluidization management system, fluidization management method, and fluidization management program | |
| JP4464195B2 (en) | Accounting apparatus, incidental expense distribution method, and computer program | |
| CN114970918A (en) | Appointment transfer method and device | |
| CN113191878A (en) | Asset securitization screening method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |