An order scheduling method and device, a storage medium and an electronic device

Abstract

This specification discloses an order scheduling method, apparatus, storage medium, and electronic device. Based on the fit between any order to be assigned and any delivery capacity, an initial matching scheme is determined, consisting of the matching relationships established between the order to be assigned and the delivery capacity. Instead of directly assigning orders based on the matching relationships in the initial matching scheme, at least some of the matching relationships are adjusted based on the initial matching scheme to obtain an adjusted optimized matching scheme. Then, a target matching scheme is selected from the initial and optimized matching schemes, and orders are assigned based on the matching relationships in the target matching scheme. The order scheduling method proposed in this specification ensures that the optimized matching scheme after adjusting the matching relationships is better than the initial matching scheme under a second comprehensive fit metric, and that the selected target matching scheme is better than the other matching scheme under a target fit metric.

Description

TECHNICAL FIELD

[0001] The present specification relates to the technical field of computer technology, and particularly relates to an order scheduling method and device, a storage medium and an electronic device. BACKGROUND

[0002] At present, online transactions have become the transaction mode selected by a large number of consumers, and the offline delivery of orders of online transactions by logistics has also become an indispensable part of daily life. The order scheduling method selected by logistics determines the cost and timeliness of logistics.

[0003] The existing order scheduling method is limited by the selected algorithm and can only optimize one index as a target. Therefore, each index of interest is usually weighted as a comprehensive index, the comprehensive index is optimized, and a matching scheme composed of each matching relationship between the order and the distribution vehicle is obtained.

[0004] The comprehensive index can evaluate the pros and cons of a pair of matching relationships as a whole, but when a pair of matching relationships appears in an extreme case in an individual index, if the individual index is not one of the components of the comprehensive index, it is obviously impossible to observe the extreme case through the comprehensive index. Even if it is a component of the comprehensive index, it is often difficult to reflect through the comprehensive index weighted with other indexes, but the extreme case can have a great impact on the result of order scheduling. SUMMARY

[0005] The present specification provides an order scheduling method, device, storage medium and electronic device to partially solve the above problems existing in the prior art.

[0006] The embodiment of the present specification adopts the following technical scheme:

[0007] The order scheduling method provided by the present specification comprises:

[0008] determining information of each to-be-allocated order and each distribution vehicle;

[0009] for each type of adaptability preset, determining the adaptability of the type in a case that any to-be-allocated order and any distribution vehicle establish a matching relationship according to the information of each to-be-allocated order and each distribution vehicle; determining a first comprehensive adaptability in the case according to the adaptability of each type in the case; and establishing a matching relationship between each to-be-allocated order and each distribution vehicle in the case as an initial matching scheme according to the first comprehensive adaptability;

[0010] adjusting at least part of the matching relationship in the initial matching scheme with the maximum second comprehensive adaptability as a target, and taking the adjusted matching relationship between each to-be-allocated order and each distribution vehicle as an optimized matching scheme;

[0011] selecting a target matching scheme from the initial matching scheme and the optimized matching scheme according to a preset at least one type of target matching degree;

[0012] allocating each to-be-allocated order to a corresponding delivery capacity according to each matching relationship in the target matching scheme.

[0013] Optionally, the at least part of the matching relationships in the initial matching scheme are adjusted, specifically including:

[0014] selecting a to-be-adjusted order from the to-be-allocated orders according to the initial allocation scheme;

[0015] selecting a to-be-adjusted capacity from the delivery capacities according to the first comprehensive matching degree under each case;

[0016] adjusting the matching relationship corresponding to the to-be-adjusted order, wherein the matching relationship corresponding to the to-be-adjusted order after adjustment is the matching relationship with the to-be-adjusted capacity.

[0017] Optionally, the to-be-adjusted order is selected from the to-be-allocated orders according to the initial allocation scheme, specifically including:

[0018] for each delivery capacity, determining a delivery path of the delivery capacity according to the allocated orders of the delivery capacity and the to-be-allocated orders of the delivery capacity in the initial allocation scheme;

[0019] dividing the allocated orders of the delivery capacity and the to-be-allocated orders of the delivery capacity in the initial allocation scheme into at least one order package according to the delivery path, as an order package corresponding to the delivery capacity;

[0020] selecting an order package meeting a specified condition from the order packages corresponding to the delivery capacities, as a to-be-adjusted order package;

[0021] including at least part of the orders in each of the to-be-adjusted order packages as to-be-adjusted orders.

[0022] Optionally, the allocated orders of the delivery capacity and the to-be-allocated orders of the delivery capacity in the initial allocation scheme are divided into at least one order package, specifically including:

[0023] dividing at least one sub-path from the delivery path; wherein for each sub-path, determining the orders of each task point passing through the sub-path as the orders corresponding to the sub-path, and all the task points included in all the orders corresponding to the sub-path are on the sub-path;

[0024] for each sub-path, taking the set of the orders corresponding to the sub-path as the order package corresponding to the sub-path.

[0025] Optionally, the order package satisfying the specified condition comprises one or more of the following in combination:

[0026] According to the delivery path adopted by each delivery capacity to deliver each order, the order packages are sorted according to the order of the task points included in each order, and at least one order package is selected as the order package satisfying the specified condition in reverse order of the order package sorting;

[0027] The order package satisfying the specified condition does not include an allocated order;

[0028] According to the information of the orders to be allocated and the delivery capacities, at least the scheduling unit corresponding to each order to be adjusted in each order to be allocated is determined, and the orders in the order package satisfying the specified condition correspond to the same scheduling unit.

[0029] Optionally, adjusting the matching relationship corresponding to the order to be adjusted comprises:

[0030] Adjusting the matching relationship corresponding to the order package to be adjusted.

[0031] Optionally, adjusting the matching relationship corresponding to the order to be adjusted comprises:

[0032] According to the information of the orders to be allocated and the delivery capacities, the scheduling units corresponding to the orders to be adjusted and the delivery capacities to be adjusted are determined;

[0033] For each scheduling unit, the matching relationship corresponding to the orders to be adjusted in the scheduling unit is adjusted, and the adjusted matching relationship corresponding to the orders to be adjusted is the matching relationship with the delivery capacities to be adjusted in the scheduling unit.

[0034] Optionally, determining the scheduling units corresponding to the orders to be adjusted and the delivery capacities to be adjusted comprises:

[0035] According to the information of the orders to be allocated and the delivery capacities, the initial scheduling units corresponding to the delivery capacities to be adjusted are determined;

[0036] For each delivery capacity to be adjusted, if the delivery capacity to be adjusted corresponds to at least two initial scheduling units, for each initial scheduling unit corresponding to the delivery capacity to be adjusted, a third comprehensive fitness degree of the delivery capacity to be adjusted and the initial scheduling unit is determined according to the first comprehensive fitness degrees in the case that the initial delivery capacity and each order to be adjusted in the initial scheduling unit establish a matching relationship.

[0037] According to the third comprehensive fitness degrees of the delivery capacity to be adjusted and the initial scheduling units, the scheduling unit corresponding to the delivery capacity to be adjusted is selected from the initial scheduling units corresponding to the delivery capacity to be adjusted.

[0038] Optionally, a target matching scheme is selected from the initial matching scheme and the optimized matching scheme according to at least one type of target fitness degree pre-set, and specifically includes:

[0039] For each target fitness degree, the initial matching scheme corresponding to the target fitness degree is determined according to the target fitness degree under the condition that each matching relationship in the initial matching scheme is established, and the optimized matching scheme corresponding to the target fitness degree is determined according to the target fitness degree under the condition that each matching relationship in the optimized matching scheme is established.

[0040] When each target fitness degree corresponding to the optimized matching scheme is not lower than each target fitness degree corresponding to the initial matching scheme, the optimized matching scheme is selected as the target matching scheme.

[0041] Optionally, the target fitness degree is one or more of each type of fitness degree pre-set.

[0042] The order scheduling device provided in the specification includes:

[0043] An information acquisition module is configured to determine information of each to-be-allocated order and each delivery capacity.

[0044] An initial matching module is configured to, for each type of fitness degree pre-set, determine a fitness degree of the type under the condition that any to-be-allocated order and any delivery capacity establish a matching relationship according to the information of each to-be-allocated order and each delivery capacity, determine a first comprehensive fitness degree under the condition according to the fitness degree of each type under the condition, and establish a matching relationship for each to-be-allocated order and each delivery capacity according to the first comprehensive fitness degree as an initial matching scheme.

