Scheduling method and scheduling system for shared bicycles

Abstract

The invention provides a real-time intelligent scheduling method and scheduling system for shared bicycles. Generally, the demand quantity of the shared bicycles is obtained based on historical data, bicycle parking key and hot spot areas are monitored in real time in a shared bicycle operation area, and the demand quantity of the shared bicycles is calculated according to the maximum threshold value (the maximum load can be borne) set in the area and the real-time parking quantity condition of the parked bicycles. And overall scheduling is performed in combination with the current number and the required number of the shared bicycles, so that dynamic intelligent scheduling is realized, and the defect that scheduling resources are redundant and uneven due to the fact that current shared bicycle scheduling needs manual experience scheduling is overcome.

Description

Technical Field

[0001] This application belongs to the technical field of shared bicycle scheduling, and particularly relates to a shared bicycle scheduling method and a scheduling system. Background Art

[0002] Currently, most of the scheduling of shared bicycles requires manual operation, and generally, it is simply to move the vehicles from one location to another. For example, in the evening, the vehicles are moved from the subway stop to the vicinity of the residential community for the convenience of users to ride during the morning rush hour the next day. However, such a scheduling scheme relies solely on manual experience. When there are too many areas to be scheduled, it is easy to cause scheduling redundancy, resulting in a waste of scheduling resources and uneven scheduling, and unable to meet the usage requirements of all scheduling areas. Therefore, there are many deficiencies. Summary of the Invention

[0003] The embodiments of this application provide a shared bicycle scheduling method and a scheduling system, which can solve the following problems: 1. After users use the bicycles within the operation area, the distribution of the parked bicycles is uneven. In some areas, the bicycles are piled up, hindering traffic and affecting the city appearance; in some areas, it is difficult to find a bicycle, and citizens have no bicycles to ride when traveling. 2. The current parking method brings many obstacles to the subsequent arriving users. For example, the walking time after parking to the destination is too long, the walking path is too complex to find the target store, and the disorderly parking method makes it more difficult for the subsequent users entering the parking lot to find a parking space, and it is easy to cause traffic congestion in the parking lot when there are many parked vehicles.

[0004] In a first aspect, the embodiments of this application provide a shared bicycle scheduling method, and the shared bicycle scheduling method includes:

[0005] Obtain the current system time information and the information such as the number of shared bicycles parked in each sub-area within the area to be scheduled;

[0006] According to the current system time information, determine the number of shared bicycles to be scheduled in each sub-area within the area to be scheduled and the target sub-area to be scheduled;

[0007] According to the number of shared bicycles to be scheduled in each sub-area within each area to be scheduled and the target sub-area to be scheduled, schedule the shared bicycles in each sub-area.

[0008] In an optional embodiment, the step of determining the number of shared bicycles to be scheduled in each sub-area within the area to be scheduled and the target sub-area to be scheduled according to the current system time information includes:

[0009] According to the current system time information, search for a comparison table of the time corresponding to each time period and the demand quantity of shared bicycles in the sub-area. The comparison tables for each time period are different;

[0010] Determine the number of shared bicycles to be scheduled in each sub - area within the area to be scheduled and the target sub - area to be scheduled according to the found look - up table.

[0011] In an alternative embodiment, the step of determining the number of shared bicycles to be scheduled in each sub - area within the area to be scheduled and the target sub - area to be scheduled according to the found look - up table includes:

[0012] For each sub - area, determine the supply - demand identity of the sub - area according to the current number of shared bicycles and the number of shared bicycle demands. The supply - demand identity includes a supply sub - area and a demand sub - area;

[0013] For each demand sub - area, find the target supply sub - area from the supply sub - areas adjacent to the demand sub - area. The target supply sub - area is the supply sub - area with the fewest adjacent sub - areas;

[0014] According to the number of shared bicycles in the current target supply sub - area, the number of shared bicycle demands, and the number of shared bicycles and the number of shared bicycle demands in the corresponding demand sub - area, determine whether the number of shared bicycles that can be scheduled in the target supply sub - area meets the number of shared bicycle demands in the demand sub - area. If not, find the target supply sub - area in the remaining supply sub - areas until the number of shared bicycles that can be scheduled in all current target supply sub - areas reaches the number of shared bicycle demands in the demand sub - area, or until all adjacent supply sub - areas are traversed;

[0015] Output the number of bicycles to be scheduled for each supply sub - area and demand sub - area respectively.

[0016] In an alternative embodiment, if the number of shared bicycles that can be scheduled in all adjacent supply sub - areas does not reach the number of shared bicycle demands in the demand sub - area, the scheduling method further includes:

[0017] Merge the demand sub - area and all adjacent supply sub - areas into a secondary sub - area;

[0018] Take the secondary sub - area as a secondary demand sub - area, find the target supply sub - area from the supply sub - areas adjacent to the secondary demand sub - area. If the number of shared bicycles that can be scheduled in all current target supply sub - areas does not reach the number of shared bicycle demands in the demand sub - area, merge the current secondary demand sub - area and all adjacent supply sub - areas into a new secondary sub - area, and re - find the target supply sub - area until the number of shared bicycles that can be scheduled reaches the number of shared bicycle demands in the demand sub - area.

[0019] In an alternative embodiment, the scheduling method further includes:

[0020] Take the sub - partition with the largest current demand for shared bikes as the central sub - partition, and the sub - partition with the smallest current demand for shared bikes as the divergent sub - partition. Connect the central points of the central sub - partition and the divergent sub - partition to form a scheduling axis;

[0021] Set the first scheduling direction of each sub - partition to be along the direction of the scheduling axis, and the second scheduling direction to be perpendicular to the scheduling axis;

