CN114595953B

CN114595953B - Method and system for scheduling shared electric bicycle

Info

Publication number: CN114595953B
Application number: CN202210191028.2A
Authority: CN
Inventors: 周坤鹏; 陶金; 刘光能; 郭其标; 周坤洋
Original assignee: Qeebike Technology Co ltd
Current assignee: Qeebike Technology Co ltd
Priority date: 2022-03-01
Filing date: 2022-03-01
Publication date: 2024-06-14
Anticipated expiration: 2042-03-01
Also published as: CN114595953A

Abstract

The invention discloses a method and a system for dispatching a shared electric bicycle, belonging to the technical field of shared electric bicycle data processing for management purposes, wherein the method comprises the following steps: acquiring unlocking quantity of a parking spot and stay time of a shared electric bicycle; screening candidate scheduling points from the parking points according to the unlocking quantity and the stay time; acquiring a shared electric bicycle to be scheduled; selecting a scheduling point from the candidate scheduling points according to the unlocking quantity and the current vehicle number; and dispatching the sharing electric bicycle to be dispatched to the dispatching point. The data of the unlocking quantity is analyzed, candidate dispatching points are screened out, analysis is carried out according to the unlocking quantity and the current number of vehicles in the parking points, whether the current parking points need to be dispatched into the vehicles or not is judged, namely, the dispatching points are dispatched into the dispatching points, the sharing electric bicycle to be dispatched is dispatched into the dispatching points, and through development and utilization of the data, the situation that no vehicle is available at the hot-spot parking points is prevented, and user experience is improved.

Description

Method and system for scheduling shared electric bicycle

Technical Field

The invention relates to the technical field of shared electric bicycle data processing for management, in particular to a method and a system for scheduling shared electric bicycles.

Background

The shared electric bicycle has entered each city, brings convenience to the people going out and solves the problem of the last kilometer. However, motor lanes, residential communities, schools, river courses, enterprise parks, remote areas and the like, and the danger is caused by the fact that the shared electric bicycle enters the areas, or normal life of other people is disturbed, and meanwhile safety of the shared electric bicycle is affected, so that the shared electric bicycle is possibly damaged. Meanwhile, in the actual operation process of the shared electric bicycle, the phenomena of uneven hot spot distribution on the usage amount, sudden increase or decrease of the temporary sudden usage amount and the like exist, and even the tidal phenomenon of the early peak and the late peak in the middle of the day exists, so that the occurrence of the phenomena brings difficulty and even challenges to the dispatching and the distribution of the shared electric bicycle.

Therefore, a method for scheduling the shared electric bicycle is needed, the shared electric bicycle is reasonably scheduled, and the user experience is improved.

Disclosure of Invention

Aiming at the technical problems in the prior art, the invention provides a method and a system for scheduling shared electric bicycles, which screen a scheduling point through historical unlocking quantity, prevent no vehicles from being available at a hot spot parking point and improve the user experience.

The invention discloses a method for scheduling a shared electric bicycle, which comprises the following steps: acquiring unlocking quantity of a parking spot and stay time of a shared electric bicycle; screening candidate scheduling points from the parking points according to the unlocking quantity and the stay time; acquiring a shared electric bicycle to be scheduled; selecting a scheduling point from the candidate scheduling points according to the unlocking quantity and the current vehicle number; and dispatching the sharing electric bicycle to be dispatched to the dispatching point.

Preferably, the method for selecting the scheduling point from the candidate scheduling points comprises the following steps:

Predicting unlocking quantity in a period of time according to the historical unlocking quantity of the candidate scheduling points;

And selecting a scheduling point from the candidate scheduling points according to the predicted unlocking quantity and the current vehicle number.

Preferably, a scheduling point is selected from the candidate scheduling points according to the predicted unlocking amount, the current vehicle number and the weighted value.

Preferably, the conditional formula for selecting the tuning point is expressed as:

A/(k+1)+n>B （1）

（2）

Wherein, a/(k+1) represents a predicted unlocking amount, n is a weighted value, B represents an existing vehicle, i represents a day, i= -m represents a previous m days, h represents a scheduling period, h+k represents a next k scheduling periods, and U represents an unlocking amount of a scheduling point.

Preferably, the shared electric bicycle to be scheduled comprises any one or a combination of the following vehicles: a parked vehicle, a new vehicle, a serviced vehicle, and an idle vehicle.

