CN112418616A - Order broadcasting method and device, computer equipment and computer-readable storage medium - Google Patents

Order broadcasting method and device, computer equipment and computer-readable storage medium Download PDF

Info

Publication number
CN112418616A
CN112418616A CN202011223444.3A CN202011223444A CN112418616A CN 112418616 A CN112418616 A CN 112418616A CN 202011223444 A CN202011223444 A CN 202011223444A CN 112418616 A CN112418616 A CN 112418616A
Authority
CN
China
Prior art keywords
driver
probability
cancellation
order
rate
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011223444.3A
Other languages
Chinese (zh)
Other versions
CN112418616B (en
Inventor
涂坚
顾佳伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Yishi Huolala Technology Co Ltd
Original Assignee
Shenzhen Yishi Huolala Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Yishi Huolala Technology Co Ltd filed Critical Shenzhen Yishi Huolala Technology Co Ltd
Priority to CN202011223444.3A priority Critical patent/CN112418616B/en
Publication of CN112418616A publication Critical patent/CN112418616A/en
Application granted granted Critical
Publication of CN112418616B publication Critical patent/CN112418616B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311Scheduling, planning or task assignment for a person or group
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/15Correlation function computation including computation of convolution operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311Scheduling, planning or task assignment for a person or group
    • G06Q10/063112Skill-based matching of a person or a group to a task
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The embodiment of the application discloses a method, a device, computer equipment and a computer readable storage medium for order broadcasting, wherein at least one driver is sequenced and numbered according to the quality degree; predicting the response rate and the cancellation rate of each driver and acquiring the response rate; constructing an objective function according to the cancellation rate and the response rate; and acquiring the driver of the broadcast according to the objective function. This scheme can the city of different driver density of self-adaptation, has saved the operation manpower to big dish is broadcast single adjustment, has realized that intelligence is broadcast single.

Description

Order broadcasting method and device, computer equipment and computer-readable storage medium
Technical Field
The embodiment of the application relates to the field of order broadcasting, in particular to an order broadcasting method, an order broadcasting device, computer equipment and a computer-readable storage medium.
Background
In the current order distribution system of the cargo pulling, most of the flow rate is the scheme of order grabbing in the hall:
that is, after the order is generated, the orders are broadcast and pushed to drivers in different ranges step by step along with the time, the pushing time and distance are configured according to the city, for example, the configuration [ 10s,1km ] indicates that [ 0s pushes drivers in 1km, 10s pushes drivers in 2km, 20s pushes drivers in 3km, and the like until the order is responded ]. In short, distance segment pushing.
Disclosure of Invention
The embodiment of the application aims to provide an order broadcasting method, an order broadcasting device, computer equipment and a computer-readable storage medium, which aim to adapt to cities with different driver densities, save the operation labor for large-disk order broadcasting adjustment and realize intelligent order broadcasting.
One aspect of the embodiments of the present application provides a method for order broadcasting, where the method includes:
sequencing and numbering at least one driver according to the quality degree;
predicting the response rate and the cancellation rate of each driver and acquiring the response rate;
constructing an objective function according to the cancellation rate and the response rate;
and acquiring the driver of the broadcast according to the objective function.
An aspect of an embodiment of the present application further provides an order broadcasting apparatus, including:
the numbering module is used for sequencing and numbering at least one driver according to the quality degree;
the first acquisition module is used for predicting the response rate and the cancellation rate of each driver and acquiring the response rate;
the construction module is used for constructing an objective function according to the cancellation rate and the response rate;
and the second acquisition module is used for acquiring the driver of the broadcast according to the target function.
An aspect of the embodiments of the present application further provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method as described above when executing the computer program.
An aspect of the embodiments of the present application further provides a computer-readable storage medium, including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method as described above when executing the computer program.
The order broadcasting method, the order broadcasting device, the computer equipment and the computer readable storage medium provided by the embodiment of the application sequence and number at least one driver according to the quality degree; predicting the response rate and the cancellation rate of each driver and acquiring the response rate; constructing an objective function according to the cancellation rate and the response rate; and acquiring the driver of the broadcast according to the objective function. This scheme can the city of different driver density of self-adaptation, has saved the operation manpower to big dish is broadcast single adjustment, has realized that intelligence is broadcast single.
Drawings
Fig. 1 is a diagram schematically illustrating an application environment of a method of order broadcasting according to an embodiment of the present application;
fig. 2 schematically shows a flowchart of a method of order broadcasting according to a first embodiment of the present application;
fig. 3 schematically shows a block diagram of an apparatus for order broadcasting according to a second embodiment of the present application;
fig. 4 schematically shows a hardware architecture diagram of a computer device suitable for implementing the method for order broadcasting according to the third embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the descriptions relating to "first", "second", etc. in the embodiments of the present application are only for descriptive purposes and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
Fig. 1 schematically shows an environment application diagram according to an embodiment of the application.
The server 20 is connected to a plurality of mobile terminals 10 through the network 9.
Server 20 may be implemented by one or more computing devices. One or more computing devices may include virtualized compute instances. The virtualized compute instance may include an emulation of a virtual machine, such as a computer system, operating system, server, and the like. The computing device may load a virtual machine by the computing device based on the virtual image and/or other data defining the particular software (e.g., operating system, dedicated application, server) used for emulation. As the demand for different types of processing services changes, different virtual machines may be loaded and/or terminated on one or more computing devices. A hypervisor may be implemented to manage the use of different virtual machines on the same computing device.
A plurality of mobile terminals 10 may be configured to access content and services of the server 20. The plurality of mobile terminals 10 may include any type of electronic device, such as a mobile device, a tablet device, a laptop computer, a workstation, a virtual reality device, a gaming device, a set-top box, a digital streaming media device, a vehicle terminal, a smart television, a set-top box, and so forth.
A plurality of mobile terminals 10 may be associated with one or more users. A single user may use one or more of the plurality of mobile terminals 11 to access the server 20. Multiple mobile terminals 10 may travel to various locations and use different networks to access the server 20.
Network 9 includes various network devices such as routers, switches, multiplexers, hubs, modems, bridges, repeaters, firewalls, proxy devices, and/or the like. The network 9 may include physical links such as coaxial cable links, twisted pair cable links, fiber optic links, combinations thereof, and the like. The network 9 may include wireless links such as cellular links, satellite links, Wi-Fi links, etc.
Example one
Fig. 2 schematically shows a flowchart of a method for order broadcasting according to a first embodiment of the present application. It is understood that the present method embodiment may be performed in the server 20, and the flow chart of the present method embodiment is not used to limit the order in which the steps are performed.
As shown in fig. 2, the order broadcasting method may include steps S200 to S206, wherein:
s200, sequencing and numbering at least one driver according to the quality degree;
optionally, the sorting and numbering at least one driver according to the quality degree includes:
and sequencing and numbering N drivers according to the quality degree, wherein the most elegant driver is numbered as 1, the worst driver is numbered as N, and N is a natural number greater than 1.
Step S202, predicting the response rate and the cancellation rate of each driver and acquiring the response rate;
optionally, the predicting a cancellation rate of each driver includes:
the probability that the nth user accepts the order and cancels is
Figure BDA0002762848510000031
Wherein the ith driver response rate is PiThe cancellation rate is QiIf no driver takes the order in the round, the probability of user cancellation is gamma, and the decision variable for whether to broadcast the ith driver is yi∈{0,1},
Figure BDA0002762848510000032
Probability that no order is received by any driver higher in priority than the nth driver, ynPnIs the nth driver's probability of taking an order, QnAfter the nth driver receives the orderThe probability is cancelled.
Step S204, constructing an objective function according to the cancellation rate and the response rate;
optionally, the constructing an objective function according to the cancellation rate and the response rate includes:
the objective function is
Figure BDA0002762848510000033
Wherein a set of decision variables yiE {0,1} and the probability of cancellation is
Figure BDA0002762848510000041
The probability of cancellation for the unanswered user is
Figure BDA0002762848510000042
And step S206, acquiring the driver of the broadcast according to the objective function.
Optionally, the obtaining the driver of the broadcast according to the objective function includes:
scanning i belongs to [1, N +1], setting the variable y with the sequence number smaller than i to be 1, and setting the variable y with the sequence number larger than or equal to i to be 0;
and comparing the N +1 results, and taking i corresponding to the minimum value as a boundary for determining whether to divide the bills.
Specifically, (one) explicitly expresses the response rate and the response rate.
1. And (4) sequencing and numbering N drivers according to the quality degree, wherein the most elegant driver is numbered 1, and the worst driver is numbered N. One driver is better quality than another driver as can be appreciated: if a booking is made to two drivers and both drivers meet the booking at the same time, the driver that we assign with priority is a good driver. Generally, the non-cancellation rate after the order is received is used as a high-quality substitute index, namely, the lower the cancellation rate, the farther the driver is, the higher the driver is, the farther the driver is.
2. The response rate and cancellation rate of each driver are predicted. Here the prediction can use the common ctr method. Note that the ith driver response rate is PiThe cancellation rate is QiMemory for recordingIf no driver takes an order for this round, the probability of the user cancelling is gamma. Let the decision variable of whether to broadcast to the ith driver be yi∈{0,1}。
The probability that the nth user accepts the order and cancels is
Figure BDA0002762848510000043
Wherein
Figure BDA0002762848510000044
Probability that no order is received by any driver higher in priority than the nth driver, ynPnIs the nth driver's probability of taking an order, QnThe probability is cancelled after the nth driver takes the order. The probability is obtained by the multiplication principle of the probabilities of the independent events. The total probability of picking up an order and canceling is
Figure BDA0002762848510000045
The probability of no order being received by all drivers is
Figure BDA0002762848510000046
The probability that the driver will not pick up the order and the user will cancel is
Figure BDA0002762848510000047
To this end we derive a set of decision variables yiE {0,1} and the probability of cancellation is
Figure BDA0002762848510000048
The probability of cancellation of the non-responded user is
Figure BDA0002762848510000049
3. We can construct an objective function based on the cancellation rate and the response rate. For simplicity, assuming we have consistent tolerance for pre-answer cancellation and post-answer cancellation of users, the objective function that needs to be minimized is
Figure BDA00027628485100000410
Figure BDA00027628485100000411
In an actual scene, the two probabilities can be freely combined according to needs to obtain a target function which accords with the service.
And (II) solving an optimization problem.
At Pi,QiWith gamma known, minimize
Figure BDA0002762848510000051
It remains a difficult problem in NP. This problem can be solved by some heuristic operational research algorithm.
Here we propose a constraint by combining business logic to transform the optimization problem into a problem that can be solved with linear scanning. We agree that if a driver (numbered i) is not ordered, then any more "bad" drivers (numbered i) than this must not be ordered. The rationale for this logic is that we always want to present the user with the best quality driver.
Under the constraint, we only need to scan i ∈ [1, N +1], and set the variable y with sequence number smaller than i to 1, and set the variable y with sequence number greater than or equal to i to 0. Then, the N +1 results are compared, and i corresponding to the minimum value is taken out as a boundary of whether to divide the bill or not.
The embodiment of the application provides an order broadcasting method, an order broadcasting device, computer equipment and a computer readable storage medium, wherein at least one driver is sequenced and numbered according to the quality degree; predicting the response rate and the cancellation rate of each driver and acquiring the response rate; constructing an objective function according to the cancellation rate and the response rate; and acquiring the driver of the broadcast according to the objective function. This scheme can the city of different driver density of self-adaptation, has saved the operation manpower to big dish is broadcast single adjustment, has realized that intelligence is broadcast single.
Example two
Fig. 3 schematically shows a block diagram of an apparatus for order broadcasting according to a second embodiment of the present application, which may be divided into one or more program modules, and the one or more program modules are stored in a storage medium and executed by one or more processors to complete the second embodiment of the present application. The program modules referred to in the embodiments of the present application refer to a series of computer program instruction segments that can perform specific functions, and the following description will specifically describe the functions of the program modules in the embodiments.
As shown in fig. 3, the order broadcasting apparatus 300 may include a numbering module 310, a first obtaining module 320, a constructing module 330, and a second obtaining module 340, wherein:
a numbering module 310 for ranking and numbering at least one driver according to a quality level;
a first obtaining module 320, configured to predict a response rate and a cancellation rate of each driver, and obtain a response rate;
a constructing module 330, configured to construct an objective function according to the cancellation rate and the response rate;
and a second obtaining module 340, configured to obtain a driver of the broadcast according to the objective function.
Optionally, the first obtaining module 320 is configured to:
the probability that the nth user accepts the order and cancels is
Figure BDA0002762848510000052
Wherein the ith driver response rate is PiThe cancellation rate is QiIf no driver takes the order in the round, the probability of user cancellation is gamma, and the decision variable for whether to broadcast the ith driver is yi∈{0,1},
Figure BDA0002762848510000053
Probability that no order is received by any driver higher in priority than the nth driver, ynPnIs the nth driver's probability of taking an order, QnThe probability is cancelled after the nth driver takes the order.
Optionally, the building module 330 is configured to:
the objective function is
Figure BDA0002762848510000061
Wherein a set of decision variables yiE {0,1} and the probability of cancellation is
Figure BDA0002762848510000062
The probability of cancellation for the unanswered user is
Figure BDA0002762848510000063
The order broadcasting device provided by the embodiment of the application sorts and numbers at least one driver according to the high-quality degree; predicting the response rate and the cancellation rate of each driver and acquiring the response rate; constructing an objective function according to the cancellation rate and the response rate; and acquiring the driver of the broadcast according to the objective function. This scheme can the city of different driver density of self-adaptation, has saved the operation manpower to big dish is broadcast single adjustment, has realized that intelligence is broadcast single.
EXAMPLE III
Fig. 4 schematically shows a hardware architecture diagram of a computer device suitable for implementing the method for order broadcasting according to the third embodiment of the present application.
In this embodiment, the computer device 4 may be used as a provider network or a component part of the provider network, and the computer device 4 may be, for example, a virtual machine host process and one or more virtual machine instances, or a rack server, a blade server, a tower server, or a rack server (including an independent server or a server cluster composed of multiple servers), and the like.
In this embodiment, the computer device 4 may also be used as a mobile terminal or a component part constituting a mobile terminal. When the computer device 4 is a mobile terminal or forms part of a mobile terminal, the computer device 4 may be, for example, a smartphone, a computer, a projector, a set-top box, etc.
In the present embodiment, the computer device 4 is a device capable of automatically performing numerical calculation and/or information processing in accordance with a command set or stored in advance. As shown in fig. 4, the computer device 4 includes at least, but is not limited to: memory 410, processor 420, and network interface 430 may be communicatively linked to each other via a system bus. Wherein:
the memory 410 includes at least one type of computer-readable storage medium including a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the storage 410 may be an internal storage module of the computer device 4, such as a hard disk or a memory of the computer device 4. In other embodiments, the memory 410 may also be an external storage device of the computer device 4, such as a plug-in hard disk provided on the computer device 4, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like. Of course, memory 410 may also include both internal and external memory modules of computer device 4. In this embodiment, the memory 410 is generally used for storing the operating system installed in the computer device 4 and various application software, such as program codes of the method for order broadcasting. In addition, the memory 410 may also be used to temporarily store various types of data that have been output or are to be output.
Processor 420 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 420 is generally configured to control the overall operation of the computer device 4, such as performing control and processing related to data interaction or communication with the computer device 4. In this embodiment, the processor 420 is used to execute program codes stored in the memory 410 or process data.
Network interface 430 can comprise a wireless network interface or a wired network interface, and network interface 430 is typically used to establish communication links between computer device 4 and other computer devices. For example, the network interface 430 is used to connect the computer device 4 with an external terminal through a network, establish a data transmission channel and a communication link between the computer device 4 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), or Wi-Fi.
It should be noted that fig. 4 only shows a computer device having components 410 and 430, but it should be understood that not all of the shown components are required to be implemented, and that more or fewer components may be implemented instead.
In this embodiment, the order broadcasting method stored in the memory 410 may be further divided into one or more program modules and executed by one or more processors (in this embodiment, the processor 420) to complete the present application.
Example four
The present embodiment also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of order broadcasting in embodiments.
In this embodiment, the computer-readable storage medium includes a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the computer readable storage medium may be an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device. Of course, the computer-readable storage medium may also include both internal and external storage devices of the computer device. In this embodiment, the computer-readable storage medium is generally used for storing an operating system and various types of application software installed in the computer device, for example, the program codes of the method for order broadcasting in the embodiment, and the like. Further, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are included in the scope of the present application.