[0022] For each sub - partition, perform the first scheduling. The first scheduling includes scheduling the shared bikes of the sub - partitions adjacent in the first scheduling direction. If the number of shared bikes in the sub - partition does not reach the demand for shared bikes in the demand sub - partition after the first scheduling, perform the second scheduling. The second scheduling includes scheduling the shared bikes of the sub - partitions adjacent in the second scheduling direction.

[0023] In an alternative embodiment, the scheduling method further includes:

[0024] Obtain the user's riding destination sub - partition data and riding initial sub - partition data from historical data;

[0025] According to the user's riding destination sub - partition data and riding initial sub - partition data, find the migration paths of the majority of users, and bind the destination sub - partition and the initial sub - partition according to the migration paths of the majority of users to form a binding relationship;

[0026] Configure the scheduling quantity of the destination sub - partition to the initial sub - partition according to the number of sub - partitions involved in the migration path corresponding to the binding relationship;

[0027] According to the scheduling quantity of the destination sub - partition to the initial sub - partition, combined with the scheduling quantity of shared bikes and the scheduling target sub - partition in each sub - partition to be scheduled, determine the scheduling quantities of the remaining sub - partitions;

[0028] Perform shared bike scheduling according to the scheduling quantity of each sub - partition.

[0029] In an alternative embodiment, configuring the scheduling quantity of the destination sub - partition to the initial sub - partition according to the number of sub - partitions involved in the migration path corresponding to the binding relationship includes:

[0030] If the number of sub - partitions involved is greater than the first set threshold, and in the next time period adjacent to the current time period, the demand for shared bikes in the destination sub - partition decreases, configure the scheduling quantity of the destination sub - partition to the initial sub - partition as the first quantity, and the first quantity is the product of the demand for shared bikes and the first coefficient;

[0031] If the number of involved sub - partitions is greater than the first set threshold, and in the next time period adjacent to the current time period, the demand quantity of shared bicycles in the target sub - partition increases or remains unchanged, configure the scheduling quantity from the target sub - partition to the initial sub - partition as the second quantity, where the second quantity is the product of the demand quantity of shared bicycles and the second coefficient;

[0032] If the number of involved sub - partitions is less than the first set threshold, configure the scheduling quantity from the target sub - partition to the initial sub - partition as the third quantity, where the third quantity is the product of the demand quantity of shared bicycles and the third coefficient; where the first coefficient is less than the second coefficient, and the second coefficient is less than the third coefficient.

[0033] In an alternative embodiment, the method for scheduling shared bicycles further includes:

[0034] If the demand quantity of shared bicycles in a sub - partition within the current time period is lower than the set demand quantity threshold, temporarily divide the sub - partition into an adjacent sub - partition.

[0035] Scheduling the shared bicycles in each sub - partition according to the scheduled quantity of shared bicycles and the scheduled target sub - partition in each sub - partition of each area to be scheduled specifically includes: Based on the re - configured sub - partitions, scheduling the shared bicycles in each sub - partition according to the scheduled quantity of shared bicycles and the scheduled target sub - partition in each sub - partition of each area to be scheduled.

[0036] In an alternative embodiment, dividing the sub - partition into an adjacent sub - partition includes:

[0037] Select, from the adjacent sub - partitions, the sub - partition with the largest difference between the quantity of shared bicycles and the demand quantity of shared bicycles as the temporarily merged sub - partition, and divide the sub - partition with the demand quantity of shared bicycles lower than the set demand quantity threshold into the temporarily merged sub - partition to form a new sub - partition.

[0038] In a second aspect, an embodiment of the present application provides a scheduling system for shared bicycles, where the scheduling system for shared bicycles includes:

[0039] An acquisition module, which acquires the current system time information and the quantity information of shared bicycles in each sub - partition within the area to be scheduled;

[0040] A determination module, which determines the scheduled quantity of shared bicycles and the scheduled target sub - partition in each sub - partition within the area to be scheduled according to the current system time information;

[0041] A scheduling module, which schedules the shared bicycles in each sub - partition according to the scheduled quantity of shared bicycles and the scheduled target sub - partition in each sub - partition of each area to be scheduled.

[0042] In a third aspect, an embodiment of the present application provides a terminal device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the method as described above when executing the computer program.

[0043] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium storing a computer program, where the computer program implements the method as described above when executed by a processor.

[0044] Advantages of the present application:

[0045] The present application provides a real-time intelligent scheduling method and a scheduling system for shared bicycles. Generally, the demand for shared bicycles is obtained based on historical data. In the operating area of shared bicycles, key and hot areas for bicycle parking are monitored in real time. According to the maximum threshold of parked vehicles (the maximum load that can be borne) set in the area and the real-time parked quantity situation, combined with the current quantity and demand quantity of shared bicycles, overall scheduling is carried out, so as to achieve dynamic automatic scheduling, and solve the defects of redundant and uneven scheduling resources caused by the need for manual scheduling based on experience in the current scheduling of shared bicycles. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] To more clearly illustrate the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings required for use in the embodiments or the description of the prior art. Obviously, the following drawings are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0047] Figure 1 is a schematic flowchart of the steps of a scheduling method for shared bicycles provided by an embodiment of the present application;

[0048] Figure 2 is a schematic diagram of a scenario of a scheduling method for shared bicycles provided by an embodiment of the present application;

[0049] Figure 3 is a schematic diagram of another scenario of a scheduling method for shared bicycles provided by an embodiment of the present application;

[0050] Figure 4 is a schematic structural diagram of a scheduling system for shared bicycles provided by an embodiment of the present application;

[0051] Figure 5 is a schematic structural diagram of a terminal device provided by an embodiment of the present application.

