CN109063957B - Dynamic scheduling method and system for shared bicycle - Google Patents
Dynamic scheduling method and system for shared bicycle Download PDFInfo
- Publication number
- CN109063957B CN109063957B CN201810650961.5A CN201810650961A CN109063957B CN 109063957 B CN109063957 B CN 109063957B CN 201810650961 A CN201810650961 A CN 201810650961A CN 109063957 B CN109063957 B CN 109063957B
- Authority
- CN
- China
- Prior art keywords
- parking area
- user
- specified parking
- target range
- specified
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
Abstract
The invention provides a method and a system for dynamically scheduling shared bicycles, and relates to the field of urban traffic optimization. The method comprises the following steps: calibrating all specified parking areas, determining the capacity of the specified parking areas, and constructing a dispatching system; unlocking by a user; a target range is defined, wherein aiming at the passive participation scheduling users, a circle is drawn by taking the center point of a specified parking area where a destination is located as the center of the circle and the tolerance radius as the radius, and the target range is defined in the circle; aiming at the active participation scheduling user, making a circle by taking the starting point as the center of the circle, wherein the circle is the target range; traversing each specified parking area in the target range, and calculating the saturation variance according to the capacity of the specified parking areas and the number of the existing vehicles; arranging the specified parking areas according to the ascending order of the saturation variance, and pushing the parking areas to a user; and (3) the user closes the intelligent lock, the system judges whether the shared bicycle is in the specified parking area or not, and feedback is given based on a reward and punishment mechanism. The utilization rate of the shared bicycle can be increased, and the operation cost of the shared bicycle is reduced.
Description
Technical Field
The invention relates to the field of urban traffic optimization, in particular to a shared bicycle dynamic planning and scheduling and user behavior reward and punishment mechanism.
Background
In recent years, along with the deepening of the concept of low-carbon travel of urban residents and the continuous expansion of the market of shared single cars, the shared single car for solving the last kilometer of travel is more and more favored by the majority of citizens. The sharing bicycle is convenient for citizens to go out, and some drawbacks also occur: enterprises invest a large amount of single-vehicle resources for market preemption, so that urban shared single vehicles are in an oversaturated state, some users randomly park the single vehicles to cause traffic jam, the single vehicles gather in a place at non-hot-spot time to cause the single-vehicle resources to be idle, and the like. These adverse use behaviors not only affect the appearance of the city, but also play a serious role in hindering urban traffic from going out.
In the peak time period, a plurality of shared bicycles are trapped in the crowded places such as subway stations, office buildings and the like, short-term 'supply shortage' or 'power shortage' occurs, and obvious 'tide effect' is shown. And the dispatching of the shared bicycle at the present stage is still mainly carried out by enterprise specialists, so that the time and the labor are consumed, and the personnel cost is high.
In order to solve the problems, the initiative of a user for participating in bicycle scheduling is mobilized by an effective reward and punishment mechanism in a mode of citizen participation, parking management is realized through accurate positioning of longitude and latitude, the user is prompted to park normally, a shared bicycle leaves a city 'black hole', the shared bicycle returns to a hotspot area from a non-hotspot area, and the vehicle utilization rate is improved.
The shared bicycle has two operation modes, one mode is that a fixed parking area is not arranged, and a user can park in any place; the other type is that a fixed parking area is arranged, a parking pile can be arranged in the area, and a user can lock a shared bicycle after putting the shared bicycle into the parking pile. The second operation mode limits the parking place of the user to a certain extent, but simplifies the management and operation of the shared bicycle, so that the shared bicycle is convenient to implement.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the sharing bicycle is unevenly distributed due to the traveling peak valley or random parking, and the utilization rate is low.
The invention adopts the following technical scheme for solving the technical problems:
the invention provides a dynamic scheduling method for a shared bicycle, which comprises the following steps:
step A: calibrating all specified parking areas, determining the capacity of the specified parking areas, and constructing a dispatching system;
and B: the user unlocks, if the user selects a specified parking area as a destination, the dispatching system judges that the user is a passive user participating in dispatching; if the user does not set a destination, judging that the user actively participates in scheduling;
and C: demarcating a target range for a user, wherein:
(1) aiming at the passively-participated scheduling user, the method for defining the target range comprises the following steps: drawing a circle by taking the center point of a specified parking area where a destination is located as the center of the circle and the tolerance radius as the radius, wherein the inner circle is a target range; the tolerance radius is obtained by multiplying the linear distance between the starting point and the central point of the specified parking area selected by the user by a coefficient alpha;
(2) aiming at the active participation scheduling user, the method for defining the target range comprises the following steps: making a circle by taking the starting point as the center of the circle, wherein the inner circle is a target range;
step D: traversing each specified parking area in the target range, and calculating the saturation variance corresponding to each specified parking area according to the capacity of the specified parking area and the number of the existing vehicles; arranging the specified parking areas according to the ascending order of the saturation variance, and pushing the parking areas to a user;
step E: when the user closes the intelligent lock, the intelligent lock sends the position data to the dispatching system, and the dispatching system compares the position with the range of the specified parking area; if the parking area is outside the specified parking area, giving negative feedback to the user; otherwise, positive feedback is given to the user.
The method for dynamically scheduling shared bicycles as described above, further comprising step a, wherein the specified parking area is a rectangle, and an intersection point of two diagonal lines of the rectangle is a center point of the specified parking area; the dispatching system records the coordinates of the four vertexes and the central point of the rectangle;
the shared bicycle dynamic scheduling method further includes the following criteria for determining whether the specified parking area is within the target range: whether the center point of the parking area is within the target range is specified.
In the method for dynamically scheduling shared bicycles, further, the coefficient α in step C is a tolerance coefficient, which is a reasonable value that most users in the middle can accept after market research.
The method for dynamically scheduling shared bicycles as described above, further, if the total number of the specified parking areas in the target range is n, traversing the n specified parking areas, and obtaining the saturation variance in step D specifically includes:
d0, recording the current traversal times as i, and recording the number of the currently traversed specified parking area as j; i is 1, j is 1;
d1, starting the ith traversal;
d2, for the jth prescribed parking area: reading the existing vehicle number ajCapacity bj；
D3, if j ═ i and aj/bj<1, then Qj＝(aj+1)/bj(ii) a If j is equal to i and aj/bj>When 1, then ViEntering D7; if j ≠ i, Qj＝aj/bj(ii) a Wherein Q isjDefining the saturation of the jth parking area in the ith traversal;
D4、j＝j+1；
d5, if j is not equal to n +1, returning to D2; if j is n +1, go to D6;
D6、
j is 1; wherein the content of the first and second substances,
the average saturation of each specified parking area when traversing the ith time; viSaturation variance for the ith designated parking area;
D7、i＝i+1；
d8, if i is not equal to n +1, returning to D1; if i is n +1, entering D9;
d9, arranging the n specified parking areas according to the ascending order of the variance of the saturation degree, and pushing the n specified parking areas to the user.
The method for dynamically scheduling shared bicycles as described above, further, the position information in the step D when the lock is closed includes GPS position data.
The invention also provides a shared bicycle dynamic scheduling system, which comprises: the intelligent lock comprises a storage module, a calculation module, a communication module and an intelligent lock;
the intelligent lock transmits information to a communication module, the communication module is respectively connected with a storage module and a calculation module, and the storage module is connected with the calculation module;
the storage module is used for storing map information, the position of a specified parking area, capacity information and intelligent lock position information;
the calculation module is used for calculating the saturation variance of each specified parking area in the target range;
the communication module is used for receiving information transmitted by the intelligent lock;
the intelligent lock is used for transmitting the position information and the information of unlocking and locking by a user to the communication module.
The system for sharing bicycle dynamic dispatching as described above, further, the calculating module includes:
the system comprises an input module, a storage module and a display module, wherein the input module is used for receiving initial data, and the initial data comprises position information when a user starts a journey and whether the user selects a specified parking area as a destination; the output end of the input module is connected with the target range module;
the target range module is used for classifying users, judging the user who selects a specified parking area as a destination as a passive participation scheduling user, and judging the user who does not select the specified parking area as the destination as an active participation scheduling user; defining a target range according to rules corresponding to the two types of users, and selecting a specified parking area in the target range;
the sequencing module is used for receiving a target range and a specified parking area from the target range module, receiving the capacity and the number of the existing vehicles of the specified parking area from the storage module, and calculating the saturation variance of each specified parking area in the target range;
the comparison module is used for receiving the position information of the intelligent lock of the user from the communication module and judging the relation between the position and the specified parking area;
and the feedback module is used for calculating a feedback coefficient for evaluating the user behavior.
The system for dynamically scheduling shared bicycles as described above, further, the calculation process of the loop module includes:
d0, recording the current traversal times as i, and recording the number of the currently traversed specified parking area as j; i is 1, j is 1;
d1, starting the ith traversal;
d2, for the jth prescribed parking area: reading the existing vehicle number ajCapacity bj；
D3, ifj is equal to i and aj/bj<1, then Qj＝(aj+1)/bj(ii) a If j is equal to i and aj/bj>When 1, then ViEntering D7; if j ≠ i, Qj＝aj/bj(ii) a Wherein Q isjDefining the saturation of the jth parking area in the ith traversal;
D4、j＝j+1；
d5, if j is not equal to n +1, returning to D2; if j is n +1, go to D6;
D6、
j is 1; wherein the content of the first and second substances,
the average saturation of each specified parking area when traversing the ith time; viSaturation variance for the ith designated parking area;
D7、i＝i+1；
d8, if i is not equal to n +1, returning to D1; if i is n +1, entering D9;
d9, arranging the n specified parking areas according to the ascending order of the variance of the saturation degree, and pushing the n specified parking areas to the user.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects:
according to the invention, according to whether the user sets the destination or not, the user categories are divided into active participation scheduling and passive participation scheduling, the target range is defined according to different algorithms, and the efficiency of sharing bicycle scheduling is improved;
the invention uses the ratio Q of the number of the existing single cars in the specified parking area to the capacity of the area to measure whether the single cars are reasonably placed at the point, and provides a standard for evaluating the parking saturation of a certain parking area;
the invention provides a method for calibrating a specified parking area by using geographic coordinates, judging whether a user parks a shared bicycle in the specified parking area or not, and standardizing the vehicle using behaviors of the user;
a certain mobility is provided for a user to recommend a series of candidate scheduling points in a scheduling area according to the optimal principle of the system;
the method includes the steps that a user is guided to use a shared bicycle normally and participate in shared bicycle scheduling through an effective reward and punishment mechanism;
generally speaking, the shared bicycle returns to the hot spot area from the non-hot spot area, so that the resource of the bicycle at each node in the urban traffic is distributed in a balanced manner and meets the trip demand of the user at the point, the operation cost, the labor cost, the maintenance cost and the like of the shared bicycle enterprise are reduced, and the optimization of the resource of the shared bicycle in the whole city is promoted.
Drawings
Fig. 1 is a schematic flow chart of a shared bicycle scheduling and reward and punishment mechanism according to the present invention.
Fig. 2 is a topology structure diagram of a passively scheduled user scheduling area according to the present invention.
Fig. 3 is a topology structure diagram of an actively scheduled user scheduling area according to the present invention.
Fig. 4 is a topological structure diagram of a prescribed parking area according to an embodiment of the present invention.
Detailed Description
The technical scheme of the invention is further explained in detail by combining the attached drawings:
it will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
In order to achieve the aim, the invention provides a shared bicycle dynamic scheduling method based on a reward and punishment mechanism. Fig. 1 is a schematic flow chart of a shared bicycle scheduling and reward and punishment mechanism according to the present invention. As shown in fig. 1, the method comprises the following steps:
step A: and calibrating a specified parking area, and determining the maximum parking amount of the specified parking area. Fig. 4 is a topological structure diagram of a prescribed parking area according to the present embodiment. As shown in fig. 4, in the present embodiment, the specified parking area is set to be a rectangular area, the position and range thereof can be determined by determining the coordinates of four vertices and a center point, and the coordinate position information and the maximum number of parking can be determined in advance and stored in the database of the scheduling system. Thereby demarcating a prescribed parking area. And the center point of the prescribed parking area refers to an intersection point of two diagonal lines of the prescribed parking area.
And B: the user unlocks, if the user selects a specified parking area as a destination, the dispatching system judges that the user is a passive user participating in dispatching; and if the user does not have the destination, judging that the user actively participates in scheduling. The present embodiment does not consider a case where the destination does not belong to any one of the prescribed parking areas for the moment.
And C: demarcating a target range for a user, wherein:
(1) aiming at the passively-participated scheduling user, the method for defining the target range comprises the following steps: drawing a circle by taking the center point of a specified parking area where a destination is located as the center of the circle and the tolerance radius as the radius, wherein the inner circle is a target range; fig. 2 is a topology structure diagram of a passively scheduled user scheduling area according to the present invention. As shown in fig. 2, the tolerance radius is obtained by multiplying a straight-line distance between a starting point and a central point of a specified parking area selected by a user by a coefficient α;
(2) aiming at the active participation scheduling user, the method for defining the target range comprises the following steps: and (4) making a circle by taking the starting point as the center of the circle, wherein the circle is the target range. Fig. 3 is a topology structure diagram of an actively scheduled user scheduling area according to the present invention.
Wherein, the coefficient alpha is a tolerance coefficient, and the tolerance coefficient alpha is a reasonable value which can be accepted by most users in market research. Let r be the tolerance radius, then r ═ α · l, where l is the linear distance between the starting point and the center point of the target specified parking area.
Step D: the dispatching system sequentially calculates the ratio Q of the existing single vehicle to the maximum parking amount in each unsaturated specified parking area in the reachable area in a traversing manner, and when the variance V of the Q value in the whole target range is minimum, the dispatching system is considered to be in the optimal state of the system at the moment. The purpose of dynamically scheduling the shared bicycle is to enable each specified parking area to reach the optimal state of the system.
If the total number of the specified parking areas in the target range is represented as n, the method for traversing the n specified parking areas to obtain the recommendation index specifically comprises the following steps:
d0, recording the current traversal times as i, and recording the number of the currently traversed specified parking area as j; i is 1, j is 1;
d1, starting the ith traversal;
d2, for the jth prescribed parking area: reading the existing vehicle number ajCapacity bj；
D3, if j ═ i and aj/bj<1, then Qj＝(aj+1)/bj(ii) a If j is equal to i and aj/bj>When 1, then ViEntering D7; if j ≠ i, Qj＝aj/bj(ii) a Wherein Q isjDefining the saturation of the jth parking area in the ith traversal;
D4、j＝j+1；
d5, if j is not equal to n +1, returning to D2; if j is n +1, go to D6;
D6、
j is 1; wherein the content of the first and second substances,
is the corresponding average saturation during the i-th traversal; viThe variance corresponding to the ith traversal is obtained;
D7、i＝i+1；
d8, if i is not equal to n +1, returning to D1; if i is n +1, entering D9;
d9, obtaining corresponding variance V of n specified parking areasi(ii) a The n specified parking areas are arranged according to the ascending order of the variance and pushed to the user;
step E: the user stops using the bicycle, when the intelligent lock is closed, the intelligent lock sends the GPS position data of the parking spot to the dispatching system, the dispatching system compares the position with the existing specified parking area data in the database, if the user does not park in the specified parking area, negative feedback is given to the user, for example, the reward is cancelled, and the user can be punished on the original riding cost. Conversely, if the vehicle is parked in a prescribed parking area and the final ride end point belongs to one of the candidate points, the user is given positive feedback, such as to exercise a reward. One mode is that the reward and punishment are realized by multiplying a reward coefficient and a punishment coefficient by the original cost, and the reward and punishment coefficient is related to the distance between the target point and the scheduling point and related to the saturation variance change amount corresponding to the Q value of each specified parking area in the target range.
In this embodiment, the method for dynamically scheduling a shared bicycle based on a reward and punishment mechanism further includes: the Q value corresponding to the specified parking area in the whole city is marked with different colors on a map, for example, the condition that the Q value is seriously larger than 1 is marked by red, the condition that the Q value is equal to 1 is marked by yellow, and the condition that the Q value approaches to zero is marked by green. The users can distinguish and share the serious accumulation area by looking over the color division of the map, so that the users can actively participate in scheduling and actively avoid aggravation, and the assistance is provided for facilitating the travel of cities.
Through the mode, the embodiment of the invention prompts more users to participate in scheduling through a dynamic planning scheduling method and an effective reward and punishment mechanism, thereby improving the resource utilization rate of the shared bicycle and reducing the operation cost of the shared bicycle.
The foregoing is only a partial embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.
Claims (6)
1. A dynamic scheduling method for shared bicycles is characterized by comprising the following steps:
step A: calibrating all specified parking areas, determining the capacity of the specified parking areas, and constructing a dispatching system;
and B: the user unlocks, if the user selects a specified parking area as a destination, the dispatching system judges that the user is a passive user participating in dispatching; if the user does not set a destination, judging that the user actively participates in scheduling;
and C: demarcating a target range for a user, wherein:
(1) aiming at the passively-participated scheduling user, the method for defining the target range comprises the following steps: drawing a circle by taking the center point of a specified parking area where a destination is located as the center of the circle and the tolerance radius as the radius, wherein the inner circle is a target range; the tolerance radius is obtained by multiplying the linear distance between the starting point and the central point of the specified parking area selected by the user by a coefficient alpha;
(2) aiming at the active participation scheduling user, the method for defining the target range comprises the following steps: making a circle by taking the starting point as the center of the circle, wherein the inner circle is a target range;
step D: traversing each specified parking area in the target range, and calculating the saturation variance corresponding to each specified parking area according to the capacity of the specified parking area and the number of the existing vehicles; arranging the specified parking areas according to the ascending order of the saturation variance, and pushing the parking areas to a user;
wherein, if the total number of the specified parking areas in the target range is n, the method of traversing n specified parking areas to obtain the saturation variance in step D specifically includes:
d0, recording the current traversal times as i, and recording the number of the currently traversed specified parking area as j; i is 1, j is 1;
d1, starting the ith traversal;
d2, for the jth prescribed parking area: reading the existing vehicle number ajCapacity bj；
D3, if j ═ i and ai/bjIf < 1, then Qi＝(ai+1)/bi(ii) a If j is equal to i and ai/bi1, then ViEntering D7; if j ≠ i, Qj＝aj/bj(ii) a Wherein Q isjDefining the saturation of the jth parking area in the ith traversal;
D4、j＝j+1；
d5, if j is not equal to n +1, returning to D2; if j is n +1, go to D6;
D6、
j is 1; wherein the content of the first and second substances,
the average saturation of each specified parking area when traversing the ith time; viSaturation variance for the ith designated parking area;
D7、i＝i+1；
d8, if i is not equal to n +1, returning to D1; if i is n +1, entering D9;
d9, arranging the n specified parking areas according to the ascending order of the variance of the saturation degree, and pushing the n specified parking areas to a user;
step E: when the user closes the intelligent lock, the intelligent lock sends the position data to the dispatching system, and the dispatching system compares the position with the range of the specified parking area; if the parking area is outside the specified parking area, giving negative feedback to the user; otherwise, positive feedback is given to the user.
2. The method according to claim 1, wherein the predetermined parking area in step a is a rectangle, and the intersection point of two diagonal lines of the rectangle is the center point of the predetermined parking area; and the dispatching system records the coordinates of the four vertexes and the central point of the specified parking area.
3. The method according to claim 1, wherein the criterion for determining whether the specified parking area is within the target range is: whether the center point of the parking area is within the target range is specified.
4. The method according to claim 1, wherein the coefficient α in step C is a tolerance coefficient obtained through market research.
5. The method as claimed in claim 1, wherein when the smart lock is turned off in step E, the position data transmitted by the smart lock is GPS position data.
6. A shared-bicycle dynamic scheduling system, comprising: the intelligent lock comprises a storage module, a calculation module, a communication module and an intelligent lock;
the intelligent lock transmits information to a communication module, the communication module is respectively connected with a storage module and a calculation module, and the storage module is connected with the calculation module;
the storage module is used for storing map information, the position of a specified parking area, capacity information and intelligent lock position information;
the calculation module is used for calculating the saturation variance of each specified parking area in the target range;
the communication module is used for receiving information transmitted by the intelligent lock;
the intelligent lock is used for transmitting position information and information of unlocking and locking by a user to the communication module;
the calculation module comprises:
the system comprises an input module, a storage module and a display module, wherein the input module is used for receiving initial data, and the initial data comprises position information when a user starts a journey and whether the user selects a specified parking area as a destination; the output end of the input module is connected with the target range module;
the target range module is used for classifying users, judging the user who selects a specified parking area as a destination as a passive participation scheduling user, and judging the user who does not select the specified parking area as the destination as an active participation scheduling user; defining a target range according to rules corresponding to the two types of users, and selecting a specified parking area in the target range;
the sequencing module is used for receiving a target range and a specified parking area from the target range module, receiving the capacity and the number of the existing vehicles of the specified parking area from the storage module, and calculating the saturation variance of each specified parking area in the target range;
the comparison module is used for receiving the position information of the intelligent lock of the user from the communication module and judging the relation between the position and the specified parking area;
the feedback module is used for calculating a feedback coefficient for evaluating the user behavior;
the rules for scoping targets include:
(1) for passively participating in scheduling users, the target range defining rule is: drawing a circle by taking the center point of a specified parking area where a destination is located as the center of the circle and the tolerance radius as the radius, wherein the inner circle is a target range; the tolerance radius is obtained by multiplying the linear distance between the starting point and the central point of the specified parking area selected by the user by a coefficient alpha;
(2) for actively participating in scheduling users, the target range defining rule is: making a circle by taking the starting point as the center of the circle, wherein the inner circle is a target range;
the calculation flow of the sequencing module comprises the following steps:
d0, recording the current traversal times as i, and recording the number of the currently traversed specified parking area as j; i is 1, j is 1;
d1, starting the ith traversal;
d2, for the jth prescribed parking area: reading the existing vehicle number ajCapacity bj；
D3, if j ═ i and aj/bjIf < 1, then Qj＝(aj+1)/bj(ii) a If j is equal to i and aj/bj1, then ViEntering D7; if j ≠ i, Qj＝aj/bj(ii) a Wherein Q isjDefining the saturation of the jth parking area in the ith traversal;
D4、j＝j+1；
d5, if j is not equal to n +1, returning to D2; if j is n +1, go to D6;
D6、
j is 1; wherein the content of the first and second substances,
for traversing the average of the specified parking areas at the i-th timeSaturation degree; viSaturation variance for the ith designated parking area;
D7、i＝i+1；
d8, if i is not equal to n +1, returning to D1; if i is n +1, entering D9;
d9, arranging the n specified parking areas according to the ascending order of the variance of the saturation degree, and pushing the n specified parking areas to the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810650961.5A CN109063957B (en) | 2018-06-22 | 2018-06-22 | Dynamic scheduling method and system for shared bicycle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810650961.5A CN109063957B (en) | 2018-06-22 | 2018-06-22 | Dynamic scheduling method and system for shared bicycle |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109063957A CN109063957A (en) | 2018-12-21 |
| CN109063957B true CN109063957B (en) | 2021-11-02 |
Family
ID=64820790
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810650961.5A Active CN109063957B (en) | 2018-06-22 | 2018-06-22 | Dynamic scheduling method and system for shared bicycle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109063957B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111383447B (en) * | 2018-12-29 | 2021-11-09 | 北京嘀嘀无限科技发展有限公司 | Method, system, device and storage medium for setting vehicle no-parking area |
| CN109712392B (en) * | 2018-12-29 | 2022-05-20 | 百度在线网络技术（北京）有限公司 | Parking information processing method, device, equipment and storage medium based on block chain |
| CN110175704B (en) * | 2019-05-07 | 2022-12-27 | 南京师范大学 | Method for dividing standard parking area of shared vehicles |
| CN111429176A (en) * | 2020-03-20 | 2020-07-17 | 长安大学 | Method for inducing standard parking of bicycle excited by fare |
| CN113095670B (en) * | 2021-04-08 | 2022-07-15 | 上海市城市建设设计研究总院（集团）有限公司 | Planning and site selection method for shared bicycle storage points |
| CN116798234B (en) * | 2023-08-28 | 2024-01-26 | 北京阿帕科蓝科技有限公司 | Method, device, computer equipment and storage medium for determining station parameter information |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106205186A (en) * | 2016-07-11 | 2016-12-07 | 深圳市金立通信设备有限公司 | A kind of method recommending parking spot and terminal |
| CN106991807A (en) * | 2017-05-23 | 2017-07-28 | 周雷文 | A kind of shared bicycle dispatching method and system |
| CN107423848A (en) * | 2017-06-16 | 2017-12-01 | 深圳天珑无线科技有限公司 | The optimization method and system, storage device of shared storing cycle |
| CN107610456A (en) * | 2017-09-11 | 2018-01-19 | 郑州云海信息技术有限公司 | A kind of shared bicycle stand method for normalizing and system based on cloud computing |
| CN107767043A (en) * | 2017-10-11 | 2018-03-06 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN108151754A (en) * | 2017-12-12 | 2018-06-12 | 北京摩拜科技有限公司 | Providing method, server, client and the system of trip service |
-
2018
- 2018-06-22 CN CN201810650961.5A patent/CN109063957B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106205186A (en) * | 2016-07-11 | 2016-12-07 | 深圳市金立通信设备有限公司 | A kind of method recommending parking spot and terminal |
| CN106991807A (en) * | 2017-05-23 | 2017-07-28 | 周雷文 | A kind of shared bicycle dispatching method and system |
| CN107423848A (en) * | 2017-06-16 | 2017-12-01 | 深圳天珑无线科技有限公司 | The optimization method and system, storage device of shared storing cycle |
| CN107610456A (en) * | 2017-09-11 | 2018-01-19 | 郑州云海信息技术有限公司 | A kind of shared bicycle stand method for normalizing and system based on cloud computing |
| CN107767043A (en) * | 2017-10-11 | 2018-03-06 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN108151754A (en) * | 2017-12-12 | 2018-06-12 | 北京摩拜科技有限公司 | Providing method, server, client and the system of trip service |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109063957A (en) | 2018-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109063957B (en) | Dynamic scheduling method and system for shared bicycle | |
| CN111260221B (en) | Traffic facility bearing capacity evaluation method based on dynamic model and oriented to city global situation | |
| CN104021667B (en) | Integrate subscription services and the taxi dispatching system called a taxi in real time and scheduling method | |
| CN108133302B (en) | Public bicycle potential demand prediction method based on big data | |
| Schlote et al. | Delay-tolerant stochastic algorithms for parking space assignment | |
| CN105976041A (en) | Urban intelligent parking reserving system and method based on Internet of vehicles | |
| CN108417031A (en) | A kind of intelligent parking berth reservation policy optimization method based on Agent emulation | |
| CN107101643B (en) | A kind of share-car matching process | |
| CN111985835A (en) | Distribution method for shared parking berths in residential area | |
| CN103458482B (en) | The evolutionary Game method that RSU accesses problem is solved in VANET | |
| CN108416452A (en) | A kind of shared bicycle management system and method | |
| Fulman et al. | Establishing heterogeneous parking prices for uniform parking availability for autonomous and human-driven vehicles | |
| CN111667086A (en) | Vehicle co-riding path optimizing method and system | |
| Farokhi et al. | A study of truck platooning incentives using a congestion game | |
| Mejri et al. | Cooperation versus competition towards an efficient parking assignment solution | |
| CN116798218A (en) | Urban low-carbon traffic big data detection method based on digital twinning | |
| CN111090935B (en) | Public bicycle appointment scheduling and path planning method | |
| Bi et al. | Capturing the characteristics of car-sharing users: Data-driven analysis and prediction based on classification | |
| CN108564810B (en) | Parking space sharing system and method | |
| Cepolina et al. | Innovative strategies for urban car-sharing systems and a simulator to assess their performance | |
| WO2021185331A1 (en) | Ticket price-driven method for encouraging proper parking of bicycles | |
| CN116090646A (en) | Optimal berth solving method and parking guiding system for indoor parking lot | |
| CN116580545A (en) | Standard parking method and system for sharing bicycle based on electronic fence | |
| CN114141046B (en) | Intelligent parking management system based on cloud platform | |
| Palevičius et al. | Evaluation of park and ride facilities at communication corridors in a middle-sized city |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |