CN112329965A - Riding service scheduling method and device, electronic equipment and storage medium - Google Patents
Riding service scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112329965A CN112329965A CN202011341390.0A CN202011341390A CN112329965A CN 112329965 A CN112329965 A CN 112329965A CN 202011341390 A CN202011341390 A CN 202011341390A CN 112329965 A CN112329965 A CN 112329965A
- Authority
- CN
- China
- Prior art keywords
- service
- riding
- scheduling
- riding service
- server
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 78
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 8
- 230000008569 process Effects 0.000 description 14
- 238000010586 diagram Methods 0.000 description 13
- 230000015654 memory Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 239000003990 capacitor Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012360 testing method 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
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
- G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a riding service scheduling method, a riding service scheduling device, electronic equipment and a storage medium, which relate to the technical field of data processing and comprise the following steps: receiving at least one riding service scheduling request sent by at least one requester server, wherein each riding service scheduling request is a scheduling request sent by one requester server under the condition that it is detected that an idle vehicle does not meet the riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided; and if the dispatching condition is met, sending a riding service instruction to the target service provider so that the target service provider provides riding service for the service requester indicated in the riding service request sent by the target requester server according to the riding service instruction. When the capacity of the server of the requester is insufficient, the capacity of the server of the receiver is adopted to provide riding service, so that the service requester can travel conveniently, the riding service experience of the service requester is improved, and the flexible scheduling capacity is realized.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a riding service scheduling method, an apparatus, an electronic device, and a storage medium.
Background
With the rapid development and popularization of the internet, various internet products are also coming out endlessly. Traveling is an indispensable part in human life, and various taxi taking applications are increasing. The taxi taking application can provide convenient riding service for users.
In the related art, the taxi taking application can obtain a service request of a service requester and send a ticket to a service provider, so that the service provider provides a riding service for the service requester. And under the condition that the own service provider corresponding to the taxi taking application is insufficient in transport capacity, prompting that the service requester needs to wait.
However, in the related art, when the capacity of the own service provider corresponding to the taxi taking application is insufficient, the service requester needs to wait, which is inconvenient for the service requester to go out, and reduces the riding service experience of the service requester.
Disclosure of Invention
In view of this, an object of the present application is to provide a riding service scheduling method, a riding service scheduling device, an electronic device, and a storage medium, which are used to solve the problems that, in the prior art, when the own service provider corresponding to the taxi taking application is insufficient in transport capacity, a service requester needs to wait, the service requester is inconvenient to go out, and the riding service experience of the service requester is reduced.
In a first aspect, an embodiment of the present application provides a bus taking service scheduling method, where the method includes:
receiving at least one riding service scheduling request sent by at least one requester server, wherein each riding service scheduling request is a scheduling request sent by one requester server when detecting that an idle vehicle does not meet a riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided;
judging whether a target requester server in the at least one requester server meets a preset scheduling condition;
and if the dispatching condition is met, sending a riding service instruction to a target service provider so that the target service provider provides riding service for a service requester indicated in the riding service request sent by the target requester server according to the riding service instruction.
Optionally, the determining whether the target requester server in the at least one requester server meets a preset scheduling condition includes:
and judging whether the target requester server meets a preset scheduling condition or not according to the information of the riding service platform to which the target requester server belongs.
Optionally, the determining, according to the information of the riding service platform to which the target requester server belongs, whether the target requester server meets a preset scheduling condition includes:
judging whether the riding service platform is a preset type of riding service platform or not according to the type information of the riding service platform;
if the vehicle taking service platform is the preset type of vehicle taking service platform, judging whether the identification information of the vehicle taking service platform is in a preset identification list or not;
and if the identification information of the riding service platform is in the preset identification list, determining that the target requester server meets the scheduling condition.
Optionally, the method further includes, before determining whether the identification information of the riding service platform is in a preset identification list, that:
judging whether the identification information of the riding service platform is in a preset blacklist or not;
the judging whether the identification information of the riding service platform is in a preset identification list comprises the following steps:
and if the identification information of the riding service platform is not in the preset blacklist, judging whether the identification information of the riding service platform is in a preset identification list.
Optionally, if the identification information of the riding service platform is in the preset identification list, the method further includes:
determining a scheduling demand time period of the riding service platform according to historical riding service scheduling information of the riding service platform;
and reserving idle vehicles for the riding service platform before the scheduling demand time period.
Optionally, the riding service scheduling request further includes: exchanging resource data required by the riding service request; the determining whether a target requester server in the at least one requester server meets a preset scheduling condition further includes:
if the identification information of the riding service platform is not in the preset identification list, judging whether the exchange resource data meets the preset scheduling resource requirement;
and if the exchanged resource data meets the scheduling resource requirement, determining that the target requester server meets the scheduling condition.
Optionally, if the number of the requester servers is multiple, before the determining whether the target requester server in the at least one requester server meets the preset scheduling condition, the method includes:
and if the free vehicles of the riding service platform to which the receiver server belongs do not meet the riding service requirements of the riding service dispatching requests, determining the target requester server according to the identification information of the riding service platform to which the requester server belongs and the corresponding exchange resource data.
Optionally, the sending the riding service instruction to the target service provider includes:
judging whether a plurality of service providers providing the riding service exist or not;
if so, selecting a service provider closest to a service requester indicated in the riding service request from the plurality of service providers as the target service provider;
and sending the riding service instruction to the target service provider.
Optionally, the method further includes:
and if the number of the idle vehicles is smaller than that of the required vehicles in the preset future time period, sending prompt information to an offline service provider, wherein the prompt information is used for indicating the offline service provider to be online.
In a second aspect, an embodiment of the present application provides a riding service scheduling apparatus, where the apparatus includes:
the system comprises a receiving module and a scheduling module, wherein the receiving module is used for receiving at least one riding service scheduling request sent by at least one requester server, each riding service scheduling request is a scheduling request sent by one requester server under the condition that it is detected that an idle vehicle does not meet the riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided;
the judging module is used for judging whether a target requester server in the at least one requester server meets a preset scheduling condition;
and the sending module is used for sending a riding service instruction to a target service provider if the scheduling condition is met, so that the target service provider provides riding service for a service requester indicated in the riding service request sent by the target requester server according to the riding service instruction.
Optionally, the determining module is further configured to determine whether the target requester server meets a preset scheduling condition according to information of a riding service platform to which the target requester server belongs.
Optionally, the determining module is further configured to determine whether the riding service platform is a preset type of riding service platform according to the type information of the riding service platform; if the vehicle taking service platform is the preset type of vehicle taking service platform, judging whether the identification information of the vehicle taking service platform is in a preset identification list or not; and if the identification information of the riding service platform is in the preset identification list, determining that the target requester server meets the scheduling condition.
Optionally, the apparatus further comprises:
the first judgment module is used for judging whether the identification information of the riding service platform is in a preset blacklist or not;
the judging module is further configured to judge whether the identification information of the riding service platform is in a preset identification list if the identification information is not in the preset blacklist.
Optionally, if the identification information of the riding service platform is in the preset identification list, the apparatus further includes:
the first determining module is used for determining a scheduling demand time period of the riding service platform according to historical riding service scheduling information of the riding service platform;
and the reservation module is used for reserving an idle vehicle for the riding service platform before the scheduling demand time period.
Optionally, the riding service scheduling request further includes: exchanging resource data required by the riding service request; the judging module is further configured to judge whether the exchanged resource data meets a preset scheduling resource requirement or not if the identification information of the riding service platform is not in the preset identification list; and if the exchanged resource data meets the scheduling resource requirement, determining that the target requester server meets the scheduling condition.
Optionally, if the number of the requesting servers is multiple, the apparatus includes:
and the second determining module is used for determining the target request party server according to the identification information of the riding service platforms to which the plurality of request party servers belong and the corresponding exchange resource data if the free transportation means of the riding service platform to which the receiver party server belongs does not meet the riding service requirements of the plurality of riding service scheduling requests.
Optionally, the sending module is configured to determine whether there are multiple service providers that provide the riding service; if so, selecting a service provider closest to a service requester indicated in the riding service request from the plurality of service providers as the target service provider; and sending the riding service instruction to the target service provider.
Optionally, the apparatus further comprises:
the first sending module is used for sending prompt information to an offline service provider if the number of the idle vehicles is smaller than the number of the required vehicles within a preset future time period, wherein the prompt information is used for indicating the offline service provider to be online.
In a third aspect, an embodiment of the present application provides an electronic device, including: the bus scheduling method comprises a processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, when an electronic device runs, the processor and the storage medium communicate through the bus, and the processor executes the machine-readable instructions to execute the steps of the bus service scheduling method according to any one of the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the bus service scheduling method according to any one of the first aspect are performed.
The embodiment of the application provides a riding service scheduling method, which comprises the following steps: receiving at least one riding service scheduling request sent by at least one requester server, wherein each riding service scheduling request is a scheduling request sent by one requester server under the condition that it is detected that an idle vehicle does not meet the riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided; and if the dispatching condition is met, sending a riding service instruction to the target service provider so that the target service provider provides riding service for the service requester indicated in the riding service request sent by the target requester server according to the riding service instruction. The method comprises the steps that a riding service scheduling request including a riding service request sent by a requester server is obtained, after the scheduling condition is determined to be met, a target service provider can send a riding service instruction, and the target service provider can provide riding service for a service requester indicated in the riding service request; under the condition that the capacity of the server of the requester is insufficient, the capacity of the server of the receiver is adopted to provide the riding service, so that the travel of the service requester is facilitated, the riding service experience of the service requester is improved, and the flexible scheduling capacity is realized.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 illustrates a block diagram of a ride service dispatch system in accordance with some embodiments of the present application;
FIG. 2 illustrates a schematic structural diagram of an electronic device of some embodiments of the present application;
fig. 3 is a schematic flow chart illustrating a method for scheduling a riding service according to an embodiment of the present application;
fig. 4 is a schematic flow chart illustrating a method for scheduling a riding service according to an embodiment of the present application;
fig. 5 is a schematic flow chart illustrating a method for scheduling a riding service according to an embodiment of the present application;
fig. 6 is a schematic flow chart illustrating a method for scheduling a riding service according to an embodiment of the present application;
fig. 7 is a schematic flow chart illustrating a method for scheduling a riding service according to an embodiment of the present application;
fig. 8 is a schematic flow chart illustrating a method for scheduling a riding service according to an embodiment of the present application;
fig. 9 is a schematic structural diagram illustrating a riding service dispatching device according to an embodiment of the present application;
fig. 10 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are for illustrative and descriptive purposes only and are not used to limit the scope of protection of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and steps without logical context may be performed in reverse order or simultaneously. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.
In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that in the embodiments of the present application, the term "comprising" is used to indicate the presence of the features stated hereinafter, but does not exclude the addition of further features.
The terms "passenger," "requestor," "service person," "service requestor," and "customer" are used interchangeably in this application to refer to an individual, entity, or tool that can request or order a service. The terms "driver," "provider," "service provider," and "provider" are used interchangeably in this application to refer to an individual, entity, or tool that can provide a service.
Fig. 1 illustrates a block diagram of a ride service dispatch system 100 in accordance with some embodiments of the present application. For example, the ride service dispatch system 100 may be an online transportation service platform for transportation services such as taxi, designated drive service, express, pool, bus service, driver rental, or regular service, or any combination thereof. Ride service dispatch system 100 may include one or more of a server 110, a network 120, a service requester terminal 130, a service provider terminal 140, a database 150, and a requester server 160, and a processor executing instructions may be included in server 110.
In some embodiments, the server 110 may be a single server or a group of servers. The set of servers can be centralized or distributed (e.g., the servers 110 can be a distributed system). In some embodiments, the server 110 may be local or remote to the terminal. For example, the server 110 may access information and/or data stored in the service requester terminal 130, the service provider terminal 140, the database 150, or the requester server 160, or any combination thereof, via the network 120. As another example, the server 110 may be directly connected to at least one of the service requester terminal 130, the service provider terminal 140, the database 150, and the requester server 160 to access stored information and/or data. In some embodiments, the server 110 may be implemented on a cloud platform; by way of example only, the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud (community cloud), a distributed cloud, an inter-cloud, a multi-cloud, and the like, or any combination thereof. In some embodiments, the server 110 may be implemented on an electronic device 200 having one or more of the components shown in FIG. 2 in the present application.
In some embodiments, 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 of the functions described herein. For example, the processor may take a first positive sample and a first negative sample. In some embodiments, a processor may include one or more processing cores (e.g., a single-core processor (S) or a multi-core processor (S)). Merely by way of example, a Processor may include a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), an Application Specific Instruction Set Processor (ASIP), a Graphics Processing Unit (GPU), a Physical Processing Unit (PPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), a Programmable Logic Device (PLD), a controller, a microcontroller Unit, a Reduced Instruction Set computer (Reduced Instruction Set computer), a microprocessor, or the like, or any combination thereof.
In some embodiments, a database 150 can be connected to the network 120 to communicate with one or more components of the ride service dispatch system 100 (e.g., the server 110, the service requester terminal 130, the service provider terminal 140, the requester server 160, etc.). One or more components in the ride service dispatch system 100 can access data or instructions stored in the database 150 via the network 120. In some embodiments, the database 150 can be directly connected to one or more components in the ride service dispatch system 100 (e.g., the server 110, the service requester terminal 130, the service provider terminal 140, the requester server 160, etc.); alternatively, in some embodiments, database 150 may also be part of server 110.
Fig. 2 illustrates a schematic diagram of exemplary hardware and software components of an electronic device 200 that may implement the server 110 of the present concepts according to some embodiments of the present application. For example, the processor 220 may be used on the electronic device 200 and to perform the functions herein.
Electronic device 200 may be a general purpose computer or a special purpose computer, both of which may be used to implement the test evaluation methods of the present application. Although only a single computer is shown, for convenience, the functions described herein may be implemented in a distributed fashion across multiple similar platforms to balance processing loads.
For example, the electronic device 200 may include a network port 210 connected to a network, one or more processors 220 for executing program instructions, a communication bus 230, and a different form of storage medium 240, such as a disk, ROM, or RAM, or any combination thereof. Illustratively, the computer platform may also include program instructions stored in ROM, RAM, or other types of non-transitory storage media, or any combination thereof. The method of the present application may be implemented in accordance with these program instructions. The electronic device 200 also includes an Input/Output (I/O) interface 250 between the computer and other Input/Output devices (e.g., keyboard, display screen).
For ease of illustration, only one processor is depicted in the electronic device 200. However, it should be noted that the electronic device 200 in the present application may also comprise a plurality of processors, and thus the steps performed by one processor described in the present application may also be performed by a plurality of processors in combination or individually. For example, if the processor of the electronic device 200 executes steps a and B, it should be understood that steps a and B may also be executed by two different processors together or separately in one processor. For example, a first processor performs step a and a second processor performs step B, or the first processor and the second processor perform steps a and B together.
In the riding service scheduling method provided by the embodiment of the present application, the execution subject may be the server 110, and the server 110 may be referred to as a receiver server. The following explains the receiver server as an example.
The method for scheduling a riding service provided by the embodiment of the present application is explained below with reference to a plurality of embodiments. Fig. 3 is a schematic flowchart illustrating a method for scheduling a riding service according to an embodiment of the present application, where as shown in fig. 3, the method may include:
s301, receiving at least one bus taking service dispatching request sent by at least one requester server.
Each bus taking service scheduling request is a scheduling request sent by one requester server under the condition that the idle transportation is detected not to meet the bus taking service requirement. Each bus service scheduling request comprises: and (5) a riding service request for the service to be provided.
In addition, when the request server detects that the free vehicle does not meet the riding service requirement, the self capacity of the request server is insufficient, the scheduling request is sent to the receiving server, and the riding service corresponding to the riding service request can be completed by acquiring the capacity from the receiving server.
In a possible implementation manner, the requester server may receive a riding service request to be provided with a service, and detect whether there is an idle vehicle to meet a riding service requirement corresponding to the riding service request, and if not, may send a scheduling request to the receiver server. Accordingly, the receiver server can receive the ride service dispatch request.
It should be noted that, when the request server detects that there is an idle vehicle, the ride service requirement corresponding to the ride service request can be met, which indicates that the capacity of the request server is sufficient. The requester server may send the riding service instruction to the service provider corresponding to the requester server, so that the service provider corresponding to the requester server provides the riding service. And the service provider corresponding to the requester server is in direct communication connection with the requester server.
S302, whether a target requester server in at least one requester server meets a preset scheduling condition is judged.
The receiver server may store therein preset scheduling conditions.
In some embodiments, the receiver server may determine a target requester server from the at least one requester server, and then may determine whether the target requester server satisfies a preset scheduling condition. The preset scheduling condition may include at least one sub-scheduling condition, and when the number of the sub-scheduling conditions is multiple and the sub-scheduling conditions are all satisfied, it may be determined that the preset scheduling condition is satisfied.
It should be noted that, when the scheduling condition is satisfied, the receiver server may provide corresponding scheduling service for the requester server to send the bus taking service scheduling request; and when the scheduling condition is not met, the receiver server can not send a riding service scheduling request to the requester server to provide corresponding scheduling service.
And S302, if the dispatching condition is met, sending a riding service instruction to the target service provider so that the target service provider provides riding service for the service requester indicated in the riding service request sent by the target requester server according to the riding service instruction.
The target service provider may be referred to as a service provider corresponding to the receiver server. The target service provider is in direct communicative connection with the recipient server.
In some embodiments, if the scheduling condition is met, the receiver server may provide a scheduling service corresponding to the riding service scheduling request, and according to the riding service request to be provided with the service carried in the riding service scheduling request, the receiver server determines a corresponding target service provider, and then sends a riding service instruction to the target service provider, and the target service provider may receive the riding service instruction and provide the riding service according to the riding service instruction.
In addition, when the scheduling condition is not satisfied, the receiver server may transmit feedback information to the requester server, and the requester server may receive the feedback information. The feedback information is used for indicating that the server at the receiving party has insufficient capacity and can not provide the scheduling service. The requester server may send waiting information to the service requester indicated in the ride service request, so that the service requester knows that the current capacity is insufficient and needs to wait.
To sum up, an embodiment of the present application provides a method for scheduling a riding service, including: receiving at least one riding service scheduling request sent by at least one requester server, wherein each riding service scheduling request is a scheduling request sent by one requester server under the condition that it is detected that an idle vehicle does not meet the riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided; and if the dispatching condition is met, sending a riding service instruction to the target service provider so that the target service provider provides riding service for the service requester indicated in the riding service request sent by the target requester server according to the riding service instruction. The method comprises the steps that a riding service scheduling request including a riding service request sent by a requester server is obtained, after the scheduling condition is determined to be met, a target service provider can send a riding service instruction, and the target service provider can provide riding service for a service requester indicated in the riding service request; under the condition that the capacity of the server of the requester is insufficient, the capacity of the server of the receiver is adopted to provide the riding service, so that the travel of the service requester is facilitated, the riding service experience of the service requester is improved, and the flexible scheduling capacity is realized.
Optionally, the server of the receiving party in the embodiment of the present application may be a server corresponding to a taxi taking service platform, may also be a server corresponding to a windward taking service platform, and may also be a server corresponding to other types of taking service platforms, which is not limited in the embodiment of the present application.
Optionally, the process of determining whether the target requester server in the at least one requester server satisfies the preset scheduling condition in S302 may include:
and judging whether the target requester server meets a preset scheduling condition or not according to the information of the riding service platform to which the target requester server belongs.
The information of the riding service platforms to which different target requester servers belong can be different.
In some embodiments, the receiver server may determine whether the target requester server satisfies a preset scheduling condition according to information of the riding service platform to which the target requester server belongs and a preset determination rule.
It should be noted that the information of the riding service platform may include: type information of the ride service platform and/or identification information of the ride service platform. Of course, other information may also be included, which is not specifically limited by the embodiments of the present application.
Optionally, fig. 4 shows a schematic flow diagram of a bus service scheduling method provided in an embodiment of the present application, and as shown in fig. 4, the process of determining whether the target requester server meets the preset scheduling condition according to the information of the bus service platform to which the target requester server belongs may include:
s401, judging whether the riding service platform is a preset type riding service platform according to the type information of the riding service platform.
The number of the preset type of riding service platforms can be multiple. The process of S401 may also be referred to as a process of traffic identification.
In some embodiments, the requester server may traverse each preset type of ride service platform, and determine whether the preset type of ride service platform matches with the type information of the ride service platform. If the type information of the taking service platform is matched with a taking service platform of a preset type, the taking service platform is the taking service platform of the preset type; and if the type information of the taking service platform is not matched with each preset type taking service platform, the taking service platform is not the preset type taking service platform.
Optionally, the preset type of riding service platform may include: the system comprises an enterprise-level riding service platform, a network car appointment riding service platform, a tailwind riding service platform and a third-party riding service platform. Certainly, the preset type of riding service platform may also be set according to actual requirements, which is not specifically limited in the embodiment of the present application.
S402, if the vehicle taking service platform is a preset type vehicle taking service platform, judging whether the identification information of the vehicle taking service platform is in a preset identification list.
If the type of the riding service platform is the preset type, it is indicated that the type information of the riding service platform meets the scheduling condition, that is, the traffic identification is successful. In addition, different types of ride service platforms may have corresponding preset identification lists.
In a possible implementation manner, the preset identification list may include: the receiving party server can judge whether the at least one piece of preset identification information comprises identification information of the riding service platform or not; if the identification information of the riding service platform is included, the identification information of the riding service platform is in a preset identification list; and if the identification information of the riding service platform is not included, the identification information of the riding service platform is not in the preset identification list.
In practical application, the preset identification information in the preset identification list may be a riding service platform with a weight higher than a preset weight threshold, that is, a riding service platform with a higher importance degree.
And S403, if the identification information of the riding service platform is in a preset identification list, determining that the target requester server meets the scheduling condition.
In the embodiment of the application, if the identification information of the ride service platform is in the preset identification list, the ride service platform is a ride service platform with a higher importance degree, and therefore it can be determined that the target requester server meets the scheduling condition.
Optionally, fig. 5 shows a schematic flow diagram of a ride service scheduling method provided in an embodiment of the present application, and as shown in fig. 5, before the process of determining whether the identification information of the ride service platform is in the preset identification list in S402, the method may further include:
s501, judging whether the identification information of the riding service platform is in a preset blacklist.
The preset blacklist may include a plurality of preset invalid identifications. The credit degree of the riding service platform corresponding to the preset invalid identifier is smaller than a preset credit degree threshold value. That is, the riding service platform corresponding to the preset invalid identifier has a low credit level, for example, there are problems of false riding service requests and defaulting fees.
In some embodiments, the receiver server may determine to traverse a preset invalid identifier in a preset blacklist, find whether a preset invalid identifier identical to the identifier information of the riding service platform exists, and if so, determine that the identifier information of the riding service platform is in the preset blacklist, where the riding service platform credit degree corresponding to the identifier information of the riding service platform is higher; if the identification information of the riding service platform does not exist in the preset blacklist, the riding service platform credit degree corresponding to the identification information of the riding service platform is determined to be low.
In the step S402, determining whether the identification information of the riding service platform is in a preset identification list may include:
and S502, if the identification information of the riding service platform is not in the preset blacklist, judging whether the identification information of the riding service platform is in the preset identification list.
If the information is not in the preset blacklist, it is indicated that there is no risk in the identification information of the ride service platform, and therefore, the process of S402 may be further performed to determine the importance degree of the ride service platform.
It should be noted that the process of S502 is similar to the process of S402, and is not described in detail here.
In conclusion, whether the identification information of the riding service platform is in a preset blacklist is judged; and if the identification information of the riding service platform is not in the preset blacklist, judging whether the identification information of the riding service platform is in the preset identification list. Risk management and control of the scheduling service can be achieved.
Optionally, fig. 6 shows a schematic flow diagram of a ride service scheduling method provided in an embodiment of the present application, and as shown in fig. 6, if the identification information of the ride service platform is in a preset identification list, the method may further include:
s601, determining a scheduling demand time period of the riding service platform according to historical riding service scheduling information of the riding service platform.
The weight of the corresponding riding service platform in the preset identification list is higher than a preset weight threshold, namely the importance degree is higher. Therefore, for the corresponding riding service platform in the preset identification list, the free vehicles can be reserved.
In some embodiments, the receiver server may determine the scheduling demand time period of the riding service platform by using a preset prediction model or a preset prediction algorithm according to the historical riding service scheduling information of the riding service platform. The number of vehicles required within the schedule demand time period of the ride service platform may also be determined.
And S602, reserving an idle vehicle for the riding service platform before scheduling the demand time period.
Optionally, before scheduling the demand time period, a corresponding number of idle vehicles may be reserved according to the number of vehicles required.
For example, the historical ride service schedule information indicates: the taking service platform a needs 8 vehicles at 8 to 9 o ' clock of monday of a month continuously, and the receiver server can predict that the taking service platform a needs 8 vehicles at 8 to 9 o ' clock of next monday, so that 8 free vehicles are reserved for the taking service platform a before 8 to 9 o ' clock of next monday.
In summary, according to the historical riding service scheduling information of the riding service platform, the scheduling demand time period of the riding service platform is determined, and before the scheduling demand time period, an idle vehicle is reserved for the riding service platform. The dispatching service can be normally provided for the riding service platform, and the experience of the riding service platform is improved.
Optionally, the bus taking service scheduling request further includes: exchanging resource data required by the ride service request. Fig. 7 is a schematic flowchart illustrating a flow of a bus taking service scheduling method provided in an embodiment of the present application, and as shown in fig. 7, the step of determining whether a target requester server in at least one requester server satisfies a preset scheduling condition in S302 may further include:
and S701, if the identification information of the riding service platform is not in the preset identification list, judging whether the exchange resource data meets the preset scheduling resource requirement.
S702, if the exchanged resource data meet the requirement of scheduling resources, determining that the target requester server meets the scheduling condition.
It should be noted that, if the identification information of the ride service platform is not in the preset identification list, it is indicated that the weight of the ride service platform corresponding to the identification information of the ride service platform is less than or equal to the preset weight threshold, that is, the importance degree is low. For the riding service platform with lower importance degree, the receiver server can further determine whether to provide corresponding dispatching service for the riding service platform according to the exchange resource data required by the riding service request and the preset dispatching resource requirement.
Optionally, the exchange resource data required for the ride service request may characterize the type of vehicle, number of vehicles, transaction data required in the ride service request. The exchange data can be virtual money, virtual points, virtual money or actual money. The virtual currency, virtual credit, virtual amount may be equivalent to the actual amount.
In some embodiments, the preset scheduling resource requirement may represent preset transaction data corresponding to different vehicle types, different vehicle numbers, and different levels of ride service platforms. The receiver server can determine corresponding preset transaction data according to the type of the required vehicles, the number of the vehicles and the grade information of the riding service platform, and judge whether the transaction data is larger than the preset transaction data.
If the transaction data is larger than the preset transaction data, the exchange resource data meets the preset scheduling resource requirement, namely the scheduling cost is met; if not, the exchange resource data does not meet the preset scheduling resource requirement, namely the scheduling cost is not met.
In summary, if the identification information of the riding service platform is not in the preset identification list, whether the exchange resource data meets the preset scheduling resource requirement is judged; and if the exchanged resource data meet the scheduling resource requirement, determining that the target requester server meets the scheduling condition. The expense accounting of the bus taking service dispatching request can be realized, and the dispatching cost is ensured to be met.
Optionally, if the number of the requester servers is multiple, before the process of determining whether the target requester server in the at least one requester server satisfies the preset scheduling condition in the step S102, the method may further include:
and if the free vehicles of the riding service platform to which the receiver server belongs do not meet the riding service requirements of the riding service dispatching requests, determining a target requester server according to the identification information of the riding service platform to which the plurality of requester servers belong and the corresponding exchange resource data.
And if the free vehicles of the riding service platform to which the receiver server belongs do not meet the riding service requirements of the plurality of riding service dispatching requests, the riding service dispatching request is sent to the receiver server. The situation shows that the capacity of the server of the receiving party is limited, and the server is insufficient to provide corresponding dispatching service for each bus taking service dispatching request. Therefore, the receiver server can determine an optimal target requester server from the plurality of requester servers corresponding to the ride service scheduling, and then provide the scheduling service for the target requester server.
In some embodiments, the receiver server may preferentially select a requester server having the identification information of the riding service platform in the preset identification list, and then may preferentially select a requester server having the largest difference between the transaction data in the exchange resource data and the corresponding preset transaction data. Of course, the target requester server can also be determined comprehensively by combining the identification information of the riding service platform and the weight occupied by the exchange resource data. This is not particularly limited by the embodiments of the present application.
It should be noted that, when the capacity of the receiver server is limited, the receiver server may also schedule the capacity from other receiver servers to complete the scheduling service corresponding to the riding service scheduling request, which is not specifically limited in the embodiment of the present application.
Optionally, fig. 8 is a schematic flow diagram illustrating a method for scheduling a ride service according to an embodiment of the present application, and as shown in fig. 8, the process of sending a ride service instruction to a target service provider in S303 may include:
s801, judging whether a plurality of service providers providing the riding service exist or not.
The plurality of service providers can provide corresponding riding services for the riding service requests included in the riding service scheduling requests.
In some embodiments, the receiver server may determine an order taking place and a destination place in the riding service request to be provided with the service, then determine corresponding service providers according to the order taking place and the destination place, and then judge whether the number of the service providers is multiple.
And S802, if so, selecting the service provider closest to the service requester indicated in the riding service request from the plurality of service providers as a target service provider.
Wherein, the receiver server can adopt the distance service to determine the target service provider.
In some embodiments, the recipient server may obtain location information of each service provider, calculate distance information of each location information and the order taking place, determine a minimum value in the distance information, and determine a service provider corresponding to the minimum value as a target service provider.
And S803, sending the riding service instruction to the target service provider.
In the embodiment of the application, the receiver server can send the riding service instruction to the target service provider, and the service provider can receive the riding service instruction, go to the pick-up location to pick up the service requester according to the pick-up location and the target position in the riding service request carried in the riding service instruction, and send the service requester to the target position. The service requester and the service provider can directly perform the transaction of the amount of the riding service.
The receiving side server is also directly connected with a service requester in a communication manner, and the receiving side server can also obtain a riding service request of the service requester and send a riding service instruction to the service provider so that the service provider provides riding service for the service requester.
Optionally, the method may further include:
and if the number of the idle vehicles is smaller than that of the required vehicles in the preset future time period, sending prompt information to an offline service provider.
The prompt information is used for indicating that the offline service provider is online.
In addition, the recipient server may predict the number of free vehicles in a preset future time period based on the historical number of free vehicles.
In one possible implementation, the ride service request may be a ride reservation service request, and the receiver server may count the number of vehicles required in a preset future period according to the ride reservation service request. And judging whether the number of the idle vehicles is less than that of the required vehicles, if so, sending prompt information by the offline service provider.
Accordingly, the offline service provider can acquire the prompt message and switch the offline state to the online state in response to the input login operation. The service provider may obtain the reminder information by: the method comprises the steps of obtaining by adopting a client side, and obtaining by adopting a telephone or short message. The information may also be obtained in other manners, which is not specifically limited in the embodiments of the present application.
To sum up, an embodiment of the present application provides a method for scheduling a riding service, including: receiving at least one riding service scheduling request sent by at least one requester server, wherein each riding service scheduling request is a scheduling request sent by one requester server under the condition that it is detected that an idle vehicle does not meet the riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided; and if the dispatching condition is met, sending a riding service instruction to the target service provider so that the target service provider provides riding service for the service requester indicated in the riding service request sent by the target requester server according to the riding service instruction. The method comprises the steps that a riding service scheduling request including a riding service request sent by a requester server is obtained, after the scheduling condition is determined to be met, a target service provider can send a riding service instruction, and the target service provider can provide riding service for a service requester indicated in the riding service request; under the condition that the capacity of the server of the requester is insufficient, the capacity of the server of the receiver is adopted to provide the riding service, so that the travel of the service requester is facilitated, the riding service experience of the service requester is improved, and the flexible scheduling capacity is realized. And whether the target requester server meets the preset scheduling condition is judged based on the type information of the riding service platform and the identification information of the riding service platform, so that the judgment result of the target requester server is more accurate and reliable.
The following describes a riding service scheduling device, an electronic device, a storage medium, and the like for executing the riding service scheduling method provided by the present application, and specific implementation processes and technical effects thereof are referred to in the related contents of the riding service scheduling method, and are not described in detail below.
Fig. 9 is a schematic structural diagram illustrating a riding service dispatching device according to an embodiment of the present application, where as shown in fig. 9, the device may include:
the receiving module 901 is configured to receive at least one riding service scheduling request sent by at least one requester server, where each riding service scheduling request is a scheduling request sent by one requester server when it is detected that an idle vehicle does not meet a riding service requirement, and each riding service scheduling request includes: a riding service request for service to be provided;
a determining module 902, configured to determine whether a target requester server in the at least one requester server meets a preset scheduling condition;
and the sending module 903 is configured to send a riding service instruction to the target service provider if the scheduling condition is met, so that the target service provider provides a riding service for a service requester indicated in the riding service request sent by the target requester server according to the riding service instruction.
Optionally, the determining module 902 is further configured to determine whether the target requester server meets a preset scheduling condition according to information of the riding service platform to which the target requester server belongs.
Optionally, the determining module 902 is further configured to determine whether the riding service platform is a preset type of riding service platform according to the type information of the riding service platform; if the vehicle taking service platform is a preset type of vehicle taking service platform, judging whether the identification information of the vehicle taking service platform is in a preset identification list or not; and if the identification information of the riding service platform is in a preset identification list, determining that the target requester server meets the scheduling condition.
Optionally, the apparatus further comprises:
the first judgment module is used for judging whether the identification information of the riding service platform is in a preset blacklist or not;
the determining module 902 is further configured to determine whether the identification information of the riding service platform is in a preset identification list if the identification information is not in the preset blacklist.
Optionally, if the identification information of the riding service platform is in a preset identification list, the apparatus further includes:
the first determining module is used for determining a scheduling demand time period of the riding service platform according to historical riding service scheduling information of the riding service platform;
and the reservation module is used for reserving the idle transportation means for the riding service platform before the scheduling of the required time period.
Optionally, the bus taking service scheduling request further includes: exchanging resource data required by the riding service request; the determining module 902 is further configured to determine whether the exchanged resource data meets a preset scheduling resource requirement if the identification information of the riding service platform is not in the preset identification list; and if the exchanged resource data meet the scheduling resource requirement, determining that the target requester server meets the scheduling condition.
Optionally, if the number of the requesting servers is multiple, the apparatus includes:
and the second determining module is used for determining a target requester server according to the identification information of the riding service platforms to which the plurality of requester servers belong and the corresponding exchange resource data if the free vehicles of the riding service platforms to which the receiver servers belong do not meet the riding service requirements of the plurality of riding service scheduling requests.
Optionally, the sending module 903 is configured to determine whether there are multiple service providers providing the riding service; if so, selecting the service provider closest to the service requester indicated in the riding service request from the plurality of service providers as a target service provider; and sending the riding service instruction to the target service provider.
Optionally, the apparatus further comprises:
the first sending module is used for sending prompt information to an offline service provider if the number of the idle vehicles is smaller than the number of the required vehicles within a preset future time period, wherein the prompt information is used for indicating the offline service provider to be online.
The apparatus may be configured to execute the method provided by the method embodiment, and the specific implementation manner and the technical effect are similar and will not be described herein again. The apparatus may be integrated in a device such as a terminal or a server, and is not limited in this application.
Fig. 10 shows a schematic structural diagram of another electronic device provided in an embodiment of the present application, and as shown in fig. 9, the electronic device includes: a processor 1001 and a memory 1002, wherein: the memory 1002 is used for storing programs, and the processor 1001 calls the programs stored in the memory 1002 to execute the above-mentioned method embodiments. The electronic device may be a recipient server. The specific implementation and technical effects are similar, and are not described herein again.
Optionally, the invention also provides a program product, for example a computer-readable storage medium, comprising a program which, when being executed by a processor, is adapted to carry out the above-mentioned method embodiments.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to corresponding processes in the method embodiments, and are not described in detail in this application. In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. The above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical division, and there may be other divisions in actual implementation, and for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or modules through some communication interfaces, and may be in an electrical, mechanical or other form.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (12)
1. A bus service scheduling method is characterized by comprising the following steps:
receiving at least one riding service scheduling request sent by at least one requester server, wherein each riding service scheduling request is a scheduling request sent by one requester server when detecting that an idle vehicle does not meet a riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided;
judging whether a target requester server in the at least one requester server meets a preset scheduling condition;
and if the dispatching condition is met, sending a riding service instruction to a target service provider so that the target service provider provides riding service for a service requester indicated in the riding service request sent by the target requester server according to the riding service instruction.
2. The method of claim 1, wherein determining whether a target requestor server of the at least one requestor server satisfies a preset scheduling condition comprises:
and judging whether the target requester server meets a preset scheduling condition or not according to the information of the riding service platform to which the target requester server belongs.
3. The method according to claim 2, wherein the determining whether the target requester server satisfies a preset scheduling condition according to the information about the ride service platform to which the target requester server belongs comprises:
judging whether the riding service platform is a preset type of riding service platform or not according to the type information of the riding service platform;
if the vehicle taking service platform is the preset type of vehicle taking service platform, judging whether the identification information of the vehicle taking service platform is in a preset identification list or not;
and if the identification information of the riding service platform is in the preset identification list, determining that the target requester server meets the scheduling condition.
4. The method of claim 3, wherein the determining whether the identification information of the ride service platform is in a pre-set identification list further comprises:
judging whether the identification information of the riding service platform is in a preset blacklist or not;
the judging whether the identification information of the riding service platform is in a preset identification list comprises the following steps:
and if the identification information of the riding service platform is not in the preset blacklist, judging whether the identification information of the riding service platform is in a preset identification list.
5. The method of claim 3, wherein if the identification information of the ride service platform is in the preset identification list, the method further comprises:
determining a scheduling demand time period of the riding service platform according to historical riding service scheduling information of the riding service platform;
and reserving idle vehicles for the riding service platform before the scheduling demand time period.
6. The method of claim 3, wherein the ride service dispatch request further comprises: exchanging resource data required by the riding service request; the determining whether a target requester server in the at least one requester server meets a preset scheduling condition further includes:
if the identification information of the riding service platform is not in the preset identification list, judging whether the exchange resource data meets the preset scheduling resource requirement;
and if the exchanged resource data meets the scheduling resource requirement, determining that the target requester server meets the scheduling condition.
7. The method of claim 1, wherein if the number of the requesting servers is multiple, before the determining whether the target requesting server of the at least one requesting server satisfies the predetermined scheduling condition, the method comprises:
and if the free vehicles of the riding service platform to which the receiver server belongs do not meet the riding service requirements of the plurality of riding service dispatching requests, determining the target requester server according to the identification information of the riding service platform to which the plurality of requester servers belong and the corresponding exchange resource data.
8. The method of claim 1, wherein sending ride service instructions to the target service provider comprises:
judging whether a plurality of service providers providing the riding service exist or not;
if so, selecting a service provider closest to a service requester indicated in the riding service request from the plurality of service providers as the target service provider;
and sending the riding service instruction to the target service provider.
9. The method according to any one of claims 1-8, further comprising:
and if the number of the idle vehicles is smaller than that of the required vehicles in the preset future time period, sending prompt information to an offline service provider, wherein the prompt information is used for indicating the offline service provider to be online.
10. A ride service scheduling apparatus, the apparatus comprising:
the system comprises a receiving module and a scheduling module, wherein the receiving module is used for receiving at least one riding service scheduling request sent by at least one requester server, each riding service scheduling request is a scheduling request sent by one requester server under the condition that it is detected that an idle vehicle does not meet the riding service requirement, and each riding service scheduling request comprises: a riding service request for service to be provided;
the judging module is used for judging whether a target requester server in the at least one requester server meets a preset scheduling condition;
and the sending module is used for sending a riding service instruction to a target service provider if the scheduling condition is met, so that the target service provider provides riding service for a service requester indicated in the riding service request sent by the target requester server according to the riding service instruction.
11. An electronic device, comprising: a processor, a storage medium and a bus, the storage medium storing machine readable instructions executable by the processor, the processor and the storage medium communicating via the bus when the electronic device is running, the processor executing the machine readable instructions to perform the steps of the ride service scheduling method according to any of claims 1 to 9.
12. A computer-readable storage medium, having stored thereon a computer program for performing the steps of the ride service scheduling method according to any of claims 1 to 9 when executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011341390.0A CN112329965A (en) | 2020-11-25 | 2020-11-25 | Riding service scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011341390.0A CN112329965A (en) | 2020-11-25 | 2020-11-25 | Riding service scheduling method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112329965A true CN112329965A (en) | 2021-02-05 |
Family
ID=74308296
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011341390.0A Pending CN112329965A (en) | 2020-11-25 | 2020-11-25 | Riding service scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112329965A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112884373A (en) * | 2021-03-25 | 2021-06-01 | 支付宝(杭州)信息技术有限公司 | Order dispatching processing method and device |
| CN113159521A (en) * | 2021-03-26 | 2021-07-23 | 珠海大横琴科技发展有限公司 | Service scheduling method and device |
| CN113421039A (en) * | 2021-05-21 | 2021-09-21 | 浙江大搜车融资租赁有限公司 | Vehicle management method, device and equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001101586A (en) * | 1999-09-30 | 2001-04-13 | Aisin Seiki Co Ltd | Vehicle allocation management system |
| CN102737501A (en) * | 2012-06-12 | 2012-10-17 | 中国联合网络通信集团有限公司 | Taxi passenger carrying scheduling method and system and scheduling server |
| CN107784824A (en) * | 2016-08-25 | 2018-03-09 | 大连楼兰科技股份有限公司 | Unmanned taxi dispatching system and dispatching method |
| US20190180628A1 (en) * | 2017-12-11 | 2019-06-13 | Toyota Jidosha Kabushiki Kaisha | User vehicle dispatch dealing system and storage medium |
| CN111739329A (en) * | 2020-05-29 | 2020-10-02 | 腾讯科技（深圳）有限公司 | Travel route generation method, travel route generation device, storage medium, and server |
-
2020
- 2020-11-25 CN CN202011341390.0A patent/CN112329965A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001101586A (en) * | 1999-09-30 | 2001-04-13 | Aisin Seiki Co Ltd | Vehicle allocation management system |
| CN102737501A (en) * | 2012-06-12 | 2012-10-17 | 中国联合网络通信集团有限公司 | Taxi passenger carrying scheduling method and system and scheduling server |
| CN107784824A (en) * | 2016-08-25 | 2018-03-09 | 大连楼兰科技股份有限公司 | Unmanned taxi dispatching system and dispatching method |
| US20190180628A1 (en) * | 2017-12-11 | 2019-06-13 | Toyota Jidosha Kabushiki Kaisha | User vehicle dispatch dealing system and storage medium |
| CN111739329A (en) * | 2020-05-29 | 2020-10-02 | 腾讯科技（深圳）有限公司 | Travel route generation method, travel route generation device, storage medium, and server |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112884373A (en) * | 2021-03-25 | 2021-06-01 | 支付宝(杭州)信息技术有限公司 | Order dispatching processing method and device |
| CN113159521A (en) * | 2021-03-26 | 2021-07-23 | 珠海大横琴科技发展有限公司 | Service scheduling method and device |
| CN113421039A (en) * | 2021-05-21 | 2021-09-21 | 浙江大搜车融资租赁有限公司 | Vehicle management method, device and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112329965A (en) | Riding service scheduling method and device, electronic equipment and storage medium | |
| US11153395B2 (en) | Optimizing multi-user requests for a network-based service | |
| WO2018228110A1 (en) | Systems and methods for transport capacity scheduling | |
| US11948464B2 (en) | Real-time service provider progress monitoring | |
| CN107464413A (en) | Real-time form processing method and server | |
| WO2020211455A1 (en) | Data processing system and method | |
| WO2016035091A1 (en) | Dynamic forecasting for forward reservation of cab | |
| CN107063277B (en) | Navigation method and server for multi-member travel | |
| US20160248914A1 (en) | Telephone Call Placement | |
| CN111553501A (en) | Order allocation method and device | |
| CN112950312A (en) | Order processing method and device | |
| JP2016143246A (en) | Power consumption estimation apparatus, power consumption estimation method, and server device | |
| JP6428190B2 (en) | Shared vehicle management apparatus and shared vehicle management method | |
| CN112529487A (en) | Vehicle scheduling method, device and storage medium | |
| CN112862214A (en) | Parking service recommendation method, device, medium and server based on big data | |
| CN107786600B (en) | Driver terminal recommendation processing method and server | |
| CN110750709A (en) | Service recommendation method and device | |
| CN112561285A (en) | Recommendation method and device for website, electronic equipment and computer readable storage medium | |
| CN111860927A (en) | Model training method, service request processing method, device, equipment and medium | |
| JP6439251B2 (en) | Vehicle management system and vehicle management method | |
| JP7126897B2 (en) | Server, Charging Station Guidance System, Charging Station Guidance Method, and Program | |
| CN111831764A (en) | Method and device for determining stop station, electronic equipment and medium | |
| US20190370890A1 (en) | Parking space rent-out apparatus, parking space rent-out system, and parking space rent-out method | |
| CN111476389A (en) | Method and device for pre-estimating order receiving waiting time | |
| CN111612286B (en) | Order distribution method and device, electronic equipment and storage medium |
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 |