[0052] Reference numerals:

[0053] 1 - Sub - partition, 11, 12, 13 - Sub - partitions adjacent to sub - partition 11; 21 - Scheduled sub - partition, 22 - Scheduling target sub - partition, 20 - Scheduling direction, both 23 and 21 are sub - partitions adjacent to sub - partition 22, 31 - First scheduling direction. Detailed implementation manners

[0054] In the following description, for the purpose of illustration rather than limitation, specific details such as specific system structures, technologies, etc. are presented to thoroughly understand the embodiments of the present application. However, those skilled in the art should clearly understand that the present application can also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well - known systems, devices, circuits, and methods are omitted to avoid unnecessary details from interfering with the description of the present application.

[0055] It should be understood that when used in the specification of the present application and the appended claims, the term "comprising" indicates the presence of the described features, wholes, steps, operations, elements, and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components, and / or their combinations.

[0056] It should also be understood that the term "and / or" used in the specification of the present application and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0057] As used in the specification of the present application and the appended claims, the term "if" can be interpreted as "when", "once", "in response to determining", or "in response to detecting" according to the context. Similarly, the phrase "if determined" or "if detecting [the described condition or event]" can be interpreted as meaning "once determined", "in response to determining", "once detecting [the described condition or event]", or "in response to detecting [the described condition or event]" according to the context.

[0058] In addition, in the description of the specification of the present application and the appended claims, the terms "first", "second", "third", etc. are only used for distinguishing descriptions and cannot be understood as indicating or implying relative importance.

[0059] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that specific features, structures, or characteristics described in connection with that embodiment are included in one or more embodiments of this application. Thus, statements such as "in one embodiment", "in some embodiments", "in other some embodiments", "in still other embodiments", etc. that appear in different places in this specification do not necessarily all refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized. The terms "comprising", "including", "having" and their variants all mean "including but not limited to", unless otherwise specifically emphasized.

[0060] In a first aspect, an embodiment of this application provides a scheduling method for shared bicycles. The scheduling method for shared bicycles includes:

[0061] S1: Obtain the current system time information and the information on the number of shared bicycles parked in each sub - area within the area to be scheduled;

[0062] S2: Determine the number of shared bicycles to be scheduled in each sub - area within the area to be scheduled and the target sub - area for scheduling according to the current system time information;

[0063] S3: Schedule the shared bicycles in each sub - area according to the number of shared bicycles to be scheduled in each sub - area within the area to be scheduled and the target sub - area for scheduling.

[0064] This application provides a real - time intelligent scheduling method and scheduling system for shared bicycles. Generally, the demand for shared bicycles is obtained based on historical data. In the operating area of shared bicycles, real - time monitoring is carried out on key and hot areas for bicycle parking. According to the maximum threshold of parked vehicles (the maximum load that can be borne) set in the area and the real - time parking quantity situation, combined with the current quantity and demand quantity of shared bicycles, overall scheduling is carried out, thus realizing dynamic intelligent scheduling and solving the defects of redundant and uneven scheduling resources caused by the need for manual scheduling based on experience in the current scheduling of shared bicycles.

[0065] The embodiments of this application will be described in detail below.

[0066] In the embodiments of this application, the current system time information is the time of the internal timer of the server system. Generally, the time of the internal timer of the server system is synchronized with the world time. Of course, this application places no restrictions on this.

[0067] In the scenario of this application, the area to be scheduled includes multiple sub - areas, and the size of each sub - area can be the same or different. Specifically, the configuration of the sub - areas can be based on geographical location configuration. For example, the sub - areas can be configured according to geographical points such as communities, subway stations, etc.

[0068] Currently, the scheduling of shared bicycles is almost entirely manual. Based on experience, shared bicycles are transported from the community to the subway station or from the subway station to the community. This application can obtain the number of shared bicycles to be scheduled and the target sub-areas for scheduling in each time period based on historical data.

[0069] Specifically, the embodiments of this application provide a method for scheduling shared bicycles based on a comparison table generated from historical data. In this embodiment, according to the current system time information, the number of shared bicycles to be scheduled and the target sub-areas for scheduling in each sub-area within the area to be scheduled are determined, as Figure 1 shown, including:

[0070] S21: According to the current system time information, search for a comparison table of the time and the number of shared bicycle demands in each sub-area for each time period. The comparison tables for each time period are different;

[0071] S22: Determine the number of shared bicycles to be scheduled and the target sub-areas for scheduling in each sub-area within the area to be scheduled according to the found comparison table.

[0072] Specifically, the comparison table of this application is a correspondence table between the time of each time period and the number of shared bicycle demands in each sub-area. This comparison table can be obtained by a pre-calibration method. For example, by the system retrieving the number of shared bicycles within the current sub-area, and then configuring sufficient shared bicycles in this sub-area, and counting the reduction or increase in the number of shared bicycles within a time period, so as to determine the number of shared bicycle demands within this time period, that is, the number of shared bicycles that need to be configured at least. Through this method, the number of shared bicycle demands in each time period can be obtained, thereby generating the comparison table of this application. It can be known that each time period of this application corresponds to a comparison table, one comparison table corresponds to one time period, and each comparison table includes the number of shared bicycle demands in each sub-area within the corresponding time period. Thus, the number of shared bicycle demands corresponding to each sub-area in each time period can be queried.

[0073] Based on the current system time, the embodiments of this application can obtain the number of shared bicycle demands in each sub-area on the comparison table by searching the comparison table. Then, according to the number of shared bicycle demands and the actual number of shared bicycles in the current sub-area, the number of shared bicycles to be scheduled and the target sub-areas for scheduling in each sub-area are comprehensively obtained.

[0074] The following details step S22 of this application. In the embodiments of this application, step S22, that is, determining the number of shared bicycles to be scheduled and the target sub-areas for scheduling in each sub-area within the area to be scheduled according to the found comparison table, includes:

[0075] S221: For each sub - partition, determine the supply - demand identity of the sub - partition according to the current number of shared bikes and the number of shared bike demands in the sub - partition. The supply - demand identity includes supply sub - partitions and demand sub - partitions;

[0076] S222: For each demand sub - partition, find a target supply sub - partition from the supply sub - partitions adjacent to the demand sub - partition. The target supply sub - partition is the supply sub - partition with the fewest adjacent sub - partitions;

[0077] S223: According to the number of shared bikes, the number of shared bike demands in the current target supply sub - partition, and the number of shared bikes, the number of shared bike demands in the corresponding demand sub - partition, determine whether the number of schedulable shared bikes in the target supply sub - partition can meet the number of shared bike demands in the demand sub - partition. If not, find the target supply sub - partition in the remaining supply sub - partitions until the number of schedulable shared bikes in all current target supply sub - partitions reaches the number of shared bike demands in the demand sub - partition, or until all adjacent supply sub - partitions are traversed;

[0078] S224: Output the scheduling quantity of each supply sub - partition and demand sub - partition respectively.

[0079] Specifically, in step S221, first determine the supply - demand identity of each sub - partition according to the current number of shared bikes and the number of shared bike demands in the sub - partition. This supply - demand identity determines the "supply and demand" of the sub - partition for shared bikes, that is, whether the sub - partition dispatches shared bikes outward or borrows shared bikes from other sub - partitions. Generally, the current number of shared bikes can be directly subtracted from the number of shared bike demands. If the result is positive, it is used as a supply sub - partition; if it is negative, it is used as a demand sub - partition.

[0080] In step S222, first, find out which sub - partitions are demand sub - partitions. Then, taking the demand sub - partition as the center, search for supply sub - partitions among all the sub - partitions adjacent to the demand sub - partition. It should be understood that not all adjacent supply sub - partitions will supply shared bikes to the demand sub - partition at this time. In the embodiment of the present application, for this detailed scheduling, aiming at the minimum scheduling cost or scheduling range, the supply sub - partition with the fewest adjacent sub - partitions is taken as the target supply sub - partition, that is, the target supply sub - partition bound to supply the demand sub - partition. For example, if the sub - partitions adjacent to partition A include B, C, D, E, and F, and among BCDEF, the number of adjacent sub - partitions of D is the fewest (for example, three), and the number of adjacent sub - partitions of BCEF is more than three, then D is selected as the target supply sub - partition of partition A at this time. In this way, each demand sub - partition corresponds to and binds a target supply sub - partition with the highest priority. Since the target supply sub - partition has the fewest adjacent sub - partitions, the probability of it supplying other sub - partitions is smaller, and it is easier to clearly divide the binding relationship of each sub - partition. In this way, when a new demand sub - partition is added later, it can ensure that the impact on the overall scheduling architecture is minimized, and when the overall scheduling architecture needs to be adjusted, it can ensure that the adjustment is easier.

[0081] After that, the embodiment of the present application performs an iterative operation to determine whether the number of schedulable shared bikes in the target supply sub - partition meets the number of shared bike demands in the demand sub - partition. If not, in addition to the target supply sub - partition with priority scheduling, the number of shared bikes to be scheduled needs to be added from other sub - partitions to ensure the demand in the demand sub - partition.

[0082] After that, if the number of schedulable shared bikes in all adjacent supply sub - partitions does not reach the number of shared bike demands in the demand sub - partition, and there are no other adjacent supply sub - partitions at this time, then the scheduling method further includes:

[0083] S224: Merge the demand sub - partition and all adjacent supply sub - partitions into a secondary sub - partition;

[0084] S225: Take the secondary sub - partition as a secondary demand sub - partition, search for a target supply sub - partition from the supply sub - partitions adjacent to the secondary demand sub - partition. If the number of schedulable shared bikes in all current target supply sub - partitions does not reach the number of shared bike demands in the demand sub - partition, merge the current secondary demand sub - partition and all adjacent supply sub - partitions into a new secondary sub - partition, and re - search for the target supply sub - partition until the number of schedulable shared bikes reaches the number of shared bike demands in the demand sub - partition.

[0085] In this embodiment, if the supply amounts of all adjacent supply sub - regions are such that at this time, the current demand sub - region and all adjacent supply sub - regions around it are combined to form a secondary sub - region, and the secondary sub - region is used as a replacement for the current demand sub - region, thus expanding the scope of the entire scheduling with the demand sub - region as the atomic center. In this way, the entire scheduling takes each demand sub - region as the atomic center and forms a scheduling strategy of "local" priority matching through the way of free diffusion. Thereby, it can ensure that the scheduling cost and scheduling speed of each sub - region are at the optimal level. Through the local priority scheduling strategy, the whole can automatically reach the optimal scheduling.

[0086] For example, as Figure 2 shown, Figure 2 FIG. is a schematic diagram of sub - regions of the area to be scheduled based on the concept of this application. It should be understood that the division of sub - regions in this application is only for illustration. It is intended to show that the shape and size of the sub - regions are not limited to a certain fixed value, but can be rationally configured according to the actual situation or geographical information. This application does not make any restrictions on this. In the Figure 2 embodiment shown, it can be seen that the adjacent sub - regions of sub - region 1 are sub - regions 11, 12, and 13. Among them, sub - region 21 schedules to sub - region 22 in the scheduling direction 20. Thus, 21 is the supply sub - region and 22 is the demand sub - region. At this time, the supply sub - region 21 is selected from sub - regions 21, 23, and 13 adjacent to the demand sub - region 22. Its selection logic is as shown in the above - mentioned embodiment, and this application will not elaborate on this.

