WO2019072054A1 - Vehicle scheduling method, server, client, and system - Google Patents

Abstract

Disclosed in the present invention are a vehicle scheduling method, a server, a client, and a system. The method comprises: after a user has carried out scheduling for a target vehicle, determining a scheduling start point and a scheduling end point for the user carrying out scheduling on the target vehicle, and acquiring corresponding activation parameters; providing a corresponding scheduling activation value to the user according to the activation parameters so as to activate the user to carry out vehicle scheduling. According to the present invention, a user may be guided to participate in vehicle scheduling. The enthusiasm of a user for participating in vehicle scheduling is thus improved, while costs of operational manpower in vehicle scheduling are lowered, and the efficiency of scheduling is increased.

Description

Vehicle scheduling method, server, client and system Technical field

The present invention relates to the field of vehicle scheduling technology, and more particularly to a vehicle scheduling method, a server, a client, and a system.

Background technique

At present, cycling through shared bicycles has become an emerging mode of travel in the city, which can effectively solve the short-distance travel needs of urban people and be green.

With the increasing size of users sharing bicycles, the standardized dispatching and management of shared bicycles is currently a requirement of many urban traffic management. Due to the “tidal effect” of the actual vehicle demand of the user, there is an imbalance in the demand for the car during the peak period, and there is no car available in the place where the car is needed, and no need to deposit even in the place where the car is needed. The negative impact of the “tidal effect” may lead to the illegal occupation of motor vehicles and non-motor vehicle lanes due to the siltation of vehicles, which affects the normal travel of other citizens. Therefore, shared bicycle service providers need to standardize vehicle scheduling to alleviate the negative impact of the “tidal effect”. However, at present, the scheduling of shared bicycles mainly relies on the manual statistics of the operators of the shared bicycle service providers to determine the multi-region or the vehicle-less area of the vehicle, and the corresponding manual scheduling, the labor cost input is high, and the scheduling efficiency is low.

Summary of the invention

It is an object of the present invention to provide a new technical solution for dispatching a vehicle.

According to a first aspect of the present invention, a vehicle scheduling method is provided, comprising:

After the user performs scheduling on the target vehicle, determining a scheduling start point and a scheduling end point for the user to perform scheduling on the target vehicle, and acquiring corresponding excitation parameters,

Wherein, the excitation parameter includes at least a reference scheduling cost, a user excitation coefficient, and a scheduling supply and demand coefficient;

Based on the excitation parameters, a corresponding scheduling incentive value is provided to the user to motivate the user to implement vehicle scheduling.

Optionally, the method further includes:

The reference scheduling cost is calculated according to a preset excitation mean value, an excitation maximum value, an excitation minimum value, and an excitation fluctuation coefficient.

Optionally, the method further includes:

Obtaining a scheduling behavior parameter of the user, and calculating and obtaining the user excitation coefficient,

The scheduling behavior parameter includes at least one of a sharing factor, a finding factor, a scheduling scale factor, and a cheating factor.

The sharing factor is set according to whether the user has the behavior of sharing the scheduling incentive value in the most recent preset duration; the searching factor is based on whether the user has found the behavior setting of the vehicle that needs to be scheduled according to the latest preset duration; The scheduling scale factor is set according to whether the ratio of the number of scheduled vehicles and the total number of used vehicles in the latest preset time period exceeds a preset ratio threshold setting; the cheat factor does not actually occur when the vehicle is used according to the user's latest preset number of times Whether the ratio exceeds the preset ratio threshold setting.

Optionally, the method further includes:

Obtaining a scheduling start point and a scheduling level of the scheduling end point;

Determining the scheduling supply and demand coefficient according to a scheduling level of the scheduling starting point, a scheduling level of the scheduling end point, and a preset scheduling supply and demand coefficient configuration table,

The scheduling supply and demand coefficient configuration table includes scheduling supply and demand coefficients from different scheduling levels of the scheduling level and scheduling end points of different scheduling levels.

Optionally, the step of acquiring the scheduling start point and the scheduling level of the scheduling end point includes:

Selecting a space-time unit corresponding to the scheduling start point in the set of space-time units, calculating a vehicle distribution index and a vehicle collection index of the corresponding space-time unit, and determining a scheduling of the scheduling starting point according to the vehicle distribution index and the vehicle collection index. grade;

as well as

Selecting a space-time unit corresponding to the scheduling end point in the set of space-time units, calculating a vehicle distribution index and a vehicle collection index of the corresponding space-time unit, and determining the scheduling end point according to the vehicle distribution index and the vehicle collection index. Scheduling level;

The space-time unit set includes a plurality of space-time units divided by the scheduling area, and each of the space-time units has a corresponding time period and a geographical position.

Optionally, the calculating, obtaining the corresponding vehicle distribution index and the vehicle collection index of the space-time unit comprises:

And acquiring, by the time-space unit, a first link weight set that uses the space-time unit as a travel start point and a second link weight set that uses the space-time unit as a travel end point according to a historical travel record,

The historical travel record includes a plurality of historical trips, where the historical trip includes the space-time unit as a starting point of the trip and the spatio-temporal unit as an end point of the trip, where the first link weight set includes a The other space-time unit other than the space-time unit is a link weight of each link of the end of the trip, and the second link weight set includes the other space-time unit except the space-time unit as a starting point of the trip. Link weight of each link;

Acquiring and acquiring the vehicle distribution index according to the first link weight set and a preset smoothing coefficient, and calculating and acquiring the vehicle collection index according to the second link weight set and the smoothing coefficient.

According to a second aspect of the present invention, a vehicle scheduling method is provided, comprising:

