Order allocation method and device, electronic equipment, medium and product

Abstract

The embodiment of the invention provides an order allocation method and device, electronic equipment, a medium and a product. The method comprises the steps that a to-be-allocated order and allocation factors input by a user are received, the allocation factors are used for determining a constraint condition and an objective function of the to-be-allocated order, and the allocation state of the to-be-allocated order is acquired based on the constraint condition and the objective function, and the allocation state comprises an order receiving state or a non-order receiving state.

Description

TECHNICAL FIELD

[0001] The present specification relates to the technical field of order allocation, and in particular to an order allocation method and device, electronic equipment, medium and product. BACKGROUND

[0002] In order to better meet market demand, large manufacturing enterprises often adopt a parallel collaborative distributed factory operation mode, the core of this mode is "collaboration", and the core of realizing "collaboration" is to establish a good order allocation method. In the fierce market environment, establishing distributed factories in multiple regions and carrying out collaborative scheduling can make enterprises occupy market share in more regions and improve enterprise competitiveness.

[0003] The order allocation problem of distributed factories under the parallel collaborative mode is a complex multi-objective decision problem. The current order allocation method usually considers the individual benefit demands of different factories in the two-level supply chain of the factory and the customer, balances the benefits of each factory based on Adams' fairness using the deviation coefficient method while maximizing the overall benefit.

[0004] However, with the increasing complexity of the environment, there are more and more uncertain factors in different business scenarios of order allocation. This order allocation method is prone to non-deterministic polynomial-hard (NP-hard) problems, which cannot be optimized or modeled with great difficulty, and the optimization of the allocation result is not significant, resulting in that the optimal allocation result of the order allocation cannot be obtained. SUMMARY

[0005] To overcome the problems in the related art, the present specification provides an order allocation method, device, electronic equipment, medium and product.

[0006] According to a first aspect of any one of the embodiments of the present specification, an order allocation method is provided, the method comprising:

[0007] receiving a user-inputted order to be allocated and an allocation factor; the allocation factor is used to determine a constraint condition and a target function of the order to be allocated;

[0008] obtaining an allocation state of the order to be allocated based on the constraint condition and the target function; the allocation state includes an order receiving state or an order not receiving state.

[0009] According to a second aspect of any one of the embodiments of the present specification, an order allocation device is provided, the device comprising:

[0010] The information receiving module is configured to receive a to-be-allocated order and an allocation factor input by a user, wherein the allocation factor is used to determine a constraint condition and an objective function of the to-be-allocated order.

[0011] The state obtaining module is configured to obtain an allocation state of the to-be-allocated order based on the constraint condition and the objective function, wherein the allocation state comprises an order receiving state or an order not receiving state.

[0012] According to a third aspect of any of the embodiments of the present specification, an electronic device is provided, comprising:

[0013] a processor;

[0014] a memory for storing processor-executable instructions;

[0015] The processor implements the method described in any of the embodiments of the present specification by running the executable instructions.

[0016] According to a fourth aspect of any of the embodiments of the present specification, a computer-readable storage medium is provided, which stores computer instructions, and the instructions are executed by a processor to implement the steps of the method described in any of the embodiments of the present specification.

[0017] According to a fifth aspect of any of the embodiments of the present specification, a computer program product is provided, which stores computer program / instructions, and the computer program / instructions are executed by a processor to implement the steps of the method described in any of the embodiments of the present specification.

[0018] The technical solutions provided by the embodiments of the present specification can include the following beneficial effects:

[0019] According to the above embodiments, by receiving a to-be-allocated order and an allocation factor input by a user, obtaining an allocation state of the to-be-allocated order based on a constraint condition and an objective function, since the constraint condition and the optimization target are determined based on the allocation factor, the order allocation problem of the distributed factory in the parallel collaborative mode is more in line with the actual situation, the configuration of the constraint condition and the objective function is flexible, the difficulty of solving the order allocation problem is greatly reduced, thereby obtaining a globally optimal allocation result of the order allocation, so that the to-be-allocated order in the order receiving state can be produced by the factory most suitable for receiving the order, effectively reducing the supply chain cost and improving the efficiency and benefit of order commitment.

[0020] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present specification. BRIEF DESCRIPTION OF DRAWINGS

[0021] The accompanying drawings, which are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present application and, together with the specification, serve to explain the principles of the present application.

[0022] Figure 1 is a structural diagram of an order allocation model according to an example embodiment of the present specification;

[0023] Figure 2 is a flow chart of an order allocation method according to an example embodiment of the present specification;

[0024] Figure 3 is a flow chart of another order allocation method according to an example embodiment of the present specification;

[0025] Figure 4 is a structural diagram of an electronic device according to an example embodiment of the present specification;

[0026] Figure 5 is a block diagram of an order allocation apparatus according to an example embodiment of the present specification. DETAILED DESCRIPTION

[0027] The example embodiments will now be described in detail with reference to the accompanying drawings. If the description of the example embodiments refers to the accompanying drawings, the same numbers on all drawings refer to the same or similar elements. The following detailed description is provided to assist in a comprehensive understanding of various embodiments of the application as defined by the appended claims and their equivalents. Accordingly, those skilled in the art will recognize that other embodiments can be practiced with the same or equivalent overall results as those described.

[0028] The terminology used in the present specification is for the purpose of describing particular embodiments only and is not intended to limit the present specification. As used in the present specification and the appended claims, the singular forms "a," "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