Claims (10)

1. A method of order broadcasting, the method comprising:
sequencing and numbering at least one driver according to the quality degree;
predicting the response rate and the cancellation rate of each driver and acquiring the response rate;
constructing an objective function according to the cancellation rate and the response rate;
and acquiring the driver of the broadcast according to the objective function.
2. The method of claim 1, wherein the ranking and numbering the at least one driver according to a quality level comprises:
and sequencing and numbering N drivers according to the quality degree, wherein the most elegant driver is numbered as 1, the worst driver is numbered as N, and N is a natural number greater than 1.
3. The method of claim 1, wherein predicting a cancellation rate for each driver comprises:
the probability that the nth user accepts the order and cancels is
Figure FDA0002762848500000011
Wherein the ith driver response rate is PiThe cancellation rate is QiIf no driver takes the order in the round, the probability of user cancellation is gamma, and the decision variable for whether to broadcast the ith driver is yi∈{0,1},
Figure FDA0002762848500000012
Probability that no order is received by any driver higher in priority than the nth driver, ynPnIs the nth driver's probability of taking an order, QnThe probability is cancelled after the nth driver takes the order.
4. The method of claim 3, wherein constructing an objective function based on the cancellation rate and the response rate comprises:
the objective function is
Figure FDA0002762848500000013
Wherein a set of decision variables yiE {0,1} and the probability of cancellation is
Figure FDA0002762848500000014
The probability of cancellation for the unanswered user is
Figure FDA0002762848500000015
5. The method of claim 4, wherein said obtaining a driver of a broadcast according to said objective function comprises:
scanning i belongs to [1, N +1], setting the variable y with the sequence number smaller than i to be 1, and setting the variable y with the sequence number larger than or equal to i to be 0;
and comparing the N +1 results, and taking i corresponding to the minimum value as a boundary for determining whether to divide the bills.
6. An apparatus for order broadcasting, the apparatus comprising:
the numbering module is used for sequencing and numbering at least one driver according to the quality degree;
the first acquisition module is used for predicting the response rate and the cancellation rate of each driver and acquiring the response rate;
the construction module is used for constructing an objective function according to the cancellation rate and the response rate;
and the second acquisition module is used for acquiring the driver of the broadcast according to the target function.
7. The apparatus of claim 6, wherein the first obtaining module is configured to:
the probability that the nth user accepts the order and cancels is
Figure FDA0002762848500000021
Wherein the ith driver response rate is PiThe cancellation rate is QiIf no driver takes the order in the round, the probability of user cancellation is gamma, and the decision variable for whether to broadcast the ith driver is yi∈{0,1},
Figure FDA0002762848500000022
Probability that no order is received by any driver higher in priority than the nth driver, ynPnIs the nth driver's probability of taking an order, QnThe probability is cancelled after the nth driver takes the order.
8. The apparatus of claim 7, wherein the build module is configured to:
the objective function is
Figure FDA0002762848500000023
Wherein a set of decision variables yiE {0,1} and the probability of cancellation is
Figure FDA0002762848500000024
The probability of cancellation for the unanswered user is
Figure FDA0002762848500000025
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 5 are implemented by the processor when executing the computer program.
10. A computer-readable storage medium, having stored thereon a computer program, the computer program being executable by at least one processor to cause the at least one processor to perform the steps of the method according to any one of claims 1 to 5.
CN202011223444.3A 2020-11-05 2020-11-05 Order broadcasting method, order broadcasting device, computer equipment and computer readable storage medium Active CN112418616B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011223444.3A CN112418616B (en) 2020-11-05 2020-11-05 Order broadcasting method, order broadcasting device, computer equipment and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011223444.3A CN112418616B (en) 2020-11-05 2020-11-05 Order broadcasting method, order broadcasting device, computer equipment and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN112418616A true CN112418616A (en) 2021-02-26
CN112418616B CN112418616B (en) 2024-01-23