After the user implements scheduling of the target vehicle, providing a scheduling incentive display interface to display the acquired scheduling incentive value to the user.

The scheduling incentive value is obtained according to the vehicle scheduling method according to any one of the first aspects of the present invention.

According to a third aspect of the present invention, there is provided a server, implementing vehicle scheduling, comprising:

a memory for storing executable instructions;

a processor for operating the server to perform the vehicle scheduling method of any one of the first aspects of the present invention in accordance with the control of the instructions.

According to a fourth aspect of the present invention, a client is provided to implement vehicle scheduling, including:

Display device for displaying a human-computer interaction interface;

a memory for storing executable instructions;

A processor for operating the server to perform a vehicle scheduling method as provided by the second aspect of the present invention in accordance with control of the instructions.

According to a fifth aspect of the present invention, a vehicle dispatching system is provided, comprising:

A server provided by the third aspect of the present invention, and a client for use in the fourth aspect of the present invention.

According to an embodiment of the present disclosure, the scheduling incentive value corresponding to the vehicle scheduling behavior may be provided to the user according to the scheduling behavior performed by the user on the target vehicle, and the user is guided to participate in the vehicle scheduling. Improve the enthusiasm of users to participate in vehicle scheduling. Reduce the operational labor cost of vehicle scheduling. Improve scheduling efficiency.

Other features and advantages of the present invention will become apparent from the Detailed Description of the <RTIgt;

Other features and advantages of the present invention will become apparent from the Detailed Description of the <RTIgt;

DRAWINGS

The accompanying drawings, which are incorporated in FIG

1 is a block diagram showing an example of a hardware configuration of a vehicle system that can be used to implement an embodiment of the present invention.

Fig. 2 is a flow chart showing a vehicle scheduling method of the first embodiment of the present invention.

Fig. 3 is a flow chart showing the calculation of the supply and demand coefficients of the first embodiment of the present invention.

Fig. 4 is a flow chart showing the calculation of the scheduling level of the first embodiment of the present invention.

Fig. 5 is a view showing an example of a space-time unit of the first embodiment of the present invention.

Fig. 6 is a flow chart showing the calculation of the vehicle distribution index and the vehicle collection index of the first embodiment of the present invention.

Fig. 7 is a view showing an example of a history stroke of the first embodiment of the present invention.

Fig. 8 shows a schematic block diagram of a server of the first embodiment of the present invention.

Fig. 9 shows a schematic block diagram of a client of a second embodiment of the present invention.

Fig. 10 is a schematic block diagram showing a vehicle dispatching system of a third embodiment of the present invention.

Detailed ways

Various exemplary embodiments of the present invention will now be described in detail with reference to the drawings. It should be noted that the relative arrangement of the components and steps, numerical expressions and numerical values set forth in the embodiments are not intended to limit the scope of the invention unless otherwise specified.

The following description of the at least one exemplary embodiment is merely illustrative and is in no way

Techniques, methods and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail, but the techniques, methods and apparatus should be considered as part of the specification, where appropriate.

In all of the examples shown and discussed herein, any specific values are to be construed as illustrative only and not as a limitation. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that similar reference numerals and letters indicate similar items in the following figures, and therefore, once an item is defined in one figure, it is not required to be further discussed in the subsequent figures.

<Hardware Configuration>

As shown in FIG. 1, the vehicle system 100 includes a server 1000, a client 2000, a vehicle 3000, and a network 4000.

Server 1000 provides service points for processing, databases, and communication facilities. Server 1000 can be a monolithic server or a decentralized server that spans multiple computers or computer data centers. The server may be of various types such as, but not limited to, a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interactive server, a database server, or a proxy server. In some embodiments, each server may comprise hardware, software, or an embedded logic component or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server such as a blade server, a cloud server, or the like, or may be a server group composed of a plurality of servers, may include one or more of the above types of servers, and the like.

In one example, the server 1000 can include a processor 1100, a memory 1200, an interface device 1300, a communication device 1400, a display device 1500, and an input device 1600, as shown in FIG. Although the server may also include a speaker, a microphone, etc., these components are reasonably unrelated to the present invention and are therefore omitted herein.

The processor 1100 can be, for example, a central processing unit CPU, a microprocessor MCU, or the like. The memory 1200 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1300 includes, for example, a USB interface, a serial interface, an infrared interface, and the like. The communication device 1400 can perform wired or wireless communication, for example. The display device 1150 is, for example, a liquid crystal display, an LED display touch display, or the like. Input device 1160 can include, for example, a touch screen, a keyboard, and the like.

In this embodiment, the client 2000 is an electronic device having a communication function and a service processing function. The client 2000 can be a mobile terminal such as a cell phone, a laptop, a tablet, a palmtop, and the like. In one example, the client 2000 is a device that performs management operations on the vehicle 3000, for example, a mobile phone that is installed with an application (APP) that supports operation and management of the vehicle.

As shown in FIG. 1, client 2000 can include processor 2100, memory 2200, interface device 2300, communication device 2400, display device 2500, input device 2600, speaker 2700, microphone 2800, and the like. The processor 2100 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 2200 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like. The interface device 2300 includes, for example, a USB interface, a headphone jack, and the like. The communication device 2400 can perform, for example, wired or wireless communication. The display device 2500 is, for example, a liquid crystal display, a touch display, or the like. Input device 2600 can include, for example, a touch screen, a keyboard, and the like. The user can input/output voice information through the speaker 2700 and the microphone 2800.