[0029] It will be understood that, although the terms first, second, third, etc. can be used herein to describe various information, these terms are not intended to denote a temporal or chronological order. Rather, these terms are used only to distinguish different sets of information from one another. For example, a first information can be termed a second information, and similarly, a second information can also be termed a first information, without departing from the scope of the present specification. As used herein, the word "if' can be interpreted to mean "when" or "upon" or "in response to determining" depending on the context.

[0030] At present, the solution process of the common order allocation method is too complex, consumes a lot of energy, cannot optimize or model, the optimization of the allocation result is not significant, and the optimal allocation result of the order allocation cannot be obtained.

[0031] To solve the above problems, the embodiment of the present specification proposes an order allocation method. In order to further illustrate the present specification, the following embodiments are provided:

[0032] The distributed factory in the parallel collaborative mode refers to multiple factories distributed in different regions belonging to the same enterprise, each factory has the ability to produce all or part of the products of the enterprise, each factory can independently produce the products specified by the enterprise, and there is no relationship between different factories to provide semi-finished products to each other.

[0033] For the enterprise of the distributed factory in the parallel collaborative mode, when an order arrives, whether to accept the order needs to consider many factors. In the case of limited production capacity and resources of the enterprise, the geographical location, production capacity, transportation capacity and inventory capacity of each factory need to be considered. The order to be produced is allocated to each factory, and the production tasks of each factory are arranged, and each factory produces according to the order task to complete the enterprise goal.

[0034] Please refer to Figure 1 , Figure 1 is a structural diagram of an order allocation model according to an example embodiment. The enterprise has a distributed factory in a parallel collaborative mode, when receiving multiple orders from the sales center, in the mode of centralized production and decentralized delivery, the factory line body is selected for order allocation.

[0035] As Figure 1 shown, the enterprise has center 1, center 2, …, and center n, each center has its own different channel orders. For the demand of each product in the order, the enterprise has factory 1, factory 2, …, and factory m can be selected. Each factory contains several lines, each line is responsible for a specific production task and production process.

[0036] When the order does not meet the inventory and production plan, the business party evaluates the order based on the production capacity, inventory and other information of the factory, and judges whether the order can be accepted in the current rolling period. If the order is accepted, the production factory of the order is determined, and the delivery period is formulated; if the order is not accepted, the order is delayed or rejected. After accepting the order, the product is guided to produce in different factories.

[0037] In the order allocation model, there is an order information flow from the center to the factory, and then from the factory to the line, and a logistics transportation process from the line to the factory, and then from the factory to the center.

[0038] It can be understood that the order allocation model exemplified in the specification is only an example, and other order allocation models can also be used as long as the order allocation model implements the method described in the embodiments of the specification, and the embodiments of the specification do not limit this.

[0039] Please refer to Figure 2 , Figure 2 is a flowchart of an order allocation method according to an exemplary embodiment. The order allocation method can be applied to a terminal device such as a computer, a tablet computer, etc. The method can include the following steps:

[0040] Step 202: receiving a to-be-allocated order and an allocation factor input by a user; the allocation factor is used to determine a constraint condition and an objective function of the to-be-allocated order.

[0041] In this step, the terminal device receives the to-be-allocated order and the allocation factor input by the user. The received to-be-allocated order and the allocation factor are used as variables of a mixed integer programming (MIP) mathematical model.

[0042] The to-be-allocated order is an order received by an enterprise and to be allocated to a factory, which can be a single-period order, a customized order, etc. The allocation factor is used to determine the constraint condition and the objective function of the to-be-allocated order, which can be data such as the production capacity of each factory, the inventory, the logistics distance, the order priority, etc. The allocation factor directly affects the production efficiency and economic benefit of the factory.

[0043] The allocation factor is a factor for deciding the allocation state of the to-be-allocated order. The allocation state is the final execution state of the to-be-allocated order. The allocation state includes an order-accepted state or an order-unaccepted state. The order-unaccepted state can include an order-delayed state or an order-rejected state.

[0044] The order-accepted state is used to identify an order-accepted factory that accepts the to-be-allocated order. The order-delayed state is used to identify an order-delayed factory that delays to accept the to-be-allocated order. The order-rejected state is used to identify a factory that rejects to accept the to-be-allocated order.

[0045] The constraint condition and the objective function are determined by comprehensively considering allocation factor information such as the production capacity of the factory, the inventory of the factory, the logistics distance, the order priority, etc. The constraint condition is a condition for limiting the value range of the allocation factor, which can be a condition for limiting the production capacity of the factory, the logistics distance, etc. The objective function is a target for optimizing the solution of the order allocation problem, which can be a minimum cost, a maximum order-accepted quantity, etc.

[0046] Step 204: obtaining an allocation state of the to-be-allocated order based on the constraint condition and the objective function; the allocation state includes an order-accepted state or an order-unaccepted state.

[0047] In this step, the terminal device can also receive a constraint condition and a target function determined based on an allocation factor input by a user. Based on the constraint condition and the target function, a MIP mathematical model is constructed. The terminal device can substitute variables, constraint conditions and a target function into a solver, calculate an allocation state of the to-be-allocated order by using operational optimization theory, and obtain an allocation state output by the MIP mathematical model.

[0048] If the allocation state is the order-accepting state, an order-accepting factory that accepts the to-be-allocated order can also be output. If the allocation state is the order-delaying state, an order-delaying factory that delays to accept the to-be-allocated order can also be output.

[0049] It can be understood that the order allocation method described in the embodiments of the present specification is not only applicable to the order allocation scene of distributed factories in the parallel collaborative mode, but also can be applied to business scenes in different industries such as the take-out industry and the service industry, and the embodiments of the present specification do not limit this.

[0050] Further, in a case where it is determined that the allocation state is the order-unaccepted state, the terminal device determines an order-unaccepted reason of the to-be-allocated order based on a constraint condition that is not met by the to-be-allocated order, and obtains an order-unaccepted reason of the to-be-allocated order output by the MIP mathematical model.

[0051] The order-unaccepted reason is used to identify a reason why a factory delays or refuses to accept the to-be-allocated order, which can be that the capacity of a line of the factory exceeds an upper limit value, a logistics distance exceeds a preset distance, and the like.

[0052] Exemplarily, the order allocation result obtained by the terminal device can be as shown in Table 1:

[0053] Table 1 Order allocation result

[0054] Order Allocation status Ordering factory Ordering reason Order1 1 Factory a / Order2 0 / Ordering reason a Order3 2 Factory b Ordering reason b

[0055] In Table 1, Order1, Order2 and Order3 are to-be-allocated orders. 0 is a refused state, 1 is an order-accepted state, and 2 is an order-delayed state. Factory a is an order-accepted factory that accepts Order1, and factory b is an order-delayed factory that accepts Order2. Order-unaccepted reason a is a reason why Order2 is refused, and order-unaccepted reason b is a reason why Order3 is delayed.

[0056] As described above, by determining an order-unaccepted reason of a to-be-allocated order based on a constraint condition that is not met by the to-be-allocated order in a case where it is determined that the allocation state is the order-unaccepted state, a user can obtain a reason why a factory does not accept the to-be-allocated order.

[0057] The order allocation method of the embodiment receives the to-be-allocated order and the allocation factor input by the user, obtains the allocation state of the to-be-allocated order based on the constraint condition and the target function, and makes the order allocation problem of the distributed factory in the parallel collaborative mode more realistic because the constraint condition and the optimization target are determined based on the allocation factor. The configuration of the constraint condition and the target function is flexible, and the difficulty of solving the order allocation problem is greatly reduced, so that the globally optimal allocation result of the order allocation is obtained, the to-be-allocated order in the order receiving state can be produced by the factory most suitable for receiving the order, the supply chain cost is effectively reduced, and the efficiency and benefit of order commitment are improved.

[0058] In addition, the allocation state is directly calculated by the modeling method, the cumbersome degree of offline communication and manual plan making is avoided, the work efficiency is greatly improved, the order allocation is quickly and effectively judged, the factory receiving the to-be-allocated order fully utilizes the factory capacity, the capacity balance of different factories is ensured, the collaborative efficiency of each link is improved, and the production cost and the logistics cost are saved.

[0059] In the foregoing embodiment, the to-be-allocated order and the allocation factor input by the user are received, and the allocation state of the to-be-allocated order is obtained based on the constraint condition and the target function. In order to improve the inventory turnover efficiency of the enterprise, the inventory can be consumed preferentially when the order is allocated. In the following embodiment, how to consume the inventory preferentially will be described in more detail, and any of the foregoing embodiments can be applied.

[0060] In an embodiment, refer to Figure 3 , Figure 3 is a flowchart of another order allocation method according to an exemplary embodiment. The order allocation method can include the following steps:

[0061] Step 302: The terminal device receives the to-be-allocated order and the allocation factor input by the user.

[0062] Step 304: It is judged whether there is overdue inventory in each factory.

[0063] In this step, the terminal device judges whether there is overdue inventory corresponding to the to-be-allocated order in each factory according to the order product required in the to-be-allocated order. The overdue inventory is the accumulated order product stored in the warehouse of the factory and not sold out for more than a certain standard time.

[0064] If there is overdue inventory in each factory, step 306 is continued.

[0065] If there is no overdue inventory in each factory, step 308 is performed.

[0066] Step 306: In a case where it is determined that there is overage inventory corresponding to the to-be-allocated order, the to-be-consumed overage inventory is determined according to the constraint condition, the target function, and a preset distance condition.

[0067] In this step, in a case where it is determined that there is overage inventory corresponding to the to-be-allocated order, the terminal device selects an optimal factory having overage inventory according to the constraint condition, the target function, and the preset distance condition, and takes the overage inventory in the optimal factory as the to-be-consumed overage inventory.

[0068] The optimal factory is a factory that meets the constraint condition, the target function, and the preset distance condition. The preset distance condition is a condition determined based on a logistics distance. For example, the inventory can be selected in an order from small to large logistics distance, or the inventory having a logistics distance within a preset distance range can be selected, which is not limited in the embodiments of the present application.

[0069] Step 308: It is determined whether there is exclusive purchase inventory in each factory.

[0070] In this step, the terminal device determines whether there is exclusive purchase inventory corresponding to the to-be-allocated order in each factory according to the order product required in the to-be-allocated order. The exclusive purchase inventory is an order product provided by an enterprise that is promised to be purchased and sold by a package seller within a certain period.

[0071] If there is exclusive purchase inventory in each factory, step 310 is performed.

[0072] If there is no exclusive purchase inventory in each factory, step 312 is performed.

[0073] Step 310: In a case where it is determined that there is exclusive purchase inventory corresponding to the to-be-allocated order, the to-be-consumed exclusive purchase inventory is determined according to the constraint condition, the target function, and the preset distance condition.

[0074] In this step, in a case where it is determined that there is exclusive purchase inventory corresponding to the to-be-allocated order, the terminal device selects an optimal factory having exclusive purchase inventory according to the constraint condition, the target function, and the preset distance condition, and takes the exclusive purchase inventory in the optimal factory as the to-be-consumed exclusive purchase inventory.

[0075] Step 312: An allocation state of an unallocated order is obtained based on the constraint condition and the target function.

[0076] In this step, if there is only overage inventory in each factory, the terminal device performs order allocation on the unallocated order based on the constraint condition and the target function, and obtains the allocation state of the unallocated order. The unallocated order is the to-be-allocated order after the to-be-consumed overage inventory is consumed.

[0077] If only the exclusive inventory exists in each factory, the terminal device performs order allocation on the unallocated orders based on the constraint conditions and the objective function to obtain the allocation state of the unallocated orders. The unallocated orders are the to-be-allocated orders after the to-be-consumed exclusive inventory is consumed.

[0078] If the overdue inventory and the exclusive inventory exist in each factory, the terminal device performs order allocation on the unallocated orders based on the constraint conditions and the objective function to obtain the allocation state of the unallocated orders. The unallocated orders are the to-be-allocated orders after the to-be-consumed overdue inventory and the to-be-consumed exclusive inventory are consumed.

[0079] As described above, by determining the to-be-consumed overdue inventory in a case where the to-be-allocated orders correspond to the overdue inventory in each factory, determining the to-be-consumed exclusive inventory in a case where the to-be-allocated orders correspond to the exclusive inventory in each factory, and preferentially consuming the overdue inventory and the exclusive inventory that meet the preset transport distance condition, the time experience of the consumer can be improved, the allocation state of the unallocated orders is obtained based on the constraint conditions and the objective function, and thus the overdue inventory and the exclusive inventory are preferentially consumed, the inventory turnover efficiency of the enterprise is improved, and the comprehensive production cost of the factory is reduced.

[0080] Step 314: determining whether the allocation state is an order receiving state.

[0081] In this step, the terminal device determines whether the allocation state of the unallocated order is the order receiving state.

[0082] Step 316: The terminal device determines an order receiving factory that receives the unallocated order.

[0083] Step 318: The terminal device determines an order receiving reason based on the unmet constraint conditions of the unallocated order.

[0084] In the foregoing embodiments, the overdue inventory and the exclusive inventory are preferentially consumed in the order allocation process. In the following embodiments, how to ensure that the allocation state meets the constraint conditions and the objective function will be described in more detail, and any of the foregoing embodiments can be applied.

[0085] In an embodiment, the constraint conditions include an efficiency constraint condition. The allocation factors include production efficiency and production efficiency upper limit of each line.

[0086] The efficiency constraint condition is determined according to the production efficiency and the production efficiency upper limit of each line, and is used to limit the production efficiency of each line in the factory. The production efficiency includes the yield and the capacity of each line. The production efficiency upper limit includes the yield upper limit and the capacity upper limit of each line.

[0087] It can be understood that the line body for producing products in the to-be-allocated order shown in the embodiments of the present specification is only an example, and based on different business scenarios, the production can also be performed by a device, a mold or the like, and the embodiments of the present specification do not limit this.

[0088] The performance constraint condition includes at least one of the following: the yield of a single product on a single line body should not exceed the capacity upper limit on the single line body, the capacity of all products on a single line body cannot exceed the total capacity upper limit on the single line body, and the total yield of all products on a single line body should not exceed the yield upper limit on the single line body.

[0089] Taking the performance constraint condition that the yield of a single product on a single line body should not exceed the capacity upper limit on the single line body as an example, the performance constraint condition can be shown in formula (1):

[0090]

[0091] wherein, l represents a line body in a factory, L represents a set of line bodies in the factory, p represents a product in a to-be-allocated order, and P represents a set of products that can be produced by the line body. l,p η represents the yield of the line body l producing the product p, and n l,p is a positive integer variable. η represents the capacity upper limit of the line body l producing the product p.

[0092] Taking the performance constraint condition that the capacity of all products on a single line body cannot exceed the total capacity upper limit on the single line body as an example, the performance constraint condition can be shown in formula (2):

[0093]

[0094] wherein, l represents a line body in a factory, L represents a set of line bodies in the factory, p represents a product in a to-be-allocated order, and P represents a set of products that can be produced by the line body. l,p η represents the yield of the line body l producing the product p, and n l.p η represents the calendar occupancy rate of the line body l producing the product p. η represents the capacity upper limit of the line body l producing the product p.

[0095] Taking the performance constraint condition that the total yield of all products on a single line body should not exceed the yield upper limit on the single line body as an example, the performance constraint condition can be shown in formula (3):

[0096]

[0097] wherein, l represents a line body in a factory, L represents a set of line bodies in the factory, and p represents a product in a to-be-allocated order. l,p η represents the yield of the line body l producing the product p, represents the upper limit of the production capacity of all products produced by line l.

[0098] As described above, by taking the performance constraint determined according to the production performance and the upper limit of the production performance of each line as a constraint condition for obtaining the allocation state, it can be ensured that the production performance of the factory to which the order to be allocated is allocated does not exceed the upper limit of the production performance, and the rationality of order allocation is ensured.

[0099] In an embodiment, the constraint condition comprises: a specified allocation constraint condition. The allocation factor comprises at least one of: a specified allocation state of the order to be allocated, and a specified order receiving factory of the order to be allocated.

[0100] The specified allocation constraint condition is determined according to at least one of the specified allocation state of the order to be allocated and the specified order receiving factory of the order to be allocated, and the specified allocation constraint condition is used to limit at least one of the specified allocation state of the order to be allocated and the specified order receiving factory of the order to be allocated. The specified allocation state is a user-specified allocation state, and the specified order receiving factory is a user-specified order receiving factory.

[0101] The specified allocation constraint condition comprises at least one of: the allocation state being the specified allocation state, the order receiving factory being the specified order receiving factory, the allocation state being the specified allocation state and the order receiving factory being the specified order receiving factory.