[0045] An optimized matching module is configured to, with the maximum second comprehensive fitness degree as a target, adjust at least part of the matching relationship in the initial matching scheme, and take the matching relationship of each to-be-allocated order and each delivery capacity after adjustment as an optimized matching scheme.

[0046] A target selection module is configured to select a target matching scheme from the initial matching scheme and the optimized matching scheme according to at least one type of target fitness degree pre-set.

[0047] An order allocation module is configured to allocate each to-be-allocated order to a corresponding delivery capacity according to each matching relationship in the target matching scheme.

[0048] The computer readable storage medium provided in the specification stores a computer program, and the computer program is executed by a processor to implement the order scheduling method described above.

[0049] The electronic device provided in the specification comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the order scheduling method when executing the program.

[0050] The above at least one technical solution adopted by the embodiments of the specification can achieve the following beneficial effects:

[0051] According to the adaptation degree in the case of establishing a matching relationship between any to-be-allocated order and any delivery capacity, the initial matching scheme constituted by the matching relationships between the to-be-allocated orders and the delivery capacities is determined, and then the matching relationships in the initial matching scheme are adjusted on the basis of the initial matching scheme to obtain an optimized matching scheme after adjustment, and then a target matching scheme is selected from the initial matching scheme and the optimized matching scheme, and the orders are allocated according to the matching relationships in the target matching scheme. The order scheduling method provided in the specification can ensure that the optimized matching scheme after adjustment of the matching relationships is superior to the initial matching scheme in the measurement of the second comprehensive adaptation degree, and the selected target matching scheme is superior to another matching scheme in the measurement of the target adaptation degree. BRIEF DESCRIPTION OF DRAWINGS

[0052] The accompanying drawings described herein are used to provide further understanding of the specification, constitute a part of the specification, and the illustrative embodiments of the specification and the description thereof are used to explain the specification, and do not constitute an improper limitation on the specification. In the drawings:

[0053] Figure 1 It is a flowchart of an order scheduling method in the specification;

[0054] Figure 2 It is a flowchart of a method for selecting a to-be-adjusted order in the specification;

[0055] Figure 3 It is a schematic diagram of an order package provided in the specification;

[0056] Figure 4 It is a flowchart of determining a scheduling unit for a delivery capacity in the specification;

[0057] Figure 5 It is a schematic diagram of adjusting the matching relationship based on the KM algorithm of the bipartite graph provided in the specification;

[0058] Figure 6 It is a schematic diagram of an order scheduling device provided in the specification;

[0059] Figure 7 It is a schematic diagram of an electronic device corresponding to Figure 1 provided in the specification. DETAILED DESCRIPTION

[0060] In order to make the objectives, technical solutions and advantages of the present specification clearer, the technical solutions of the present specification will be described clearly and completely below in conjunction with specific embodiments of the present specification and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of the present specification, rather than all the embodiments. Based on the embodiments in the present specification, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present specification.

[0061] The order scheduling problem is a classical application of the resource allocation problem, which is embodied in the logistics field as allocating orders to be distributed to appropriate distribution capacity. The embodiments provided by the present application can all be used as technical solutions to solve this technical problem. Due to the commonality of the resource allocation problem, the embodiments provided by the present application can also be applied to solve resource allocation problems in other fields. Specifically, it can be to allocate processing resources for tasks to be processed, for example, to decompose a task that needs to occupy huge computing resources in distributed computing into several sub-tasks, and allocate computing resources to each sub-task.

[0062] When the order scheduling method provided by the present application is used as a resource allocation method for resource allocation, it can be:

[0063] A resource allocation method, characterized in that it comprises:

[0064] determining information of tasks to be allocated and processing resources;

[0065] for each type of adaptability set in advance, determining the adaptability of this type under the condition that any task to be allocated and any processing resource establish a matching relationship according to the information of the tasks to be allocated and the processing resources; determining a first comprehensive adaptability under the condition according to the adaptability of each type; establishing a matching relationship for each task to be allocated and each processing resource according to the first comprehensive adaptability as an initial matching scheme;

[0066] adjusting at least part of the matching relationship in the initial matching scheme with the goal of maximizing the second comprehensive adaptability, and taking the adjusted matching relationship of each task to be allocated and each processing resource as an optimized matching scheme;

[0067] selecting a target matching scheme from the initial matching scheme and the optimized matching scheme according to at least one type of target adaptability set in advance;

[0068] allocating each task to be allocated to the corresponding processing resource according to the matching relationship in the target matching scheme.

[0069] It can be seen that the technical solution provided by the present application can be applied to various application fields of resource allocation and achieve allocation of tasks and processing resources. For ease of description, the embodiments are described below by taking order scheduling in the logistics field as an example.

[0070] The technical solution provided by each embodiment of the present specification is described in detail below with reference to the accompanying drawings.

[0071] Figure 1 The order scheduling flowchart provided by the embodiments of the present specification includes:

[0072] S100: Determine information of each to-be-allocated order and each delivery capacity.

[0073] In the embodiments of the present specification, the to-be-allocated order is an order that needs to be allocated to a delivery capacity. It can be an order newly generated within a preset time period, an order generated before a preset time point and not allocated to a delivery capacity, or an order generated before a preset time point and already allocated to a delivery capacity but needs to be reassigned to another delivery capacity. In actual application scenarios, any order that needs to be allocated to a delivery capacity can be a to-be-allocated order.

[0074] For each to-be-allocated order, information of the to-be-allocated order is obtained. The information of the to-be-allocated order can include order generation time, estimated delivery time, location information of a task point, etc. The task point can include a pickup point and / or a delivery point of the to-be-allocated order.

[0075] The delivery capacity is a transportation unit that can deliver a to-be-allocated order allocated from a supplier location to a receiver location. It can be a transportation tool or a delivery person. The word "can" can refer to the ability of the delivery capacity to achieve the delivery process, or the willingness of the delivery capacity to receive the to-be-allocated order and deliver the order. The information of the delivery capacity can include information such as transportation speed, carrying capacity, and maximum driving distance of each delivery capacity, and information such as each allocated order of each delivery capacity.

[0076] When the transportation tool is a driverless vehicle, such as a drone or a self-driving vehicle, the delivery capacity can be the transportation tool; when the transportation tool is a vehicle requiring a driver, the delivery capacity can be the transportation tool and / or the delivery personnel, and specifically in the embodiments of the present specification, when the transportation tool and the delivery personnel have a preset corresponding relationship, the delivery capacity can be the transportation tool and / or the delivery personnel; when the transportation tool and the delivery personnel do not have a preset corresponding relationship, it is determined whether the transportation tool is a standard transportation tool, and when the transportation tool is a standard transportation tool (i.e., each transportation tool capable of providing transportation services has the same or similar transportation speed and / or carrying capacity and / or maximum driving distance, or the transportation tools can be divided into several categories, and each category has the same or similar transportation speed and / or carrying capacity and / or maximum driving distance), the delivery capacity can be the transportation tool or the delivery personnel; when the transportation tool is a non-standard transportation tool (i.e., each transportation tool capable of providing transportation services does not have the same or similar transportation speed and / or carrying capacity and / or maximum driving distance, and cannot be divided into several categories, and each category has the same or similar transportation speed and / or carrying capacity and / or maximum driving distance), the delivery capacity can be the transportation tool.

[0077] S102: For each type of adaptability preset, determine the adaptability of the type in a case where any to-be-allocated order and any delivery capacity establish a matching relationship according to the information of the to-be-allocated orders and the delivery capacities; determine a first comprehensive adaptability in the case according to the adaptability of each type in the case; and establish a matching relationship for each to-be-allocated order and each delivery capacity in the case according to the first comprehensive adaptability, as an initial matching scheme.

[0078] Specifically, in order to quantify the adaptability of the to-be-allocated order and the delivery capacity, at least one type of index capable of quantifying the adaptability is preset, i.e., the adaptability. In actual application, for a matching relationship constituted by a to-be-allocated order and a delivery capacity, whether the matching relationship is appropriate can be measured from different angles, for example, the punctuality of the delivery capacity in delivering the to-be-allocated order, the on-the-way degree, etc., and each type of adaptability can represent and quantify the adaptability of the matching relationship, and in an embodiment of the present application, different types of adaptability represent different angles of adaptability.

[0079] For each to-be-allocated order, establishing a matching relationship between the to-be-allocated order and any delivery capacity is regarded as a case of establishing a matching relationship for the to-be-allocated order, and for each case of establishing a matching relationship for the to-be-allocated order, the adaptability of each type in the case is determined, so as to measure the adaptability of the matching relationship, and according to the adaptability of each type in the case, a first comprehensive adaptability capable of evaluating the adaptability of the case as a whole is determined.

[0080] Specifically, when each adaptation degree is taken as a measure of the adaptation degree of the matching relationship, each adaptation degree can be given a weight according to the importance of the measure standard, and then the value of the first comprehensive adaptation degree in each case can be determined according to the adaptation degree values of each type in this case and the weights corresponding to each type of adaptation degree.

[0081] According to the first comprehensive adaptation degree in each case in which a matching relationship is established for each to-be-allocated order, a matching relationship between each to-be-allocated order and a distribution vehicle is established. Specifically, at least part of the to-be-allocated orders and at least part of the distribution vehicles are established to have corresponding matching relationships. Further, in an embodiment of the present specification, each to-be-allocated order corresponds to a matching relationship with a distribution vehicle, and the distribution vehicle can not correspond to a matching relationship with a to-be-allocated order.

[0082] As an example, the present specification provides an embodiment of establishing a matching relationship between each to-be-allocated order and a distribution vehicle according to the first comprehensive adaptation degree in each case in which a matching relationship is established for each to-be-allocated order by using a greedy algorithm: for each to-be-allocated order, a case in which the first comprehensive adaptation degree corresponding to the to-be-allocated order is the largest is determined, and the distribution vehicle that establishes a matching relationship with the to-be-allocated order in this case is taken as the most suitable vehicle for the to-be-allocated order; according to the correspondence between each to-be-allocated order and each most suitable vehicle, for each most suitable vehicle, it is determined whether the most suitable vehicle is the most suitable vehicle for more than two to-be-allocated orders, if not, a matching relationship between the most suitable vehicle and the to-be-allocated order corresponding to the most suitable vehicle is established; if yes, the to-be-allocated orders corresponding to the most suitable vehicle are temporarily not established to have a matching relationship with any distribution vehicle; the first comprehensive adaptation degree in each case in which a matching relationship is established for each to-be-allocated order that has not yet established a matching relationship is determined again, and then the matching relationship is continued to be established for the to-be-allocated order that has not yet established a matching relationship according to the first comprehensive adaptation degree, and the iteration is continued until all to-be-allocated orders have a matching relationship with a distribution vehicle.

[0083] The established matching relationship between each to-be-allocated order and each distribution vehicle is taken as an initial matching scheme. In an embodiment of the present specification, the initial matching scheme is the set of matching relationships in the initial matching scheme.

[0084] S104: Adjust at least part of the matching relationships in the initial matching scheme to maximize the second comprehensive adaptation degree, and take the matching relationship between the adjusted to-be-allocated orders and the distribution vehicles as an optimized matching scheme.

[0085] The second comprehensive adaptation degree can also represent and quantify the adaptation degree of the matching relationship. Specifically, the second comprehensive adaptation degree can be a preset type of adaptation degree, or a comprehensive adaptation degree determined according to multiple types of adaptation degrees. Each type of adaptation degree can be the same as or different from the adaptation degree types constituting the first comprehensive adaptation degree. When the second comprehensive adaptation degree is a comprehensive adaptation degree determined according to multiple types of adaptation degrees, the second comprehensive adaptation degree can be the first comprehensive adaptation degree, that is, the matching relationships in the initial matching scheme are adjusted according to the same evaluation standard of the adaptation degree of the matching relationship as the initial matching scheme. The adjustment process can use an algorithm different from the initial matching scheme or follow a different order of establishing matching relationships than the initial matching scheme. According to the needs of different stages of order scheduling, another comprehensive adaptation degree that can represent and measure the adaptation degree of the matching relationship can also be provided, that is, the adaptation degree of the matching relationship is evaluated according to another standard, and the matching relationships in the initial matching scheme are adjusted to optimize the matching relationships under the evaluation standard.

[0086] All matching relationships in the initial matching scheme can be adjusted, but in an embodiment of the present specification, not all matching relationships in the initial matching scheme are adjusted, but part of the matching relationships in the initial matching scheme are selected and adjusted. It can be understood that according to the standard for selecting matching relationships to be adjusted, it can not be possible to select matching relationships to be adjusted, that is, no matching relationship in the initial matching scheme is adjusted, that is, the optimized matching scheme is the initial matching scheme.

[0087] The matching relationships between the adjusted to-be-allocated orders and the distribution capacities are used as the optimized matching scheme. In an embodiment of the present specification, the optimized matching scheme is the set of the adjusted matching relationships.

[0088] S106: Select a target matching scheme from the initial matching scheme and the optimized matching scheme according to a preset target adaptation degree of at least one type.

[0089] In the present specification, the target adaptation degree can be selected according to the needs, and the selected target adaptation degree can represent and quantify the advantages and disadvantages of the matching scheme according to the index of interest. Since the matching scheme is composed of matching relationships in the matching scheme, in an embodiment of the present specification, the adaptation degree of each matching scheme can be determined according to the adaptation degree of each matching relationship in the matching scheme, that is, the advantages and disadvantages of each matching scheme can be evaluated according to the advantages and disadvantages of each matching relationship in each matching scheme represented by the target adaptation degree.

[0090] It can be understood that each target fitness is a type of fitness, and the target fitness can be one or more. When the target matching scheme is selected according to at least two types of target fitness, it is obvious that a comprehensive target fitness for evaluating the overall matching scheme fitness can also be determined according to each type of target fitness. For each target fitness, the target fitness can be the same as the type of fitness used to measure the matching relationship fitness in the initial matching scheme or the optimized matching scheme, or it can be different.

[0091] The target matching scheme selected according to the target fitness is a matching scheme whose fitness is better than that of another matching scheme under the evaluation standard of the target fitness.

[0092] According to the matching relationship in the target matching scheme, each to-be-allocated order is allocated to a corresponding distribution capacity. Specifically, each to-be-allocated order can be allocated to a distribution capacity with which it has a matching relationship according to the matching relationship in the target matching scheme, or a to-be-allocated order that needs to be allocated to a distribution capacity later (i.e., a pressed order) can be determined according to the matching relationship in the target matching scheme. The present specification does not limit how to allocate to-be-allocated orders according to the matching relationship in the target matching scheme.

[0093] Through the above Figure 1 The method can be seen that the present specification proposes an order scheduling method. After determining the initial matching relationship between each to-be-allocated order and each distribution capacity according to the fitness of the matching relationship between any to-be-allocated order and any distribution capacity, the order is not directly allocated according to the matching relationship in the initial matching scheme. Instead, the initial matching relationship is used as an initial solution, at least part of the matching relationship in the initial solution is adjusted, an optimized matching scheme after adjustment is obtained, a target matching scheme is selected from the initial matching scheme and the optimized matching scheme, and the order is allocated according to the matching relationship in the target matching scheme. The order scheduling method proposed in the present specification can ensure that the optimized matching scheme after adjusting the matching relationship is better than the initial matching scheme under the measurement of the second comprehensive fitness, and the target matching scheme selected is better than another matching scheme under the measurement of the target fitness. Therefore, the target matching scheme in which the probability of the occurrence of an extreme case of the target fitness concerned is relatively low is selected from the two schemes, and the order allocation result in which the probability of the occurrence of an extreme case of the target fitness concerned is relatively low is realized according to the target matching scheme.

[0094] In step S104, when selecting the matching relationships to be adjusted from the initial matching scheme, this embodiment of the specification provides two methods for selecting the matching relationships to be adjusted. First, the method of selecting orders to be adjusted determines which matching relationships in the initial matching scheme will be the objects of adjustment. Specifically, orders to be adjusted can be selected from each order to be allocated that has established a matching relationship with delivery capacity in the initial matching scheme, and the matching relationship of each order to be adjusted in the initial matching scheme can be adjusted.