The vehicle 3000 is any vehicle that can be used for sharing by different users in a time-sharing or sub-regional manner, for example, a shared bicycle for sharing, a shared moped, a shared electric vehicle, a shared vehicle, and the like. The vehicle 3000 may be in various forms such as a bicycle, a tricycle, an electric bicycle, a motorcycle, and a four-wheeled passenger car.

As shown in FIG. 1, the vehicle 3000 may include a processor 3100, a memory 3200, an interface device 3300, a communication device 3400, a display device 3500, an input device 3600, a positioning device 3700, a sensor 3800, and the like. The processor 3100 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 3200 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), a nonvolatile memory such as a hard disk, and the like. The interface device 3300 includes, for example, a USB interface, a headphone interface, and the like. The communication device 3400 is capable of, for example, wired or wireless communication. The output device 3500 may be, for example, a device that outputs a signal, and may display a device such as a liquid crystal display, a touch display, or the like, or may output a voice message or the like. The input device 3600 may include, for example, a touch screen, a keyboard, or the like, or may be a microphone input voice information. The positioning device 3700 is configured to provide a positioning function, such as a GPS positioning module, a Beidou positioning module, and the like. The sensor 3800 is used to acquire vehicle attitude information, such as an accelerometer, a gyroscope, or a three-axis, six-axis, nine-axis microelectromechanical system (MEMS), or the like.

The network 4000 may be a wireless communication network or a wired communication network, and may be a local area network or a wide area network. In the article management system shown in FIG. 1, the vehicle 3000 and the server 1000, the client 2000, and the server 1000 can communicate via the network 4000. In addition, the network 4000 on which the vehicle 3000 communicates with the server 1000, the client 2000, and the server 1000 may be the same or different.

It should be understood that although FIG. 1 shows only one server 1000, client 2000, and vehicle 3000, it is not meant to limit the corresponding number. The vehicle system 100 may include a plurality of servers 1000, clients 2000, and vehicles 3000.

Taking the vehicle 3000 as a shared bicycle as an example, the vehicle system 100 is a shared bicycle system. The server 1000 is used to provide all the functions necessary to support the sharing of bicycle use. The client 2000 can be a mobile phone with a shared bicycle application installed thereon, and the shared bicycle application can assist the user in using the vehicle 3000 to obtain corresponding functions and the like.

The vehicle system 100 shown in Figure 1 is merely illustrative and is in no way intended to limit the invention, its application or use.

In the embodiment of the present invention, although FIG. 1 shows only one server 1000, one client 2000, and one vehicle 3000, it should be understood that, in a specific application, the vehicle system 100 may be included according to actual needs. A plurality of servers 1000, a plurality of clients 2000, and a plurality of vehicles 3000.

In an embodiment of the present invention, the memory 1200 of the server 1000 is for storing instructions for controlling the processor 1100 to operate to perform the vehicle scheduling method provided in the embodiments of the present invention.

Although a plurality of devices are shown for server 1000 in FIG. 1, the present invention may relate only to some of the devices therein, for example, server 1000 only relates to memory 1200 and processor 1100.

In an embodiment of the present invention, the memory 2200 of the client 2000 is configured to store instructions for controlling the processor 2100 to operate the client 2000 to perform the vehicle scheduling method provided in the embodiments of the present invention.

Although a plurality of devices are shown for client 2000 in FIG. 1, the present invention may relate only to some of the devices therein, for example, client 2000 only relates to memory 2200 and processor 2100.

In the above description, a person skilled in the art can design instructions in accordance with the disclosed aspects of the present invention. How the instructions control the processor for operation is well known in the art and will not be described in detail herein.

<First Embodiment>

<method>

In this embodiment, a vehicle scheduling method is provided. The vehicle is a transportation device that is placed for the user to acquire the usage right in a time sharing manner, a land lease, or the like. The vehicle may be a two- or three-wheel bicycle, a moped, Electric vehicles can also be four or more motor vehicles.

The vehicle scheduling method, as shown in FIG. 2, includes: steps S2100-S2200.

Step S2100: After the user performs scheduling on the target vehicle, determine a scheduling start point and a scheduling end point that the user performs scheduling on the target vehicle, and obtain corresponding excitation parameters.

In this embodiment, the user can obtain the use right of the target vehicle in a time-sharing manner, a land lease, or the like, and travel through the target vehicle. When the user travels through the target vehicle, the scheduling of the target vehicle can be simultaneously performed, that is, when the user travels through the target vehicle, the target vehicle is caused to reach the dispatch destination from the dispatch starting point, and the scheduling of the target vehicle is completed.

In the process of the user performing the scheduling on the target vehicle, the positioning module of the target vehicle or the positioning module of the client used by the user may be positioned to determine the scheduling starting point and the scheduling end point of the user performing scheduling on the target vehicle, for example, when the vehicle is a shared bicycle. The starting point of the scheduling is the starting point of the user's riding, and the ending point of the scheduling is the ending point of the user's riding.

The excitation parameter is a parameter related to a scheduling excitation value that can be acquired after the user implements the vehicle scheduling, and includes at least a reference scheduling cost, a user excitation coefficient, and a scheduling supply and demand coefficient.

The baseline scheduling cost is a baseline value used to evaluate the costs associated with implementing a vehicle scheduling behavior.

Specifically, the acquisition reference scheduling cost may be calculated according to a preset excitation mean value, an excitation maximum value, an excitation minimum value, and an excitation fluctuation coefficient.

Assuming that the excitation mean is Avg, the excitation maximum is Max, the excitation minimum is Min, and the excitation fluctuation coefficient is σ, the baseline scheduling cost Y can be calculated according to the following formula:

