WO2020238600A1 - 一种订单处理方法、装置、电子设备及存储介质 - Google Patents
一种订单处理方法、装置、电子设备及存储介质 Download PDFInfo
- Publication number
- WO2020238600A1 WO2020238600A1 PCT/CN2020/089671 CN2020089671W WO2020238600A1 WO 2020238600 A1 WO2020238600 A1 WO 2020238600A1 CN 2020089671 W CN2020089671 W CN 2020089671W WO 2020238600 A1 WO2020238600 A1 WO 2020238600A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- order
- time
- time point
- splitting
- time set
- Prior art date
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 claims abstract description 22
- 238000004590 computer program Methods 0.000 claims description 8
- 230000015654 memory Effects 0.000 description 17
- 230000006870 function Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000003068 static effect Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000029305 taxis Effects 0.000 description 2
- 102000006822 Agouti Signaling Protein Human genes 0.000 description 1
- 108010072151 Agouti Signaling Protein Proteins 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 239000003990 capacitor Substances 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0639—Item locations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Definitions
- This application relates to the technical field of order processing, and in particular to an order processing method, device, electronic equipment and storage medium.
- Online ride-hailing platforms can provide passengers with a variety of travel services, including: express, special cars, taxis, bicycles, carpooling, etc.
- the method for splitting carpool orders provided by the prior art is as follows: the platform pre-determines the order splitting interval, and for any area, the platform will split the carpooling orders from that region at the aforementioned splitting interval. .
- the platform's order splitting efficiency is low.
- the purpose of this application is to provide an order processing method, device, electronic equipment, and storage medium.
- the order splitting strategy of the target area By matching the order splitting strategy of the target area, the pending orders from the target area are split, and the platform is improved. The efficiency of order splitting.
- an order processing method including:
- search for a target order placement time set corresponding to the target area wherein the target order placement time set includes at least one order placement time point, and the target order placement time set
- the time set is obtained by matching and processing historical orders in the target area
- the embodiments of the present application provide the first possible implementation manner of the first aspect, wherein the obtaining the pending order sent by the service requester in the target area includes:
- the pending order sent by the service requester in the target area is acquired.
- an embodiment of the present application provides a second possible implementation manner of the first aspect, wherein the said target order time set is based on each order time point , To perform split-order matching processing on the pending order, including:
- For each split time point in the target split time set select the previous split time point of the split time point as the first initial split time point, and obtain the first initial split time point Orders to be processed within the time period up to the time point of the order split;
- the obtained pending order is split and matched, and the split matching result is obtained.
- the embodiments of the present application provide a third possible implementation manner of the first aspect, in which the target split time set is determined in the following manner, including:
- the ending order time point is the last time point in the preset time period, and the ending order time point corresponds to At least one split order at the end of the split time point;
- the first order splitting time set corresponding to the maximum order splitting efficiency and the first order splitting are determined Order splitting efficiency of time set; where the number of split time points included in each split time set is the same as the number of split orders, and the split time points in different split time sets are different;
- the target first sorting time set corresponding to the maximum sorting efficiency is selected from each first sorting time set as the target sorting time set.
- the embodiments of the present application provide the fourth possible implementation manner of the first aspect, in which, from each set of order split times corresponding to the number of order splits, it is determined
- the first set of order splitting time corresponding to the maximum splitting efficiency including:
- the target number of order splits is the number of times the number of splits minus one;
- an embodiment of the present application provides a fifth possible implementation manner of the first aspect, wherein determining the order splitting efficiency of the first order splitting time set includes:
- an embodiment of the present application provides a sixth possible implementation manner of the first aspect, wherein the determination of the candidate order splitting time point corresponds to the maximum number of times of the target order splitting
- the second set of order splitting time for splitting efficiency including:
- the candidate sorting time point is selected as the new end sorting time point, and each sorting time point before the end sorting time point is selected as the candidate sorting time point and Subsequent steps, until the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times;
- the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times, based on each time point in the second order placement time set and historical orders in the target area Order information, performing order splitting matching processing on the historical orders to obtain the order splitting efficiency of the second order splitting time set.
- an embodiment of the present application provides a seventh possible implementation manner of the first aspect, where the said is based on each time point in the second split time set and The order information of the historical order in the target area, the order matching processing is performed on the historical order to obtain the order splitting efficiency of the second order split time set, including:
- the sum of the order splitting efficiency corresponding to each order splitting time point in the second order splitting time set is determined as the order splitting efficiency of the second order splitting time set.
- an embodiment of the present application provides an eighth possible implementation manner of the first aspect, wherein, at the point in time when the split order ends, the first historical order Performing sorting matching processing to determine the sorting efficiency at the time when the sorting ends, including:
- the order splitting efficiency at the point of ending the order splitting is determined.
- an embodiment of the present application provides a ninth possible implementation manner of the first aspect, wherein the corresponding maximum order splitting efficiency is selected from each first order splitting time set After the target first split time is set, the method further includes:
- Fitting processing is performed on a plurality of the first sorting time sets to obtain a target sorting time set corresponding to the target area.
- an order processing device including:
- the first obtaining module is used to obtain pending orders sent by the service requester in the target area
- the search module is configured to search for a target order placement time set corresponding to the target area according to the correspondence between each region and the order placement time set; wherein the target order placement time set includes at least one order placement time point, and The target order split time set is obtained by performing split matching processing on historical orders in the target area;
- An order matching module configured to perform order matching processing on the pending order based on each order time point in the target order time set
- the sending module is used to send the matching result obtained by matching the order to the corresponding service requester.
- the embodiments of the present application provide the first possible implementation manner of the second aspect, wherein the first acquisition module is specifically used for:
- the pending order sent by the service requester in the target area is acquired.
- an embodiment of the present application provides a second possible implementation manner of the second aspect, wherein the order splitting and matching module is specifically used for:
- For each split time point in the target split time set select the previous split time point of the split time point as the first initial split time point, and obtain the first initial split time point Orders to be processed within the time period up to the time point of the order split;
- the obtained pending order is split and matched, and the split matching result is obtained.
- the embodiments of the present application provide a third possible implementation manner of the second aspect, wherein the device further includes:
- the second acquiring module is used to acquire the ending time point of order placement in the preset time period of the target area; wherein the ending time point of order placement is the last time point in the preset time period, and The time point for ending the order splitting corresponds to at least one order splitting at the time point for ending the order splitting;
- the determining module is used for determining the first order dividing time set corresponding to the maximum order dividing efficiency and all the order dividing time sets corresponding to the order dividing times for each order dividing time corresponding to the ending time point of order dividing. Describe the efficiency of the order splitting of the first order splitting time set; where the number of splitting time points included in each splitting time set is the same as the number of splitting orders, and the splitting time points in different order splitting time sets different;
- the selection module is used to select the target first order sorting time set corresponding to the maximum order sorting efficiency from each first order sorting time set based on the order sorting efficiency of the first order sorting time set corresponding to each number of order sorting times, as the all The set of target split time.
- an embodiment of the present application provides a fourth possible implementation manner of the second aspect, wherein the determining module is specifically used for:
- the target number of order splits is the number of times the number of splits minus one;
- an embodiment of the present application provides a fifth possible implementation manner of the second aspect, wherein the determining module is specifically used for:
- an embodiment of the present application provides a sixth possible implementation manner of the second aspect, wherein the determining module is specifically used for:
- the candidate sorting time point is selected as the new end sorting time point, and each sorting time point before the end sorting time point is selected as the candidate sorting time point and Subsequent steps, until the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times;
- the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times, based on each time point in the second order placement time set and historical orders in the target area Order information, performing order splitting matching processing on the historical orders to obtain the order splitting efficiency of the second order splitting time set.
- an embodiment of the present application provides a seventh possible implementation manner of the second aspect, wherein the determining module is specifically used for:
- the sum of the order splitting efficiency corresponding to each order splitting time point in the second order splitting time set is determined as the order splitting efficiency of the second order splitting time set.
- an embodiment of the present application provides an eighth possible implementation manner of the second aspect, wherein the determining module is specifically used for:
- the order splitting efficiency at the point of ending the order splitting is determined.
- an embodiment of the present application provides a ninth possible implementation manner of the second aspect, wherein the device further includes:
- the third acquiring module is configured to acquire a plurality of first split time sets corresponding to the target area
- the fitting module is used to perform fitting processing on a plurality of the first sorting time sets to obtain a target sorting time set corresponding to the target area.
- an embodiment of the present application also provides an electronic device, including: a processor, a storage medium, and a bus.
- the storage medium stores machine-readable instructions executable by the processor.
- the processor and the storage medium communicate via a bus, and the processor executes the machine-readable instructions to execute the steps of the order processing method according to any one of the first aspect.
- an embodiment of the present application also provides a computer-readable storage medium having a computer program stored on the computer-readable storage medium, and the computer program is executed by a processor as described in any one of the first aspect. Describe the steps of the order processing method.
- the order processing method, device, electronic equipment, and storage medium provided in the embodiments of the present application obtain a target order distribution time set matching the target area by performing order matching processing on historical orders in a target area. For pending orders from the target area, the pending orders from the target area are split by matching the target sorting time set of the target area, thereby improving the efficiency of the platform.
- FIG. 1 shows a schematic structural diagram of a service system provided by an embodiment of the present application
- FIG. 2 shows a flowchart of an order processing method provided by an embodiment of the present application
- FIG. 3 shows a flowchart of another order processing method provided by an embodiment of the present application
- FIG. 4 shows a flowchart of another order processing method provided by an embodiment of the present application.
- FIG. 5 shows a flowchart of another order processing method provided by an embodiment of the present application.
- FIG. 6 shows a flowchart of another order processing method provided by an embodiment of the present application.
- FIG. 7 shows a flowchart of another order processing method provided by an embodiment of the present application.
- FIG. 8 shows a flowchart of another order processing method provided by an embodiment of the present application.
- FIG. 9 shows a flowchart of another order processing method provided by an embodiment of the present application.
- FIG. 10 shows a schematic structural diagram of an order processing apparatus provided by an embodiment of the present application.
- FIG. 11 shows a schematic structural diagram of an electronic device provided by an embodiment of the present application.
- Fig. 1 is a block diagram of a service system 100 according to some embodiments of the present application.
- the service system 100 may be an online transportation service platform used for transportation services such as taxis, car rental services, express cars, carpooling, bus services, driver leasing, or shuttle services, or any combination thereof.
- the service system 100 may include one or more of a server 110, a network 120, a service requester 130, a service provider 140, and a database 150.
- the server 110 may be a single server or a server group.
- the server group may be centralized or distributed (for example, the server 110 may be a distributed system).
- the server 110 may be local or remote.
- the server 110 may access information and/or data stored in the service requester 130, the service provider 140, or the database 150, or any combination thereof via the network 120.
- the server 110 may be directly connected to at least one of the service requester 130, the service provider 140, and the database 150 to access stored information and/or data.
- the server 110 may be implemented on a cloud platform; just as an example, a cloud platform may include private cloud, public cloud, hybrid cloud, community cloud, distributed cloud, and inter-cloud. , Multi-cloud, etc., or any combination of them.
- the server 110 may include a processor.
- the processor may process information and/or data related to the service request to perform one or more functions described in this application. For example, the processor may determine each boarding point in the target area to which the foregoing current location information belongs based on the current location information in the service request sent from the service requester 130.
- the processor may include one or more processing cores (e.g., single-core processor (S) or multi-core processor (S)).
- the processor may include a central processing unit (CPU), an application specific integrated circuit (ASIC), a dedicated instruction set processor (Application Specific Instruction-set Processor, ASIP), and a graphics processing unit (Graphics Processing Unit, GPU), Physical Processing Unit (Physics Processing Unit, PPU), Digital Signal Processor (Digital Signal Processor, DSP), Field Programmable Gate Array (Field Programmable Gate Array, FPGA), Programmable Logic Device ( Programmable Logic Device (PLD), controller, microcontroller unit, Reduced Instruction Set Computing (RISC), or microprocessor, etc., or any combination thereof.
- CPU central processing unit
- ASIC application specific integrated circuit
- ASIP Application Specific Instruction-set Processor
- GPU Graphics Processing Unit
- PPU Physical Processing Unit
- DSP Digital Signal Processor
- DSP Digital Signal Processor
- FPGA Field Programmable Gate Array
- PLD Programmable Logic Device
- controller microcontroller unit, Reduced Instruction Set Computing (RISC), or microprocessor, etc., or any combination thereof.
- the network 120 may be used for the exchange of information and/or data.
- one or more components in the service system 100 may send information and/or data to other components.
- the server 110 may obtain a service request from the service requester 130 via the network 120.
- the network 120 may be any type of wired or wireless network, or a combination of them.
- the network 130 may include a wired network, a wireless network, an optical fiber network, a telecommunication network, an intranet, the Internet, a local area network (LAN), a wide area network (Wide Area Network, WAN), and a wireless local area network (Wireless Local Area).
- the network 120 may include one or more network access points.
- the network 120 may include wired or wireless network access points, such as base stations and/or network switching nodes, through which one or more components of the service system 100 may be connected to the network 120 to exchange data and/or information.
- the service requester 130 may include a mobile device, a tablet computer, a laptop computer, or a built-in device in a motor vehicle, etc., or any combination thereof.
- the mobile device may include a wearable device, a smart mobile device, a virtual reality device, or an augmented reality device, etc., or any combination thereof.
- the service requester 130 may be a device with a positioning function.
- the database 150 may store data and/or instructions. In some embodiments, the database 150 may store data obtained from the service requester 130 and/or the service provider 140. In some embodiments, the database 150 may store data and/or instructions of the exemplary methods described in the embodiments of the present application. In some embodiments, the database 150 may include mass memory, removable memory, volatile read-write memory, or read-only memory (Read-Only Memory, ROM), etc., or any combination thereof.
- mass storage may include magnetic disks, optical disks, solid-state drives, etc.; removable storage may include flash drives, floppy disks, optical disks, memory cards, zip disks, tapes, etc.; volatile read-write storage may include random access memory ( Random Access Memory, RAM; RAM can include dynamic RAM (Dynamic Random Access Memory, DRAM), double data rate synchronous dynamic RAM (Double Date-Rate Synchronous RAM, DDR SDRAM); static RAM (Static Random-Access Memory, SRAM) ), thyristor RAM (Thyristor-Based Random Access Memory, T-RAM) and zero capacitor RAM (Zero-RAM), etc.
- RAM Random Access Memory
- RAM can include dynamic RAM (Dynamic Random Access Memory, DRAM), double data rate synchronous dynamic RAM (Double Date-Rate Synchronous RAM, DDR SDRAM); static RAM (Static Random-Access Memory, SRAM) ), thyristor RAM (Thyristor-Based Random Access Memory, T-RAM) and zero capacitor RAM (Z
- ROM may include mask ROM (Mask Read-Only Memory, MROM), programmable ROM (Programmable Read-Only Memory, PROM), Erasable Programmable ROM (Programmable Read-only Memory, PEROM), electrical Erasable programmable ROM (Electrically Erasable Programmable read only memory, EEPROM), compact disc ROM (CD-ROM), and digital universal disk ROM, etc.
- MROM mask ROM
- PROM Programmable ROM
- PEROM Erasable Programmable ROM
- PEROM Erasable Programmable ROM
- EEPROM Electrical Erasable programmable ROM
- CD-ROM compact disc ROM
- digital universal disk ROM etc.
- the database 150 may be implemented on a cloud platform.
- the cloud platform may include private cloud, public cloud, hybrid cloud, community cloud, distributed cloud, cross-cloud, multi-cloud, or the like, or any combination thereof.
- the database 150 may be connected to the network 120 to communicate with one or more components in the service system 100 (for example, the server 110, the service requester 130, the service provider 140, etc.). One or more components in the service system 100 can access data or instructions stored in the database 150 via the network 120. In some embodiments, the database 150 may be directly connected to one or more components in the service system 100, or the database 150 may also be a part of the server 110.
- an embodiment of the present application provides an order processing method, which can be applied to the server 110. As shown in FIG. 2, the method includes the following steps:
- S201 Obtain a pending order sent by a service requester in the target area.
- the pending order may be a pending ride sharing order.
- the to-be-processed carpool orders respectively sent by multiple different service requesting terminals in the area A are acquired as the to-be-processed orders.
- each area and the order placement time set search for a target order placement time set corresponding to the target area; wherein the target order placement time set includes at least one order placement time point, and the target
- the order split time set is obtained by performing split order matching processing on historical orders in the target area.
- the server divides the current city into multiple regions in advance, and performs order matching processing on historical orders in each region to obtain the order time set corresponding to each region; then, it will correspond to each region respectively
- the collection of each order time is stored in the database.
- the set of order placement times corresponding to the area that is, the set of order placement times within a preset time period of the area; for example, the set of order placement times within 24 hours of the area.
- each order placement time set includes each order placement time point in the region within the preset time period.
- these time points of the order include: 1 o'clock, 2 o'clock, 3 o'clock, 4 o'clock, 5 o'clock, etc.
- the minimum order placement time interval is preset in the server, and the interval between any two adjacent order placement time points in each order placement time set is greater than or equal to the minimum order placement time interval.
- the server searches the database for the target order placement time set corresponding to the target area based on the correspondence between each area and the order placement time set.
- S203 Perform order matching processing on the pending order based on each order distribution time point in the target order distribution time set.
- the order splitting method is as follows: for each splitting time point in the target splitting time set, the previous splitting time point of the splitting time point is selected as the first initial splitting time point, and obtaining Orders to be processed in the time period from the first initial order splitting time point to the order splitting time point; at the order splitting time point, the acquired pending orders are split and matched to obtain a split order matching result.
- the first split time point in the target split time set is 1 o'clock
- the previous split time point of the split time point (that is, the first initial split time point) is 0 o'clock
- 0 points are obtained
- the starting position is in the pending order in the target area (that is, the pending order during the period from 0 o'clock to 1 o'clock is obtained)
- the server packs and matches the obtained pending order, That is, the service provider that matches the acquired pending order is selected.
- a service provider in the carpool service, can be assigned one pending order or multiple pending orders.
- the split order matching result corresponding to the pending order is sent to the service requesting end that sends the pending order.
- the above-mentioned order splitting matching process and the process of sending the splitting matching result to the service requesting end are the order splitting processing.
- the server sends the information of the service provider that matches the pending order to the service requester that sent the pending order, and other services that match the aforementioned service provider Information on the requesting side.
- the server sends to the service provider one or more pending orders that match the service provider.
- An order processing method provided in an embodiment of the present application obtains a target order distribution time set matching the target area by performing order matching processing on historical orders in a target area. For pending orders from the target area, the pending orders from the target area are split by matching the target split time set of the target area, which can split and match more matching pending orders. Thereby improving the efficiency of the platform's order splitting.
- the obtaining the pending order sent by the service requesting terminal in the target area includes:
- S301 Receive orders to be processed respectively sent by service requesting terminals in each area, where the orders to be processed include starting location information.
- S302 Acquire the pending order sent by the service requester in the target area according to the geographic location range of the target area and the starting position information of each pending order.
- the area is taken as the target area, and based on the received starting position information of each pending order, each pending order located in the target area is obtained to obtain the current city
- the pending orders from the region are split and matched, which improves the split efficiency of the platform .
- the target order split time set is determined by the following methods, including:
- S401 Acquire an end order time point of the target area in a preset time period; wherein the end order time point is the last time point in the preset time period, and the end order time point The point corresponds to at least one split order at the end of the split time point.
- the last time point of the target area in the preset time period is selected as the time point for ending the order placement.
- the ending time of order splitting can correspond to a single splitting, that is, the ordering will be split at the ending splitting time point; the ending splitting time point can also correspond to multiple splitting of orders, including: splitting the order at the ending splitting time point , And, in the preset time period, except the start time point of the order placement (ie the first time point in the preset time period) and the end time point of the order placement in the preset time period.
- the preset time period is from 0 o'clock to 24 o'clock, and 24 o'clock is selected as the time point for ending the order placement. Taking 1 hour as the minimum order placement interval as an example, the order is divided at least once at 24 o'clock within the aforementioned preset time period.
- the time point for ending the order splitting corresponds to at least one order splitting time set for each order splitting times.
- the number of order time points included in each order time set is the same as the number of orders, and the order time points in different order time sets are different.
- 24 o'clock corresponds to one time order and recorded as (24, 1)
- 24 o'clock corresponds to two time orders as (24, 2), and so on.
- (24, 1) corresponds to an order-dividing time set.
- the number of time points in the order-dividing time set is the same as the current number of order-dividing times, which is 1; (24, 2) corresponds to multiple time-dividing time sets, And the number of order time points in each order time set is the same as the current order times, which is 2; (24, 3) corresponds to multiple order time sets, and the number of time points in each order time set
- the number of single time points is the same as the current number of orders, which is 3; and so on; (24,23) corresponds to multiple order time sets, and the number of order time points in each order time set It is the same as the current number of orders, which is 23; (24, 24) corresponds to an order time set, and the number of order time points in the order time set is the same as the current order number, which is 24.
- the first order splitting time set corresponding to the maximum order splitting efficiency is selected from the above various order splitting time sets, and Further determine the order splitting efficiency of the first order splitting time set.
- (24, 1) corresponds to the order time set 1 [24]
- the order time set 1 [24] is the first order time set corresponding to the order at 24 o’clock, and the order will be divided at 24 o’clock.
- the order efficiency is taken as the order dividing efficiency of the first order dividing time set.
- (24, 2) corresponds to the order split time set 1 [1, 24], the split time set 2 [2, 24], the split time set 3 [3, 24]... the split time set 23 [23 , 24], select the first order splitting time set corresponding to the maximum order splitting efficiency from the above sorting sets 1-23, and add the sum of the order splitting efficiency at each time point in the first order splitting time set, As the order dividing efficiency of the first order dividing time set.
- a target first order splitting time set corresponding to the maximum order splitting efficiency is selected from each first order splitting time set as the target splitting time set. Single time collection.
- (24, 1) corresponds to the sort efficiency of the first sort time set
- (24, 2) corresponds to the first sort time set
- (24, 3) corresponds to Sorting efficiency of the first sorting time set «(24, 24)
- the one-minute order time set is used as the target order time set.
- the first order dividing time set corresponding to the maximum order dividing efficiency is determined from each order dividing time set corresponding to the number of order dividing times, include:
- S501 Select each order placement time point before the time point for ending order placement as a candidate order placement time point.
- a dynamic programming algorithm is used to determine the first order dividing time set corresponding to the maximum order dividing efficiency under each order dividing time from each order dividing time set corresponding to each order dividing frequency.
- each order placement time set corresponding to (24, 2) selects the first order placement time set corresponding to the maximum order placement efficiency from each order placement time set corresponding to (24, 2), and set 23 o'clock, 22 o'clock, 21 o'clock, 20 o'clock, 19 o'clock, and 1 o'clock as 1 o'clock.
- S502 For each candidate sorting time point, determine the second sorting time set corresponding to the maximum sorting efficiency at the target sorting times for the candidate sorting time point and the sorting efficiency of the second sorting time set; Wherein, the target number of order splitting is the number of times the number of splitting orders minus one.
- (23, 1) corresponds to an order placement time set, that is, the second order placement time set corresponding to 23 o'clock in the candidate order placement time point; in the second order placement time set, the order is divided at 23 o'clock, and 23
- the order sorting efficiency corresponding to the point order is taken as the order sorting efficiency of the second order sorting time set.
- the original problem of the first order placement time set corresponding to the maximum order placement efficiency will be selected from each order placement time set corresponding to (24, 3), and the original problem from (23, 2), (22 , 2), (21, 2) ... (2, 2), select the regression problem of the time set of order placement corresponding to the maximum order placement efficiency.
- (23, 2) corresponds to multiple order time sets (taking 1 hour as an order interval as an example, that is, 22 order time sets), and the server selects from (23, 2) corresponding to multiple order time sets
- the second order splitting time set corresponding to the maximum order splitting efficiency, and the order splitting efficiency of the second order splitting time set is determined.
- (22, 2) corresponds to multiple order time sets (take 1 hour as an order interval as an example, that is, 21 order time sets), and the server corresponds to multiple order time sets from (22, 2) Select the second sorting time set corresponding to the maximum sorting efficiency, and determine the sorting efficiency of the second sorting time set.
- the server corresponds to the order splitting efficiency of the second order splitting time set corresponding to (23, 2), the order splitting efficiency of the second order splitting time set corresponding to (22, 2), and (21, 2)
- the second order splitting time set of the second order splitting efficiency ... (2, 2)
- the corresponding second splitting time set of the order splitting efficiency is compared, the largest order splitting efficiency among them is selected, and the maximum order splitting efficiency corresponds to The second set of split time is used as the target second set of split time.
- each time point in the target second order placement time set and the ending time point of the order placement are combined to obtain the first order placement time set.
- determining the order splitting efficiency of the first order splitting time set includes:
- 24 o'clock is used as the ending time point for order splitting, and 1 hour is used as an example for the order splitting interval, and 23 o'clock is selected as the second initial order splitting time point.
- S602 Based on the order information of the historical orders in the target area, obtain a first historical order in a time period from the second initial order placement time point to the end order placement time point.
- the server obtains all historical orders in the target area from 23:00 to 24:00, and determines the first historical order corresponding to 24 o’clock based on the preset cancellation rate of the historical orders and all the above historical orders .
- S603 Perform order splitting matching processing on the first historical order at the time point when the order splitting ends, and determine the order splitting efficiency at the time point when the order splitting ends.
- the acquired first historical order is split at the time point (for example, 24 o'clock) when the split is ended.
- the specific order splitting process is as follows: the server packs and matches the first historical order, selects the service provider that matches the first historical order, and based on the resource supply information and the resource supply information corresponding to the service requesting end that sent the first historical order The resource consumption information corresponding to the service provider determines the order splitting efficiency at the time when the order splitting ends.
- S604 Determine the order splitting efficiency of the first order splitting time set according to the splitting efficiency of the splitting order at the time when the splitting is ended and the splitting efficiency corresponding to the target second splitting time set.
- the order splitting efficiency corresponding to the target second order splitting time set is obtained, and the sum of the order splitting efficiency corresponding to the target second order splitting time set and the order splitting efficiency at the end of the order splitting time point is calculated, and This sum is used as the order dividing efficiency of the first order dividing time set.
- the determination of the second order placing time set corresponding to the maximum order placing efficiency at the target order placing time point of the candidate order placing time point includes:
- the candidate sorting time point is selected as the new end sorting time point, and each sorting time point before the end sorting time point is selected as the candidate sorting time point and Subsequent steps, until the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times.
- the dynamic programming algorithm is still used to determine the second order ordering time set corresponding to the maximum order ordering efficiency at the target order ordering times and the ordering efficiency of the second ordering time set for the candidate order ordering time point.
- the candidate order placement time point For each candidate order placement time point, if the candidate order placement time point corresponds to multiple second order placement time sets under the target order placement times, the candidate order placement time point is selected as the new end order placement time point , Continue to perform the steps from step 501 to step 504 until the current candidate order placement time point corresponds to a second order placement time set under the target order placement times.
- the original problem of the first order placement time set corresponding to the maximum order placement efficiency will be selected from each order placement time set corresponding to (24, 3), and the original problem will be returned from (23, 2), (22, 2), ( 21, 2)&(2, 2), select the regression problem of the time set of order placement corresponding to the maximum order placement efficiency.
- the regression problem such as (23, 2), it also corresponds to multiple set of order time (taking 1 hour as the order interval as an example, that is, 22 sets of order time), from (23, 2), 2)
- the problem of selecting the second ordering time set corresponding to the maximum ordering efficiency from the corresponding ordering time sets can still be returned to (22, 1), (22, 1), (20, 1)... In (1, 1), the problem of selecting the order splitting time set corresponding to the maximum order splitting efficiency until the current candidate order splitting time point corresponds to a second order splitting time set under the corresponding target order splitting times.
- the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times
- the candidate order placement time point cannot be selected as the new end order placement time point.
- order splitting matching processing is performed on the historical orders to obtain the order splitting efficiency of the second order splitting time set.
- the order split matching processing is performed on the historical order to obtain the order split efficiency of the second order split time set, including:
- S701 For any order placement time point in the second order placement time set, select the order placement time point before the order placement time point as the third initial order placement time point.
- the candidate order time point is 22 o'clock, corresponding to a second order time set, namely (22 ,1) Corresponds to a second set of order time [22 o'clock].
- the server selects 21 o'clock as the third initial order time point corresponding to 22 o'clock.
- S702 Based on the order information of the historical orders in the target area, obtain a second historical order in a time period from the third initial order placement time point to the order placement time point.
- the server obtains all historical orders in the target area during the period from 21:00 to 22:00, and determines the second historical order corresponding to 22:00 based on the preset cancellation rate of the historical order and all the above historical orders. .
- S703 Perform order splitting matching processing on the second historical order at the order splitting time point, and obtain the order splitting efficiency corresponding to the order splitting at the order splitting time point.
- the acquired second historical order is split at the time point when the split is ended (for example, at 22:00).
- the specific order splitting process is as follows: the server selects the service provider that matches the second historical order; based on the resource supply information corresponding to the service requesting terminal sending the second historical order and the resource consumption information corresponding to the service provider, it is determined where Describes the order splitting efficiency at the end of the splitting time.
- the order matching processing is performed on the first historical order at the time when the order is ended to determine the time when the order is ended.
- the sorting efficiency of point-of-sale orders includes:
- S802 Based on the resource supply information corresponding to the service requesting end that sent the first historical order and the resource consumption information corresponding to the service provider, determining the order splitting efficiency at the time when the order splitting ends.
- the server packages and matches the first historical order for the first historical order corresponding to any point in time when the order is split, that is, selects the service provider that matches the first historical order, and obtains and sends
- the resource supply information of the service requesting side of the first historical order such as payable fees
- the resource consumption information of the service provider matching the first historical order such as the charging fees
- the method also includes:
- the server obtains multiple first order time sets corresponding to the target area from January 1, 2018 to May 1, 2019, from 0:00 to 24:00.
- S902 Perform fitting processing on a plurality of the first order placement time sets to obtain a target order placement time set corresponding to the target area.
- the multiple first order placement time sets are subjected to fitting processing to obtain the target order placement time set corresponding to the target area.
- the order processing method, device, electronic equipment, and storage medium provided in the embodiments of the present application obtain a target order distribution time set matching the target area by performing order matching processing on historical orders in a target area. For pending orders from the target area, the pending orders from the target area are split by matching the target split time set of the target area, thereby improving the efficiency of the platform splitting.
- FIG. 10 is a block diagram showing an order processing device of some embodiments of the present application, and the function implemented by the order processing device corresponds to the steps executed by the above method.
- This device can be understood as the aforementioned server or the processor of the server, and can also be understood as a component independent of the aforementioned server or processor that implements the functions of the application under the control of the server.
- the order processing device Can include:
- the first obtaining module 1001 is configured to obtain pending orders sent by the service requester in the target area;
- the searching module 1002 is configured to search for a target order sorting time set corresponding to the target area according to the correspondence between each area and the order sorting time set; wherein, the target order sorting time set includes at least one order sorting time point, And the target order split time set is obtained by performing split matching processing on historical orders in the target area;
- the order matching module 1003 is configured to perform order matching processing on the pending order based on each order time point in the target order time set;
- the sending module 1004 is used to send the matching result of the split order obtained by matching the split order to the corresponding service requester.
- the first obtaining module 1001 is specifically configured to:
- the pending order sent by the service requester in the target area is acquired.
- the order matching module 1003 is specifically used for:
- For each split time point in the target split time set select the previous split time point of the split time point as the first initial split time point, and obtain the first initial split time point Orders to be processed within the time period up to the time point of the order split;
- the obtained pending order is split and matched, and the split matching result is obtained.
- the device further includes:
- the second acquiring module is used to acquire the ending time point of order placement in the preset time period of the target area; wherein the ending time point of order placement is the last time point in the preset time period, and The time point for ending the order splitting corresponds to at least one order splitting at the time point for ending the order splitting;
- the determining module is used for determining the first order dividing time set corresponding to the maximum order dividing efficiency and all the order dividing time sets corresponding to the order dividing times for each order dividing time corresponding to the ending time point of order dividing. Describe the efficiency of the order splitting of the first order splitting time set; where the number of splitting time points included in each splitting time set is the same as the number of splitting orders, and the splitting time points in different order splitting time sets different;
- the selection module is used to select the target first order sorting time set corresponding to the maximum order sorting efficiency from each first order sorting time set based on the order sorting efficiency of the first order sorting time set corresponding to each number of order sorting times, as the all The set of target split time.
- the determining module is specifically configured to:
- the target number of order splits is the number of times the number of splits minus one;
- the determining module is specifically configured to:
- the determining module is specifically configured to:
- the candidate sorting time point is selected as the new end sorting time point, and each sorting time point before the end sorting time point is selected as the candidate sorting time point and Subsequent steps, until the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times;
- the candidate order placement time point corresponds to a second order placement time set under the corresponding target order placement times, based on each time point in the second order placement time set and historical orders in the target area Order information, performing order splitting matching processing on the historical orders to obtain the order splitting efficiency of the second order splitting time set.
- the determining module is specifically configured to:
- the sum of the order splitting efficiency corresponding to each order splitting time point in the second order splitting time set is determined as the order splitting efficiency of the second order splitting time set.
- the determining module is specifically configured to:
- the order splitting efficiency at the point of ending the order splitting is determined.
- the device further includes:
- the third acquiring module is configured to acquire a plurality of first split time sets corresponding to the target area
- the fitting module is used to perform fitting processing on a plurality of the first sorting time sets to obtain a target sorting time set corresponding to the target area.
- An order processing device provided in an embodiment of the present application obtains a target order distribution time set matching the target area by performing order matching processing on historical orders in a target area. For pending orders from the target area, the pending orders from the target area are split by matching the target split time set of the target area, thereby improving the efficiency of the platform splitting.
- an electronic device 1100 provided by an embodiment of the present application includes a processor 1101, a memory 1102, and a bus.
- the memory 1102 stores machine-readable instructions executable by the processor 1101.
- the processor 1101 and the memory 1102 communicate via a bus, and the processor 1101 executes the machine-readable instructions to perform the steps of the above-mentioned order processing method.
- the aforementioned processor 1101 and the memory 1102 are general-purpose memories and processors, which are not specifically limited here.
- the processor 1101 runs the computer program stored in the memory 1102, the aforementioned order processing method can be executed.
- embodiments of the present application also provide a computer-readable storage medium having a computer program stored on the computer-readable storage medium, and when the computer program is executed by a processor, the above-mentioned order processing method is executed. step.
- the modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
- each unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
- the function is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a nonvolatile computer readable storage medium executable by a processor.
- a computer device which may be a personal computer, a server, or a network device, etc.
- the aforementioned storage media include: U disk, mobile hard disk, ROM, RAM, magnetic disk or optical disk and other media that can store program codes.
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
本申请提供了一种订单处理方法、装置、电子设备及存储介质,涉及数据处理领域,所述方法包括:获取目标区域内的服务请求端发送的待处理订单;根据各个区域与分单时间集合的对应关系,查找与所述目标区域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的;基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理;将分单匹配得到的分单匹配结果发送给相应的服务请求端。本申请中,通过匹配目标区域的分单策略,对来自该目标区域的待处理订单进行分单处理,提高了平台的分单效率。
Description
本申请涉及订单处理技术领域,具体而言,涉及一种订单处理方法、装置、电子设备及存储介质。
随着互联网的快速发展,越来越多的互联网产品被人们使用,比如网约车平台。网约车平台能够为乘客提供多种出行服务,包括:快车、专车、出租车、单车、拼车等。
针对拼车服务,现有技术提供的拼车订单的分单方法如下:平台预先确定分单间隔时间,针对任一区域,平台每隔上述分单间隔时间对来自该区域的拼车订单进行一次分单处理。但是,采用上述分单方式,平台的分单效率较低。
发明内容
有鉴于此,本申请的目的在于提供一种订单处理方法、装置、电子设备及存储介质,通过匹配目标区域的分单策略,对来自该目标区域的待处理订单进行分单处理,提高了平台的分单效率。
第一方面,本申请实施例提供了一种订单处理方法,包括:
获取目标区域内的服务请求端发送的待处理订单;
根据各个区域与分单时间集合的对应关系,查找与所述目标区域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的;
基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理;
将分单匹配得到的分单匹配结果发送给相应的服务请求端。
结合第一方面,本申请实施例提供了第一方面的第一种可能的实施方式,其中,所述获取目标区域内的服务请求端发送的待处理订单,包括:
接收各个区域内的服务请求端分别发送的待处理订单,所述待处理订单中包括起始位置信息;
根据所述目标区域的地理位置范围以及每一个所述待处理订单的起始位置信息,获取所述目标区域内的服务请求端发送的待处理订单。
结合第一方面的第一种可能的实施方式,本申请实施例提供了第一方面的第二种可能的实施方式,其中,所述基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理,包括:
针对所述目标分单时间集合中的每一分单时间点,选取该分单时间点的前一个分单时间点作为第一初始分单时间点,并获取所述第一初始分单时间点到该分单时间点的时间段内的待处理订单;
在该分单时间点对获取的待处理订单进行分单匹配处理,得到分单匹配结果。
结合第一方面,本申请实施例提供了第一方面的第三种可能的实施方式,其中,通过以下方式确定所述目标分单时间集合,包括:
获取所述目标区域在预设时间段中的结束分单时间点;其中,所述结束分单时间点为所述预设时间段中的最后一个时间点,且所述结束分单时间点对应至少在该结束分单时间点的一次分单;
针对所述结束分单时间点对应的每一分单次数,从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合以及所述第一分单时间集合的分单效率;其中,每个分单时间集合中包括的分单时间点的个数与该分单次数相同,且不同的分单时间集合中的分单时间点不同;
基于各个分单次数分别对应的第一分单时间集合的分单效率,从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合,作为所述目标分单时间集合。
结合第一方面的第三种可能的实施方式,本申请实施例提供了第一方面的第四种可能的实施方式,其中,所述从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合,包括:
选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点;
针对每一候选分单时间点,确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合以及所述第二分单时间集合的分单效率;其中,所述目标分单次数为该分单次数减一的次数;
基于各个候选分单时间点在目标分单次数下分别对应的第二分单时间集合的分单效率,从各个所述第二分单时间集合中,选取对应最大分单效率的目标第二分单时间集合;
将所述结束分单时间点和所述目标第二分单时间集合中的各个分单时间点进行组合,得到所述第一分单时间集合。
结合第一方面的第四种可能的实施方式,本申请实施例提供了第一方面的第五种可能的实施方式,其中,确定所述第一分单时间集合的分单效率,包括:
选取所述结束分单时间点的前一个分单时间点作为第二初始分单时间点;
基于所述目标区域中历史订单的订单信息,获取所述第二初始分单时间点到所述结束分单时间点的时间段内的第一历史订单;
在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率;
根据所述结束分单时间点分单的分单效率和所述目标第二分单时间集合对应的分单效率,确定所述第一分单时间集合的分单效率。
结合第一方面的第四种可能的实施方式,本申请实施例提供了第一方面的第六种可能的实施方式,其中,所述确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合,包括:
针对每一所述候选分单时间点,选取该候选分单时间点作为新的结束分单时间点,返回选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点及后续步骤,直至该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合;
其中,当该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合时,基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率。
结合第一方面的第六种可能的实施方式,本申请实施例提供了第一方面的第七种可能的实施方式,其中,所述基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率,包括:
针对所述第二分单时间集合中的任一分单时间点,选取该分单时间点的前一个分单时间点作为第三初始分单时间点;
基于所述目标区域中历史订单的订单信息,获取所述第三初始分单时间点到该分单时间点的时间段内的第二历史订单;
在该分单时间点对所述第二历史订单进行分单匹配处理,获取该分单时间点分单对应的分单效率;
将所述第二分单时间集合中的各个分单时间点分单对应的分单效率的和值,确定为所述第二分单时间集合的分单效率。
结合第一方面的第五种可能的实施方式,本申请实施例提供了第一方面的第八种可能的实施方式,其中,所述在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率,包括:
在所述结束分单时间点,选取与所述第一历史订单相匹配的服务提供端;
基于发送所述第一历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
结合第一方面的第三种可能的实施方式,本申请实施例提供了第一方面的第九种可能的实施方式,其中,所述从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合之后,所述方法还包括:
获取所述目标区域对应的多个第一分单时间集合;
对多个所述第一分单时间集合进行拟合处理,得到所述目标区域对应的目标分单时间集合。
第二方面,本申请实施例提供了一种订单处理装置,包括:
第一获取模块,用于获取目标区域内的服务请求端发送的待处理订单;
查找模块,用于根据各个区域与分单时间集合的对应关系,查找与所述目标区域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的;
分单匹配模块,用于基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理;
发送模块,用于将分单匹配得到的分单匹配结果发送给相应的服务请求端。
结合第二方面,本申请实施例提供了第二方面的第一种可能的实施方式,其中,所述第一获取模块,具体用于:
接收各个区域内的服务请求端分别发送的待处理订单,所述待处理订单中包括起始位置信息;
根据所述目标区域的地理位置范围以及每一个所述待处理订单的起始位置信息,获取所述目标区域内的服务请求端发送的待处理订单。
结合第二方面的第一种可能的实施方式,本申请实施例提供了第二方面的第二种可能的实施方式,其中,所述分单匹配模块,具体用于:
针对所述目标分单时间集合中的每一分单时间点,选取该分单时间点的前一个分单时间点作为第一初始分单时间点,并获取所述第一初始分单时间点到该分单时间点的时间段内的待处理订单;
在该分单时间点对获取的待处理订单进行分单匹配处理,得到分单匹配结果。
结合第二方面,本申请实施例提供了第二方面的第三种可能的实施方式,其中,所述装置还包括:
第二获取模块,用于获取所述目标区域在预设时间段中的结束分单时间点;其中,所述结束分单时间点为所述预设时间段中的最后一个时间点,且所述结束分单时间点对应至少在该结束分单时间点的一次分单;
确定模块,用于针对所述结束分单时间点对应的每一分单次数,从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合以及所述第一分单时间集合的分单效率;其中,每个分单时间集合中包括的分单时间点的个数与该分单次数相同,且不同的分单时间集合中的分单时间点不同;
选取模块,用于基于各个分单次数分别对应的第一分单时间集合的分单效率,从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合,作为所述目标分单时间集合。
结合第二方面的第三种可能的实施方式,本申请实施例提供了第二方面的第四种可能的实施方式,其中,所述确定模块,具体用于:
选取所述结束分单时间点之前的各个分单时间点作为候选分单时间 点;
针对每一候选分单时间点,确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合以及所述第二分单时间集合的分单效率;其中,所述目标分单次数为该分单次数减一的次数;
基于各个候选分单时间点在目标分单次数下分别对应的第二分单时间集合的分单效率,从各个所述第二分单时间集合中,选取对应最大分单效率的目标第二分单时间集合;
将所述结束分单时间点和所述目标第二分单时间集合中的各个分单时间点进行组合,得到所述第一分单时间集合。
结合第二方面的第四种可能的实施方式,本申请实施例提供了第二方面的第五种可能的实施方式,其中,所述确定模块,具体用于:
选取所述结束分单时间点的前一个分单时间点作为第二初始分单时间点;
基于所述目标区域中历史订单的订单信息,获取所述第二初始分单时间点到所述结束分单时间点的时间段内的第一历史订单;
在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率;
根据所述结束分单时间点分单的分单效率和所述目标第二分单时间集合对应的分单效率,确定所述第一分单时间集合的分单效率。
结合第二方面的第四种可能的实施方式,本申请实施例提供了第二方面的第六种可能的实施方式,其中,所述确定模块,具体用于:
针对每一所述候选分单时间点,选取该候选分单时间点作为新的结束分单时间点,返回选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点及后续步骤,直至该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合;
其中,当该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合时,基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率。
结合第二方面的第六种可能的实施方式,本申请实施例提供了第二方面的第七种可能的实施方式,其中,所述确定模块,具体用于:
针对所述第二分单时间集合中的任一分单时间点,选取该分单时间点的前一个分单时间点作为第三初始分单时间点;
基于所述目标区域中历史订单的订单信息,获取所述第三初始分单时间点到该分单时间点的时间段内的第二历史订单;
在该分单时间点对所述第二历史订单进行分单匹配处理,获取该分单时间点分单对应的分单效率;
将所述第二分单时间集合中的各个分单时间点分单对应的分单效率的和值,确定为所述第二分单时间集合的分单效率。
结合第二方面的第五种可能的实施方式,本申请实施例提供了第二方面的第八种可能的实施方式,其中,所述确定模块,具体用于:
在所述结束分单时间点,选取与所述第一历史订单相匹配的服务提供端;
基于发送所述第一历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
结合第二方面的第三种可能的实施方式,本申请实施例提供了第二方面的第九种可能的实施方式,其中,所述装置还包括:
第三获取模块,用于获取所述目标区域对应的多个第一分单时间集合;
拟合处模块,用于对多个所述第一分单时间集合进行拟合处理,得到所述目标区域对应的目标分单时间集合。
第三方面,本申请实施例还提供了一种电子设备,包括:处理器、存储介质和总线,所述存储介质存储有所述处理器可执行的机器可读指令,当电子设备运行时,所述处理器与所述存储介质之间通过总线通信,所述处理器执行所述机器可读指令,以执行如第一方面任一项所述订单处理方法的步骤。
第四方面,本申请实施例还提供了一种计算机可读存储介质,所述计算机可读存储介质上存储有计算机程序,所述计算机程序被处理器运行时执行如第一方面任一项所述订单处理方法的步骤。
本申请实施例提供的一种订单处理方法、装置、电子设备及存储介质,通过对目标区域中历史订单进行分单匹配处理,得到匹配该目标区域的目标分单时间集合。针对来自目标区域的待处理订单,通过匹配该目标区域 的目标分单时间集合对来自该目标区域的待处理订单进行分单处理,从而提高了平台的分单效率。
为了更清楚地说明本申请实施例的技术方案,下面将对实施例中所需要使用的附图作简单地介绍,应当理解,以下附图仅示出了本申请的某些实施例,因此不应被看作是对范围的限定,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他相关的附图。
图1示出了本申请实施例提供的一种服务系统的架构示意图;
图2示出了本申请实施例提供的一种订单处理方法的流程图;
图3示出了本申请实施例提供的另一种订单处理方法的流程图;
图4示出了本申请实施例提供的另一种订单处理方法的流程图;
图5示出了本申请实施例提供的另一种订单处理方法的流程图;
图6示出了本申请实施例提供的另一种订单处理方法的流程图;
图7示出了本申请实施例提供的另一种订单处理方法的流程图;
图8示出了本申请实施例提供的另一种订单处理方法的流程图;
图9示出了本申请实施例提供的另一种订单处理方法的流程图;
图10示出了本申请实施例提供的一种订单处理装置的结构示意图;
图11示出了本申请实施例提供的电子设备的结构示意图。
为使本申请实施例的目的、技术方案和优点更加清楚,下面将结合本申请实施例中的附图,对本申请实施例中的技术方案进行清楚、完整地描述,应当理解,本申请中附图仅起到说明和描述的目的,并不用于限定本申请的保护范围。另外,应当理解,示意性的附图并未按实物比例绘制。本申请中使用的流程图示出了根据本申请的一些实施例实现的操作。应该理解,流程图的操作可以不按顺序实现,没有逻辑的上下文关系的步骤可以反转顺序或者同时实施。此外,本领域技术人员在本申请内容的指引下,可以向流程图添加一个或多个其他操作,也可以从流程图中移除一个或多个操作。
另外,所描述的实施例仅仅是本申请一部分实施例,而不是全部的实 施例。通常在此处附图中描述和示出的本申请实施例的组件可以以各种不同的配置来布置和设计。因此,以下对在附图中提供的本申请的实施例的详细描述并非旨在限制要求保护的本申请的范围,而是仅仅表示本申请的选定实施例。基于本申请的实施例,本领域技术人员在没有做出创造性劳动的前提下所获得的所有其他实施例,都属于本申请保护的范围。
为了使得本领域技术人员能够使用本申请内容,结合特定应用场景“拼车订单处理”,给出以下实施方式。对于本领域技术人员来说,在不脱离本申请的精神和范围的情况下,可以将这里定义的一般原理应用于其他实施例和应用场景。虽然本申请主要围绕拼车订单处理进行描述,但是应该理解,这仅是一个示例性实施例。
需要说明的是,本申请实施例中将会用到术语“包括”,用于指出其后所声明的特征的存在,但并不排除增加其它的特征。
本申请实施例中的术语“用户”、“乘客”、“请求方”、“服务人员”、“服务请求方”、“服务请求端”、“服务请求方终端”、“乘客终端”、“乘客端”、“客户”可互换使用,以指代可以请求或订购服务的个人、实体或工具。本申请实施例中的术语“司机”、“服务提供方”、“服务提供端”、“司机端”和“司机终端”可互换使用,以指代可以提供服务的个人、实体或工具。
图1是本申请一些实施例的服务系统100的框图。例如,服务系统100可以是用于诸如出租车、代驾服务、快车、拼车、公共汽车服务、驾驶员租赁、或班车服务之类的运输服务、或其任意组合的在线运输服务平台。服务系统100可以包括服务器110、网络120、服务请求端130、服务提供端140和数据库150中的一种或多种。
在一些实施例中,服务器110可以是单个服务器,也可以是服务器组。服务器组可以是集中式的,也可以是分布式的(例如,服务器110可以是分布式系统)。在一些实施例中,服务器110相对于终端,可以是本地的、也可以是远程的。例如,服务器110可以经由网络120访问存储在服务请求端130、服务提供端140、或数据库150、或其任意组合中的信息和/或数据。作为另一示例,服务器110可以直接连接到服务请求端130、服务提供端140和数据库150中至少一个,以访问存储的信息和/或数据。在一些实施例中,服务器110可以在云平台上实现;仅作为示例,云平台可以包括私有云、公有云、混合云、社区云(community cloud)、分布式云、跨云(inter-cloud)、多云(multi-cloud)等,或者它们的任意组合。
在一些实施例中,服务器110可以包括处理器。处理器可以处理与服务请求有关的信息和/或数据,以执行本申请中描述的一个或多个功能。例如,处理器可以基于从服务请求端130发送的服务请求中的当前位置信息来确定上述当前位置信息所属的目标区域内的各个上车点。在一些实施例中,处理器可以包括一个或多个处理核(例如,单核处理器(S)或多核处理器(S))。仅作为举例,处理器可以包括中央处理单元(Central Processing Unit,CPU)、专用集成电路(Application Specific Integrated Circuit,ASIC)、专用指令集处理器(Application Specific Instruction-set Processor,ASIP)、图形处理单元(Graphics Processing Unit,GPU)、物理处理单元(Physics Processing Unit,PPU)、数字信号处理器(Digital Signal Processor,DSP)、现场可编程门阵列(Field Programmable Gate Array,FPGA)、可编程逻辑器件(Programmable Logic Device,PLD)、控制器、微控制器单元、简化指令集计算机(Reduced Instruction Set Computing,RISC)、或微处理器等,或其任意组合。
网络120可以用于信息和/或数据的交换。在一些实施例中,服务系统100中的一个或多个组件(例如,服务器110,服务请求端130,服务提供端140和数据库150)可以向其他组件发送信息和/或数据。例如,服务器110可以经由网络120从服务请求端130获取服务请求。在一些实施例中,网络120可以是任何类型的有线或者无线网络,或者是他们的结合。仅作为示例,网络130可以包括有线网络、无线网络、光纤网络、远程通信网络、内联网、因特网、局域网(Local Area Network,LAN)、广域网(Wide Area Network,WAN)、无线局域网(Wireless Local Area Networks,WLAN)、城域网(Metropolitan Area Network,MAN)、广域网(Wide Area Network,WAN)、公共电话交换网(Public Switched Telephone Network,PSTN)、蓝牙网络、ZigBee网络、或近场通信(Near Field Communication,NFC)网络等,或其任意组合。在一些实施例中,网络120可以包括一个或多个网络接入点。例如,网络120可以包括有线或无线网络接入点,例如基站和/或网络交换节点,服务系统100的一个或多个组件可以通过该接入点连接到网络120以交换数据和/或信息。
在一些实施例中,服务请求端130可以包括移动设备、平板计算机、膝上型计算机、或机动车辆中的内置设备等,或其任意组合。在一些实施例中,移动设备可以包括可穿戴设备、智能移动设备、虚拟现实设备、或增强现实设备等,或其任意组合。在一些实施例中,服务请求端130可以是具有用于定位功能的设备。
数据库150可以存储数据和/或指令。在一些实施例中,数据库150可以存储从服务请求端130和/或服务提供端140获得的数据。在一些实施例中,数据库150可以存储在本申请实施例中描述的示例性方法的数据和/或指令。在一些实施例中,数据库150可以包括大容量存储器、可移动存储器、易失性读写存储器、或只读存储器(Read-Only Memory,ROM)等,或其任意组合。作为举例,大容量存储器可以包括磁盘、光盘、固态驱动器等;可移动存储器可包括闪存驱动器、软盘、光盘、存储卡、zip磁盘、磁带等;易失性读写存储器可以包括随机存取存储器(Random Access Memory,RAM);RAM可以包括动态RAM(Dynamic Random Access Memory,DRAM),双倍数据速率同步动态RAM(Double Date-Rate Synchronous RAM,DDR SDRAM);静态RAM(Static Random-Access Memory,SRAM),晶闸管RAM(Thyristor-Based Random Access Memory,T-RAM)和零电容器RAM(Zero-RAM)等。作为举例,ROM可以包括掩模ROM(Mask Read-Only Memory,MROM)、可编程ROM(Programmable Read-Only Memory,PROM)、可擦除可编程ROM(Programmable Erasable Read-only Memory,PEROM)、电可擦除可编程ROM(Electrically Erasable Programmable read only memory,EEPROM)、光盘ROM(CD-ROM)、以及数字通用磁盘ROM等。在一些实施例中,数据库150可以在云平台上实现。仅作为示例,云平台可以包括私有云、公有云、混合云、社区云、分布式云、跨云、多云或者其它类似的等,或其任意组合。
在一些实施例中,数据库150可以连接到网络120以与服务系统100中的一个或多个组件(例如,服务器110,服务请求端130、服务提供端140等)通信。服务系统100中的一个或多个组件可以经由网络120访问存储在数据库150中的数据或指令。在一些实施例中,数据库150可以直接连接到服务系统100中的一个或多个组件,或者,数据库150也可以是服务器110的一部分。
基于上述服务系统100,本申请实施例提供了一种订单处理方法,所述订单处理方法可以应用于服务器110,如图2所示,所述方法包括以下步骤:
S201、获取目标区域内的服务请求端发送的待处理订单。
本申请实施例中,待处理订单可以是待处理的拼车订单。
作为一种实施方式,获取区域A中的多个不同的服务请求端分别发送的待处理拼车订单,作为待处理订单。
S202、根据各个区域与分单时间集合的对应关系,查找与所述目标区 域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的。
本申请实施例中,服务器预先将当前城市划分为多个区域,并对各个区域的历史订单进行分单匹配处理,得到与每个区域对应的分单时间集合;然后,将与各个区域分别对应的各个分单时间集合存储到数据库中。
针对任一区域,该区域对应的分单时间集合,即该区域在预设时间段内的分单时间集合;比如,该区域在24小时内的分单时间集合。
其中,每个分单时间集合中均包括该区域在预设时间段内的各个分单时间点。比如,该区域在24小时内的各个分单时间点,这些分单时间点包括:1点、2点、3点、4点、5点等。
需要说明的是,服务器中预先设置最小分单时间间隔,每个分单时间集合中任意两个相邻的分单时间点之间的间隔均大于或者等于最小分单时间间隔。
本申请实施例中,服务器基于各个区域与分单时间集合的对应关系,从数据库中查找与目标区域对应的目标分单时间集合。
S203、基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理。
作为一种实施方式,分单方法如下:针对目标分单时间集合中的每一分单时间点,选取该分单时间点的前一个分单时间点作为第一初始分单时间点,并获取所述第一初始分单时间点到该分单时间点的时间段内的待处理订单;在该分单时间点对获取的待处理订单进行分单匹配处理,得到分单匹配结果。
比如,目标分单时间集合中的第一个分单时间点为1点,该分单时间点的前一个分单时间点(也即第一初始分单时间点)为0点,获取0点到1点这段时间内起始位置位于目标区域中的待处理订单(也即获取0点到1点这段时间内的待处理订单),服务器对获取到的待处理订单进行打包和匹配,即选取与获取到的待处理订单相匹配的服务提供端。
其中,在拼车服务中,一个服务提供端可以被分配一个待处理订单,也可以被分配多个待处理订单。
S204、将分单匹配得到的分单匹配结果发送给相应的服务请求端。
本申请实施例中,针对每一个待处理订单,将该待处理订单对应的分单匹配结果发送给发送该待处理订单的服务请求端。其中,上述分单匹配过程以及将分单匹配结果发送给服务请求端的过程即分单处理。
作为一种实施方式,针对每个待处理订单,服务器向该发送该待处理订单的服务请求端发送该待处理订单相匹配的服务提供端的信息,以及,与上述服务提供端相匹配的其他服务请求端的信息。
同时,针对每个服务提供端,服务器向该服务提供端发送该服务提供端相匹配的一个或多个待处理订单。
本申请实施例提供的一种订单处理方法,通过对目标区域中历史订单进行分单匹配处理,得到匹配该目标区域的目标分单时间集合。针对来自目标区域的待处理订单,通过匹配该目标区域的目标分单时间集合对来自该目标区域的待处理订单进行分单处理,能够对更多相匹配的待处理订单进行分单匹配处理,从而提高了平台的分单效率。
进一步的,如图3所示,本申请实施例提供的订单处理方法中,所述获取目标区域内的服务请求端发送的待处理订单,包括:
S301、接收各个区域内的服务请求端分别发送的待处理订单,所述待处理订单中包括起始位置信息。
S302、根据所述目标区域的地理位置范围以及每一个所述待处理订单的起始位置信息,获取所述目标区域内的服务请求端发送的待处理订单。
本申请实施例中,针对当前城市的每一区域,以该区域作为目标区域,基于接收到的各个待处理订单的起始位置信息,获取位于该目标区域内的各个待处理订单,得到当前城市中每一个区域内的各个待处理订单。
本申请实施例中,针对每个区域,基于每个区域对应的分单时间集合中的各个分单时间点,对来自该区域的待处理订单进行分单匹配处理,提高了平台的分单效率。
进一步的,如图4所示,本申请实施例提供的订单处理方法中,通过以下方式确定所述目标分单时间集合,包括:
S401、获取所述目标区域在预设时间段中的结束分单时间点;其中,所述结束分单时间点为所述预设时间段中的最后一个时间点,且所述结束分单时间点对应至少在该结束分单时间点的一次分单。
本申请实施例中,选取目标区域在预设时间段中的最后一个时间点作 为结束分单时间点。其中,该结束分单时间点可以对应一次分单,即在该结束分单时间点分单;该结束分单时间点也可以对应多次分单,包括:在该结束分单时间点分单,以及,在预设时间段中除起始分单时间点(即预设时间段中的第一个时间点)和结束分单时间点之外的任一时间点分单。
比如,预设时间段为0点~24点,选取24点作为结束分单时间点,以1小时作为最小分单间隔为例,在上述预设时间段内,至少在24点分单一次。
S402、针对所述结束分单时间点对应的每一分单次数,从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合以及所述第一分单时间集合的分单效率;其中,每个分单时间集合中包括的分单时间点的个数与该分单次数相同,且不同的分单时间集合中的分单时间点不同。
本申请实施例中,结束分单时间点在每一分单次数下,对应至少一个分单时间集合。其中,每个分单时间集合中包括的分单时间点的个数与该分单次数相同,且不同的分单时间集合中的分单时间点不同。
比如,以1小时作为最小分单间隔,24点对应一次分单记作(24,1),24点对应两次分单记作(24,2),以此类推。(24,1)对应一个分单时间集合,该分单时间集合中的分单时间点的个数与当前分单次数相同,为1个;(24,2)对应多个分单时间集合,且每个分单时间集合中的分单时间点的个数与当前分单次数相同,为2个;(24,3)对应多个分单时间集合,且每个分单时间集合中的分单时间点的个数与当前分单次数相同,为3个;以此类推;(24,23)对应多个分单时间集合,且每个分单时间集合中的分单时间点的个数与当前分单次数相同,为23个;(24,24)对应一个分单时间集合,且该分单时间集合中的分单时间点的个数与当前分单次数相同,为24个。
其中,不同的分单时间集合中的分单时间点不同。比如,(24,1)对应分单时间集合1,表示为【24】;(24,2)对应分单时间集合1,表示为【1,24】、分单时间集合2,表示为【2,24】、分单时间集合3,表示为【3,24】等。这里,无论是在相同分单次数下,还是不同分单次数下,任意两个分单时间集合中的分单时间点均不同。
本申请实施例中,针对结束分单时间点在每一分单次数下对应各个分单时间集合,从上述各个分单时间集合中,选取对应最大分单效率的第一分单时间集合,并进一步确定第一分单时间集合的分单效率。
比如,(24,1)对应分单时间集合1【24】,该分单时间集合1【24】即在24点分单对应的第一分单时间集合,并将在24点分单的分单效率作为上述第一分单时间集合的分单效率。
再比如,(24,2)对应分单时间集合1【1,24】、分单时间集合2【2,24】、分单时间集合3【3,24】……分单时间集合23【23,24】,从上述分单集合1~23中选取对应最大分单效率的第一分单时间集合,并将在上述第一分单时间集合中的各个时间点的分单效率的和值,作为该第一分单时间集合的分单效率。
以此类推,直至确定了(24,24)的第一分单时间集合和该第一分单时间集合对应的分单效率。
S403、基于各个分单次数分别对应的第一分单时间集合的分单效率,从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合,作为所述目标分单时间集合。
作为一种实施方式,将(24,1)对应的第一分单时间集合的分单效率、(24,2)对应的第一分单时间集合的分单效率、(24,3)对应的第一分单时间集合的分单效率……(24,24)对应的第一分单时间集合的分单效率进行比较,选取其中的最大分单效率,并将该最大分单效率对应的第一分单时间集合作为目标分单时间集合。
进一步的,如图5所示,本申请实施例提供的订单处理方法中,所述从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合,包括:
S501、选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点。
本申请实施例中,采用动态规划算法从每一次分单次数对应的各个分单时间集合中,确定该次分单次数下对应最大分单效率的第一分单时间集合。
比如,从(24,2)对应的各个分单时间集合中选取对应最大分单效率的第一分单时间集合,将23点、22点、21点、20点、19点…1点均作为24点的候选分单时间点。
再比如,从(24,3)对应的各个分单时间集合中选取对应最大分单效率的第一分单时间集合,将23点、22点、21点、20点、19点…1点均作为24点的候选分单时间点。
S502、针对每一候选分单时间点,确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合以及所述第二分单时间集合的分单效率;其中,所述目标分单次数为该分单次数减一的次数。
作为一种实施方式,将从(24,2)对应的各个分单时间集合中选取对应最大分单效率的第一分单时间集合的原始问题,回归到从(23,1)、(22,1)、(21,1)……(1,1)中选取对应最大分单效率的分单时间集合的回归问题。
其中,(23,1)对应一个分单时间集合,即候选分单时间点23点对应的第二分单时间集合;在该第二分单时间集合中,在23点进行分单,将23点分单对应的分单效率作为第二分单时间集合的分单效率。同理,(22,1)、(21,1)……(1,1)。
作为另一种实施方式,将从(24,3)对应的各个分单时间集合中选取对应最大分单效率的第一分单时间集合的原始问题,回归到从(23,2)、(22,2)、(21,2)……(2,2)中选取对应最大分单效率的分单时间集合的回归问题中。
其中,(23,2)对应多个分单时间集合(以1小时为分单间隔为例,即22个分单时间集合),服务器从(23,2)对应多个分单时间集合中选取对应最大分单效率的第二分单时间集合,并确定第二分单时间集合的分单效率。
同理,(22,2)对应多个分单时间集合(以1小时为分单间隔为例,即21个分单时间集合),服务器从(22,2)对应多个分单时间集合中选取对应最大分单效率的第二分单时间集合,并确定第二分单时间集合的分单效率。
以此类推,直至确定(2,2)对应第二分单时间集合和该第二分单时间集合的分单效率。
S503、基于各个候选分单时间点在目标分单次数下分别对应的第二分单时间集合的分单效率,从各个所述第二分单时间集合中,选取对应最大分单效率的目标第二分单时间集合。
本申请实施例中,服务器将(23,2)对应的第二分单时间集合的分单效率、(22,2)对应的第二分单时间集合的分单效率、(21,2)对应的第二分单时间集合的分单效率……(2,2)对应的第二分单时间集合的分单效率进行比较,选取其中的最大分单效率,并将该最大分单效率对应的 第二分单时间集合,作为目标第二分单时间集合。
S504、将所述结束分单时间点和所述目标第二分单时间集合中的各个分单时间点进行组合,得到所述第一分单时间集合。
本申请实施例中,将目标第二分单时间集合中的各个时间点和结束分单时间点进行组合,得到所述第一分单时间集合。
进一步的,如图6所示,本申请实施例提供的订单处理方法中,确定所述第一分单时间集合的分单效率,包括:
S601、选取所述结束分单时间点的前一个分单时间点作为第二初始分单时间点。
本申请实施例中,以24点为结束分单时间点,以1小时为分单间隔为例,选取23点作为第二初始分单时间点。
S602、基于所述目标区域中历史订单的订单信息,获取所述第二初始分单时间点到所述结束分单时间点的时间段内的第一历史订单。
本申请实施例中,服务器获取23点到24点这段时间内所述目标区域中的所有历史订单,根据历史订单的预设取消率和上述所有历史订单,确定24点对应的第一历史订单。
S603、在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率。
本申请实施例中,在结束分单时间点(比如24点)对获取的第一历史订单进行分单。具体分单过程如下:服务器对第一历史订单进行打包和匹配,选取与第一历史订单相匹配的服务提供端,并基于发送所述第一历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
S604、根据所述结束分单时间点分单的分单效率和所述目标第二分单时间集合对应的分单效率,确定所述第一分单时间集合的分单效率。
本申请实施例中,获取目标第二分单时间集合对应的分单效率,计算目标第二分单时间集合对应的分单效率与结束分单时间点分单的分单效率的和值,将该和值作为第一分单时间集合的分单效率。
进一步的,本申请实施例提供的订单处理方法中,所述确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合,包括:
针对每一所述候选分单时间点,选取该候选分单时间点作为新的结束 分单时间点,返回选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点及后续步骤,直至该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合。
本申请实施例中,仍然采用动态规划算法确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合以及所述第二分单时间集合的分单效率。
针对每一所述候选分单时间点,如果该候选分单时间点在目标分单次数下对应多个第二分单时间集合,则选取该候选分单时间点作为新的结束分单时间点,继续执行步骤501至步骤504的步骤,直至当前的候选分单时间点在所述目标分单次数下对应一个第二分单时间集合。
比如,将从(24,3)对应的各个分单时间集合中选取对应最大分单效率的第一分单时间集合的原始问题,回归到从(23,2)、(22,2)、(21,2)……(2,2)中选取对应最大分单效率的分单时间集合的回归问题中。而对于回归问题中的任一组合,如(23,2),同样对应多个分单时间集合(以1小时为分单间隔为例,即22个分单时间集合),在从(23,2)对应的各个分单时间集合中选取对应最大分单效率的第二分单时间集合的问题,仍然能够回归到从(22,1)、(22,1)、(20,1)……(1,1)中选取对应最大分单效率的分单时间集合的问题,直至当前的候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合。
其中,当该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合时,该候选分单时间点不能在被选为新的结束分单时间点,此时,基于这一个第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到在该第二分单时间集合的分单效率。
基于各个一个第二分单时间集合对应的分单效率,实现通过最小的(i,j)组合解决上述原始问题和各个回归问题;其中,i表示分单时间点,j表示分单次数。
如图7所示,当该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合时,基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率,包括:
S701、针对所述第二分单时间集合中的任一分单时间点,选取该分单时间点的前一个分单时间点作为第三初始分单时间点。
本申请实施例中,比如针对回归路径(24,3)-(23,2)-(22,1),候选分单时间点为22时,对应一个第二分单时间集合时,即(22,1)对应一个第二分单时间集合【22点】。服务器选取21点作为22点对应的第三初始分单时间点。
S702、基于所述目标区域中历史订单的订单信息,获取所述第三初始分单时间点到该分单时间点的时间段内的第二历史订单。
本申请实施例中,服务器获取21点到22点这段时间内所述目标区域中的所有历史订单,根据历史订单的预设取消率和上述所有历史订单,确定22点对应的第二历史订单。
S703、在该分单时间点对所述第二历史订单进行分单匹配处理,获取该分单时间点分单对应的分单效率。
本申请实施例中,在结束分单时间点(比如22点)对获取的第二历史订单进行分单。具体分单过程如下:服务器选取与第二历史订单相匹配的服务提供端;基于发送第二历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
S704、将所述第二分单时间集合中的各个分单时间点分单对应的分单效率的和值,确定为所述第二分单时间集合的分单效率。
进一步的,如图8所示,本申请实施例提供的订单处理方法中,所述在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率,包括:
S801、在所述结束分单时间点,选取与所述第一历史订单相匹配的服务提供端。
S802、基于发送所述第一历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
结合步骤801和步骤802,针对任一分单时间点对应的第一历史订单,服务器对第一历史订单进行打包和匹配,即选取与该第一历史订单相匹配的服务提供端,并获取发送第一历史订单的服务请求端的资源供给信息(比如应付费用)和该第一历史订单匹配的服务提供端的资源消耗信息(比如应收费用),基于服务请求端的资源供给信息总和服务提供端的资源消耗信息总和,确定结束分单时间点分单对应的分单效率。
进一步的,如图9所示,本申请实施例提供的订单处理方法中,所述从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合之后,所述方法还包括:
S901、获取所述目标区域对应的多个第一分单时间集合。
本申请实施例中,比如服务器获取2018年1月1日到2019年5月1日,0点到24点内,目标区域对应的多个第一分单时间集合。
S902、对多个所述第一分单时间集合进行拟合处理,得到所述目标区域对应的目标分单时间集合。
本申请实施例中,将多个第一分单时间集合进行拟合处理,得到目标区域对应的目标分单时间集合。
本申请实施例提供的一种订单处理方法、装置、电子设备及存储介质,通过对目标区域中历史订单进行分单匹配处理,得到匹配该目标区域的目标分单时间集合。针对来自目标区域的待处理订单,通过匹配该目标区域的目标分单时间集合对来自该目标区域的待处理订单进行分单处理,从而提高了平台的分单效率。
图10是示出本申请的一些实施例的订单处理装置的框图,该订单处理装置实现的功能对应上述方法执行的步骤。该装置可以理解为上述服务器,或服务器的处理器,也可以理解为独立于上述服务器或处理器之外的在服务器控制下实现本申请功能的组件,如图10所示,所述订单处理装置可以包括:
第一获取模块1001,用于获取目标区域内的服务请求端发送的待处理订单;
查找模块1002,用于根据各个区域与分单时间集合的对应关系,查找与所述目标区域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的;
分单匹配模块1003,用于基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理;
发送模块1004,用于将分单匹配得到的分单匹配结果发送给相应的服务请求端。
进一步的,本申请实施例提供的订单处理装置中,第一获取模块1001, 具体用于:
接收各个区域内的服务请求端分别发送的待处理订单,所述待处理订单中包括起始位置信息;
根据所述目标区域的地理位置范围以及每一个所述待处理订单的起始位置信息,获取所述目标区域内的服务请求端发送的待处理订单。
进一步的,本申请实施例提供的订单处理装置中,分单匹配模块1003,具体用于:
针对所述目标分单时间集合中的每一分单时间点,选取该分单时间点的前一个分单时间点作为第一初始分单时间点,并获取所述第一初始分单时间点到该分单时间点的时间段内的待处理订单;
在该分单时间点对获取的待处理订单进行分单匹配处理,得到分单匹配结果。
进一步的,本申请实施例提供的订单处理装置中,所述装置还包括:
第二获取模块,用于获取所述目标区域在预设时间段中的结束分单时间点;其中,所述结束分单时间点为所述预设时间段中的最后一个时间点,且所述结束分单时间点对应至少在该结束分单时间点的一次分单;
确定模块,用于针对所述结束分单时间点对应的每一分单次数,从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合以及所述第一分单时间集合的分单效率;其中,每个分单时间集合中包括的分单时间点的个数与该分单次数相同,且不同的分单时间集合中的分单时间点不同;
选取模块,用于基于各个分单次数分别对应的第一分单时间集合的分单效率,从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合,作为所述目标分单时间集合。
进一步的,本申请实施例提供的订单处理装置中,所述确定模块,具体用于:
选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点;
针对每一候选分单时间点,确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合以及所述第二分单时间集合的分单效率;其中,所述目标分单次数为该分单次数减一的次数;
基于各个候选分单时间点在目标分单次数下分别对应的第二分单时间集合的分单效率,从各个所述第二分单时间集合中,选取对应最大分单效率的目标第二分单时间集合;
将所述结束分单时间点和所述目标第二分单时间集合中的各个分单时间点进行组合,得到所述第一分单时间集合。
进一步的,本申请实施例提供的订单处理装置中,所述确定模块,具体用于:
选取所述结束分单时间点的前一个分单时间点作为第二初始分单时间点;
基于所述目标区域中历史订单的订单信息,获取所述第二初始分单时间点到所述结束分单时间点的时间段内的第一历史订单;
在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率;
根据所述结束分单时间点分单的分单效率和所述目标第二分单时间集合对应的分单效率,确定所述第一分单时间集合的分单效率。
进一步的,本申请实施例提供的订单处理装置中,所述确定模块,具体用于:
针对每一所述候选分单时间点,选取该候选分单时间点作为新的结束分单时间点,返回选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点及后续步骤,直至该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合;
其中,当该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合时,基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率。
进一步的,本申请实施例提供的订单处理装置中,所述确定模块,具体用于:
针对所述第二分单时间集合中的任一分单时间点,选取该分单时间点的前一个分单时间点作为第三初始分单时间点;
基于所述目标区域中历史订单的订单信息,获取所述第三初始分单时间点到该分单时间点的时间段内的第二历史订单;
在该分单时间点对所述第二历史订单进行分单匹配处理,获取该分单时间点分单对应的分单效率;
将所述第二分单时间集合中的各个分单时间点分单对应的分单效率的和值,确定为所述第二分单时间集合的分单效率。
进一步的,本申请实施例提供的订单处理装置中,所述确定模块,具体用于:
在所述结束分单时间点,选取与所述第一历史订单相匹配的服务提供端;
基于发送所述第一历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
进一步的,本申请实施例提供的订单处理装置中,所述装置还包括:
第三获取模块,用于获取所述目标区域对应的多个第一分单时间集合;
拟合处模块,用于对多个所述第一分单时间集合进行拟合处理,得到所述目标区域对应的目标分单时间集合。
本申请实施例提供的一种订单处理装置,通过对目标区域中历史订单进行分单匹配处理,得到匹配该目标区域的目标分单时间集合。针对来自目标区域的待处理订单,通过匹配该目标区域的目标分单时间集合对来自该目标区域的待处理订单进行分单处理,从而提高了平台的分单效率。
如图11所示,本申请实施例提供的一种电子设备1100,包括:处理器1101、存储器1102和总线,所述存储器1102存储有所述处理器1101可执行的机器可读指令,当电子设备运行时,所述处理器1101与所述存储器1102之间通过总线通信,所述处理器1101执行所述机器可读指令,以执行如上述订单处理方法的步骤。
具体地,上述处理器1101和存储器1102为通用的存储器和处理器,这里不做具体限定,当处理器1101运行存储器1102存储的计算机程序时,能够执行上述订单处理方法。
对应于上述订单处理方法,本申请实施例还提供了一种计算机可读存储介质,所述计算机可读存储介质上存储有计算机程序,所述计算机程序被处理器运行时执行上述订单处理方法的步骤。
所属领域的技术人员可以清楚地了解到,为描述的方便和简洁,上述 描述的系统和装置的具体工作过程,可以参考方法实施例中的对应过程,本申请中不再赘述。在本申请所提供的几个实施例中,应该理解到,所揭露的系统、装置和方法,可以通过其它的方式实现。以上所描述的装置实施例仅仅是示意性的,例如,所述模块的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式,又例如,多个模块或组件可以结合或者可以集成到另一个系统,或一些特征可以忽略,或不执行。另一点,所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些通信接口,装置或模块的间接耦合或通信连接,可以是电性,机械或其它的形式。
所述作为分离部件说明的模块可以是或者也可以不是物理上分开的,作为模块显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外,在本申请各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个处理器可执行的非易失的计算机可读取存储介质中。基于这样的理解,本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括:U盘、移动硬盘、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
以上仅为本申请的具体实施方式,但本申请的保护范围并不局限于此,任何熟悉本技术领域的技术人员在本申请揭露的技术范围内,可轻易想到变化或替换,都应涵盖在本申请的保护范围之内。因此,本申请的保护范围应以权利要求的保护范围为准。
Claims (13)
- 一种订单处理方法,其特征在于,包括:获取目标区域内的服务请求端发送的待处理订单;根据各个区域与分单时间集合的对应关系,查找与所述目标区域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的;基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理;将分单匹配得到的分单匹配结果发送给相应的服务请求端。
- 根据权利要求1所述的订单处理方法,其特征在于,所述获取目标区域内的服务请求端发送的待处理订单,包括:接收各个区域内的服务请求端分别发送的待处理订单,所述待处理订单中包括起始位置信息;根据所述目标区域的地理位置范围以及每一个所述待处理订单的起始位置信息,获取所述目标区域内的服务请求端发送的待处理订单。
- 根据权利要求2所述的订单处理方法,其特征在于,所述基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理,包括:针对所述目标分单时间集合中的每一分单时间点,选取该分单时间点的前一个分单时间点作为第一初始分单时间点,并获取所述第一初始分单时间点到该分单时间点的时间段内的待处理订单;在该分单时间点对获取的待处理订单进行分单匹配处理,得到分单匹配结果。
- 根据权利要求1所述的订单处理方法,其特征在于,通过以下方式确定所述目标分单时间集合,包括:获取所述目标区域在预设时间段中的结束分单时间点;其中,所述结束分单时间点为所述预设时间段中的最后一个时间点,且所述结束分单时间点对应至少在该结束分单时间点的一次分单;针对所述结束分单时间点对应的每一分单次数,从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合以及所述第一分单时间集合的分单效率;其中,每个分单时间集合中包括的分单时间点的个数与该分单次数相同,且不同的分单时间集合中的分单时间点不同;基于各个分单次数分别对应的第一分单时间集合的分单效率,从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合,作为所述目标分单时间集合。
- 根据权利要求4所述的订单处理方法,其特征在于,所述从该分单次数对应的各个分单时间集合中,确定对应最大分单效率的第一分单时间集合,包括:选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点;针对每一候选分单时间点,确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合以及所述第二分单时间集合的分单效率;其中,所述目标分单次数为该分单次数减一的次数;基于各个候选分单时间点在目标分单次数下分别对应的第二分单时间集合的分单效率,从各个所述第二分单时间集合中,选取对应最大分单效率的目标第二分单时间集合;将所述结束分单时间点和所述目标第二分单时间集合中的各个分单时间点进行组合,得到所述第一分单时间集合。
- 根据权利要求5所述的订单处理方法,其特征在于,确定所述第一分单时间集合的分单效率,包括:选取所述结束分单时间点的前一个分单时间点作为第二初始分单时间点;基于所述目标区域中历史订单的订单信息,获取所述第二初始分单时间点到所述结束分单时间点的时间段内的第一历史订单;在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率;根据所述结束分单时间点分单的分单效率和所述目标第二分单时间集合对应的分单效率,确定所述第一分单时间集合的分单效率。
- 根据权利要求5所述的订单处理方法,其特征在于,所述确定该候选分单时间点在目标分单次数下对应最大分单效率的第二分单时间集合,包括:针对每一所述候选分单时间点,选取该候选分单时间点作为新的结束分单时间点,返回选取所述结束分单时间点之前的各个分单时间点作为候选分单时间点及后续步骤,直至该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合;其中,当该候选分单时间点在对应的目标分单次数下对应一个第二分单时间集合时,基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率。
- 根据权利要求7所述的订单处理方法,其特征在于,所述基于所述第二分单时间集合中的各个时间点以及所述目标区域中历史订单的订单信息,对所述历史订单进行分单匹配处理,得到所述第二分单时间集合的分单效率,包括:针对所述第二分单时间集合中的任一分单时间点,选取该分单时间点的前一个分单时间点作为第三初始分单时间点;基于所述目标区域中历史订单的订单信息,获取所述第三初始分单时间点到该分单时间点的时间段内的第二历史订单;在该分单时间点对所述第二历史订单进行分单匹配处理,获取该分单时间点分单对应的分单效率;将所述第二分单时间集合中的各个分单时间点分单对应的分单效率的和值,确定为所述第二分单时间集合的分单效率。
- 根据权利要求6所述的订单处理方法,其特征在于,所述在所述结束分单时间点对所述第一历史订单进行分单匹配处理,确定所述结束分单时间点分单的分单效率,包括:在所述结束分单时间点,选取与所述第一历史订单相匹配的服务提供端;基于发送所述第一历史订单的服务请求端对应的资源供给信息和所述服务提供端对应的资源消耗信息,确定在所述结束分单时间点分单的分单效率。
- 根据权利要求4所述的订单处理方法,其特征在于,所述从各个第一分单时间集合中选取对应最大分单效率的目标第一分单时间集合之后,所述方法还包括:获取所述目标区域对应的多个第一分单时间集合;对多个所述第一分单时间集合进行拟合处理,得到所述目标区域对应的目标分单时间集合。
- 一种订单处理装置,其特征在于,包括:第一获取模块,用于获取目标区域内的服务请求端发送的待处理订单;查找模块,用于根据各个区域与分单时间集合的对应关系,查找与所 述目标区域对应的目标分单时间集合;其中,所述目标分单时间集合中包括至少一个分单时间点,且所述目标分单时间集合是通过对所述目标区域中历史订单进行分单匹配处理得到的;分单匹配模块,用于基于所述目标分单时间集合中的各个分单时间点,对所述待处理订单进行分单匹配处理;发送模块,用于将分单匹配得到的分单匹配结果发送给相应的服务请求端。
- 一种电子设备,其特征在于,包括:处理器、存储介质和总线,所述存储介质存储有所述处理器可执行的机器可读指令,当电子设备运行时,所述处理器与所述存储介质之间通过总线通信,所述处理器执行所述机器可读指令,以执行如权利要求1至10任一项所述订单处理方法的步骤。
- 一种计算机可读存储介质,其特征在于,所述计算机可读存储介质上存储有计算机程序,所述计算机程序被处理器运行时执行如权利要求1至10任一项所述订单处理方法的步骤。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910452598.0 | 2019-05-28 | ||
CN201910452598.0A CN111861614A (zh) | 2019-05-28 | 2019-05-28 | 一种订单处理方法、装置、电子设备及存储介质 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2020238600A1 true WO2020238600A1 (zh) | 2020-12-03 |
Family
ID=72965888
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/089671 WO2020238600A1 (zh) | 2019-05-28 | 2020-05-11 | 一种订单处理方法、装置、电子设备及存储介质 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN111861614A (zh) |
WO (1) | WO2020238600A1 (zh) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8880601B2 (en) * | 2011-05-13 | 2014-11-04 | Bravioz Oy | Arrangement and method for transport sharing within a trusted network |
CN105844349A (zh) * | 2016-03-21 | 2016-08-10 | 上海壹佰米网络科技有限公司 | 一种订单自动分配方法及系统 |
CN108876156A (zh) * | 2018-06-25 | 2018-11-23 | 清华大学 | 拼车及用户订单处理方法、系统及所适用的设备 |
CN109685309A (zh) * | 2018-11-15 | 2019-04-26 | 拉扎斯网络科技(上海)有限公司 | 订单分配方法、装置、电子设备和存储介质 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
AU2017406770A1 (en) * | 2017-03-29 | 2019-10-17 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for allocating vehicles for on-demand services |
CN109426872A (zh) * | 2017-08-25 | 2019-03-05 | 北京嘀嘀无限科技发展有限公司 | 网约车订单分配方法及终端 |
CN109508799B (zh) * | 2018-09-26 | 2020-10-09 | 长沙市到家悠享家政服务有限公司 | 订单分配方法、装置及电子设备 |
CN109615201B (zh) * | 2018-11-30 | 2021-02-09 | 拉扎斯网络科技(上海)有限公司 | 订单分配方法、装置、电子设备和存储介质 |
CN109767289A (zh) * | 2018-12-15 | 2019-05-17 | 深圳壹账通智能科技有限公司 | 订单智能分配方法、装置、计算机设备及存储介质 |
-
2019
- 2019-05-28 CN CN201910452598.0A patent/CN111861614A/zh active Pending
-
2020
- 2020-05-11 WO PCT/CN2020/089671 patent/WO2020238600A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8880601B2 (en) * | 2011-05-13 | 2014-11-04 | Bravioz Oy | Arrangement and method for transport sharing within a trusted network |
CN105844349A (zh) * | 2016-03-21 | 2016-08-10 | 上海壹佰米网络科技有限公司 | 一种订单自动分配方法及系统 |
CN108876156A (zh) * | 2018-06-25 | 2018-11-23 | 清华大学 | 拼车及用户订单处理方法、系统及所适用的设备 |
CN109685309A (zh) * | 2018-11-15 | 2019-04-26 | 拉扎斯网络科技(上海)有限公司 | 订单分配方法、装置、电子设备和存储介质 |
Also Published As
Publication number | Publication date |
---|---|
CN111861614A (zh) | 2020-10-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3754583A1 (en) | Systems and methods for carpooling | |
CN110348589B (zh) | 一种拼车方法、装置、计算机设备及存储介质 | |
CN109923373B (zh) | 用于确定车辆参考方向的系统和方法 | |
US20180089786A1 (en) | Methods and systems for carpooling | |
CN111831899B (zh) | 导航兴趣点推荐方法、装置、服务器及可读存储介质 | |
US20200041288A1 (en) | Method of planning travel route, planning server, and storage medium | |
US10818108B2 (en) | Methods and systems for vehicle management | |
CN111353092B (zh) | 服务推送方法、装置、服务器及可读存储介质 | |
CN110945557B (zh) | 用于确定到达的预估时间的系统和方法 | |
CN108074027A (zh) | 纯孤儿单分配方法和装置 | |
WO2018223272A1 (en) | Systems and methods for price estimation using machine learning techniques | |
US20170030724A1 (en) | Route planning system & method | |
CN111104585B (zh) | 一种问题推荐方法及装置 | |
CN111277618B (zh) | 一种信息推送方法、装置、电子设备及存储介质 | |
CN111080407A (zh) | 房屋信息推荐方法、装置、电子设备及可读存储介质 | |
CN111861178B (zh) | 服务匹配模型的训练方法、服务匹配方法、设备及介质 | |
CN110832536B (zh) | 推荐上车地点的系统和方法 | |
CN111325436A (zh) | 网约车同行乘客匹配方法及系统、存储介质及服务器 | |
TW201933280A (zh) | 用於新道路確定的系統和方法 | |
CN111242754B (zh) | 账户数据更新方法、装置及电子设备 | |
WO2020238600A1 (zh) | 一种订单处理方法、装置、电子设备及存储介质 | |
WO2020238599A1 (zh) | 一种订单处理方法、装置、电子设备及存储介质 | |
CN111260423B (zh) | 订单分配方法、装置、电子设备及计算机可读存储介质 | |
CN111865558A (zh) | 服务数据处理方法、装置、电子设备及存储介质 | |
CN111612286A (zh) | 一种订单分配方法、装置、电子设备及存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20813939 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20813939 Country of ref document: EP Kind code of ref document: A1 |