Family

ID=74827585

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011223444.3A Active CN112418616B (en) 2020-11-05 2020-11-05 Order broadcasting method, order broadcasting device, computer equipment and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN112418616B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104599168A (en) * 2015-02-02 2015-05-06 北京嘀嘀无限科技发展有限公司 Method and device for allocating taxi-calling orders
CN105741020A (en) * 2016-01-25 2016-07-06 滴滴(中国)科技有限公司 Unified order allocation method and device
CN109377317A (en) * 2018-10-26 2019-02-22 天津五八到家科技有限公司 Data processing method and device
CN110543960A (en) * 2019-08-20 2019-12-06 南京领行科技股份有限公司 Order dispatching method and device
CN110839346A (en) * 2018-06-19 2020-02-25 北京嘀嘀无限科技发展有限公司 System and method for distributing service requests
CN111325374A (en) * 2018-12-13 2020-06-23 北京嘀嘀无限科技发展有限公司 Method and device for predicting order cancellation probability and electronic equipment
CN111353676A (en) * 2018-12-24 2020-06-30 北京嘀嘀无限科技发展有限公司 Order distribution method, system, computer device and computer readable storage medium
CN111724091A (en) * 2019-03-21 2020-09-29 天津五八到家科技有限公司 Order distribution method, server side equipment and storage medium
CN111861620A (en) * 2019-12-18 2020-10-30 北京嘀嘀无限科技发展有限公司 Order processing method and system

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104599168A (en) * 2015-02-02 2015-05-06 北京嘀嘀无限科技发展有限公司 Method and device for allocating taxi-calling orders
CN105741020A (en) * 2016-01-25 2016-07-06 滴滴(中国)科技有限公司 Unified order allocation method and device
CN110839346A (en) * 2018-06-19 2020-02-25 北京嘀嘀无限科技发展有限公司 System and method for distributing service requests
CN109377317A (en) * 2018-10-26 2019-02-22 天津五八到家科技有限公司 Data processing method and device
CN111325374A (en) * 2018-12-13 2020-06-23 北京嘀嘀无限科技发展有限公司 Method and device for predicting order cancellation probability and electronic equipment
CN111353676A (en) * 2018-12-24 2020-06-30 北京嘀嘀无限科技发展有限公司 Order distribution method, system, computer device and computer readable storage medium
CN111724091A (en) * 2019-03-21 2020-09-29 天津五八到家科技有限公司 Order distribution method, server side equipment and storage medium
CN110543960A (en) * 2019-08-20 2019-12-06 南京领行科技股份有限公司 Order dispatching method and device
CN111861620A (en) * 2019-12-18 2020-10-30 北京嘀嘀无限科技发展有限公司 Order processing method and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李建斌;周泰;徐礼平;戴宾;: "货运O2O平台有时间窗同城零担集货匹配优化决策", 系统工程理论与实践, no. 04 *

