Sales promotion configuration method for ERP software developed based on Java technology

Abstract

The invention belongs to the technical field of promotion configuration, and particularly relates to a promotion configuration method for ERP software based on Java technology development, and the method comprises the following steps: S1, adding a commodity into a shopping cart for preprocessing: carrying out the preprocessing preferentially, and finding out an available promotion scheme; shrinking a final promotion execution range through preprocessing to form an available promotion scheme set; s2, finally confirming whether promotion meets conditions or not: transmitting all commodities transmitted into the shopping cart into the available promotion scheme set returned by preprocessing in the S1, and performing cyclic detection and verification according to the transmitted promotion scheme set; the preprocessing in the S1 is to judge whether the promotion scheme is available or not, whether the current date is in the promotion time range or not, whether the current date is in the available store range or not, and whether the current commodity is in the available commodity condition range specified by the promotion scheme or not. According to the method, the promotion activity requirements of different merchants can be met, meanwhile, the strong promotion configuration capacity is obtained, and the operation response speed is high.

Description

Technical Field

[0001] The invention belongs to the technical field of promotion configuration, and in particular relates to a promotion configuration method for ERP software developed based on Java technology. Background Art

[0002] Although existing ERP software has made some progress in terms of functionality, it still has some shortcomings. On the one hand, some ERP software is not efficient enough in data processing and business process management, causing enterprises to face problems such as data redundancy, slow processing speed, and cumbersome processes in daily operations. For example, in the order management module, traditional ERP software may take a long time to process a large amount of order data, affecting the company's response speed and customer satisfaction.

[0003] In the current technological environment, Java, as a widely used programming language, has the advantages of cross-platform, security, stability and strong scalability. Many companies are beginning to seek ERP software developed based on Java technology to meet their increasingly complex business needs.

[0004] However, Java programs need to be interpreted and executed by JVM (Java Virtual Machine), which introduces additional abstract actions and time overhead, causing them to run slower than languages ​​such as C and C++ that are directly compiled into machine code. For example, in some scenarios with extremely high performance requirements, such as real-time computing and high-frequency trading, Java's performance may not meet the requirements.

[0005] In summary, the promotion configuration capabilities of ERP software currently on the market still need to be improved. When applied to promotional activities that require extremely high real-time computing performance, the computing response speed is slow. Summary of the invention

[0006] The purpose of the present invention is to provide a promotion configuration method for ERP software developed based on Java technology, which can achieve powerful promotion configuration capabilities while meeting the promotion needs of different merchants and has a faster computing response speed.

[0007] The technical solution adopted by the present invention is as follows:

[0008] A promotion configuration method for ERP software developed based on Java technology, comprising the following steps:

[0009] S1: Preprocessing of adding products to the shopping cart: Preprocessing is done first to find available promotion plans. Preprocessing narrows the scope of promotion that can be finally performed and forms a set of available promotion plans.

[0010] S2: Final confirmation of whether the promotion meets the conditions: all the products in the shopping cart are passed in, and the set of available promotion plans returned by the pre-processing in S1 is passed in, and a loop detection and verification is performed according to the passed in promotion plan set.

[0011] Further, the S2 comprises the following steps:

[0012] S201: Loop through the shopping cart items, obtain and record the current items that meet the promotion item range rules, and filter out the shopping cart items that do not meet the promotion rules;

[0013] S202: The shopping cart items that meet the promotion rules after filtering are totaled and compared with the total of the product rules of the promotion plan. If the total of the shopping cart items is less than the total of the promotion rules, the promotion condition is not met. If the total of the shopping cart items is greater than the total of the promotion rules, the promotion condition is met and the next step is entered;

[0014] S203: Decompose the shopping cart product details that meet the promotion conditions according to the natural number 1, and use a recursive algorithm to combine and calculate the product data that meets the conditions in the shopping cart and the total value of the products in the promotion plan to calculate the product combination that meets the promotion conditions;

[0015] S204: Arrange and exchange positions of different commodities to form a new commodity combination;

[0016] S205: Match the combined data obtained in S203 and S204 with each line of the promotion rules one by one.

[0017] The technical effects achieved by the present invention are:

[0018] The promotion configuration method for ERP software developed based on Java technology of the present invention can obtain powerful promotion configuration capabilities through the algorithm model of [condition] + [reward] while meeting the promotion needs of different merchants. It makes up for a series of problems of slow JAVA language operation speed and high memory consumption by continuously optimizing algorithms and execution strategies, and can have a faster operation response speed when configuring more promotions to be executed simultaneously. DETAILED DESCRIPTION

[0019] In order to make the purpose and advantages of the present invention more clearly understood, the present invention is specifically described below in conjunction with embodiments. It should be understood that the following text is only used to describe one or several specific embodiments of the present invention, and does not strictly limit the scope of protection of the specific claims of the present invention.