Preferably, the method for judging the idle vehicle comprises the following steps:

judging whether the shared electric bicycle meets a first condition or not, wherein the first condition comprises:

T3>（T1+T2×P）（11）

Wherein T3 is the stay time of the shared electric bicycle at the parking spot, T1 is the average stay time of the shared electric bicycle in the region, T2 is the average interval time of the shared electric bicycle in the region, and P is the effect weighting value.

Preferably, the shared electric bicycle to be scheduled is expressed as:

Bd=B1+B2+B3

Wherein Bd is represented as a shared electric bicycle to be dispatched, B1 is represented as a parking violation vehicle, B2 is represented as a new vehicle or a repaired vehicle, and B3 is represented as an idle vehicle.

Preferably, the method for emergency vehicle dispatch includes:

Judging whether the shared electric bicycle to be scheduled is an emergency vehicle or not;

if yes, taking the nearest tuning-in point of the emergency vehicle as an executing tuning-in point;

and dispatching the shared electric bicycle to be dispatched to the execution dispatching point.

Preferably, the method further comprises the step of selecting the scheduling point according to the capacity of the scheduling point:

Judging whether the shared electric bicycle or the existing vehicle to be scheduled exceeds the capacity of the scheduling point;

If the scheduling point exceeds the scheduling point, the scheduling point is a non-scheduling point.

The invention also provides a system for realizing the method, which comprises a first acquisition module, a dispatching point screening module, a second acquisition module, a dispatching point screening module and an execution module,

The first acquisition module is used for acquiring unlocking quantity of a parking spot and stay time of the shared electric bicycle;

The scheduling point screening module is used for screening candidate scheduling points from the parking points according to the unlocking quantity and the stay time;

the second acquisition module is used for acquiring the shared electric bicycle to be scheduled;

The tuning-in point screening module is used for selecting a tuning-in point from the candidate dispatching points according to the historical unlocking quantity and the current vehicle number,

The execution module is used for dispatching the shared electric bicycle to be dispatched to the dispatching-in point.

Compared with the prior art, the invention has the beneficial effects that: the data of the unlocking quantity is analyzed, candidate dispatching points are screened out, analysis is carried out according to the unlocking quantity and the current number of vehicles in the parking points, whether the current parking points need to be dispatched into the vehicles or not is judged, namely, the dispatching points are dispatched into the dispatching points, the sharing electric bicycle to be dispatched is dispatched into the dispatching points, and through development and utilization of the data, the situation that no vehicle is available at the hot-spot parking points is prevented, and user experience is improved.

Drawings

FIG. 1 is a flow chart of a method of shared electric bicycle scheduling of the present invention;

fig. 2 is a system logic block diagram of the present invention.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

The invention is described in further detail below with reference to the attached drawing figures:

A method of sharing electric bicycle scheduling, as shown in fig. 1, the method comprising:

Step 101: and acquiring unlocking quantity of the parking spot and stay time of the shared electric bicycle. The historical unlocking quantity reflects the vehicle quantity of the parking spot, and the stay time reflects the idle condition of the shared electric bicycle. The unlocking quantity comprises the unlocking quantity and the historical unlocking quantity in the current time period.

Step 102: and screening candidate scheduling points from the parking points according to the unlocking quantity and the stay time. In one embodiment, among the parking spots or parking zones of the front 30 unlocking amounts, 15 parking spots with the shortest stay time are taken as candidate scheduling spots, but not limited thereto.

Step 103: and obtaining the shared electric bicycle to be scheduled. Wherein the shared electric bicycle to be scheduled comprises any one of the following vehicles or a combination thereof: a parked vehicle, a new vehicle, a serviced vehicle, and an idle vehicle.

Step 104: and selecting a scheduling point from the candidate scheduling points according to the unlocking quantity and the current vehicle number.

Step 105: and dispatching the sharing electric bicycle to be dispatched to the dispatching point.

The data of the unlocking quantity is analyzed, candidate dispatching points are screened out, analysis is carried out according to the unlocking quantity and the current number of vehicles in the parking points, whether the current parking points need to be dispatched into the vehicles or not is judged, the shared electric bicycle to be dispatched is dispatched into the dispatching points, the use frequency of the shared electric bicycle is improved through development and utilization of the data, the idle time of the electric bicycle is reduced, no-vehicle availability of the hot parking points is prevented, users needing to use the electric bicycle can find the electric bicycle in time, and user experience is improved.