[0102] Taking the specified allocation constraint condition as the allocation state being the specified allocation state as an example, the specified allocation constraint condition can be as shown in formula (4):

[0103]

[0104] Wherein, o represents the order to be allocated, O represents the set of orders, and f represents the factory. o,f represents whether the order o is allocated to the factory f. o,f s o,f = 1 represents that the order o is allocated to the factory f. f = 0 represents that the order o is not allocated to the factory f. represents the set of orders in the specified order receiving state.

[0105] Taking the specified allocation constraint condition as the order receiving factory being the specified order receiving factory as an example, the specified allocation constraint condition can be as shown in formula (5):

[0106] ∑ f s o,f = 0, o∈O (5)

[0107] Wherein, o represents the order to be allocated, O represents the set of orders, and f represents the factory. o,f represents whether the order o is allocated to the factory f. represents the non-specified factory of the order o, indicates a factory f supporting production of an order o to be allocated, indicates a designated factory f accepting an order o to be allocated.

[0108] Taking the designated allocation constraint condition as an example that the designated allocation state is the allocation state and the designated accepting factory is the designated factory, the designated allocation constraint condition can be shown as formula (6):

[0109] s o,f = 1, o e O (6)

[0110] wherein o represents an order to be allocated, O represents a set of orders, f represents a factory, s o,f indicates whether the order o is allocated to the factory f.

[0111] As described above, by taking the designated allocation constraint condition determined according to the designated allocation state of the order to be allocated as the constraint condition for obtaining the allocation state, it can be ensured that the order state allocated to the order to be allocated is the designated allocation state; by taking the designated allocation constraint condition determined according to the designated allocation factory of the order to be allocated as the constraint condition for obtaining the allocation state, it can be ensured that the factory allocated to the order to be allocated is the designated allocation factory, thereby ensuring that the order allocation meets the designated requirements of the user.

[0112] In an embodiment, the constraint condition comprises a production capacity constraint condition. The allocation factor comprises an inventory quantity of each factory.

[0113] wherein the production capacity constraint condition is determined according to a product quantity of the order to be allocated, the inventory quantity of each factory and a production capacity of each line, and the production capacity constraint condition is used to limit the link relationship of the line of the factory accepting the order to be allocated to produce the product. The inventory quantity is the number of inventory in each factory.

[0114] Taking the production capacity constraint condition as an example that the sum of the production capacity of the line and the inventory quantity of the factory is greater than or equal to the product quantity, the production capacity constraint condition can be shown as formula (7):

[0115] ∑ l∈(f,l) n l,p + I f,p ≥ ∑ o N o,p · s o,p , o e O (7)

[0116] wherein o represents an order to be allocated, O represents a set of orders, f represents a factory. l represents a line in the factory, and p represents a product in the order to be allocated. I f,p represents the inventory quantity of the product p in the factory f, N o,p represents the product quantity of the product p in the order to be allocated o, s o,f represents whether the order o is allocated to the factory f. nl,p represents the production quantity of the product p of the line body l, represents the factory f with the line body l.

[0117] As described above, by taking the production quantity constraint determined according to the product quantity of the to-be-allocated order, the inventory quantity of each factory and the production quantity of each line body as the constraint condition for obtaining the allocation state, it can be ensured that the inventory of the factory and the production quantity of the product produced by the factory allocated to the to-be-allocated order meet the product quantity required by the to-be-allocated order, and the rationality of order allocation is ensured.

[0118] In an embodiment, the constraint condition comprises: a whole vehicle order constraint condition. The allocation factor comprises: an allocation state of a whole vehicle order corresponding to the to-be-allocated order.

[0119] The whole vehicle order constraint condition is determined according to the allocation state of the whole vehicle order corresponding to the to-be-allocated order, and is used to limit the allocation states of the whole vehicle orders to be the same. The whole vehicle order is an order transported by the same vehicle and having the same allocation state, and the allocation states of all orders in the whole vehicle order are simultaneously accepted, rejected or delayed.

[0120] Taking the condition that the allocation states of the whole vehicle orders are the same as an example, the whole vehicle order constraint condition can be shown in formula (8):

[0121]

[0122] Wherein, o represents the to-be-allocated order, O represents the set of orders, and f represents the factory. o,f represents whether the order o is allocated to the factory f, represents the set of all orders in the whole vehicle order in which the order o is located.

[0123] As described above, by taking the whole vehicle order constraint condition determined according to the allocation state of the whole vehicle order corresponding to the to-be-allocated order as the constraint condition for obtaining the allocation state, it can be ensured that the allocation states of the orders transported by the same vehicle are all the same, thereby saving the logistics cost.

[0124] In an embodiment, the constraint condition comprises: a minimum production batch constraint condition. The allocation factor comprises: a minimum economic batch value corresponding to the to-be-allocated order and the production quantity of each line body.

[0125] The minimum production batch constraint condition is determined according to the minimum economic batch value of the to-be-allocated order and the production quantity of each line body, and is used to limit the lowest product quantity put into production or output at a time.

[0126] The minimum economic batch value is the most economical production batch determined in the production process by considering factors such as procurement cost, production cost and storage cost.

[0127] With the minimum production batch constraint condition being that the sum of the production quantity of the line body and the inventory quantity of the product is greater than or equal to the minimum economic batch value, the minimum production batch constraint condition can be shown as formula (9):

[0128]