Where X = e ^{μ + σ × Z} + Min, Z ~ Norm (0, 1), Z is a random number between 0 and 1 obeying the normal distribution; μ can pass

Seek.

In this embodiment, the excitation mean Avg, the excitation maximum value Max, the excitation minimum value Min, and the excitation fluctuation coefficient σ may be set according to specific application scenarios, for example, different scheduling areas (different cities or different administrative regions) may be set differently. Avg, excitation maximum value Max, excitation minimum value Min, excitation fluctuation coefficient σ. In one example, the excitation fluctuation coefficient σ can be set to one.

The user incentive coefficient is a coefficient related to the user that reflects the user's participation in vehicle scheduling.

Specifically, the scheduling behavior parameter of the user may be acquired, and the user excitation coefficient is calculated and calculated.

The scheduling behavior parameter includes at least one of a sharing factor, a finding factor, a scheduling scale factor, and a cheating factor.

The sharing factor is used to indicate whether the corresponding user has a sharing promotion vehicle scheduling behavior. Specifically, the sharing factor may be set according to whether the user has the sharing scheduling incentive value in the latest preset duration. The latest preset duration may be selected according to the specific application scenario. For example, it can be set to the last 7 days. The weight corresponding to the sharing factor configuration may be selected by the specific application scenario, for example, selected as 2.5. When the user has the corresponding behavior in the most recent preset duration, the sharing factor is 2.5, otherwise, it is 0.

The search factor is used to indicate whether the user has an active participation in the vehicle scheduling behavior. Specifically, the search factor may be set according to whether the user has found the behavior of the vehicle that needs to be scheduled according to the latest preset duration. The latest preset duration may be selected according to the specific application scenario. For example, it can be set to the last 7 days. Find the weight corresponding to the factor configuration, and the weight can be specifically selected for the scene selection, for example, selected as 1.5. When the user has a corresponding behavior in the most recent preset duration, the search factor is 1.5, otherwise, it is 0.

The scheduling scale factor is used to characterize the frequency of the real-time vehicle scheduling behavior of the user. Specifically, the scheduling scale factor may be set according to whether the ratio of the number of scheduled vehicles and the total number of used vehicles in the latest preset duration exceeds a preset ratio threshold. The preset duration and the preset ratio threshold can be selected according to the specific application scenario. For example, the latest preset duration can be set to the last 7 days, and the preset proportional threshold can be set to 50%. The scheduling scale factor is configured with a corresponding weight, and the weight can be specifically selected for the scenario selection, for example, selected as 0.8. When the proportion of the user scheduling the vehicle within the most recent preset time exceeds the preset ratio threshold, the scheduling scale factor takes a value of 0.8, otherwise, the value is 0.

In practical applications, the user may not implement the vehicle usage behavior when using the vehicle to defraud the scheduling incentive value of the vehicle scheduling. For example, when the vehicle is a bicycle, the user may defraud the dispatching incentive value of the vehicle dispatch by unlocking the bicycle but not actually riding, and may be determined by the bicycle being stopped and the bicycle is stopped in place.

The cheating factor is used to characterize the user's level of integrity in implementing vehicle scheduling behavior. Specifically, the cheat factor may be set according to whether the proportion of the usage behavior that does not actually occur when the vehicle is used by the user in the preset number of times exceeds a preset ratio threshold setting. The preset preset number and the preset ratio threshold may be set according to a specific application scenario. For example, the most recent preset number may be 10 times, and the preset proportional threshold may be set to 50%. The cheating factor is configured with a corresponding weight, and the weight can be specifically selected for the scene selection, for example, selected as 0.01. The value is 0 when the user does not actually use the behavior when the vehicle is used for the preset number of times. The value is 0. Otherwise, the value is 0.01.

Assuming that the sharing factor is W ₁ , the finding factor is W ₂ , the scheduling scale factor is W _{3 ,} and the cheat factor is W ₄ , the user excitation coefficient W can be calculated according to the following formula:

W = W ₁ × W ₂ × W ₃ × W _{4 .}

In the actual operation process, the number of vehicles in different regions is different, and the supply and demand of vehicles are not related. In the region where the supply and demand relationship of vehicles is not balanced, vehicle scheduling needs to be implemented to adjust the supply and demand relationship of vehicles in this region to balance.

The scheduling supply and demand coefficient is used to characterize the impact of vehicle scheduling implemented by the user on the vehicle supply and demand relationship. By scheduling the supply and demand relationship, it is possible to assess the degree of adjustment of the vehicle supply and demand relationship by the vehicle implementation implemented by the user.

Specifically, calculating the acquisition scheduling supply and demand coefficient may be performed by the method shown in FIG. 3: including steps S2110-S2120.

Step S2110: Acquire a scheduling start point and a scheduling level of the scheduling end point.

The scheduling level is used to evaluate the requirements of the corresponding dispatch area to implement vehicle scheduling.

The step of obtaining the scheduling level of the scheduling start point may be as shown in FIG. 4, including: steps S2111-S2112.

Step S2111: Select a space-time unit corresponding to the scheduling start point in the set of space-time units, and calculate a vehicle distribution index and a vehicle collection index of the corresponding space-time unit.

The space-time unit set includes a plurality of spatio-temporal units obtained by dividing the scheduling area, and each of the spatio-temporal units has a corresponding time period and a geographical position.

In this embodiment, the scheduling area is an area where there is a vehicle scheduling requirement, and the scheduling area may be set according to actual vehicle scheduling requirements, such as a certain city or an administrative area of a certain city. The scheduling area may be divided according to specific time and space dimensions, and a corresponding set of spatio-temporal units including a plurality of spatio-temporal units is obtained, and each spatio-temporal unit has a corresponding time period and a geographical position. Specifically, the granularity of the time period or geographic location can be set according to specific application requirements.