In step 104, the method for selecting the scheduling point from the candidate scheduling points includes:

step 201: and predicting unlocking quantity in a period of time according to the historical unlocking quantity of the candidate scheduling points.

Step 202: and selecting a scheduling point from the candidate scheduling points according to the unlocking quantity and the current vehicle number. However, the predicted unlocking amount is not limited to this, and a weight value may be set for the predicted unlocking amount, usually with a certain deviation.

Wherein, the conditional formula for selecting the tuning-in point can be expressed as:

A/(k+1)+n>B （1）

（2）

Wherein, a/(k+1) is represented as a predicted unlocking amount or vehicle amount, n is a weighted value, B is represented as an existing vehicle, i is represented as a day, i= -m is represented as the first m days, h is represented as a scheduling period, h+k is represented as the next k scheduling periods, and U is represented as an unlocking amount of a scheduling point. In a specific embodiment, the average value of the current time period h, h+1 time and h+2 time period of the previous 7 days is taken, and h can be calculated in hours or 30 minutes as the predicted unlocking amount. Wherein n is an empirical value that the bicycle at the vehicle returning point in the operation process does not meet the unlocking quantity, and a certain threshold value reaches the optimal scheduling effect by adjusting the weighted value, and can be set and adjusted according to empirical accumulation, for example, set to 5.

For example: the time of idle scheduling is 3 months 20 days 16 hours (h), then the unlocking amount of the scheduling point at 16 hours (h), 17 hours (h+1) and 18 hours (h+2) of 3 months 19 days, 3 months 18 days, 3 months 17 days, 3 months 16 days, 3 months 15 days, 3 months 14 days and 3 months 13 days which are all 7 days is obtained, the average value A/7 is obtained, namely the predicted unlocking amount is obtained, and the weight n is added, if the current vehicle number B of the scheduling point is larger than the current vehicle number B of the scheduling point, the scheduling point is considered as the scheduling point. I.e., m= 7,k =2, then it can be derived by combining equations 1 and 2:

（3）

In the invention, the average unlocking quantity A/(k+1) between the past m days, the h time period and the h+k time period is taken as the predicted unlocking quantity, but the method is not limited to the predicted unlocking quantity, and the unlocking quantity of k time periods in the future can be predicted by a time sequence and a machine learning method.

In step 103, the method for determining the idle vehicle includes:

T3>（T1+T2×P）（11）

wherein T3 is the stay time of the shared electric bicycle at the parking spot, T1 is the average stay time of the shared electric bicycle in the region, T2 is the average interval time of the shared electric bicycle in the region, and P is the effect weighting value. T2 can be obtained using the 24 divided by the daily average electric bicycle frequency for two weeks in the area.

If the first condition is met, the vehicle is idle; if not, the vehicle is a normal vehicle.

The vehicle frequency refers to the use times of the vehicle in one day, and if the vehicle frequency is 6, the vehicle frequency is used for 6 times in 24 hours; while the average dwell time or average inter-vehicle interval duration is 4, i.e. is used once every 4 hours on average. If the average bicycle dwell time at parking spot a is 16 hours, the average bicycle dwell time at parking spot B is 8 hours. The parking time of the single vehicle is changed from 16 hours to 8 hours when the vehicle is scheduled from the parking point A to the parking point B, which means that the parking time of the single vehicle is shortened by 8 hours, and if the average vehicle frequency of the area is 6, the average vehicle frequency of each vehicle in the area is used once every 4 hours, and the vehicle frequency after the vehicle is scheduled is improved because the parking time is shortened by 8 hours. If the P value is set to 1, it represents that the vehicle to be dispatched (the stay time of the vehicle participating in the dispatch is the stay time at the parking point, i.e., the call-out point) is longer by 4 (t2×p=4×1=4) hours than the stay time at the call-in point; if the P value is set to 2, this represents that the vehicle to be scheduled stays 8 (t2=p= 4*2 =8) hours longer than the stay at the call-in point. The larger the number of P is, the fewer the number of vehicles to be scheduled is, and the lower the scheduling cost is; the smaller the number set, the greater the number of vehicles involved in the dispatch, and the greater the dispatch cost.

Wherein, the sharing electric bicycle to be scheduled can be expressed as:

Bd=B1+B2+B3 （12）

When the shared electric bicycle to be scheduled is an emergency vehicle, the method for scheduling the emergency vehicle comprises the following steps:

step 301: judging whether the shared electric bicycle to be scheduled is an emergency vehicle or not;

If yes, go to step 302: taking the nearest tuning-in point of the emergency vehicle as an executing tuning-in point, and executing step 303;

If not, selecting the executing calling point according to the distance between the dispatcher and the calling point.

Step 303: and dispatching the shared electric bicycle to be dispatched to the execution dispatching point. That is, the emergency vehicle has a higher processing priority, can be preset by a manager, and can be set according to the public hazard degree of the vehicle, for example, when the vehicle is parked on a road to cause obstruction to traffic, the emergency vehicle is designed, but the emergency vehicle is not limited to the emergency vehicle.

Parking spots, typically having different capacities, e.g. a park stop, with a capacity of 0, i.e. no vehicle can be parked; the limit stop point is defined by the number or capacity of stops by the municipality.

In step 104, the method of selecting the scheduling point according to the capacity of the scheduling point may also be as follows:

step 401: judging whether the shared electric bicycle or the existing vehicle to be scheduled exceeds the capacity of the scheduling point;

if yes, go to step 402: the scheduling point is a non-scheduling point, i.e. scheduling is not performed.

If not, according to formulas 1 and 2, it is determined whether the call-in point is present.

The invention also provides a system for realizing the method, as shown in figure 2, comprising a first acquisition module 1, a dispatching point screening module 2, a second acquisition module 3, a dispatching point screening module 4 and an execution module 5,

The first acquisition module 1 is used for acquiring unlocking quantity of a parking spot and stay time of the shared electric bicycle;

The scheduling point screening module 2 is used for screening candidate scheduling points from the parking points according to the unlocking quantity and the stay time;

the second acquisition module 3 is used for acquiring the shared electric bicycle to be scheduled;

The tuning-in point screening module 4 is used for selecting a tuning-in point from the candidate scheduling points according to the historical unlocking quantity and the current vehicle number;

the execution module 5 is used for dispatching the sharing electric bicycle to be dispatched to the dispatching-in point.

Specifically, a scheduling task can be generated by combining the shared electric bicycle to be scheduled and the scheduling point, and is allocated to a scheduler for execution.

The method and the system of the invention are not limited to sharing electric bicycles, and are also applicable to sharing bicycles at courts. Parking spots refer to parking areas where electric bicycles or bicycles are shared. The dispatch point is a parking point capable of receiving a vehicle to be dispatched, and generally refers to a parking point where the vehicle is not used and the vehicle needs to be added. The dispatch point refers to a dispatch point for a vehicle to be dispatched. Idle vehicles refer to vehicles which are not ridden for a long time, and are required to be dispatched to a parking point where the vehicles are insufficient, namely, the vehicle stay time is longer than a threshold value, and the idle vehicles are defined. T2 x P: the vehicles participating in dispatch must participate in dispatch for more than T2 x P hours than the stay time of the dispatch point, where the stay time of the vehicle is the stay time of the parking point (i.e., dispatch point) where the vehicle is located.

The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method of sharing electric bicycle scheduling, the method comprising:

acquiring unlocking quantity of a parking spot and stay time of a shared electric bicycle;

Screening candidate scheduling points from the parking points according to the unlocking quantity and the stay time;

Acquiring a shared electric bicycle to be scheduled;

Selecting a scheduling point from the candidate scheduling points according to the predicted unlocking quantity, the current vehicle number and the weighted value;

scheduling the shared electric bicycle to be scheduled to the scheduling point;

wherein, the conditional formula for selecting the tuning-in point is expressed as:

A/(k+1)+n>B (1)

2. The method of claim 1, wherein the shared electric bicycle to be scheduled comprises any one or a combination of the following vehicles: a parked vehicle, a new vehicle, a serviced vehicle, and an idle vehicle.

3. The method of claim 2, wherein the method of determining an idle vehicle comprises:

T3>(T1+T2×P)(11)

4. A method according to claim 3, characterized in that the shared electric bicycle to be scheduled is represented as:

Bd＝B1+B2+B3

5. The method of claim 1, further comprising the method of emergency vehicle dispatch comprising:

6. The method of claim 1, further comprising the step of selecting a scheduling point based on the scheduling point capacity:

7. A system for implementing the method of any one of claims 1-6, comprising a first acquisition module, a dispatch point screening module, a second acquisition module, a call-in point screening module, and an execution module,