[0129] wherein o represents the order to be allocated, O represents a set of orders, f represents a factory. l represents a line body in the factory, and p represents a product in the order to be allocated. l,p represents the production quantity of the product p produced by the line body l, is the inventory quantity of the product p, and represents the minimum economic batch value of the product p.

[0130] As described above, by taking the minimum production batch constraint condition determined according to the minimum economic batch value of the order to be allocated and the production quantity of each line body as a constraint condition for obtaining the allocation state, the line bodies in the factory can be continuously operated, the production efficiency is improved, the production batches and switching times are reduced, and the production cost is reduced.

[0131] In an embodiment, the constraint condition can further include a unique factory constraint condition. The unique factory constraint condition is used to limit that all products in the order to be allocated are produced by a unique factory.

[0132] Exemplarily, the unique factory constraint condition can be shown as formula (10):

[0133] ∑ f s o,f ≤1, o∈O (10)

[0134] wherein o represents the order to be allocated, O represents a set of orders, f represents a factory. s o,f represents whether the order o is allocated to the factory f.

[0135] As described above, by taking the unique factory constraint condition as a constraint condition for obtaining the allocation state, all products in the order to be allocated can be produced by a unique factory, so that the logistics management can be simplified, and the transportation and storage costs are reduced.

[0136] In an embodiment, the constraint condition can further include a transportation distance constraint condition. The transportation distance constraint condition is used to limit that the logistics transportation distance of the order-accepting factory cannot exceed a preset transportation distance.

[0137] Exemplarily, the transportation distance constraint condition can be shown as formula (11):

[0138] ∑ f s o,f ≤1, o∈O (11)

[0139] wherein o represents an order to be allocated, O represents a set of orders, f represents a factory, s o,f represents whether the order o is allocated to the factory f. represents factories whose logistic distances exceed a preset distance, represents factories that support production of the order o to be allocated, represents factories whose logistic distances exceed a preset distance.

[0140] As described above, by taking the logistic distance constraint as a constraint condition for obtaining the allocation state, the production of the order to be allocated is realized in the vicinity, which helps to reduce the cost of long-distance transportation, reduce the logistics cost, improve the timeliness experience of consumers, reduce the uncertainty and risk in the supply chain, and ensure the stability of the supply chain.

[0141] In an embodiment, the objective function includes at least one of: a maximum priority objective function, a minimum total cost objective function, and a maximum order quantity objective function.

[0142] The maximum priority objective function is established according to the priority score of the order to be allocated, and is used to give priority to the order to be allocated with the highest priority score. The priority score of the order to be allocated is evaluated according to the urgency, value, priority and other factors of the order to be allocated.

[0143] For example, the maximum priority objective function can be shown as formula (12):

[0144] f1 = max∑ f G o ·s o,f , o ∈ O, f ∈ F (12)

[0145] wherein f1 represents the maximum priority objective function. o represents an order to be allocated, O represents a set of orders, f represents a factory, and F represents a set of factories. s o,f represents whether the order o is allocated to the factory f, and G o represents the priority score of the order to be allocated o.

[0146] The minimum total cost objective function is established according to the total cost per piece in the order to be allocated, and is used to give priority to the minimum supply chain operation cost. The total cost per piece is the total cost allocated by each product in the order to be allocated.

[0147] For example, the minimum total cost objective function can be shown as formula (13):

[0148] f2 = min∑ o ∑ f ∑ p C o,f,p ·s o,f, o∈O, f∈F, p∈P (13)

[0149] wherein f2 represents the minimum total cost objective function. o represents the to-be-allocated order, O represents the set of orders, f represents the factory, F represents the set of factories. p represents the product in the to-be-allocated order, P represents the set of products. s o,f represents whether the order o is allocated to the factory f, C o,f,p represents the total cost per piece of the order o in the factory f to produce the product p.

[0150] The maximum order quantity objective function is established according to the product quantity of the to-be-allocated order, and is used to give priority to the maximum order quantity.

[0151] Exemplarily, the maximum order quantity objective function can be as shown in formula (14):

[0152] f3 = max∑ f s o,f ·N o,p , o∈O, f∈F (14)

[0153] wherein f3 represents the maximum order quantity objective function. o represents the to-be-allocated order, O represents the set of orders, f represents the factory, F represents the set of factories. s o,f represents whether the order o is allocated to the factory f, N o,p represents the product quantity of the product p in the to-be-allocated order o.

[0154] As described above, by taking the maximum priority objective function established according to the priority score of the to-be-allocated order, the minimum total cost objective function established according to the total cost per piece in the to-be-allocated order, and the maximum order quantity objective function established according to the product quantity of the to-be-allocated order as the objective function of the obtained allocation state, the optimization objectives of maximizing the order priority, minimizing the supply chain cost, and maximizing the order quantity are comprehensively considered, so that the enterprise limited resources obtain the maximum benefit.

[0155] In an embodiment, the terminal device performs weighted calculation on the maximum priority objective function, the minimum total cost objective function, and the maximum order quantity objective function according to a preset target weight, to obtain a weighted objective function after the weighted calculation. The weighted objective function is taken as the objective function, so as to realize normalization of the multiple single objective functions.

[0156] wherein the weighted objective function is a function after the weighted calculation on the multiple single objective functions. The target weight is according to the weight occupied by each single objective function, and can be a constant or an expression, which is not limited by the embodiments of the present specification.

[0157] Exemplarily, the weighted objective function can be as shown in formula (15):

[0158]

[0159] Wherein, f4 represents a weighted target function. f1 represents a maximum priority target function, f2 represents a minimum total cost target function, and f3 represents a maximum order quantity target function. k1 represents a target weight of the maximum priority target function, k2 represents a target weight of the minimum total cost target function, and k3 represents a target weight of the maximum order quantity target function.