For example, the 24 hours a day can be divided into 24 time segments, and the scheduling area is divided into fine meshes of 100 meters*100 meters, and divided into time and space dimensions respectively to obtain corresponding space-time units, as shown in FIG. 5 Show.

Obtaining a scheduling start time for the user to perform scheduling on the target vehicle, and selecting a space-time unit corresponding to the scheduling starting point in the set of space-time units according to the scheduling starting time and the specific geographic location of the scheduling location.

When the vehicle is used by the user, the vehicle will leave a certain space-time unit according to the user's needs and enter another time-space unit. For each space-time unit, there will be vehicles entering or leaving during their corresponding time periods. The space-time unit acts as a node of the transportation network, and there is a dynamic change in collecting the vehicle (vehicle entering) or distributing the vehicle (vehicle leaving).

The vehicle collection index is used to characterize the ability of the corresponding space-time unit to collect vehicles from other of the space-time units within a corresponding time period. The vehicle distribution index is used to characterize the ability of the corresponding space-time unit to distribute the vehicle to other of the space-time units within a corresponding time period.

For example, the time period of the space-time unit u is 8:00-9:00 in the morning, and its vehicle collection index is the ability to characterize the collection of vehicles from other time-space units during this time period, and the vehicle distribution index is used to characterize the time period. The ability to distribute vehicles to other such space-time units.

Specifically, the step of calculating the vehicle collection index and the vehicle distribution index of the space-time unit may be as shown in FIG. 6, and includes:

Step S2111-1, the space-time unit calculates, according to the historical travel record, a first link weight set obtained by using the space-time unit as a travel start point and a second link weight set using the space-time unit as a travel end point,

The historical travel record includes a plurality of historical trips, where the historical trip includes the space-time unit as a starting point of the trip and the spatio-temporal unit as an end point of the trip, where the first link weight set includes a The other space-time unit other than the space-time unit is a link weight of each link of the end of the trip, and the second link weight set includes the other space-time unit except the space-time unit as a starting point of the trip. The link weight of each link.

Step S2111-2, calculating and acquiring the vehicle distribution index according to the first link weight set and the preset smoothing coefficient, and calculating the acquired vehicle collection index according to the second link weight set and the smoothing coefficient.

Historical trip records can be obtained from the vehicle history usage record. For example, when the vehicle is a shared bicycle, it can be obtained from the bicycle history order information stored in the order server corresponding to the shared bicycle system that provides the shared bicycle service. Correspondingly, each historical trip corresponds to a historical order information, and the starting point of the trip is the user riding. The space-time unit where the starting point of the line is, and the end point of the trip is the space-time unit where the user's riding end is located.

The preset smoothing factor can be set according to the engineering experience value or the experimental simulation value, for example, it can be set to 0.85.

For example, it is assumed that all N+1 space-time units u _n (n=0, . . . , N) obtained by the scheduling area division constitute a space-time unit set G, wherein each u _n (b _n , t _n ) has a corresponding Time period t _n and geographic location b _n ;

The historical itinerary is recorded as a historical itinerary set O including a plurality of historical itineraries, including M+1 historical itineraries o _j (j=0,...,M) in the set O, each historical itinerary is o _j (start_geogrid , start_timeslot, end_geogrid, end_timeslot), where start_geogrid is the geographic location of the space-time unit as the starting point of the journey, start_timeslot is the time period of the space-time unit as the starting point of the journey, end_geogrid is the geographical position of the space-time unit as the end of the journey, and end_timeslot is used as the itinerary The ground time period of the space-time unit of the end point, specifically, the link diagram corresponding to the historical travel may be as shown in FIG. 7;

For the spatio-temporal unit u _p (b _p , t _p ) is the starting point of the journey, and the spatio-temporal unit u _q (b _q , t _q ) is the end of the travel end, the corresponding link weight W(u _p , u _q ) is:

among them,

Similarly, ω(u _n , u _q ) can also be obtained, and will not be described again here.

According to the above method of calculating W(u _p , u _q ), each space-time unit u _p (b _p , t _p ) (p=0, . . . , N) can be obtained as the starting point of the journey to other space-time units u _p (b _p , t _p ) ∈ G(p ≠ q) is the link weight of the end of the stroke, thereby obtaining the first link weight set {W(u _p , u _q )};

Iterating according to the first link weight set {W(u _p , u _q )} of the candidate space-time unit u _p (b _p , t _p )(p=0, . . . , N), the preset smoothing coefficient d Calculate the vehicle distribution index:

Initialization: PRd ₀ (u _p )=1(u _p ∈G, p=0,...,N);

The tth calculation:

when

The iteration calculation is aborted, and the corresponding vehicle distribution index PRd(u _p )=PRd _t (u _p ) is obtained, where α is a preset difference threshold, which can be set according to experimental simulation or engineering experience;

For the spatio-temporal unit u _p (b _p , t _p ) is the end of the travel, the spatio-temporal unit u _q (b _q , t _q ) is the starting point of the journey, and the corresponding link weight W(u _q , u _p ) is:

among them,

Similarly, ω(u _q , u _n ) can also be obtained, and details are not described herein again.

According to the above method of calculating W(u _q , u _p ), the space-time unit u _p (b _p , t _p ) can be obtained as the end of the stroke, and every other space-time unit u _p (b _p ,t _p )∈G(p ≠q) is the link weight of the starting point of the journey, thereby obtaining a second link weight set {W(u _q , u _p )};