[0087] In addition, in the embodiment of this application, based on the core idea of the "local" priority scheduling strategy, this application further provides a parallel solution. In the above - mentioned embodiment, the "local" priority scheduling strategy is a "local surface" scheduling based on adjacent sub - regions. This embodiment can further provide a solution based on "local linear" scheduling. Specifically, the scheduling method further includes:

[0088] S41: Taking the sub - region with the largest current number of shared bicycle demands as the central sub - region and the sub - region with the smallest current number of shared bicycle demands as the divergent sub - region, connecting the central points of the central sub - region and the divergent sub - region to form a scheduling axis;

[0089] S42: Setting the first scheduling direction of each sub - region to be along the direction of the scheduling axis and the second scheduling direction to be perpendicular to the scheduling axis;

[0090] S43: For each sub - partition, perform the first scheduling. The first scheduling includes scheduling shared bicycles in sub - partitions adjacent in the first scheduling direction. If the number of shared bicycles in the sub - partition after the first scheduling does not reach the demand quantity of shared bicycles in the demand sub - partition, perform the second scheduling. The second scheduling includes scheduling shared bicycles in sub - partitions adjacent in the second scheduling direction.

[0091] In this embodiment, in step S41, first, define the sub - partition with the largest current demand quantity of shared bicycles as the "central sub - partition", and the sub - partition with the smallest current demand quantity of shared bicycles as the "divergent sub - partition". In this way, the connection line between the "central sub - partition" and the "divergent sub - partition" can be used as the overall scheduling optimization direction. At this time, after the overall scheduling optimization direction is determined, by setting the scheduling strategies along the scheduling axis direction and perpendicular to the scheduling axis direction, "local" priority scheduling can be formed in the direction of this connection line. In this way, the scheduling is limited to linear scheduling along the scheduling axis direction and perpendicular to the scheduling axis direction, so as to ensure that the scheduling cost and scheduling speed of each sub - partition are at the best level. Through the local priority scheduling strategy, the overall can automatically reach the optimal scheduling.

[0092] Specifically, as Figure 3 shown, in the embodiment of the present application, sub - partition 32 is the central sub - partition and sub - partition 33 is the divergent sub - partition. At this time, the first scheduling direction 31 is used as the scheduling direction of linear local priority, and the second scheduling direction is configured perpendicular to the first scheduling direction 31. The present application will not elaborate on this.

[0093] Based on the descriptions of the above two embodiments, in the preferred embodiment of the present application, other scheduling strategy combinations can be further matched. Specifically, the scheduling method further includes:

[0094] S01: Obtain the data of the sub - partition of the user's riding purpose and the data of the initial sub - partition of the ride in the historical data;

[0095] S02: According to the data of the sub - partition of the user's riding purpose and the data of the initial sub - partition of the ride, find the migration paths of most users, and bind the destination sub - partition and the initial sub - partition according to the migration paths of most users to form a binding relationship;

[0096] S03: Configure the scheduling quantity of the destination sub - partition to the initial sub - partition according to the number of sub - partitions involved in the migration path corresponding to the binding relationship;

[0097] S04: According to the scheduling quantity of the destination sub - partition to the initial sub - partition, combined with the scheduling quantity of shared bicycles in each sub - partition within each area to be scheduled and the scheduling target sub - partition, determine the scheduling quantity of the remaining sub - partitions;

[0098] S05: Schedule shared bicycles according to the scheduling quantity of each sub - area.

[0099] It should be noted that in the embodiments of the present application, the sub - area data of the user's riding purpose and the initial sub - area data in the historical data can be obtained by counting the destination and starting place of the user's ride. The present application does not limit this. At the same time, the collection of historical data is obtained by the user actively reporting when using shared bicycles, and the present application will not elaborate on this.

[0100] In the embodiments of the present application, the behavioral consistency of the user group is further considered. Scheduling binding can be performed based on the user's historical vehicle usage data. Specifically, for example, when a user rides back and forth between the sub - areas where the K community cluster point and the J subway point are located, the sub - areas where the K community and the J subway entrance are located are the most in need of scheduling. At this time, by finding the migration paths of the majority of users and binding the destination sub - area and the initial sub - area according to the migration paths of the majority of users to form a binding relationship. In this way, the binding relationship is a relationship based on real direct needs. Then, according to the number of sub - areas involved in the migration path corresponding to the binding relationship, the scheduling quantity from the destination sub - area to the initial sub - area is configured, that is, the more sub - areas involved in the migration path, the fewer the scheduling quantity from the destination sub - area to the initial sub - area, and vice versa. Thus, it cooperates with the local - priority scheduling strategy of the previous two embodiments to finally form a scheduling plan.

[0101] For example, if the number of sub - areas involved in the corresponding migration path is 10, which is defined as a relatively large number, the cost of scheduling to the destination sub - area is higher. At this time, the scheduling quantity from the destination sub - area to the initial sub - area can be dynamically reduced. For example, the scheduling quantity is reduced to 10% of the total scheduling quantity. At this time, the remaining 90% of the scheduling quantity needs to cooperate with the scheduling of other sub - areas. At the same time, the remaining 90% of the scheduling quantity is configured according to the above - mentioned two local - priority embodiments for scheduling, so as to achieve overall coordinated scheduling. In this way, dynamic scheduling can be achieved by adjusting the two schemes, fully considering the consistency of the user group while ensuring local priority, and the influence of the distance from the destination sub - area to the initial sub - area can be eliminated by adjusting the weight.

[0102] Further, in an optional embodiment of the present application, configuring the scheduling quantity from the destination sub - area to the initial sub - area according to the number of sub - areas involved in the migration path corresponding to the binding relationship includes:

[0103] S031: If the number of sub - areas involved is greater than the first set threshold, and in the next time period adjacent to the current time period, the demand quantity of shared bicycles in the destination sub - area decreases, configure the scheduling quantity from the destination sub - area to the initial sub - area as the first quantity, and the first quantity is the product of the demand quantity of shared bicycles and the first coefficient;

[0104] S032: If the number of sub - partitions involved is greater than the first set threshold, and in the next time period adjacent to the current time period, the demand quantity of shared bikes in the target sub - partition increases or remains unchanged, configure the scheduling quantity from the target sub - partition to the initial sub - partition as the second quantity, where the second quantity is the product of the demand quantity of shared bikes and the second coefficient;

[0105] S033: If the number of sub - partitions involved is less than the first set threshold, configure the scheduling quantity from the target sub - partition to the initial sub - partition as the third quantity, where the third quantity is the product of the demand quantity of shared bikes and the third coefficient; wherein, the first coefficient is less than the second coefficient, and the second coefficient is less than the third coefficient.

[0106] In this embodiment, further, multiple different weight coefficients can be set. Thus, when there are more sub - partitions on the migration path, a strategy that gives priority to the local - priority scheduling strategy and takes into account the user - group consistency factor as a supplement is ensured. When there are fewer sub - partitions, a strategy that gives priority to the user - group consistency factor and takes the local - priority scheduling strategy as a supplement is ensured, so that the overall scheduling effect reaches the optimal.

[0107] Further, in the embodiment of the present application, for some continuous sub - partitions, there may be a situation where the number of users is too small to participate in scheduling. However, in some scenarios, although this sub - partition does not need to schedule shared bikes, it can be "lent" to other sub - partitions for scheduling through other means. At this time, this sub - partition can be temporarily divided into other sub - partitions and regarded as a part of other sub - partitions to jointly schedule shared bikes. In this way, sub - partitions that are not active in scheduling can be reused by other sub - partitions. In this embodiment, the method for scheduling shared bikes further includes:

[0108] S001: If the demand quantity of shared bikes in a sub - partition within the current time period is lower than the set demand quantity threshold, temporarily divide the sub - partition into an adjacent sub - partition;

[0109] The scheduling of shared bikes for each sub - partition according to the scheduling quantity of shared bikes and the scheduling target sub - partition in each sub - partition of each area to be scheduled specifically includes: Based on the re - configured sub - partitions, schedule the shared bikes of each sub - partition according to the scheduling quantity of shared bikes and the scheduling target sub - partition in each sub - partition of each area to be scheduled.

[0110] In this way, for sub - partitions that do not require scheduling for a long time, on the one hand, they are merged with surrounding sub - partitions through temporary merging to form new sub - partitions. When the new sub - partitions are scheduled, it is equivalent to temporarily borrowing the sub - partitions that do not require scheduling for a long time, thereby forming a buffer between some sub - partitions with longer scheduling lengths in the overall scheduling optimization and forming a buffer zone for the stability of the overall scheduling.

[0111] Furthermore, the present application provides a scheme for temporarily dividing the sub - partitions into adjacent sub - partitions, which specifically includes:

[0112] Select the sub - partition with the largest difference between the number of shared bicycles and the demand quantity of shared bicycles from the adjacent sub - partitions as the temporarily merged sub - partition, and divide the sub - partitions with the demand quantity of shared bicycles lower than the set demand quantity threshold into the temporarily merged sub - partition to form a new sub - partition.

[0113] In this embodiment, since the merged sub - partition is the sub - partition with the largest difference between the number of shared bicycles and the demand quantity of shared bicycles, this sub - partition is equivalent to the one with the most scheduling in the whole and the most need for scheduling. After merging to form a temporarily merged sub - partition, the number of its adjacent sub - partitions or the number of sub - partitions along the first scheduling direction and the second scheduling direction both increase exponentially, thereby optimizing the local non - uniformity caused by local - priority scheduling. Especially for the sub - partition with the largest difference between the number of shared bicycles and the demand quantity of shared bicycles, the local - priority scheduling strategy is likely to lead to a more complex scheduling strategy in this area. After absorbing a sub - partition, its "local" scheduling range expands, reducing the complex impact brought by the local - priority strategy in this area and making the overall optimization more uniform.

[0114] It should be understood that the schematic diagrams of the present application are only for convenient display, and their shapes and sizes are not limitations on the sub - partitions. It should be understood that the shapes of the sub - partitions in the embodiments of the present application are generally irregular closed shapes, and the present application will not elaborate on this.

[0115] On the second aspect, the embodiments of the present application provide a scheduling system for shared bicycles, as Figure 4 shown. The scheduling system for shared bicycles includes:

[0116] An acquisition module 100, which acquires the current system time information and the number information of shared bicycles in each sub - partition within the area to be scheduled;

[0117] A determination module 200, which determines the number of shared bicycles to be scheduled and the target sub - partition for scheduling in each sub - partition within the area to be scheduled according to the current system time information;

[0118] The scheduling module 300 schedules the shared bikes in each sub - area according to the number of shared bikes to be scheduled in each sub - area within each area to be scheduled and the target sub - area to be scheduled.

[0119] This application provides a scheduling system for shared bikes. By partitioning the entire scheduling area and then comprehensively scheduling in combination with the current number and required number of shared bikes, and the required number of shared bikes is obtained based on historical data, dynamic automatic scheduling is realized, solving the defects of redundant and uneven scheduling resources caused by the need for manual scheduling based on experience in the current shared bike scheduling.