[0160] As described above, by performing weighted calculation on the maximum priority target function, the minimum total cost target function and the maximum order quantity target function according to preset target weights, a weighted target function after weighted calculation is obtained, and the weighted target function is used as a target function, so that the user can customize the weights of the target functions according to the business scenarios, normalize multiple single optimization targets, and make the allocation state more consistent with the optimization targets.

[0161] Figure 4 is a structural schematic diagram of an electronic device according to an example embodiment. The electronic device may, for example, be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a personal digital assistant, a server, a smart home appliance, etc. Referring to Figure 4 At the hardware level, the electronic device includes a processor 402, an internal bus 404, a network interface 406, a memory 408, and a non-volatile memory 410, and of course, other hardware required by the business. The processor 402 reads the corresponding computer program from the non-volatile memory 410 into the memory 408 and then runs, and forms an order allocation apparatus at the logical level. Of course, in addition to the software implementation, the present application does not exclude other implementation manners, such as logic devices or a combination of software and hardware, etc., that is, the execution subject of the following processing flow is not limited to each logical unit, but can also be hardware or a logic device.

[0162] Figure 5 is a block diagram of an order allocation apparatus according to an example embodiment.

[0163] Referring to Figure 5 The apparatus can include an information receiving module 502 and a state obtaining module 504, wherein:

[0164] The information receiving module 502 is configured to receive a to-be-allocated order and an allocation factor input by a user, and the allocation factor is configured to determine a constraint condition and a target function of the to-be-allocated order.

[0165] The state obtaining module 504 is configured to obtain an allocation state of the to-be-allocated order based on the constraint condition and the target function; the allocation state includes an order-accepted state or an order-unaccepted state.

[0166] In one example, the allocation factor includes overdue inventory and exclusive inventory; before the state obtaining module 504 is configured to obtain the allocation state of the to-be-allocated order based on the constraint condition and the target function, the state obtaining module 504 further includes: determining to-be-consumed overdue inventory according to the constraint condition, the target function and a preset transportation distance condition, when it is determined that the to-be-allocated order corresponds to overdue inventory in each factory; determining to-be-consumed exclusive inventory according to the constraint condition, the target function and the preset transportation distance condition, when it is determined that the to-be-allocated order corresponds to exclusive inventory in each factory; when the state obtaining module 504 is configured to obtain the allocation state of the to-be-allocated order based on the constraint condition and the target function, the state obtaining module 504 includes: obtaining the allocation state of an unallocated order based on the constraint condition and the target function, the unallocated order being the to-be-allocated order after the to-be-consumed overdue inventory and the to-be-consumed exclusive inventory are consumed.

[0167] In one example, the allocation factor includes production efficiency and production efficiency upper limit of each line; the constraint condition includes an efficiency constraint condition; the efficiency constraint condition is determined according to the production efficiency and the production efficiency upper limit of each line.

[0168] In one example, the allocation factor includes at least one of a specified allocation state of the to-be-allocated order and a specified order-accepted factory of the to-be-allocated order; the constraint condition includes a specified allocation constraint condition; the specified allocation constraint condition is determined according to at least one of the specified allocation state of the to-be-allocated order and the specified order-accepted factory of the to-be-allocated order.

[0169] In one example, the allocation factor includes inventory quantity of each factory; the constraint condition includes a production quantity constraint condition; the production quantity constraint condition is determined according to product quantity of the to-be-allocated order, the inventory quantity of each factory and production quantity of each line.

[0170] In one example, the allocation factor includes an allocation state of a whole vehicle order corresponding to the to-be-allocated order; the whole vehicle order is an order transported by the same vehicle and having the same allocation state; the constraint condition includes a whole vehicle order constraint condition; the whole vehicle order constraint condition is determined according to the allocation state of the whole vehicle order corresponding to the to-be-allocated order.

[0171] In one example, the allocation factors include: the minimum economic batch value corresponding to the order to be allocated and the output of each line; the constraints include: the minimum production batch constraint; the minimum production batch constraint is determined based on the minimum economic batch value of the order to be allocated and the output of each line.

[0172] In one example, the objective function includes at least one of the following: a maximum priority objective function, which is established based on the priority score of the order to be assigned; a minimum total cost objective function, which is established based on the average total cost per piece in the order to be assigned; and a maximum order quantity objective function, which is established based on the number of products in the order to be assigned.

[0173] In one example, the status acquisition module 504, before being used to obtain the allocation status of the order to be allocated based on the constraint conditions and the objective function, also includes: performing weighted calculation on the maximum priority objective function, the minimum total cost objective function and the maximum order quantity objective function according to preset target weights to obtain a weighted objective function after weighted calculation; and using the weighted objective function as the objective function.

[0174] In one example, the status acquisition module 504 is further configured to determine the reason why the order to be allocated is not accepted based on the constraint conditions not satisfied by the order to be allocated when it is determined that the allocation status is the unaccepted order status.

[0175] The implementation process of the functions and effects of each unit in the above-mentioned device is specifically described in the implementation process of the corresponding steps in the above-mentioned method, and will not be repeated here.

[0176] For the device embodiments, since they basically correspond to the method embodiments, the relevant parts can be referred to the partial description of the method embodiments. The device embodiments described above are merely illustrative, wherein the modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place, or they may be distributed on multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this specification. A person of ordinary skill in the art can understand and implement it without paying any creative work.

[0177] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions is also provided, such as a memory including instructions. The instructions can be executed by a processor of an order distribution device to implement any of the methods described in the above embodiments.

[0178] The non-transitory computer readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disc, and an optical data storage device, and the like, and the present application is not limited thereto.

[0179] In an example embodiment, there is also provided a computer program product comprising computer program instructions / program code executable by a processor of an order allocation device to implement a method as claimed in any of the above embodiments.

[0180] The above description has described certain exemplary embodiments. Other embodiments are within the scope and range of equivalents of the claims. In some cases, acts or steps can be performed in an order different from the order in which they are presented here. Also, the processes depicted in the figures do not necessarily require the particular order shown, or sequential order to achieve the desired results. In certain implementations, multitasking and parallel processing can be advantageous.

[0181] Other embodiments of the present description will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. The specification and examples given are considered exemplary only, and the true scope and spirit of the present description is indicated by the following claims.

[0182] It will be understood that the present description is not limited to the precise structures as herein described and illustrated in the drawings, and that various modifications and changes can be made by those skilled in the art without departing from the scope of the present description. The scope of the present description is limited only by the claims that follow.

[0183] The above description is only preferred embodiments of the present description and is not used to limit the present description. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present description shall be included in the scope of protection of the present description.

Claims

1. An order allocation method, characterized by, The method comprises: receiving a user inputted order to be allocated and an allocation factor; the allocation factor is used to determine a constraint condition and an objective function of the order to be allocated; obtaining an allocation state of the order to be allocated based on the constraint condition and the objective function; the allocation state comprises an order receiving state or an order not receiving state.

2. The method of claim 1, wherein, The allocation factor comprises overdue inventory and exclusive inventory. Before the step of obtaining the allocation state of the order to be allocated based on the constraint condition and the objective function, the method further comprises: determining the overdue inventory to be consumed according to the constraint condition, the objective function and a preset transportation distance condition when it is determined that the order to be allocated corresponds to the overdue inventory in each factory; determining the exclusive inventory to be consumed according to the constraint condition, the objective function and the preset transportation distance condition when it is determined that the order to be allocated corresponds to the exclusive inventory in each factory. The step of obtaining the allocation state of the order to be allocated based on the constraint condition and the objective function comprises: obtaining the allocation state of an unallocated order based on the constraint condition and the objective function; the unallocated order is the order to be allocated after the overdue inventory to be consumed and the exclusive inventory to be consumed.

3. The method of claim 1, wherein, The allocation factor comprises production efficiency and production efficiency upper limit of each line body. The constraint condition comprises an efficiency constraint condition; the efficiency constraint condition is determined according to the production efficiency and the production efficiency upper limit of each line body.

4. The method of claim 1, wherein, The allocation factor comprises at least one of a specified allocation state of the order to be allocated and a specified order receiving factory of the order to be allocated. The constraint condition comprises a specified allocation constraint condition; the specified allocation constraint condition is determined according to at least one of the specified allocation state of the order to be allocated and the specified order receiving factory of the order to be allocated.

5. The method of claim 1, wherein, The allocation factor comprises inventory quantity of each factory. The constraint condition comprises a production quantity constraint condition; the production quantity constraint condition is determined according to product quantity of the order to be allocated, inventory quantity of each factory and production quantity of each line body.

6. The method of claim 1, wherein, The allocation factor comprises an allocation state of a whole vehicle order corresponding to the order to be allocated; the whole vehicle order is an order transported by the same vehicle and having the same allocation state. The constraint condition comprises a whole vehicle order constraint condition; the whole vehicle order constraint condition is determined according to the allocation state of the whole vehicle order corresponding to the order to be allocated.

7. The method of claim 1, wherein, The allocation factor comprises minimum economic batch value corresponding to the order to be allocated and production quantity of each line body. The constraint condition comprises a minimum production batch constraint condition; the minimum production batch constraint condition is determined according to the minimum economic batch value corresponding to the order to be allocated and the production quantity of each line body.

8. The method of claim 1, wherein, The objective function comprises at least one of: a maximum priority objective function; the maximum priority objective function is established according to priority score of the order to be allocated; a minimum total cost objective function; the minimum total cost objective function is established according to total cost per piece in the order to be allocated. a maximum order quantity objective function established according to a product quantity of the to-be-allocated order.

9. The method of claim 8, wherein, Before the obtaining, according to the constraint condition and the objective function, of the allocation state of the to-be-allocated order, the method further includes: performing weighted calculation on the maximum priority objective function, the minimum total cost objective function and the maximum order quantity objective function according to a preset target weight to obtain a weighted objective function after weighted calculation; the weighted objective function after weighted calculation is used as the objective function.

10. The method of claim 1, wherein, The method further includes: in a case where the allocation state is determined as the un-ordered state, determining an un-ordered reason of the to-be-allocated order based on an un-satisfied constraint condition of the to-be-allocated order.

11. An order allocation apparatus characterized by comprising: The device includes: an information receiving module configured to receive a to-be-allocated order and an allocation factor input by a user; the allocation factor is used to determine a constraint condition and an objective function of the to-be-allocated order; a state obtaining module configured to obtain an allocation state of the to-be-allocated order based on the constraint condition and the objective function; the allocation state includes an ordered state or an un-ordered state.

12. An electronic device, comprising: include: a processor; a memory for storing processor-executable instructions; wherein the processor implements the method according to any one of claims 1-10 by running the executable instructions.

13. A computer readable storage medium having stored thereon computer instructions, wherein, The instructions are executed by the processor to implement the method according to any one of claims 1-10.

14. A computer program product having stored thereon computer programs / instructions, characterized in that, The computer program / instructions are executed by the processor to implement the method according to any one of claims 1-10.

Images