Also Published As

Publication number Publication date
CN112418616B (en) 2024-01-23

Similar Documents

Publication Publication Date Title
CN110555640B (en) Route planning method and device
CN107466469B (en) Map drawing method, cloud platform and server thereof
CN111352711B (en) Multi-computing engine scheduling method, device, equipment and storage medium
CN108446110B (en) Lua script generation method, Lua script generation device, Lua script generation terminal and computer readable medium
CN112488430A (en) Modeling method and device for predicting order cancellation, computer equipment and computer readable storage medium
CN112488806A (en) Method and device for predicting order willingness, computer equipment and computer-readable storage medium
CN112418616A (en) Order broadcasting method and device, computer equipment and computer-readable storage medium
CN112488794A (en) Order broadcasting method and device, computer equipment and computer readable storage medium
CN112465602B (en) Order pushing method, order pushing device, computer equipment and computer readable storage medium
US20170090820A1 (en) Method and device for operating a many-core system
CN114329058A (en) Image gathering method and device and electronic equipment
CN112465604A (en) Order distribution method and device, computer equipment and computer readable storage medium
CN114004623A (en) Machine learning method and system
CN111367664A (en) Information processing method and related device
CN111461356B (en) Resource management method, device, equipment and storage medium thereof
CN112486615B (en) Method, device, equipment and storage medium for executing decision flow based on topological path
CN112465597A (en) Order pushing method and device, computer equipment and computer readable storage medium
CN116679758B (en) Unmanned aerial vehicle scheduling method, unmanned aerial vehicle scheduling system, computer and readable storage medium
CN113592148B (en) Optimization method and system for improving delivery route of vehicle and unmanned aerial vehicle
CN116402432B (en) Route planning method, device, equipment and storage medium
CN117689186B (en) Scheduling plan screening method based on identification analysis and related equipment
CN112752098B (en) Video editing effect verification method and device
CN109741415B (en) Picture layer arrangement method and device and terminal equipment
CN117009061A (en) Task processing method, device, equipment and computer readable storage medium
CN116662396A (en) Method, device, equipment and storage medium for processing identification information

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant