Order allocation method and device, server and nonvolatile storage medium

Abstract

An embodiment of the invention relates to the technical field of information processing, and discloses an order allocation method, an order allocation device, a server and a nonvolatile storage medium. The order allocation method comprises the steps of: acquiring combinations of at least two to-be-allocated orders and candidate delivery resources according to the to-be-allocated orders and the candidate delivery resources, wherein each combination comprises one to-be-distributed order and one candidate distribution resource; calculating the distribution cost corresponding to each combination;acquiring an allocation result of each to-be-allocated order according to a preset constraint condition and the distribution cost corresponding to each combination, wherein the combinations correspondto at least one first target feature, and the constraint conditions include that for each first target feature, the sum of eigenvalues of the first target features of each combination meets a presetcondition. According to the order allocation method and the order allocation device provided by the embodiment of the invention, a more reasonable order allocation scheme can be provided, so that moreactual business scenes are covered.

Description

technical field [0001] The present invention relates to the technical field of data processing, in particular to an order distribution method, device, server and non-volatile storage medium. Background technique [0002] With the rapid development of Internet technology, there are more and more Internet-based applications, such as food delivery applications, etc.; such applications allow users to obtain their desired items without leaving home. While these applications are convenient for users, they also face the problem of item delivery. At present, the order allocation is mainly realized by the dispatch system; the dispatch system needs to allocate the order to the delivery staff reasonably, so that the items in the order can be delivered to the user as soon as possible. At the same time try to save delivery costs. [0003] The inventors found that there are at least the following problems in the related technologies: in the scheduling scheme of the existing scheduling sy...

AI Technical Summary

Problems solved by technology

[0003] The inventors have found that there are at least the following problems in the related technologies: in the scheduling scheme of the existing scheduling system, it can only be filtered according to the constraint setting rules one by one, and then the allocation scheme of orders and riders can be solved; for example, the delivery distance and / or delivery time are used as Constraint conditions, filter the combinations of riders and orders one by one to obtain the combinations of riders and orders that meet the constraints, and then perform subsequent processing on the selected combinations to obtain the allocation plan

This method of filtering constraint-by-constraint setting rules can only achieve local optimization, and it is easy to make the final allocation scheme unable to cover a variety of practical application scenarios

Images