[0095] The second method is to select the matching relationship as the object of adjustment by selecting delivery capacity. Specifically, the matching relationship corresponding to each selected delivery capacity can be used as the matching relationship to be adjusted. Specifically, from each delivery capacity that has established a matching relationship with the order to be assigned in the initial matching scheme, some delivery capacity is selected, and the matching relationship of the selected delivery capacity in the initial matching scheme is adjusted.

[0096] For ease of description, this specification uses the first method described above to select the matching relationship to be adjusted as an example to describe the embodiments provided by this solution.

[0097] From the orders to be allocated that have established a matching relationship with the delivery capacity in the initial matching scheme, orders to be adjusted are selected. The matching relationship corresponding to the selected orders to be adjusted is taken as the matching relationship to be adjusted. Then, based on the selected orders to be adjusted and the first comprehensive fit of each order to be adjusted with each delivery capacity established in the initial matching scheme, delivery capacity to be adjusted is selected from each delivery capacity. The matching relationship to be adjusted can be adjusted according to the following principle: After adjusting the matching relationship corresponding to the order to be adjusted, the matching relationship corresponding to the adjusted order is the matching relationship with the selected delivery capacity to be adjusted mentioned above. That is to say, the adjustment process is to deactivate the matching relationship established in the initial matching scheme for each order to be adjusted and re-establish the matching relationship with the delivery capacity to be adjusted.

[0098] In one embodiment of this specification, for each delivery capacity, there may also be assigned orders that were historically allocated to the delivery capacity but have not been completed, which are considered as assigned orders for that delivery capacity. In one embodiment of this specification, for each delivery capacity, if the delivery capacity completes all historically allocated orders, or if the delivery capacity has never been allocated any orders historically, then the delivery capacity has no assigned orders.

[0099] If the previously allocated orders are also taken into account, the specific method for selecting orders to be adjusted from the initial allocation scheme can be as follows: Figure 2 As shown.

[0100] S200: For each delivery capacity, according to the allocated orders of the delivery capacity and the to-be-allocated orders in the initial delivery scheme that have a matching relationship with the delivery capacity, determine the delivery path of the delivery capacity.

[0101] According to the information of the allocated orders of the delivery capacity and the to-be-allocated orders in the initial delivery scheme that have a matching relationship with the delivery capacity, determine the delivery path of the delivery capacity when delivering each allocated order and each to-be-allocated order in the initial delivery scheme that has a matching relationship with the delivery capacity.

[0102] Specifically, when determining the delivery path of a delivery capacity, the delivery path is the ordering of the task points of each order corresponding to the delivery capacity, in which the pickup point is in front of the delivery point.

[0103] In order to plan a relatively more efficient delivery path, in actual application, when the delivery capacity delivers orders according to the delivery path, it does not take and deliver each order in turn, but after taking one order, it goes to take or deliver another order, which is called "cross delivery" of the two orders. Figure 3 A delivery path containing "cross delivery" is shown, in which each pattern marked with letters and numbers represents a task point, A1-F1 are the pickup points of orders A-F, and A2-F2 are the delivery points of orders A-F. The ordering of the task points connected by arrows is the delivery path of the delivery capacity for delivering each order: take order A, take order B, deliver order B, deliver order A, take order C, take order D, take order E, deliver order D, deliver order C, deliver order E, take order F, and deliver order F.

[0104] S202: According to the delivery path, divide the allocated orders of the delivery capacity and the to-be-allocated orders in the initial delivery scheme that have a matching relationship with the delivery capacity into at least one order package as the order package corresponding to the delivery capacity, and each order package includes at least one order.

[0105] Specifically, as an example, the specification provides a method of dividing sub-paths from a delivery path, wherein each sub-path is an order of task points on the sub-path. For each sub-path, the orders to which the task points on the sub-path belong are the orders corresponding to the sub-path, that is, the path taken by the delivery capacity when performing all the orders corresponding to the sub-path. For each sub-path, the set of orders corresponding to the sub-path is the order package corresponding to the sub-path. In an embodiment of the specification, for each sub-path, all the task points included in all the orders corresponding to the sub-path are on the sub-path, that is, for each order corresponding to the sub-path, the delivery capacity can only perform "cross delivery" on the order and other orders corresponding to the sub-path, but not on the order and orders corresponding to other sub-paths.

[0106] It can be seen that when the orders of the delivery capacity are divided in this way, when the delivery capacity "cross delivers" the orders, the "cross delivered" orders are divided into the same order package and the sub-path corresponding to the order package is determined according to the task points corresponding to the orders. At this time, if the matching relationship between the delivery capacity and one of the orders is adjusted, the delivery capacity will execute the orders not adjusted in the matching relationship alone without executing the order adjusted in the matching relationship, which is no longer an efficient execution mode. In an embodiment of the specification, when the matching relationship of one of the "cross delivered" orders is adjusted, the matching relationship between the remaining orders and the delivery capacity becomes a matching relationship with a lower degree of adaptation under the evaluation standard of the degree of adaptation of a matching relationship. When the orders are not "cross delivered" by the delivery capacity, adjusting the matching relationship between one of the orders and the delivery capacity has a lower impact on the rationality of the delivery capacity executing the orders not adjusted in the matching relationship and a lower impact on the degree of adaptation of the matching relationship between the orders not adjusted in the matching relationship and the delivery capacity. Therefore, after dividing the orders into order packages in the above method, adjusting the matching relationship of the order packages has a lower impact on the rationality of the orders not "cross delivered" with the orders in the order packages. Therefore, when adjusting the matching relationship subsequently, the matching relationship of the orders in the entire order package can be adjusted, or the matching relationship can be adjusted directly in units of order packages.

[0107] As Figure 3In the shown delivery path, the delivery capacity delivers orders A and B in sub-path 1 by cross delivery, and delivers orders C, D and E in sub-path 2 by cross delivery, but does not deliver orders in the order package corresponding to sub-paths 1 and 2 by cross delivery. Therefore, when adjusting the matching relationship between order B in the order package corresponding to sub-path 1 and the delivery capacity, the delivery capacity needs to deliver order A without delivering order B. However, the distance between task points A1 and A2 of order A is relatively long, and the sub-path is a reasonable path for delivering orders A and B when the delivery capacity delivers orders A and B. The matching relationship between order A and the delivery capacity is highly adaptable. However, when the delivery capacity delivers order A without delivering order B, the matching relationship between order A and the delivery capacity is less adaptable due to the long distance between A1 and A2. At this time, assigning order A to the delivery capacity is an unreasonable assignment scheme.

[0108] When adjusting the matching relationship of order C corresponding to sub-path 2, the delivery capacity can still deliver orders A and B in sub-path 1 at the same time. At this time, the matching relationship between the delivery capacity and orders A and B is not greatly affected.

[0109] S204: Selecting an order package satisfying a specified condition from each order package corresponding to each delivery capacity as a to-be-adjusted order package, and selecting at least part of the orders included in each to-be-adjusted order package as to-be-adjusted orders.

[0110] S206: Selecting at least part of the orders included in each to-be-adjusted order package as to-be-adjusted orders.

[0111] The present specification exemplarily provides three specified conditions for selecting an order package:

[0112] Condition 1: According to the order in which each delivery capacity delivers each order along the task points included in each order when adopting the delivery path, sorting each order package, and selecting at least one order package in reverse order of the sorting of each order package as an order package satisfying the specified condition.

[0113] In an embodiment of the present specification, when a delivery path is divided into a plurality of sub-paths, according to the order in which each delivery capacity delivers each order along the task points included in each order when adopting the delivery path, sorting each order package, for example, Figure 3As shown, the order of each task point of the distribution route is taking order A, taking order B, delivering order B, delivering order A, taking order C, taking order D, taking order E, delivering order D, delivering order C, delivering order E, taking order F, and delivering order F, that is, after the distribution vehicle completes the task points (A1, B1, B2, A2) in the order package corresponding to sub-path 1, the distribution vehicle proceeds to the task points in the order package corresponding to sub-path 2, and after completing the task points (C1, D1, E1, D2, C2, E2) in the order package corresponding to sub-path 2, the distribution vehicle proceeds to the task points in the order package corresponding to sub-path 3, and thus the order of each order package corresponding to the distribution vehicle is the order package corresponding to sub-path 1, the order package corresponding to sub-path 2, and the order package corresponding to sub-path 3.

[0114] Adjusting the order package corresponding to the sub-path of the distribution vehicle in advance often leads to unreasonable distribution of the distribution vehicle in the sub-path in the later stage to execute the orders in the order package corresponding to the sub-path in the later stage. When the adjusted order package corresponds to the first sub-path in the distribution route of the distribution vehicle, the actual coordinates of the distribution vehicle when the order package is adjusted may be far away from the first task point in the sub-path corresponding to the first order package that is not adjusted, such as Figure 3 As shown, before the distribution vehicle reaches task point A1, the matching relationship of orders A and B corresponding to sub-path 1 is adjusted, and after the adjustment, the distribution vehicle needs to go directly from the actual coordinates at that time to task point C1, and when the actual coordinates are far away from task point C1, the path from the actual coordinates to task point C1 becomes an unreasonable path. When the adjusted order package does not correspond to the first sub-path in the distribution route of the distribution vehicle, for example, as shown in Figure 3 As shown, when the matching relationship of the orders in the order package corresponding to sub-path 2 is adjusted, after the distribution vehicle completes order A, the distribution vehicle needs to go from task point A2 to task point F1, and when task point A2 is far away from task point F1, the path from task point A2 to task point F1 becomes an unreasonable path, and the matching relationship between order F and the distribution vehicle is less suitable.

[0115] In an embodiment of the present specification, for each distribution vehicle, the last order package corresponding to the distribution vehicle is selected as the order package to be adjusted, and since the orders in the two adjacent order packages can also be regarded as an order package, as shown in Figure 3As shown, the order package corresponding to sub-path 1 includes order A and order B, and the order package corresponding to sub-path 2 includes order C-E, but sub-path 4 also satisfies the above-mentioned sub-path division condition: each task point corresponding to orders A-E is on the sub-path, and before the sub-path 4, the number of pickup points and delivery points in each task point of the delivery capacity is equal. In an embodiment of the present specification, each sub-path divided does not include a sub-path similar to sub-path 4 that can be further divided into at least two sub-paths.

[0116] Therefore, after dividing the sub-paths and order packages in the above-mentioned method, for each delivery capacity, at least one order package that meets the specified condition can be selected in the reverse order of the order package corresponding to the delivery capacity, at which time the order package to which the order of the adjusted matching relationship belongs is the order package delivered later by the delivery capacity, and it is difficult to affect the matching relationship adaptation degree between the order in each online delivery order package and the delivery capacity, such as Figure 3 As shown, when the matching relationship between order F in sub-path 3 and the delivery capacity is adjusted, the matching relationship adaptation degree between the delivery capacity and orders A-E is difficult to affect; when the matching relationship between orders C-F in sub-paths 2 and 3 and the delivery capacity is adjusted, it is also difficult to affect the matching relationship adaptation degree between orders A and B and the delivery capacity.

[0117] From each order package corresponding to each delivery capacity, select an order package that meets the specified condition as a to-be-adjusted order package. In an embodiment of the present specification, when there is no order package that meets the specified condition in each order package corresponding to each delivery capacity, it means that there is no order that needs to adjust the matching relationship, at which time the optimization matching scheme is the initial matching scheme.

[0118] Condition two: the order package that meets the specified condition does not include an allocated order.

[0119] For each to-be-adjusted order package, at least part of the orders in the to-be-adjusted order package are to-be-adjusted orders, which can be determined in advance according to needs, for example, the last few orders in the to-be-adjusted order package are to-be-adjusted orders. In an embodiment of the present specification, to-be-adjusted orders can only include to-be-allocated orders, and in another embodiment of the present specification, when to-be-adjusted orders include to-be-allocated orders and allocated orders, the to-be-adjusted order adjusts the matching relationship specifically includes adjusting the matching relationship for to-be-allocated orders in to-be-adjusted orders, and changing the allocated delivery capacity for allocated orders in to-be-adjusted orders.

[0120] For convenience of description, the present specification will be described below with an example that each to-be-adjusted order package can only have to-be-allocated orders and does not include allocated orders.

[0121] Condition three: according to the information of each to-be-allocated order and each delivery capacity, at least determine the scheduling unit corresponding to each to-be-adjusted order in each to-be-allocated order, and the orders in the order package satisfying the specified condition correspond to the same scheduling unit.

[0122] In an embodiment of the present specification, when the number of orders to be adjusted is large, in order to reduce the scale of the problem, each order and each delivery capacity can be divided into several scheduling units, and for each scheduling unit, only the matching relationship in the scheduling unit is adjusted, and the adjusted matching relationship of each scheduling unit is used as the optimized matching scheme.

[0123] For the division standard of the scheduling unit, specifically, according to the obtained information of the orders and the delivery capacities, a pre-set manner can be used to determine the corresponding scheduling unit for each order and each delivery capacity. For example, each order with a task point in the same city can correspond to the same scheduling unit, and each delivery capacity located in the same city can correspond to the same scheduling unit. In addition, according to the obtained task point of the order, each order with a similar path for delivering each order can be determined as an order corresponding to the same scheduling unit, and the position of each scheduling unit can be determined according to the position of the task point of each order in the scheduling unit, and the delivery capacity can be determined to correspond to the scheduling unit with a distance less than a pre-set distance threshold from the delivery capacity.

[0124] According to the orders included in each order package, an order package including all orders corresponding to the same scheduling unit can be selected as a to-be-adjusted order package. After selecting the to-be-adjusted order package, the matching relationship corresponding to the to-be-adjusted order package can be adjusted. It can be understood that when adjusting the matching relationship for a to-be-adjusted order package, the matching relationship of each to-be-adjusted order in the to-be-adjusted order package is first released, and then the delivery capacity is re-determined for the to-be-adjusted order package, and the matching relationship between the to-be-adjusted order package and the re-determined delivery capacity is established, and the matching relationship between each to-be-adjusted order in the to-be-adjusted order package and the re-determined delivery capacity is established.

[0125] When the to-be-adjusted order package satisfying the specified condition only includes to-be-allocated orders, the corresponding scheduling unit can be determined only for the to-be-allocated orders and the delivery capacities, and for the convenience of description, the scheduling unit will be described below only for the to-be-allocated orders and the delivery capacities.

[0126] For each to-be-allocated order, the to-be-allocated order can correspond to several scheduling units at the same time; for each delivery capacity, the delivery capacity can also correspond to several scheduling units at the same time.

[0127] In one embodiment of the present specification, for each to-be-assigned order and delivery capacity, when the to-be-assigned order or the delivery capacity is determined to correspond to a plurality of scheduling units, the k scheduling units can be determined for the to-be-assigned order or the delivery capacity in the plurality of scheduling units corresponding thereto, so that the to-be-assigned order or the delivery capacity adjusts the matching relationship in the k scheduling units, where k is a preset unit threshold.

[0128] Specifically, each scheduling unit corresponding to the to-be-assigned order or the delivery capacity can be taken as the initial scheduling unit of the to-be-assigned order or the delivery capacity. For each initial scheduling unit, the third comprehensive fitness of the to-be-assigned order or the delivery capacity and each initial scheduling unit is determined according to each first comprehensive fitness under the condition that the to-be-assigned order and each delivery capacity in the initial scheduling unit establish a matching relationship, or each first comprehensive fitness under the condition that the delivery capacity and each to-be-assigned order in the initial scheduling unit establish a matching relationship. The third comprehensive fitness is used to represent and quantify the fitness degree of the to-be-assigned order or the delivery capacity and each initial scheduling unit. One initial scheduling unit is selected as the scheduling unit corresponding to the to-be-assigned order or the delivery capacity according to the third comprehensive fitness of each initial scheduling unit.

[0129] Specifically, since the to-be-adjusted order and the delivery capacity can correspond to a plurality of scheduling units, the present specification provides two methods for re-determining the scheduling unit of each to-be-assigned order and delivery capacity according to the third comprehensive fitness. The first method is to re-determine the scheduling unit corresponding to all to-be-assigned orders in the above manner, and then re-determine the scheduling unit of each delivery capacity according to the re-determined scheduling unit of each to-be-assigned order. The second method is to re-determine the scheduling unit corresponding to all delivery capacities in the above manner, and then re-determine the scheduling unit of each to-be-assigned order according to the re-determined scheduling unit of each delivery capacity.