[0020] This technical solution refers to all the promotional software functions on the market, analyzes them one by one, and finds that all promotional methods are based on the business model of triggering a certain [reward] after a certain [condition] is met. Based on this, a promotional function that can configure any [condition] and combine any [reward] is designed. Through such a design, a promotional method of the order of magnitude of Cartesian product can be generated to meet the promotional activities of merchants on the market. Merchants only need to configure the corresponding [condition] + corresponding [reward] according to their own requirements;

[0021] While satisfying the merchant's configuration, this technical solution also solves the problems in system operation logic caused by various randomly combined promotion configurations, such as calculation results, calculation complexity, calculation priority, etc. To this end, we designed a professional promotion operation engine to solve such problems. The operation engine is developed in Java language, and the main algorithms include the following:

[0022] 1. Divide and conquer algorithm: Decompose a large problem into multiple small problems, solve the small problems separately, and then merge the results to get the solution to the large problem.

[0023] For example, the merge sort of merchandise in promotion is a divide-and-conquer algorithm that divides an array into two parts and sorts them separately, and then merges the two ordered sub-arrays. This algorithm usually performs better than some simple sorting algorithms when processing large-scale data sorting.

[0024] 2. Dynamic programming: Avoid repeated calculations by saving solutions to sub-problems, thereby improving algorithm efficiency.

[0025] For example, if the Fibonacci sequence is used to calculate the performance of a product, there will be a lot of repeated calculations if a recursive algorithm is used. However, using dynamic programming and saving the results that have been calculated can greatly increase the calculation speed.

[0026] 3. Greedy algorithm: Take the optimal decision under the current state in each step of selection.

[0027] For example, in some complex promotion logic, the greedy algorithm can obtain a result close to the optimal solution in a shorter time.

[0028] Example:

[0029] A promotion configuration method for ERP software developed based on Java technology, comprising the following steps:

[0030] S1: Preprocessing of adding products to the shopping cart: simple preprocessing is performed first to find available promotion plans; the scope of the final executable promotion is narrowed through preprocessing to form a set of available promotion plans.

[0031] Here, the preprocessing is to determine whether the promotion plan is available, whether the current date is within the promotion time range, whether it is within the available store range, and whether the current product is within the available product condition range specified by the promotion plan;

[0032] If yes, it is an available promotion plan, if no, it is an unavailable promotion plan.

[0033] S2: Final confirmation of whether the promotion meets the conditions: all product details of the shopping cart are passed in, and the set of available promotion plans returned by the pre-processing in S1 is passed in. At this time, a loop detection and verification is performed according to the passed in promotion plan set.

[0034] Here, the cyclic detection and verification in S2 is mainly to verify the commodity range, whether the combination of commodities meets the specified amount, etc.

[0035] Specifically, S2 includes the following steps:

[0036] S201: Loop through the shopping cart items, obtain and record the current items that meet the promotion item range rules, and filter out the shopping cart items that do not meet the promotion rules;

[0037] S202: The shopping cart items that meet the promotion rules after filtering are totaled and compared with the total of the product rules of the promotion plan. If the total of the shopping cart items is less than the total of the promotion rules, the promotion condition is not met. If the total of the shopping cart items is greater than the total of the promotion rules, the promotion condition is met and the next step is entered;

[0038] S203: Decompose the shopping cart product details that meet the promotion conditions according to the natural number 1, and use a recursive algorithm to combine and calculate the product data that meets the conditions in the shopping cart and the total value of the products in the promotion plan to calculate the product combination that meets the promotion conditions;

[0039] For example, the items in the shopping cart that meet the promotion plan are 2 item A, 3 item B, and 1 item C. The total number of combinations of the promotion plan rules is 2. Then the combination plan at this time is [A, B], [A, C], [A, A], [B, C], [B, B].

[0040] S204: The above algorithm can further reduce the amount of calculation required for matching cycles. Since the product range of the promotion plan is uncertain, after S203, different products will be arranged and exchanged when matching promotion rules to form more new product combinations.

[0041] This process is not performed if all products in the combination are the same. For example, [A,B], the final calculation matching rules are two groups [A,B][B,A], not [B,B] or [A,A].

[0042] S205: Match the combined data obtained in S203 and S204 with each line of the promotion rules one by one.

[0043] For example, the promotional product scope rules are:

[0044] The first row of rules is either product A or product B

[0045] The second row rule is either one of the products B or C

[0046] According to the known combinations [A, B], [B, A], [A, C], [C, A], [A, A], [B, C], [C, B], [B, B]