Iterating according to the second link weight set {W(u _q , u _p )} of the candidate space-time unit u _p (b _p , t _p )(p=0, . . . , N), the preset smoothing coefficient d Calculate the vehicle collection index:

Initialization: PRc ₀ (u _p )=1(u _p ∈G, p=0,...,N);

The tth calculation:

when

When the iterative calculation is aborted, the corresponding vehicle collection index PRc(u _p )=PRc _t (u _p ) is obtained, where α is a preset difference threshold, which can be set according to experimental simulation or engineering experience.

Similarly, the vehicle distribution index and the vehicle collection index of any one of the space-time units can be calculated. For the space-time unit corresponding to the scheduling start point, the vehicle distribution index and the vehicle collection index may be calculated as described in FIG. 6.

Step S2112, determining a scheduling level of the scheduling starting point according to the vehicle distribution index and the vehicle collection index.

Specifically, the scheduling level of the scheduling start point may be determined according to a preset level threshold:

When the vehicle distribution index is greater than the level threshold, the scheduling level is the first level;

When the vehicle collection index is greater than the level threshold, the scheduling level is the third level;

Otherwise, the scheduling level is the second level.

The level threshold can be set according to engineering experience or experimental simulation, for example, setting the level threshold to 1. Correspondingly, when the vehicle distribution index is greater than 1, the scheduling level is the first level, and when the vehicle collection index is greater than 1, the scheduling level is the third level; otherwise, the scheduling level is the second level.

It should be understood that the scheduling level may not be limited to the first, second, and third levels, and may also be classified into three categories, for example, A, B, and C. The scheduling level can also be divided into more levels according to specific application scenarios, and different levels of thresholds are respectively set for division, etc., which are not enumerated here.

Similar to the method shown in FIG. 4, the steps of acquiring the scheduling level of the scheduling endpoint include:

Selecting a space-time unit corresponding to the scheduling end point in the set of space-time units, calculating a vehicle distribution index and a vehicle collection index of the corresponding space-time unit, and determining the scheduling end point according to the vehicle distribution index and the vehicle collection index. Scheduling level;

Obtaining a scheduling end time for the user to perform scheduling on the target vehicle, and selecting a space-time unit corresponding to the scheduling end point in the set of space-time units according to the scheduling end time and the specific geographic location of the scheduling end point;

After the time-space unit of the scheduling end point is selected, the vehicle distribution index and the vehicle collection index of the space-time unit may be calculated, and the step of determining the scheduling level of the scheduling end point according to the vehicle distribution index and the vehicle collection index may be performed as shown in FIG. 6 . The steps of determining the scheduling level of the scheduling start point are similar, and are not described here.

Step S2120: Determine a scheduling supply and demand coefficient according to a scheduling level of the scheduling starting point, a scheduling level of the scheduling end point, and a preset scheduling supply and demand coefficient configuration table.

The scheduling supply and demand coefficient configuration table includes a scheduling supply and demand coefficient from a scheduling starting point of different scheduling levels and a scheduling ending point of reaching the different scheduling levels.

For example, suppose the scheduling level is divided into three levels: A, B, and C. The scheduling supply and demand coefficient configuration table can be pre-configured as follows:

It is assumed that the user performs scheduling on the target vehicle from the scheduling starting point of the scheduling level A to the scheduling end point of the scheduling level C. According to the scheduling supply and demand coefficient configuration table, the scheduling supply and demand coefficient can be determined to be 0.1.

It should be understood that the scheduling supply and demand coefficient configuration table is set according to engineering experience or experimental simulation for a specific application scenario. I will not list them here.

Step S2200: Provide a corresponding scheduling incentive value to the user according to the excitation parameter to motivate the user to implement vehicle scheduling.

In this embodiment, the scheduling incentive value may be a user integral value, an incentive amount, and the like that motivate the user to implement vehicle scheduling.

Specifically, assuming that the excitation parameter includes the reference scheduling cost Y, the user excitation coefficient W, and the scheduling supply and demand coefficient S, the corresponding scheduling incentive value M can be obtained according to the following formula:

M = Y × W × S.

By providing the user with a scheduling incentive value corresponding to the vehicle scheduling behavior after the user performs scheduling on the target vehicle, the user can be guided to participate in the vehicle scheduling. Improve the enthusiasm of users to participate in vehicle scheduling. Reduce the operational labor cost of vehicle scheduling. Improve scheduling efficiency.

<server>

In this embodiment, a server 200 is further provided for implementing vehicle scheduling, as shown in FIG. 8, including:

a memory 210, configured to store executable instructions;

The processor 220 is configured to execute, according to the instruction, the server 200 to perform the vehicle scheduling method according to any one of the embodiments provided in this embodiment.

In this embodiment, the server 200 can be in various physical forms. For example, server 200 can be a cloud server. Server 200 can also be server 1000 as shown in FIG.

Those skilled in the art will appreciate that server 200 can be implemented in a variety of ways. For example, server 200 can be implemented by an instruction configuration processor. For example, the instructions can be stored in the ROM, and when the device is booted, the instructions are read from the ROM into the programmable device to implement the server 200. For example, server 200 can be cured into a dedicated device (eg, an ASIC). The server 200 can be divided into mutually independent units, or they can be implemented together. The server 200 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.

The vehicle scheduling method and the server provided in the embodiment are described above with reference to the accompanying drawings. According to the embodiment, the scheduling incentive behavior corresponding to the vehicle scheduling behavior can be provided to the user according to the scheduling behavior performed by the user on the target vehicle, and the user is guided. Participate in vehicle scheduling. Improve the enthusiasm of users to participate in vehicle scheduling. Reduce the operational labor cost of vehicle scheduling. Improve scheduling efficiency.