[0130] The present specification only takes the first method for re-determining the scheduling unit of each to-be-assigned order as an example to provide an embodiment for re-determining the scheduling unit of each to-be-adjusted capacity after determining each to-be-adjusted order. Figure 4

[0131] S400: Obtain the re-determined scheduling unit of each to-be-assigned order.

[0132] S402: Determine the initial scheduling unit corresponding to each to-be-adjusted capacity.

[0133] Among them, for each to-be-adjusted capacity, each scheduling unit corresponding to the to-be-adjusted capacity is taken as the initial scheduling unit corresponding to the to-be-adjusted capacity. The to-be-adjusted capacity can correspond to only one initial scheduling unit, or can correspond to a plurality of initial scheduling units.

[0134] ​S404: For each to-be-adjusted transport capacity, determine whether the number h of initial scheduling units corresponding to the to-be-adjusted transport capacity is less than a preset unit threshold k, if the determination result is yes, execute step S406, otherwise execute step S408.

[0135] S406: Take the h initial scheduling units corresponding to the to-be-adjusted transport capacity as the scheduling units re-determined for the to-be-adjusted transport capacity.

[0136] S408: According to the first comprehensive fitness degrees of the to-be-adjusted transport capacity and each to-be-adjusted order in each initial scheduling unit corresponding to the to-be-adjusted transport capacity, determine the third comprehensive fitness degree of the to-be-adjusted transport capacity and each initial scheduling unit corresponding to the to-be-adjusted transport capacity.

[0137] S410: Select k initial scheduling units with the largest third comprehensive fitness degrees of the to-be-adjusted transport capacity, and take the k initial scheduling units as the scheduling units re-determined for the to-be-adjusted transport capacity.

[0138] The present specification does not limit how to determine the third comprehensive fitness degree of the to-be-adjusted transport capacity and each initial scheduling unit corresponding to the to-be-adjusted transport capacity according to the first comprehensive fitness degrees of the to-be-adjusted transport capacity and each to-be-adjusted order in each initial scheduling unit corresponding to the to-be-adjusted transport capacity, but as an example, the present specification also provides a method for determining the third comprehensive fitness degree of the to-be-adjusted transport capacity and each initial scheduling unit: for the i-th initial scheduling unit corresponding to the to-be-adjusted transport capacity, determine the third comprehensive fitness degree S i :

[0139]

[0140] wherein, for each to-be-adjusted order in the M to-be-adjusted orders in the initial distribution unit, according to the first comprehensive fitness degrees of the to-be-adjusted order and each distribution transport capacity, determine the ranking of the first comprehensive fitness degree of the to-be-adjusted transport capacity in the first comprehensive fitness degrees of the to-be-adjusted order and each distribution transport capacity, according to the ranking of the to-be-adjusted transport capacity in the first comprehensive fitness degrees of each to-be-adjusted order and each distribution transport capacity, determine the number of times Time that the to-be-adjusted transport capacity ranks in the top N in the first comprehensive fitness degrees of each to-be-adjusted order and each distribution transport capacity i , where N is a preset number threshold, and according to the ranking of the to-be-adjusted transport capacity in the first comprehensive fitness degrees of each to-be-adjusted order and each distribution transport capacity, add the ranking of the to-be-adjusted transport capacity in the first comprehensive fitness degrees of the j-th to-be-adjusted order and each distribution transport capacity when j=1 to j=M as the sum of rankings, and the number of times Time that the to-be-adjusted transport capacity ranks in the top N i , and the sum of the rankings of the M to-be-adjusted orders and each distribution transport capacity first comprehensive fitness degree respectively, to a pre-set weight α and β, the to-be-adjusted transport capacity and the third comprehensive fitness S of the initial scheduling unit i is the weighted Time i is the weighted Time , where α is a positive number and β is a negative number.

[0141] It can be understood that when adjusting the matching relationship of each to-be-adjusted order in the to-be-adjusted order package, the above Time i may be the number of times that the to-be-adjusted transport capacity ranks in the top N in the second comprehensive fitness of each to-be-adjusted order package and each delivery transport capacity; the above may be the sum of the rankings of the second comprehensive fitness of the to-be-adjusted transport capacity in the M to-be-adjusted order packages and each delivery transport capacity.

[0142] Figure 5 Taking the KM algorithm based on the bipartite graph as an example, a method for adjusting the matching relationship of the to-be-adjusted order is shown, where the first set consists of n to-be-adjusted orders, and the second set consists of m to-be-adjusted transport capacities, and the weight of the edge between any to-be-adjusted order in the first set and any to-be-adjusted transport capacity in the second set is the second comprehensive fitness of the matching relationship between the to-be-adjusted order and the to-be-adjusted transport capacity. Figure 5 , where the weights V11-V1m are the second comprehensive fitness of order 1 with delivery transport capacity 1-delivery transport capacity m, respectively, and the weights Vn1-Vnm are the second comprehensive fitness of order n with delivery transport capacity 1-delivery transport capacity m, respectively. Based on the weighted bipartite graph, the KM algorithm is used to determine the perfect matching with the maximum second comprehensive fitness as the solution of the KM algorithm.

[0143] The matching relationship between the adjusted to-be-allocated orders and the delivery transport capacities is used as the optimized matching scheme, and the optimized matching scheme is compared with the initial matching scheme under the standard of the target fitness, which can be one or several of the pre-set types of fitness.

[0144] In an embodiment of the present specification, for each target fitness, the target fitness corresponding to the initial matching scheme is determined according to the target fitness under the condition of the establishment of each matching relationship in the initial matching scheme, and the target fitness corresponding to the optimized matching scheme is determined according to the target fitness under the condition of the establishment of each matching relationship in the optimized matching scheme. When each target fitness corresponding to the optimized matching scheme is not lower than each target fitness corresponding to the initial matching scheme, the optimized matching scheme is selected as the target matching scheme.

[0145] When at least one target fitness corresponding to the optimized matching scheme is lower than the target fitness corresponding to the initial matching scheme, the initial matching scheme can be selected as the target matching scheme.

[0146] It can be understood that when the respective target adaptation degrees of the optimization matching scheme are equal to the respective target adaptation degrees of the initial matching scheme, any matching scheme can be selected as the target matching scheme.

[0147] The order scheduling method provided in the embodiments of the present specification is based on the same idea. The present specification also provides a corresponding device, a storage medium and an electronic device.

[0148] Figure 6 A structural diagram of an order scheduling device provided in the embodiments of the present specification is shown in the figure. The device comprises:

[0149] An information acquisition module 600 determines information of each to-be-allocated order and each delivery capacity;

[0150] An initial matching module 602 determines, for each type of adaptation degree preset, an adaptation degree of the type in a case where any to-be-allocated order and any delivery capacity establish a matching relationship according to the information of each to-be-allocated order and each delivery capacity; determines a first comprehensive adaptation degree in the case according to the adaptation degrees of each type in the case; and establishes a matching relationship for each to-be-allocated order and each delivery capacity as an initial matching scheme according to the first comprehensive adaptation degree.

[0151] An optimization matching module 604 adjusts at least part of the matching relationship in the initial matching scheme with the maximum second comprehensive adaptation degree as the target, and takes the adjusted matching relationship of each to-be-allocated order and each delivery capacity as an optimization matching scheme.

[0152] A target selection module 606 selects a target matching scheme from the initial matching scheme and the optimization matching scheme according to at least one type of target adaptation degree preset.

[0153] An order allocation module 608 allocates each to-be-allocated order to a corresponding delivery capacity according to the matching relationship in the target matching scheme.

[0154] Optionally, the optimization matching module 604 is specifically configured to select a to-be-adjusted order from the to-be-allocated orders according to the initial allocation scheme; select a to-be-adjusted capacity from each delivery capacity according to the first comprehensive adaptation degree in each case; and adjust the matching relationship corresponding to the to-be-adjusted order, wherein the adjusted matching relationship corresponding to the to-be-adjusted order is the matching relationship with the to-be-adjusted capacity.