[0120] Figure 5 This is a schematic structural diagram of a terminal device provided in an embodiment of this application. The terminal device 400 includes: at least one processor 401 ( Figure 5 only one processor is shown in the figure), a memory 402, and a computer program 403 stored in the memory 402 and executable on the at least one processor 401. When the processor 401 executes the computer program 403, the steps in the above - mentioned method embodiment are implemented.

[0121] The terminal device 400 can be a computing device such as a desktop computer, a notebook, a palm computer, and a cloud server. The terminal device may include, but is not limited to, a processor 401 and a memory 402. Those skilled in the art can understand that Figure 5 this is only an example of the terminal device 400 and does not constitute a limitation on the terminal device 400. It may include more or fewer components than shown in the figure, or combine some components, or different components. For example, it may also include input - output devices, network access devices, etc.

[0122] The so - called processor 401 may be a central processing unit (CPU). The processor 401 may also be other general - purpose processors, digital signal processors (DSPs), application - specific integrated circuits (ASICs), field - programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general - purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0123] In some embodiments, the memory 402 may be an internal storage unit of the terminal device 400, such as a hard disk or memory of the terminal device 400. In other embodiments, the memory 402 may also be an external storage device of the terminal device 400, such as a plug-in hard disk equipped on the terminal device 400, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, etc. Further, the memory 402 may also include both the internal storage unit of the terminal device 400 and an external storage device. The memory 402 is used to store an operating system, application programs, a Boot Loader, data, and other programs, such as the program code of the computer program, etc. The memory 402 may also be used to temporarily store data that has been output or will be output.

[0124] Those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of each functional unit and module is used as an example. In actual applications, the above functions can be assigned to different functional units and modules according to needs, that is, the internal structure of the device is divided into different functional units or modules to complete all or part of the functions described above. Each functional unit and module in the embodiments can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above integrated units can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of each functional unit and module are only for the convenience of mutual distinction and do not limit the protection scope of this application. The specific working processes of the units and modules in the above system can refer to the corresponding processes in the foregoing method embodiments and will not be elaborated herein.

[0125] The embodiments of the present application also provide a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the steps in the foregoing method embodiments can be implemented.

[0126] The embodiments of the present application provide a computer program product, and when the computer program product runs on a mobile terminal, the mobile terminal can implement the steps in the foregoing method embodiments when executed.

[0127] When the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, to implement all or part of the processes in the above-described embodiment methods of this application, a computer program can be used to instruct the relevant hardware to complete. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by a processor, the steps of the above-described method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in the form of source code, object code, executable file, or some intermediate form, etc. The computer-readable medium can at least include: any entity or device that can carry the computer program code to the photographing device / terminal device, recording medium, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electrical carrier signal, telecommunication signal, and software distribution medium. For example, a USB flash drive, a mobile hard disk, a magnetic disk, or an optical disc, etc. In some jurisdictions, according to legislation and patent practice, the computer-readable medium cannot be an electrical carrier signal and a telecommunication signal.

[0128] In the above embodiments, the descriptions of the various embodiments have their own focuses. For parts that are not detailed or recorded in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0129] Those of ordinary skill in the art can realize that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered to exceed the scope of this application.

[0130] In the embodiments provided in this application, it should be understood that the disclosed device / network device and method can be implemented in other ways. For example, the device / network device embodiments described above are merely illustrative. For example, the division of the modules or units is only a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed coupling or direct coupling or communication connection between each other can be through some interfaces. The indirect coupling or communication connection of the device or unit can be in an electrical, mechanical, or other form.

[0131] The unit described as the separation component may or may not be physically separated. The component shown as a unit may or may not be a physical unit, that is, it may be located in one place or may be distributed across multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0132] The above-described embodiments are only used to illustrate the technical solutions of the present application, rather than to limit it; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements on some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the various embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A scheduling method for shared bicycles, characterized in that, The scheduling method of the shared bicycles includes: Obtaining the current system time information and the information on the number of shared bicycles parked in each sub-region within the region to be scheduled; Determining the number of shared bicycles to be scheduled in each sub-region within the region to be scheduled and the target sub-region to be scheduled according to the current system time information; Scheduling the shared bicycles in each sub-region according to the number of shared bicycles to be scheduled in each sub-region within the region to be scheduled and the target sub-region to be scheduled.

2. The scheduling method of the shared bicycle according to claim 1, wherein, The determining the number of shared bicycles to be scheduled in each sub-region within the region to be scheduled and the target sub-region to be scheduled according to the current system time information includes: According to the current system time information, looking up the comparison table of the time corresponding to each time period with the number of shared bicycles parked and the required number in the sub-region, and the comparison tables for each time period are different; Determining the number of shared bicycles to be scheduled in each sub-region within the region to be scheduled and the target sub-region to be scheduled according to the found comparison table.

3. The scheduling method of the shared bicycle according to claim 2, wherein The determining the number of shared bicycles to be scheduled in each sub-region within the region to be scheduled and the target sub-region to be scheduled according to the found comparison table includes: For each sub-region, determining the supply-demand identity of the sub-region according to the current number of shared bicycles parked and the required number of shared bicycles, and the supply-demand identity includes a supply sub-region and a demand sub-region; For each demand sub-region, looking up the target supply sub-region from the supply sub-regions adjacent to the demand sub-region, and the target supply sub-region is the supply sub-region with the fewest adjacent sub-regions; According to the number of shared bicycles parked and the required number of shared bicycles in the current target supply sub-region, and the number of shared bicycles parked and the required number of shared bicycles in the corresponding demand sub-region, determining whether the number of shared bicycles that can be scheduled in the target supply sub-region meets the required number of shared bicycles in the demand sub-region. If not, looking up the target supply sub-region in the remaining supply sub-regions until the number of shared bicycles that can be scheduled in all current target supply sub-regions reaches the required number of shared bicycles in the demand sub-region, or until all adjacent supply sub-regions are traversed; Outputting the respective scheduling quantities of each supply sub-region and demand sub-region.