<Second embodiment>

In this embodiment, a vehicle scheduling method is provided, including:

After the user implements scheduling of the target vehicle, a scheduling incentive display interface is provided to display the acquired scheduling incentive value to the user.

The scheduling incentive value is obtained according to the vehicle scheduling method described in any one of the first embodiments, and details are not described herein again.

In this embodiment, the scheduling incentive display interface is a human-computer interaction interface that provides display and operation, and is directed to a user who uses the vehicle. It may be provided by a user-oriented vehicle application (APP) installed by the apparatus implementing the embodiment. By scheduling the incentive display interface, the user can confirm the acquired scheduling incentive value after performing scheduling on the target vehicle. Achieve guiding users to participate in vehicle scheduling. Improve the enthusiasm of users to participate in vehicle scheduling. Reduce the operational labor cost of vehicle scheduling. Improve scheduling efficiency.

<client>

In this embodiment, a client 300 is also provided. As shown in FIG. 9, the method includes:

a display device 310, configured to display a human-computer interaction interface;

a memory 320, configured to store executable instructions;

The processor 300 is configured to run the server according to the control of the instruction to execute the vehicle scheduling method provided by the embodiment.

In this embodiment, the client 300 can be in various physical forms. For example, client 300 can be a cell phone. Client 300 can also be client 2000 as shown in FIG.

Those skilled in the art will appreciate that the client 300 can be implemented in a variety of ways. For example, client 300 can be implemented by an instruction configuration processor. For example, the instructions can be stored in the ROM, and when the device is booted, the instructions are read from the ROM into the programmable device to implement the client 300. For example, client 300 can be cured into a dedicated device (eg, an ASIC). The client 300 can be divided into mutually independent units, or they can be combined and implemented. The client 300 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.

The vehicle scheduling method and the client provided by the embodiment are described above with reference to the accompanying drawings. According to the embodiment, the user who implements the vehicle scheduling is provided with a scheduling incentive display interface, so that the user confirms the acquired scheduling incentive value. Achieve guiding users to participate in vehicle scheduling. Improve the enthusiasm of users to participate in vehicle scheduling. Reduce the operational labor cost of vehicle scheduling. Improve scheduling efficiency.

<Third embodiment>

In this embodiment, a vehicle scheduling system 400 is provided, as shown in FIG. 10, including:

The server 200 provided by the first embodiment, and the client 300 provided by the second embodiment.

In the present embodiment, the vehicle dispatch system 400 can also include a vehicle, for example, the vehicle system 100 can be as shown in FIG.

In the vehicle scheduling system 400, the vehicle scheduling method provided in the first embodiment may be implemented by the server 200, and a user who performs scheduling to the target vehicle is provided with a corresponding scheduling incentive value, and the client 300 is held by the user. The scheduling incentive display interface displays the acquired scheduling incentive value to the user, and can guide the user to participate in vehicle scheduling. Improve the enthusiasm of users to participate in vehicle scheduling. Reduce the operational labor cost of vehicle scheduling. Improve scheduling efficiency.

The invention can be a system, method and/or computer program product. The computer program product can comprise a computer readable storage medium having computer readable program instructions embodied thereon for causing a processor to implement various aspects of the present invention.

The computer readable storage medium can be a tangible device that can hold and store the instructions used by the instruction execution device. The computer readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (non-exhaustive list) of computer readable storage media include: portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM) Or flash memory), static random access memory (SRAM), portable compact disk read only memory (CD-ROM), digital versatile disk (DVD), memory stick, floppy disk, mechanical encoding device, for example, with instructions stored thereon A raised structure in the hole card or groove, and any suitable combination of the above. A computer readable storage medium as used herein is not to be interpreted as a transient signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (eg, a light pulse through a fiber optic cable), or through a wire The electrical signal transmitted.

The computer readable program instructions described herein can be downloaded from a computer readable storage medium to various computing/processing devices or downloaded to an external computer or external storage device over a network, such as the Internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium in each computing/processing device .

Computer program instructions for performing the operations of the present invention may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine related instructions, microcode, firmware instructions, state setting data, or in one or more programming languages. Source code or object code written in any combination, including object oriented programming languages such as Smalltalk, C++, etc., as well as conventional procedural programming languages such as the "C" language or similar programming languages. The computer readable program instructions can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer, partly on the remote computer, or entirely on the remote computer or server. carried out. In the case of a remote computer, the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or wide area network (WAN), or can be connected to an external computer (eg, using an Internet service provider to access the Internet) connection). In some embodiments, the customized electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), can be customized by utilizing state information of computer readable program instructions. Computer readable program instructions are executed to implement various aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus, and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowcharts and/or block diagrams can be implemented by computer readable program instructions.

The computer readable program instructions can be provided to a general purpose computer, a special purpose computer, or a processor of other programmable data processing apparatus to produce a machine such that when executed by a processor of a computer or other programmable data processing apparatus Means for implementing the functions/acts specified in one or more of the blocks of the flowcharts and/or block diagrams. The computer readable program instructions can also be stored in a computer readable storage medium that causes the computer, programmable data processing device, and/or other device to operate in a particular manner, such that the computer readable medium storing the instructions includes An article of manufacture that includes instructions for implementing various aspects of the functions/acts recited in one or more of the flowcharts.

The computer readable program instructions can also be loaded onto a computer, other programmable data processing device, or other device to perform a series of operational steps on a computer, other programmable data processing device or other device to produce a computer-implemented process. Thus, instructions executed on a computer, other programmable data processing apparatus, or other device implement the functions/acts recited in one or more of the flowcharts and/or block diagrams.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality and operation of possible implementations of systems, methods and computer program products according to various embodiments of the invention. In this regard, each block in the flowchart or block diagram can represent a module, a program segment, or a portion of an instruction that includes one or more components for implementing the specified logical functions. Executable instructions. In some alternative implementations, the functions noted in the blocks may also occur in a different order than those illustrated in the drawings. For example, two consecutive blocks may be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved. It is also noted that each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts, can be implemented in a dedicated hardware-based system that performs the specified function or action. Or it can be implemented by a combination of dedicated hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, implementation by software, and implementation by a combination of software and hardware are equivalent.

The embodiments of the present invention have been described above, and the foregoing description is illustrative, not limiting, and not limited to the disclosed embodiments. Numerous modifications and changes will be apparent to those skilled in the art without departing from the scope of the invention. The choice of terms used herein is intended to best explain the principles, practical applications, or technical improvements in the various embodiments of the embodiments, or to enable those of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims (10)

1. A vehicle scheduling method, comprising:

   After the user performs scheduling on the target vehicle, determining a scheduling start point and a scheduling end point for the user to perform scheduling on the target vehicle, and acquiring corresponding excitation parameters,

   Wherein, the excitation parameter includes at least a reference scheduling cost, a user excitation coefficient, and a scheduling supply and demand coefficient;

   Based on the excitation parameters, a corresponding scheduling incentive value is provided to the user to motivate the user to implement vehicle scheduling.
2. The method of claim 1 further comprising:

   The reference scheduling cost is calculated according to a preset excitation mean value, an excitation maximum value, an excitation minimum value, and an excitation fluctuation coefficient.
3. The method according to claim 1 or 2, further comprising:

   Obtaining a scheduling behavior parameter of the user, and calculating and obtaining the user excitation coefficient,

   The scheduling behavior parameter includes at least one of a sharing factor, a finding factor, a scheduling scale factor, and a cheating factor.

   The sharing factor is set according to whether the user has the behavior of sharing the scheduling incentive value in the most recent preset duration; the searching factor is based on whether the user has found the behavior setting of the vehicle that needs to be scheduled according to the latest preset duration; The scheduling scale factor is set according to whether the ratio of the number of scheduled vehicles and the total number of used vehicles in the latest preset time period exceeds a preset ratio threshold setting; the cheat factor does not actually occur when the vehicle is used according to the user's latest preset number of times Whether the ratio exceeds the preset ratio threshold setting.
4. The method of any of claims 1-3, further comprising:

   Obtaining a scheduling start point and a scheduling level of the scheduling end point;

   Determining the scheduling supply and demand coefficient according to a scheduling level of the scheduling starting point, a scheduling level of the scheduling end point, and a preset scheduling supply and demand coefficient configuration table,

   The scheduling supply and demand coefficient configuration table includes scheduling supply and demand coefficients from different scheduling levels of the scheduling level and scheduling end points of different scheduling levels.
5. The method according to any one of claims 1 to 4, wherein the step of acquiring the scheduling start point and the scheduling level of the scheduling end point comprises:

   Selecting a space-time unit corresponding to the scheduling start point in the set of space-time units, calculating a vehicle distribution index and a vehicle collection index of the corresponding space-time unit, and determining a scheduling of the scheduling starting point according to the vehicle distribution index and the vehicle collection index. grade;

   as well as

   Selecting a space-time unit corresponding to the scheduling end point in the set of space-time units, calculating a vehicle distribution index and a vehicle collection index of the corresponding space-time unit, and determining the scheduling end point according to the vehicle distribution index and the vehicle collection index. Scheduling level;

   The space-time unit set includes a plurality of space-time units divided by the scheduling area, and each of the space-time units has a corresponding time period and a geographical position.
6. The method according to any one of claims 1 to 5, wherein the calculating the step of acquiring the corresponding vehicle distribution index and the vehicle collection index of the space-time unit comprises:

   And acquiring, by the time-space unit, a first link weight set that uses the space-time unit as a travel start point and a second link weight set that uses the space-time unit as a travel end point according to a historical travel record,

   The historical travel record includes a plurality of historical trips, where the historical trip includes the space-time unit as a starting point of the trip and the spatio-temporal unit as an end point of the trip, where the first link weight set includes a The other space-time unit other than the space-time unit is a link weight of each link of the end of the trip, and the second link weight set includes the other space-time unit except the space-time unit as a starting point of the trip. Link weight of each link;

   Acquiring and acquiring the vehicle distribution index according to the first link weight set and a preset smoothing coefficient, and calculating and acquiring the vehicle collection index according to the second link weight set and the smoothing coefficient.
7. A vehicle scheduling method includes:

   After the user implements scheduling of the target vehicle, providing a scheduling incentive display interface to display the acquired scheduling incentive value to the user.

   The scheduling incentive value is obtained according to the vehicle scheduling method according to any one of claims 1-6.
8. A server for implementing vehicle scheduling, including:

   a memory for storing executable instructions;

   a processor for operating the server to perform the vehicle scheduling method according to any one of claims 1-6 in accordance with control of the instructions.
9. A client for implementing vehicle scheduling, including:

   Display device for displaying a human-computer interaction interface;

   a memory for storing executable instructions;

   a processor for operating the server to perform the vehicle scheduling method of claim 8 in accordance with control of the instructions.
10. A vehicle system comprising:

    The server of claim 8;

    And the client of claim 9.

Images