[0155] Optionally, the optimization matching module 604 is specifically configured to: for each delivery capacity, determine a delivery path of the delivery capacity according to the allocated orders of the delivery capacity and the to-be-allocated orders in the initial delivery scheme that have a matching relationship with the delivery capacity; divide the allocated orders of the delivery capacity and the to-be-allocated orders in the initial delivery scheme that have a matching relationship with the delivery capacity into at least one order package according to the delivery path, as an order package corresponding to the delivery capacity; select an order package that meets a specified condition from each order package corresponding to each delivery capacity, as a to-be-adjusted order package; and include at least part of the orders in each to-be-adjusted order package as to-be-adjusted orders.

[0156] Optionally, the optimization matching module 604 is specifically configured to: divide at least one sub-path from the delivery path; wherein for each sub-path, determine the orders to which the task points on the sub-path belong as the orders corresponding to the sub-path, and all the task points included in all the orders corresponding to the sub-path are on the sub-path; and for each sub-path, take the set of orders corresponding to the sub-path as the order package corresponding to the sub-path.

[0157] Optionally, the order package that meets the specified condition specifically includes one or a combination of the following: according to the order in which each delivery capacity delivers each order by using the delivery path, the orders are sorted according to the order in which the task points included in the orders are passed through, and at least one order package is selected as an order package that meets the specified condition in reverse order of the order package sorting; the to-be-adjusted order package does not include allocated orders; and according to the information of the to-be-allocated orders and the delivery capacities, at least a scheduling unit corresponding to each to-be-adjusted order in each to-be-allocated order is determined, and the orders in the order package that meets the specified condition correspond to the same scheduling unit.

[0158] Optionally, the optimization matching module 604 is specifically configured to: adjust the matching relationship corresponding to the to-be-adjusted order package.

[0159] Optionally, the optimization matching module 604 is specifically configured to: determine the scheduling units corresponding to the to-be-adjusted orders and the to-be-adjusted capacities according to the information of the to-be-allocated orders and the delivery capacities.

[0160] For each scheduling unit, the matching relationship corresponding to the to-be-adjusted orders in the scheduling unit is adjusted, and the adjusted matching relationship corresponding to the to-be-adjusted orders is a matching relationship with the to-be-adjusted capacities in the scheduling unit.

[0161] Optionally, the optimization matching module 604 is specifically configured to determine initial scheduling units corresponding to each to-be-adjusted delivery capacity according to information of each to-be-allocated order and each delivery capacity; for each to-be-adjusted delivery capacity, if the to-be-adjusted delivery capacity corresponds to at least two initial scheduling units, for each initial scheduling unit corresponding to the to-be-adjusted delivery capacity, determine a third comprehensive fitness degree of the to-be-adjusted delivery capacity and the initial scheduling unit according to the first comprehensive fitness degrees in a case that the initial delivery capacity and each to-be-adjusted order in the initial scheduling unit establish a matching relationship; and select a scheduling unit corresponding to the to-be-adjusted delivery capacity from the initial scheduling units corresponding to the to-be-adjusted delivery capacity according to the third comprehensive fitness degrees of the to-be-adjusted delivery capacity and each initial scheduling unit.

[0162] Optionally, the target selection module 606 is specifically configured to, for each target fitness degree, determine a target fitness degree corresponding to the initial matching scheme according to the target fitness degree in a case that each matching relationship in the initial matching scheme is established; determine a target fitness degree corresponding to the optimization matching scheme according to the target fitness degree in a case that each matching relationship in the optimization matching scheme is established; and select the optimization matching scheme as the target matching scheme when each target fitness degree corresponding to the optimization matching scheme is not lower than each target fitness degree corresponding to the initial matching scheme.

[0163] Optionally, the target fitness degree is one or more of each type of fitness degree preset in advance.

[0164] The specification also provides a computer-readable storage medium storing a computer program, and the computer program can be used to execute the order scheduling method described above. Figure 1 The order scheduling method is provided.

[0165] The specification also provides an electronic device. Figure 7 As shown in the schematic structural diagram of the electronic device. As shown in the schematic structural diagram of the electronic device. Figure 7 At the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, and of course, other hardware required by the business. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs to implement the order scheduling method shown in the above. Figure 1 Of course, in addition to the software implementation, the specification does not exclude other implementation manners, such as logic devices or a combination of software and hardware, and so on, that is, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or a logic device.

[0166] In the 1990s, it was quite obvious to distinguish whether an improvement in a technology was in hardware (e.g., improvement in circuit structures of diodes, transistors, switches, etc.) or in software (improvement in method flow). However, as technology has evolved, many improvements in method flow today can be considered as direct improvements in hardware circuit structures. Designers almost always obtain the corresponding hardware circuit structures by programming the improved method flow into hardware circuits. Therefore, it cannot be said that an improvement in a method flow cannot be implemented by hardware entity modules. For example, a programmable logic device (PLD) (e.g., a field programmable gate array (FPGA)) is an integrated circuit whose logic function is determined by user programming of the device. A digital system is "integrated" on a PLD by the designer programming it, rather than by asking a chip manufacturer to design and fabricate a custom integrated circuit chip. Moreover, instead of manually fabricating integrated circuit chips, this programming is now mostly implemented by "logic compiler" software, which is similar to software compilers used in program development, and the original code to be compiled is written in a specific programming language, which is called a hardware description language (HDL), and there are many such languages, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc., and the most commonly used are VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should be aware that, as long as the method flow is logically programmed in the above-mentioned hardware description languages and programmed into an integrated circuit, a hardware circuit implementing the logical method flow can be easily obtained.

[0167] The controller can be implemented in any suitable way, for example, the controller can take the form of a microprocessor or processor and a computer readable medium storing computer readable program code, such as software or firmware, executable by the (micro)processor, logic gates, switches, an application specific integrated circuit (ASIC), a programmable logic controller and an embedded microcontroller, examples of which include but are not limited to the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320, the memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art will also know that, in addition to being implemented in pure computer readable program code, the controller can also be implemented to perform the same functions in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers and embedded microcontrollers, etc. by logically programming the method steps. Therefore, such a controller can be considered as a hardware component, and the means included therein for implementing various functions can also be considered as structures within the hardware component. Alternatively, the means for implementing various functions can even be considered as both a software module implementing a method and a structure within a hardware component.

[0168] The systems, apparatuses, modules or units illustrated by the above embodiments can be specifically implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer can be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0169] For the sake of description, the above apparatuses are described in functional division and are described respectively as various units. Of course, the functions of the units can be implemented in the same or multiple software and / or hardware in implementing the present specification.

[0170] Those skilled in the art will understand that the embodiments of the present application can be provided as a method, a system or a computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0171] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof.

[0172] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof.

[0173] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks in the flowcharts and / or combination thereof. ​ one or more flowcharts and / or blocks in the flowcharts and / or combination thereof.

[0174] In one typical configuration, the computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0175] The memory can include non-persistent memory and / or volatile memory, such as random access memory (RAM) and / or cache memory, non-volatile memory, such as read-only memory (ROM), EPROM, and / or flash memory. The memory is an example of computer-readable media.

[0176] Computer-readable media includes permanent and non-permanent, movable and non-movable media that can be implemented by any method or technology to store information. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible to a computing device. According to the definition herein, computer-readable media does not include transitory media such as modulated data signals and carriers.

[0177] It should also be noted that the terms "comprising", "containing", or any other variant thereof are intended to cover non-exclusive inclusion, such that a process, method, article or apparatus that comprises a list of elements does not only include those elements, but can also include other elements not expressly listed or inherent to such process, method, article or apparatus. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0178] Those skilled in the art will appreciate that embodiments of the present specification can be provided as methods, systems or computer program products. Therefore, the present specification can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Moreover, the present specification can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0179] The present specification can be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The present specification can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are connected through a communication network. In a distributed computing environment, program modules can be located in both local and remote computer storage media including storage devices.

[0180] The various embodiments described in this specification are described using a numbering of embodiments approach: these are each individually integrated contributions pertaining to different aspects of the description. For each embodiment, the description focuses on the differences from the other embodiments. In particular, the description of the system embodiments is relatively brief, as the system embodiments are largely analogous to the method embodiments. The relevant parts of the description of the method embodiments are therefore referred to.

[0181] The above only describes the embodiments of the present specification and is not intended to limit the present specification. The present specification can have various modifications and changes for those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification shall be included in the scope of claims of the present specification.

Claims

1. An order dispatching method characterized by, The method comprises the following steps: determining information of each to-be-assigned order and each delivery capacity; for each type of pre-set matching degree, determining a matching degree of any to-be-assigned order and any delivery capacity under the condition that they are matched, according to the information of each to-be-assigned order and each delivery capacity; determining a first comprehensive matching degree under the condition according to the matching degrees of each type under the condition; establishing a matching relationship for each to-be-assigned order and each delivery capacity according to the first comprehensive matching degree, as an initial matching scheme; adjusting at least part of the matching relationship in the initial matching scheme to maximize a second comprehensive matching degree, and taking the adjusted matching relationship of each to-be-assigned order and each delivery capacity as an optimized matching scheme; for each delivery capacity, determining a delivery path of the delivery capacity according to the assigned orders of the delivery capacity and the to-be-assigned orders of the delivery capacity that are matched in the initial delivery scheme, and dividing a sub-path from the delivery path, wherein at least one sub-path is divided from the delivery path; for each sub-path, determining the orders to which each task point on the sub-path belongs as the orders corresponding to the sub-path, and all task points included in all orders corresponding to the sub-path are on the sub-path; for each sub-path, the orders to which each task point on the sub-path belongs are taken as the orders corresponding to the sub-path, and the delivery capacity can only cross-deliver the orders corresponding to the sub-path and other orders corresponding to the sub-path, but cannot cross-deliver the orders corresponding to the sub-path and the orders corresponding to other sub-paths; selecting a target matching scheme from the initial matching scheme and the optimized matching scheme according to at least one type of pre-set target matching degree; assigning each to-be-assigned order to the corresponding delivery capacity according to the matching relationship in the target matching scheme.

2. The method of claim 1, wherein, adjusting at least part of the matching relationship in the initial matching scheme, specifically comprising: selecting a to-be-adjusted order from the to-be-assigned orders according to the initial matching scheme; selecting a to-be-adjusted delivery capacity from each delivery capacity according to the first comprehensive matching degree under each condition; adjusting the matching relationship corresponding to the to-be-adjusted order, wherein the adjusted matching relationship corresponding to the to-be-adjusted order is the matching relationship with the to-be-adjusted delivery capacity.

3. The method of claim 2, wherein, selecting a to-be-adjusted order from the to-be-assigned orders according to the initial matching scheme, specifically comprising: for each delivery capacity, determining a delivery path of the delivery capacity according to the assigned orders of the delivery capacity and the to-be-assigned orders of the delivery capacity that are matched in the initial delivery scheme; dividing the assigned orders of the delivery capacity and the to-be-assigned orders of the delivery capacity that are matched in the initial delivery scheme into at least one order package according to the delivery path, as the order package corresponding to the delivery capacity; selecting an order package satisfying a specified condition from each order package corresponding to each delivery capacity as a to-be-adjusted order package; taking at least part of the orders included in each to-be-adjusted order package as a to-be-adjusted order.

4. The method of claim 3, wherein, dividing the assigned orders of the delivery capacity and the to-be-assigned orders of the delivery capacity that are matched in the initial delivery scheme into at least one order package, specifically comprising: At least one sub-path is divided from the delivery path, wherein for each sub-path, orders to which task points on the way of the sub-path belong are determined as orders corresponding to the sub-path, and all orders corresponding to the sub-path contain all task points on the sub-path; For each sub-path, a set of orders corresponding to the sub-path is taken as an order package corresponding to the sub-path.

5. The method of claim 4, wherein, The order package satisfying the specified condition specifically includes one or more combinations of the following: According to the order in which each delivery capacity adopts the delivery path to deliver each order, the order in which each order included by the order is passed, and each order package is sorted, at least one order package is selected as an order package satisfying the specified condition in reverse order of the order package sorting; The order package satisfying the specified condition does not include the allocated order; According to the information of each delivery capacity and each delivery capacity, at least the scheduling unit corresponding to each to-be-adjusted order in each to-be-adjusted order is determined, and the order in the order package satisfying the specified condition corresponds to the same scheduling unit.

6. The method of any one of claims 3 to 5, wherein, Adjusting the matching relationship corresponding to the to-be-adjusted order, specifically includes: Adjusting the matching relationship corresponding to the to-be-adjusted order package.

7. The method of claim 2, wherein, Adjusting the matching relationship corresponding to the to-be-adjusted order, specifically includes: According to the information of each to-be-adjusted order and each delivery capacity, each scheduling unit corresponding to each to-be-adjusted order and each to-be-adjusted capacity is determined; For each scheduling unit, the matching relationship corresponding to the to-be-adjusted order in the scheduling unit is adjusted, and the adjusted matching relationship corresponding to the to-be-adjusted order is: the matching relationship with the to-be-adjusted capacity in the scheduling unit.

8. The method of claim 7, wherein, Determining the scheduling unit corresponding to each to-be-adjusted order and each to-be-adjusted capacity, specifically includes: According to the information of each to-be-adjusted order and each delivery capacity, the initial scheduling unit corresponding to each to-be-adjusted capacity is determined; For each to-be-adjusted capacity, if the to-be-adjusted capacity corresponds to at least two initial scheduling units, for each initial scheduling unit corresponding to the to-be-adjusted capacity, the third comprehensive fitness degree of the to-be-adjusted capacity and the initial scheduling unit is determined according to the first comprehensive fitness degree of the to-be-adjusted capacity and the initial scheduling unit under the condition that the matching relationship is established between the to-be-adjusted capacity and each to-be-adjusted order in the initial scheduling unit; According to the third comprehensive fitness degree of the to-be-adjusted capacity and each initial scheduling unit, the scheduling unit corresponding to the to-be-adjusted capacity is selected from the initial scheduling unit corresponding to the to-be-adjusted capacity.

9. The method of any one of claims 1-5 or 7-8, wherein, According to the pre-set at least one type of target fitness degree, the target matching scheme is selected from the initial matching scheme and the optimized matching scheme, specifically including: For each target fitness degree, the target fitness degree corresponding to the initial matching scheme is determined according to the target fitness degree under the condition that each matching relationship in the initial matching scheme is established, and the target fitness degree corresponding to the optimized matching scheme is determined according to the target fitness degree under the condition that each matching relationship in the optimized matching scheme is established; When each target fitness degree corresponding to the optimized matching scheme is not lower than each target fitness degree corresponding to the initial matching scheme, the optimized matching scheme is selected as the target matching scheme.

10. The method of claim 9, wherein, The target fitness degree is one or more of the pre-set types of fitness degrees.

11. An order scheduling apparatus characterized by comprising: It includes: An information obtaining module is configured to determine information of each to-be-assigned order and each delivery capacity; An initial matching module is configured to determine, for each type of preset adaptability, adaptability of a case where any to-be-assigned order and any delivery capacity establish a matching relationship according to the information of each to-be-assigned order and each delivery capacity; determine a first comprehensive adaptability of the case according to the adaptability of each type of the case; and establish a matching relationship for each to-be-assigned order and each delivery capacity according to the first comprehensive adaptability, as an initial matching scheme. For each delivery capacity, a delivery path of the delivery capacity is determined according to the assigned orders of the delivery capacity and the to-be-assigned orders of the delivery capacity that have a matching relationship in the initial matching scheme; sub-paths are divided from the delivery path; for each sub-path, orders to which each task point on the sub-path belongs are taken as orders corresponding to the sub-path; and for each order corresponding to the sub-path, the delivery capacity can only perform cross delivery on the order and other orders corresponding to the sub-path, and cannot perform cross delivery on the order and orders corresponding to other sub-paths. An optimization matching module is configured to adjust at least part of the matching relationships in the initial matching scheme with a maximum second comprehensive adaptability as a target, and take the matching relationships of each to-be-assigned order and each delivery capacity after the adjustment as an optimization matching scheme. A target selection module is configured to select a target matching scheme from the initial matching scheme and the optimization matching scheme according to at least one type of preset target adaptability. An order assignment module is configured to assign each to-be-assigned order to a corresponding delivery capacity according to each matching relationship in the target matching scheme.

12. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, and the computer program is executed by the processor to implement the method in any one of claims 1-10.

13. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor executes the program to implement the method in any one of claims 1-10.

Images