[0047] After cyclic matching, it can be seen that only [A, B][A, C][B, C][B, B] meets this condition. At this time, if there is a specified amount (such as a promotion can only be performed when the amount is over 100), further verification is performed. Assuming that the unit price of product A is 30, the unit price of product B is 60, and the unit price of product C is 70, then the combination of [A, C][B, C][B, B] meets the condition;

[0048] This calculation will use a recursive algorithm to find the optimal solution. If there are multiple combinations that meet the conditions, the highest price or the lowest price can be combined recursively according to business needs to obtain the expected optimal solution.

[0049] Activity (Promotion) Conditions Description Table

[0050]

[0051]

[0052] Activity (Promotion) Reward Description Table

[0053]

[0054]

[0055]

[0056]

[0057] In summary, the technology used in this technical solution is Java language. Under the current technical environment, Java, as a widely used programming language, has the advantages of cross-platform, security, stability and strong scalability. It can meet the promotion needs of different merchants. At the same time, through the algorithm model of [conditions] + [rewards], a powerful promotion configuration capability is obtained. By continuously optimizing algorithms and execution strategies, it compensates for a series of problems such as slow JAVA language computing speed and excessive memory consumption. When configuring more promotions to be executed simultaneously, it has a faster computing response speed.

[0058] The above is only a preferred embodiment of the present invention. It should be noted that, for those skilled in the art, several improvements and modifications can be made without departing from the principles of the present invention, and these improvements and modifications should also be considered as the protection scope of the present invention. The structures, devices and operating methods not specifically described and explained in the present invention shall be implemented according to the conventional means in the art unless otherwise specified and limited.

Claims

1. A promotion configuration method for ERP software developed based on Java technology, characterized in that: The following steps are involved: S1: Preprocessing of adding products to the shopping cart: Preprocessing is done first to find available promotion plans. Preprocessing narrows the scope of promotion that can be finally performed and forms a set of available promotion plans. S2: Final confirmation of whether the promotion meets the conditions: all the products in the shopping cart are passed in, and the set of available promotion plans returned by the pre-processing in S1 is passed in, and a loop detection and verification is performed according to the passed in promotion plan set.

2. The promotion configuration method for ERP software developed based on Java technology according to claim 1, characterized in that: The preprocessing in S1 is to determine whether the promotion plan is available, whether the current date is within the promotion time range, whether it is within the available store range, and whether the current product is within the available product condition range specified by the promotion plan; If yes, it is an available promotion plan, if no, it is an unavailable promotion plan.

3. The promotion configuration method for ERP software developed based on Java technology according to claim 1, characterized in that: The cyclic detection and verification in S2 is to verify whether the commodity range and the combination of commodities meet the specified amount.

4. The promotion configuration method for ERP software developed based on Java technology according to claim 1, characterized in that: The S2 comprises the following steps: S201: Loop through the shopping cart items, obtain and record the current items that meet the promotion item range rule, and filter out the shopping cart items that do not meet the promotion rules; S202: The shopping cart items that meet the promotion rules after filtering are totaled and compared with the total of the product rules of the promotion plan. If the total of the shopping cart items is less than the total of the promotion rules, the promotion condition is not met. If the total of the shopping cart items is greater than the total of the promotion rules, the promotion condition is met and the next step is entered; S203: Decompose the shopping cart product details that meet the promotion conditions according to the natural number 1, and use a recursive algorithm to combine and calculate the product data that meets the conditions in the shopping cart and the total value of the products in the promotion plan to calculate the product combination that meets the promotion conditions; S204: Arrange and exchange positions of different commodities to form a new commodity combination; S205: Match the combined data obtained in S203 and S204 with each line of the promotion rules one by one.

5. The promotion configuration method for ERP software developed based on Java technology according to claim 1, characterized in that: The promotion conditions of the promotion plan include at least one of product conditions, applicable scope, price conditions, payment conditions and additional purchase.

6. The promotion configuration method for ERP software developed based on Java technology according to claim 1, characterized in that: The promotional rewards of the promotional plan include at least one of free merchandise, points, stored value, membership cards, coupons, special offers, discounts, and N-th item Y discounts.

7. The promotion configuration method for ERP software developed based on Java technology according to claim 6, characterized in that: When the promotional reward is points, when adjusting the order for return, the corresponding points need to be returned after the entire order is returned. If the points at this time are less than the points that need to be returned, they will be directly returned to 0 after the return is completed.

8. The promotion configuration method for ERP software developed based on Java technology according to claim 6, characterized in that: When the promotional reward is a stored value, the gifted stored value amount will be included in the gift balance; when adjusting an order for return, the corresponding stored value amount needs to be returned after the entire order is refunded. If the current gift balance is less than the amount to be returned, it will be directly returned to 0 after the return is completed.

Images