4. The scheduling method of the shared bicycle according to claim 3, wherein If the number of shared bicycles that can be scheduled in all adjacent supply sub-regions does not reach the required number of shared bicycles in the demand sub-region, the scheduling method further includes: Combining the demand sub-region and all adjacent supply sub-regions into a secondary sub-region; Taking the secondary sub-region as a secondary demand sub-region, looking up the target supply sub-region from the supply sub-regions adjacent to the secondary demand sub-region. If the number of shared bicycles that can be scheduled in all current target supply sub-regions does not reach the required number of shared bicycles in the demand sub-region, combining the current secondary demand sub-region and all adjacent supply sub-regions into a new secondary sub-region, and re-looking up the target supply sub-region until the number of shared bicycles that can be scheduled reaches the required number of shared bicycles in the demand sub-region.

5. The scheduling method of the shared bicycle according to claim 1, characterized in that, The scheduling method further includes: Take the sub - partition with the largest number of current shared - bike demands as the central sub - partition, and the sub - partition with the smallest number of current shared - bike demands as the divergent sub - partition. Connect the central points of the central sub - partition and the divergent sub - partition to form a scheduling axis. Set the first scheduling direction for each sub - partition to be along the scheduling axis direction, and the second scheduling direction to be perpendicular to the scheduling axis direction. For each sub - partition, perform the first scheduling. The first scheduling includes scheduling shared bikes from adjacent sub - partitions in the first scheduling direction. If the number of shared bikes in the sub - partition does not reach the shared - bike demand quantity of the demand sub - partition after the first scheduling, perform the second scheduling. The second scheduling includes scheduling shared bikes from adjacent sub - partitions in the second scheduling direction.

6. The dispatching method of the shared bicycle according to claim 4 or 5, characterized in that The scheduling method further includes: Obtain the user's riding destination sub - partition data and riding initial sub - partition data from historical data. According to the user's riding destination sub - partition data and riding initial sub - partition data, find the migration paths of most users, and bind the destination sub - partition and the initial sub - partition according to the migration paths of most users to form a binding relationship. Configure the scheduling quantity from the destination sub - partition to the initial sub - partition according to the number of sub - partitions involved in the migration path corresponding to the binding relationship. According to the scheduling quantity from the destination sub - partition to the initial sub - partition, combined with the scheduled shared - bike quantity and the scheduled target sub - partition in each sub - partition of the area to be scheduled, determine the scheduling quantity of the remaining sub - partitions. Perform shared - bike scheduling according to the scheduling quantity of each sub - partition.

7. The scheduling method of the shared bicycle according to claim 6, characterized in that Configuring the scheduling quantity from the destination sub - partition to the initial sub - partition according to the number of sub - partitions involved in the migration path corresponding to the binding relationship includes: If the number of sub - partitions involved is greater than the first set threshold, and in the next time period adjacent to the current time period, the shared - bike demand quantity in the destination sub - partition decreases, configure the scheduling quantity from the destination sub - partition to the initial sub - partition as the first quantity, where the first quantity is the product of the shared - bike demand quantity and the first coefficient. If the number of sub - partitions involved is greater than the first set threshold, and in the next time period adjacent to the current time period, the shared - bike demand quantity in the destination sub - partition increases or remains unchanged, configure the scheduling quantity from the destination sub - partition to the initial sub - partition as the second quantity, where the second quantity is the product of the shared - bike demand quantity and the second coefficient. If the number of sub - partitions involved is less than the first set threshold, configure the scheduling quantity from the destination sub - partition to the initial sub - partition as the third quantity, where the third quantity is the product of the shared - bike demand quantity and the third coefficient. Among them, the first coefficient is less than the second coefficient, and the second coefficient is less than the third coefficient.

8. The scheduling method of the shared bicycle according to claim 6, wherein The shared - bike scheduling method further includes: If the shared - bike demand quantity in a sub - partition within the current time period is lower than the set demand quantity threshold, temporarily divide the sub - partition into an adjacent sub - partition. Scheduling the shared bicycles in each sub - area according to the number of shared bicycles to be scheduled in each sub - area within each area to be scheduled and the target sub - area to be scheduled, specifically including: Based on the reconfigured sub - areas, scheduling the shared bicycles in each sub - area according to the number of shared bicycles to be scheduled in each sub - area within each area to be scheduled and the target sub - area to be scheduled.

9. The scheduling method of the shared bicycle according to claim 8, wherein The temporarily dividing the sub - area into an adjacent sub - area includes: Selecting, from the adjacent sub - areas, the sub - area with the largest difference between the number of shared bicycles and the number of shared bicycle demands as the temporarily merged sub - area, and dividing the sub - area with the number of shared bicycle demands lower than the set demand quantity threshold into the temporarily merged sub - area to form a new sub - area.

10. A scheduling system for shared bicycles, characterized in that, The scheduling system of the shared bicycles includes: An acquisition module, which acquires the current system time information and the information on the number of parked shared bicycles in each sub - area within the area to be scheduled; A determination module, which determines the number of shared bicycles to be scheduled in each sub - area within the area to be scheduled and the target sub - area to be scheduled according to the current system time information; A scheduling module, which schedules the shared bicycles in each sub - area according to the number of shared bicycles to be scheduled in each sub - area within each area to be scheduled and the target sub - area to be scheduled.

Images