CN115689258A - Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position - Google Patents
Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position Download PDFInfo
- Publication number
- CN115689258A CN115689258A CN202310001884.1A CN202310001884A CN115689258A CN 115689258 A CN115689258 A CN 115689258A CN 202310001884 A CN202310001884 A CN 202310001884A CN 115689258 A CN115689258 A CN 115689258A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- station
- stations
- preset range
- reward
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 87
- 229920006395 saturated elastomer Polymers 0.000 claims description 19
- 238000001914 filtration Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012545 processing Methods 0.000 claims description 6
- 230000008901 benefit Effects 0.000 abstract description 14
- 230000000875 corresponding effect Effects 0.000 description 47
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 6
- 238000012216 screening Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Abstract
The invention relates to the technical field of shared vehicles, in particular to a method, a prompting method, a system and a storage medium for optimizing the position of a shared vehicle returning, and the method comprises the following steps: acquiring a block where a vehicle is located when the vehicle is parked and locked, and taking the block as a current block; judging whether the current block meets a first preset condition or not; if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations; after judging all stations of the vehicle in the preset range and reward quotas corresponding to the stations, judging whether the user returns the vehicle to the corresponding station or not, if so, the reward user corresponds to the reward quotas and reminds the completion of vehicle returning, and guiding the user to return the vehicle to the station with high benefit by distributing rewards, so that the overall benefit of the vehicle of an operator is improved, and the problem of unbalanced supply and demand of the existing shared vehicle is solved.
Description
Technical Field
The invention relates to the technical field of shared vehicles, in particular to a method, a prompting method, a system and a storage medium for optimizing the returning position of a shared vehicle.
Background
The vehicle dispatching in the shared vehicle industry is actually a conversion from the vehicle distribution of riding of a user to the ideal station vehicle distribution. Because the riding of the user has obvious hot spot effects, such as: the vehicles at the parking spots at the doorways of the office early peak districts are consumed quickly or even insufficiently, because of more demands, the benefits are higher, and the vehicles at doorways of some companies are less in demand, are consumed slowly, cause the waste of the vehicles, also cause lower benefits and cause the imbalance of the supply and demand of the vehicles, so that the problem of the imbalance of the supply and demand of the vehicles exists in the shared vehicle, the scheduling is very important, how to encourage customers to directly return the vehicles to the hot spot area and reduce the difficulty in scheduling to a certain extent, and the problem of the imbalance of the supply and demand is relieved.
Disclosure of Invention
In order to solve the problem of unbalanced supply and demand of the existing sharing vehicle, the invention provides a method, a prompting method, a system and a storage medium for optimizing the returning position of the sharing vehicle.
The invention provides a method for optimizing the returning position of a shared vehicle, which solves the technical problem and comprises the following steps:
acquiring a block where a vehicle is located when the vehicle is parked and locked, and taking the block as a current block;
judging whether the current block meets a first preset condition or not;
if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations;
and judging whether the station returned by the user terminal to the vehicle belongs to the station with the reward quota, if so, rewarding the user terminal to correspond to the reward quota and reminding the completion of returning the vehicle.
Preferably, the step of determining whether the current block meets the first preset condition includes the following steps:
step S21: judging whether the current block has a station, if so, executing the step S22; if not, executing the step S23;
step S22: judging whether the station is unbalanced in the current time interval; if yes, the current block meets a first preset condition, and if not, the vehicle displays a normal vehicle returning interface;
step S23: judging whether the opportunity cost of the current block in the current time period is less than a preset parameter or not; if yes, the current block meets a first preset condition, and if not, the vehicle displays a normal vehicle returning interface.
Preferably, the preset range is an area formed by taking a GPS of the vehicle as a center and taking a difference between a circular area formed by taking m meters as a radius and a circular area formed by taking n meters as the radius, n is more than or equal to 25 meters and less than or equal to 50 meters, and m is more than or equal to 100 meters and less than or equal to 1000 meters.
Preferably, the step of acquiring all stations of the vehicle within the preset range and the corresponding reward quota specifically comprises the following steps:
acquiring preset information of a station of a vehicle in a preset range;
filtering the stations within the preset range based on a second preset condition to obtain filtered stations;
and calculating the reward quota corresponding to each station in the filtered stations.
Preferably, the second preset condition is one or more of a low-value station and a saturation station.
Preferably, the filtering the stations within the preset range based on the second preset condition specifically includes the following steps:
traversing stations in a preset range, acquiring the estimated income of each station in the preset range, and acquiring the opportunity cost of the current block;
taking stations with estimated income smaller than the opportunity cost of the current block in a preset range as low-value stations, and filtering the low-value stations;
and/or traversing stations in a preset range, and acquiring the current time period station vehicle capacity of each station in the preset range, the current station stock vehicles and the station predicted inflow vehicles in the current time period;
and (3) making a difference between the current time period vehicle capacity of each station in a preset range and the sum of the current time period stock vehicle corresponding to the current time period vehicle capacity and the current time period predicted inflow vehicle, taking the station with the result smaller than zero after the difference is made as a saturated station, and filtering the saturated station.
Preferably, the preset information of the station comprises the vehicle capacity of the station in the current time period, the vehicle stock in the station in the current time period, the predicted inflow vehicle of the station in the current time period, the predicted station income and the vehicle dispatching amount of the station in the current time period.
The invention also provides a prompting method for optimizing the returning position of the shared vehicle, which is used for realizing the method for optimizing the returning position of the shared vehicle, and comprises the following steps:
displaying the station returned by the user terminal vehicle;
acquiring an instruction fed back by a server;
and if the instruction fed back by the server is that the user terminal returns the vehicle to the station with the reward quota, displaying the corresponding reward quota.
The invention also provides a system for optimizing the returning position of the shared vehicle, which is used for realizing the method for optimizing the returning position of the shared vehicle, and comprises the following modules:
an acquisition module: the method comprises the steps of obtaining a block where a vehicle is located when the vehicle is parked and locked and taking the block as a current block;
a judging module: the method comprises the steps of judging whether a current block meets a first preset condition or not;
a processing module: if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations;
a distribution module: and the system is used for judging whether the station returned by the user terminal to the vehicle belongs to the station with the reward quota, if so, the reward user terminal corresponds to the reward quota and reminds the completion of returning the vehicle.
The present invention further provides a computer readable storage medium, on which a computer program is stored, wherein the computer program, when executed by a processor, implements any one of the above methods for optimizing and sharing the returning position of the vehicle.
Compared with the prior art, the method, the prompting method, the system and the storage medium for optimizing the shared vehicle returning position have the following advantages:
1. the method for optimizing the shared vehicle returning position comprises the steps of obtaining a block where a vehicle is located when the vehicle is parked and locked, using the block as a current block, judging whether the current block meets a first preset condition, meeting the first preset condition, obtaining all stations of the vehicle in a preset range and reward quotas corresponding to the stations, calculating the reward quotas corresponding to all the stations of the vehicle in the preset range and each station, continuing to judge whether the vehicle is returned to the corresponding station by a user, rewarding the reward quotas corresponding to the user if the vehicle is returned to the corresponding station by the user, conducting preliminary screening on the current block where the vehicle is located by setting the first preset condition, obtaining the stations meeting the requirements after the preliminary screening is completed, distributing rewards to the user by a system after the user parks the vehicle at the corresponding station, guiding the user to return the vehicle to the station with higher benefit by distributing the rewards, effectively scheduling the vehicle, improving the overall benefits of the vehicle of an operator, and solving the problem of unbalanced supply and demand of the existing shared vehicle.
2. The method for optimizing and sharing the vehicle returning position comprises the steps of judging whether a station exists in a block where a vehicle is located, judging whether the station is unbalanced in the current time interval if the station exists, judging whether the current block meets a first preset condition if the station is unbalanced, displaying a normal vehicle returning interface by the vehicle if the station does not exist in the block where the vehicle is located, acquiring whether the opportunity cost of the current block in the current time interval is smaller than a preset parameter if the opportunity cost of the current block in the current time interval is smaller than the preset parameter, comparing the opportunity cost of the current block in the current time interval with the preset parameter if the current block meets the first preset condition if the opportunity cost of the current block in the current time interval is smaller than the preset parameter, displaying the normal vehicle returning interface if the current block does not meet the first preset condition, directly entering a subsequent process if the opportunity cost of the current block in the current time interval is judged, and displaying the normal vehicle returning interface, wherein the operation is simple and fast.
3. The method for optimizing the shared vehicle returning position comprises the steps of obtaining preset information of stations of the vehicle in a preset range, setting a second preset condition to filter the stations in the preset range to obtain filtered stations, wherein the filtered stations are the stations meeting requirements, respectively calculating reward quota corresponding to each station in the filtered stations, enabling a user to select the corresponding station by himself, enabling the user to obtain the reward after returning the vehicle to the station, and enabling the user to select the corresponding station by himself by calculating the reward quota of each station meeting the condition.
4. In the embodiment of the method for optimizing the shared vehicle returning position, the second preset condition is one or more of a low-value station and a saturated station, after the preset information of the station of the vehicle in the preset range is acquired, the station in the preset range is filtered based on the second preset condition, namely the low-value station and the saturated station relative to the low-value station in the preset range are filtered, the low-value station can be understood as a station which is lower than the value of the station in the current block and has a small order quantity, the saturated station has enough orders and does not need to be scheduled, and after the two types of stations are filtered, the station which meets the requirement for subsequent scheduling can be conveniently screened out, the station which can be screened out for subsequent scheduling can be improved, and the efficiency is improved.
5. The method for optimizing the shared vehicle returning position comprises the steps of traversing stations in a preset range, obtaining estimated income of each station in the preset range, obtaining opportunity cost of a current block, when the estimated income of the stations in the preset range is smaller than the opportunity cost obtained by the current block, indicating that the order quantity of the corresponding stations in the preset range is smaller than that of the current block, namely a low-value station, and/or obtaining the vehicle capacity of the stations in the current period, the stock vehicle of the stations in the current period and the forecast inflow vehicle of the current period of each station in the preset range, respectively making a difference between the vehicle capacity of the stations in the current period and the stock vehicle in the current period and the forecast inflow vehicle in the current period, indicating that the order quantity of the stations is larger after the difference is smaller than zero, namely a saturated station, and filtering the two types of stations, namely the stations which meet the conditions and can be dispatched, so that the vehicles can be dispatched to maximize the overall income.
6. In the embodiment of the method for optimizing and sharing the vehicle returning position, the vehicle capacity of the station in the current time period, the vehicle stock of the station in the current time period, the predicted inflow vehicle of the station in the current time period, the estimated income of the station and the vehicle dispatching amount of the station in the current time period can be known by acquiring the preset information of the station of the vehicle in the preset range, and after the information is obtained, the station can be compared with the current block, so that the value of the station can be known, and the subsequent propulsion is facilitated.
7. The invention also provides a prompting method for optimizing the sharing of the vehicle returning position, a system for optimizing the sharing of the vehicle returning position and a computer readable storage medium, which have the same beneficial effects as the method for optimizing the sharing of the vehicle returning position, and the detailed description is omitted here.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a flowchart illustrating steps of a method for optimizing and sharing a car return position according to a first embodiment of the present invention.
Fig. 2 is a flowchart illustrating a step S2 of a method for optimizing and sharing a car returning position according to a first embodiment of the present invention.
Fig. 3 is a flowchart illustrating a step S3 of a method for optimizing and sharing a car returning position according to a first embodiment of the present invention.
Fig. 4 is a flowchart illustrating a step S32 of a method for optimizing and sharing a car returning position according to a first embodiment of the present invention.
Fig. 5 is a flowchart illustrating steps of a prompting method for optimizing a shared vehicle returning position according to a second embodiment of the present invention.
Fig. 6 is a block diagram of a system for optimizing and sharing the returning position of vehicles according to a third embodiment of the present invention.
Description of the figures:
1. a system for optimizing and sharing the vehicle-returning position;
10. an acquisition module; 20. a judgment module; 30. a processing module; 40. and (4) a distribution module.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
Referring to fig. 1, a first embodiment of the present invention provides a method for optimizing a shared vehicle returning position, applied to a server, including the following steps:
s1: acquiring a block where the vehicle is located when the vehicle is parked and locked, and taking the block as a current block;
s2: judging whether the current block meets a first preset condition or not;
s3: if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations;
s4: and judging whether the station returned by the user terminal to the vehicle belongs to the station with the reward quota, if so, rewarding the user terminal to correspond to the reward quota and reminding the completion of returning the vehicle.
The method for optimizing and sharing the vehicle returning position comprises the steps of obtaining a block where a vehicle is located when the vehicle is in a parking lock state, taking the block as a current block, judging whether the current block meets a first preset condition, judging whether the current block meets the first preset condition, obtaining all stations of the vehicle in a preset range and reward quotas corresponding to the stations, calculating to obtain all stations of the vehicle in the preset range and reward quotas corresponding to each station, continuing to judge whether the vehicle is returned to the corresponding station by a user, rewarding the reward quotas corresponding to the user if the vehicle is returned to the corresponding station by the user, conducting preliminary screening on the current block where the vehicle is located by setting the first preset condition, obtaining the stations meeting requirements after the preliminary screening is completed, distributing rewards to the user by the system after the user stops the vehicle at the corresponding station, and guiding the user to return the vehicle to the station with higher benefit by distributing the reward, so that the vehicle is effectively scheduled, the overall benefits of the vehicle of an operator are improved, and the problem of unbalanced supply and demand of the existing shared vehicle is solved.
It should be noted that the blocks are planned in advance for each city, and the blocks are regular or irregular hexagons with a side length of 25m, that is, in a city specified by an operator, a geographic area of the city is divided into a plurality of blocks.
Further, the station is a circular area formed by taking longitude and latitude of a central point as coordinates and a radius of 25 m.
It should be noted that, the specific type of the reward quota is not limited, and the corresponding specific type may be selected according to the usage scenario. Optionally, the reward quota may be one of a red envelope, a coupon, a discount coupon, and a reward kilometer number. Preferably, in this embodiment of the present invention, the bonus quota is a bonus packet.
Referring to fig. 2, step S2 specifically includes the following steps:
step S21: judging whether the current block has a station, if so, executing the step S22; if not, executing the step S23;
step S22: judging whether the station is unbalanced in the current time period; if yes, the current block meets a first preset condition, and if not, the vehicle displays a normal vehicle returning interface;
step S23: judging whether the opportunity cost of the current block in the current time period is less than a preset parameter or not; if yes, the current block meets a first preset condition, and if not, the vehicle displays a normal vehicle returning interface.
It can be understood that, in the steps of the present invention, it is first determined whether a station exists in a block where a vehicle is located, if so, it is necessary to determine whether the station is unbalanced in the current time period, if not, it is determined that the current block meets a first preset condition, if not, the vehicle displays a normal vehicle returning interface, if not, it is necessary to obtain whether the opportunity cost of the current block in the current time period is less than a preset parameter, if less than the preset parameter, the current block meets the first preset condition, if not, the vehicle displays the normal vehicle returning interface, and by determining whether the current block exists the station or when the station does not exist, it is determined whether the current block meets the first preset condition, if so, a subsequent process can be directly entered, the process is not completed, and the normal vehicle returning interface is displayed, so that the operation is simple and fast.
The imbalance means that the vehicle capacity at the station at the current time is smaller than the sum of the vehicle stock at the current station and the predicted inflow vehicle at the current time, that is, it can be understood that the current station is in a saturated state and cannot accommodate the vehicle which is to be ridden again.
As an alternative embodiment, the preset range is an area formed by taking a GPS of the vehicle as a center and taking a circular area formed by taking m meters as a radius and a circular area formed by taking n meters as a radius as a difference, n is more than or equal to 25 meters and less than or equal to 50 meters, and m is more than or equal to 100 meters and less than or equal to 1000 meters.
It can be understood that, in the embodiment of the present invention, by setting the preset range, it is convenient for the current block to recall the stops within the preset range when the first preset condition is met.
It should be noted that, optionally, the value of m may be 100, 200, 300, 400, 500, 600, 700, 800, 900 and 1000 meters, and preferably, in the embodiment of the present invention, the value of m is 400 meters; further, optionally, the value of n may be 25, 30, 35, 40, 45, and 50 meters, and preferably, in the embodiment of the present invention, the value of n is 30 meters, that is, in the embodiment of the present invention, the preset range is an area obtained by subtracting a circular area formed by taking the GPS of the current vehicle as a center and taking 400m as a radius from a circular area formed by taking the GPS of the current vehicle as a center and taking 30m as a radius.
It should be noted that the GPS coordinates of the vehicle are longitude and latitude coordinates of the current vehicle.
Referring to fig. 3, step S3 specifically includes the following steps:
s31: acquiring preset information of a station of a vehicle within a preset range;
s32: filtering the stations within the preset range based on a second preset condition to obtain filtered stations;
s33: and calculating the reward quota corresponding to each station in the filtered stations.
The method comprises the steps of obtaining preset information of stations of a vehicle in a preset range, setting a second preset condition to filter the stations in the preset range to obtain filtered stations, wherein the filtered stations are the stations meeting requirements, calculating the reward quota corresponding to each station in the filtered stations respectively, enabling a user to select the corresponding station by himself, returning the vehicle to the station to obtain the reward, and enabling the user to select the corresponding station by himself by calculating the reward quota of each station meeting the condition.
As an alternative embodiment, the second preset condition is one or more of a low-value station and a saturation station.
The second preset condition is one or more of a low-value station and a saturated station, after preset information of stations of vehicles in a preset range is acquired, the stations in the preset range are filtered based on the second preset condition, namely, the low-value stations and the saturated stations corresponding to the low-value stations in the preset range are filtered, the low-value stations can be understandably less than the value of the stations in the current block, the order quantity of the saturated stations is enough, scheduling is not needed, and after the two types of stations are filtered, stations meeting follow-up scheduling requirements can be conveniently screened out, the stations which can be screened out in follow-up mode can be improved, and efficiency is improved.
Referring to fig. 4, step S32 specifically includes the following steps:
s321: traversing stations within a preset range, acquiring the estimated income of each station within the preset range, and acquiring the opportunity cost of the current block;
s322: taking stations with estimated income smaller than the opportunity cost of the current block as low-value stations in a preset range, and filtering the low-value stations;
s323: and/or traversing stations in a preset range to obtain the current time period station vehicle capacity of each station in the preset range, the current station stock vehicle and the station predicted inflow vehicle in the current time period;
s324: and (3) making a difference between the current time period vehicle capacity of each station in a preset range and the sum of the current time period stock vehicle corresponding to the current time period vehicle capacity and the current time period predicted inflow vehicle, taking the station with the result smaller than zero after the difference is made as a saturated station, and filtering the saturated station.
The method comprises the steps of traversing stations in a preset range, obtaining estimated income of each station in the preset range, obtaining opportunity cost of a current block, when the estimated income of the stations in the preset range is smaller than the opportunity cost obtained by the current block, indicating that the order quantity of the corresponding stations in the preset range is smaller than that of the current block, namely, the stations are low-value stations, and/or obtaining the vehicle capacity of the stations in the preset range in the current period, the stock vehicles of the stations in the current period and the predicted inflow vehicles in the current period, and respectively subtracting the vehicle capacity of the stations in the current period from the stock vehicles in the current period and the predicted inflow vehicles in the current period, indicating that the order quantity of the stations is larger when the difference is smaller than zero, namely, the stations are saturated stations, and the stations which meet the conditions and can be scheduled are obtained after filtering the stations, so that the vehicles can be scheduled to enable the overall income to be maximized.
As an optional implementation manner, the preset information of the station includes the vehicle capacity of the station in the current time period, the vehicle stock in the station in the current time period, the predicted inflow vehicle of the station in the current time period, the predicted station income and the vehicle dispatch amount of the station in the current time period.
It can be understood that, in the embodiment of the present invention, by obtaining the preset information of the station where the vehicle is in the preset range, the vehicle capacity of the station in the current time period, the vehicle stock of the station in the current time period, the predicted inflow vehicle of the station in the current time period, the estimated income of the station, and the vehicle dispatch amount of the station in the current time period can be known, and after obtaining the information, the station can be compared with the current block, so that the value of the station can be known, which is beneficial to subsequent propulsion.
As an optional implementation manner, a formula for calculating the reward quota corresponding to each station in the filtered stations is as follows:
estimating vehicle moving profit = (station estimated profit-opportunity cost) × passenger unit price;
station demand unsatisfied rate = (vehicle capacity at station of current time slot-predicted inflow of vehicle to station of current time slot-vehicle dispatch amount at station of current time slot) ÷ (1 + vehicle stock at station of current time slot);
station reward quota = predict vehicle moving profit x station distance parameter x station demand unsatisfied rate x reward quota weight parameter.
It should be noted that, in the embodiment of the present invention, the reward refers to a red packet.
The method and the device have the advantages that the reward quota of each station is calculated by respectively calculating the estimated vehicle moving income, the station demand unsatisfied rate, the station distance parameter and the reward quota parameter, after the reward quota of the station meeting the requirements in the preset range is calculated, the user can automatically select which station meeting the requirements stops the vehicle at and obtain the corresponding reward, the user is mobilized to ride the vehicle to the corresponding station by distributing the reward, the overall income of the city can be finally improved, and the method and the device have better economic value.
It should be noted that, in the embodiment of the present invention, the estimated revenue of a station refers to the order quantity generated in the future for 24 hours by all vehicles existing in each time period every day at the station, and then the average value is obtained after summing up historical 30 days; opportunity cost refers to the amount of order that may be lost by removing the vehicle from the block; further, optionally, the unit price of the guest may be 2 yuan, 2.5 yuan, or 3 yuan, which may vary with different cities, and in the embodiment of the present invention, the unit price of the guest is 2.5 yuan.
Further, the station distance parameter is a parameter influenced by the distance between the current vehicle and the target station when the vehicle is scheduled, and when the station reward quota is calculated, it can be understood that the station distance parameter is positively correlated with the distance between the current vehicle and the target station, in the embodiment of the present invention, the distance between the current vehicle and the target vehicle is [ 30 meters to 50 meters ], and the station distance parameter is 1.0; similarly, the distance between the current vehicle and the target vehicle is (50-100 m), and the station distance parameter is 1.2; 100-200 m), the station distance parameter is 1.4; 200-400 m), the distance parameter of the station is 1.6.
Further, the selectable range of the reward quota weight parameter is one sixth to one third, and the selectable values are one sixth, one fifth, one fourth and one third; preferably, in the embodiment of the present invention, the value of the reward quota weight parameter is one fifth.
It should be noted that the station award quota is not less than 0.1 yuan and not more than 2 yuan; and when the calculated station reward quota is larger than 2 yuan, taking the station reward quota as 2 yuan.
Referring to fig. 5, a second embodiment of the present invention provides a prompting method for optimizing a returning position of a shared vehicle, for implementing the method for optimizing a returning position of a shared vehicle provided by the first embodiment of the present invention, including the following steps:
s10: displaying the station returned by the user terminal vehicle;
s20: acquiring an instruction fed back by a server;
s30: and if the instruction fed back by the server is that the user terminal returns the vehicle to the station with the reward quota, displaying the corresponding reward quota.
Referring to fig. 6, a third embodiment of the present invention provides a system 1 for optimizing a shared vehicle returning position, for implementing any one of the above methods for optimizing the shared vehicle returning position, including the following modules:
the acquisition module 10: the method comprises the steps of obtaining a block where a vehicle is located when the vehicle is parked and locked and taking the block as a current block;
the judging module 20: the method comprises the steps of judging whether a current block meets a first preset condition or not;
the processing module 30: if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations;
the distribution module 40: and the system is used for judging whether the station returned by the user to the vehicle belongs to the station with the reward quota, if so, rewarding the user to correspond to the reward quota and reminding the completion of returning the vehicle.
It can be understood that, when the modules of the system 1 for optimizing shared vehicle-returning position are operated, the method for optimizing shared vehicle-returning position provided in the first embodiment is required to be used, and therefore, it is within the scope of the present invention to integrate or configure different hardware for the obtaining module 10, the determining module 20, the processing module 30 and the allocating module 40 to generate functions similar to the effects achieved by the present invention.
A fourth embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements a method for optimizing and sharing a return location of a vehicle as described in any one of the above.
It will be appreciated that the processes described above with reference to the flowcharts may be implemented as computer software programs, in accordance with the disclosed embodiments of the invention. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section, and/or installed from a removable medium. The computer program, when executed by a Central Processing Unit (CPU), performs the above-described functions defined in the method of the present application. It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may include, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
In the embodiments provided herein, it should be understood that "B corresponding to a" means that B is associated with a, from which B can be determined. It should also be understood that determining B from a does not mean determining B from a alone, but may also be determined from a and/or other information.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Those skilled in the art should also appreciate that the embodiments described in this specification are exemplary and alternative embodiments, and that the acts and modules illustrated are not required in order to practice the invention.
In various embodiments of the present invention, it should be understood that the sequence numbers of the above-mentioned processes do not imply an inevitable order of execution, and the execution order of the processes should be determined by their functions and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
The flowchart and block diagrams in the figures of the present application illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Compared with the prior art, the method, the prompting method, the system and the storage medium for optimizing the shared vehicle returning position have the following advantages:
1. the method for optimizing the shared vehicle returning position comprises the steps of obtaining a block where a vehicle is located when the vehicle is parked and locked, using the block as a current block, judging whether the current block meets a first preset condition, meeting the first preset condition, obtaining all stations of the vehicle in a preset range and reward quotas corresponding to the stations, calculating the reward quotas corresponding to all the stations of the vehicle in the preset range and each station, continuing to judge whether the vehicle is returned to the corresponding station by a user, rewarding the reward quotas corresponding to the user if the vehicle is returned to the corresponding station by the user, conducting preliminary screening on the current block where the vehicle is located by setting the first preset condition, obtaining the stations meeting the requirements after the preliminary screening is completed, distributing rewards to the user by a system after the user parks the vehicle at the corresponding station, guiding the user to return the vehicle to the station with higher benefit by distributing the rewards, effectively scheduling the vehicle, improving the overall benefits of the vehicle of an operator, and solving the problem of unbalanced supply and demand of the existing shared vehicle.
2. The method for optimizing and sharing the vehicle returning position comprises the steps of judging whether a station exists in a block where a vehicle is located, judging whether the station is unbalanced in the current time interval if the station exists, judging whether the current block meets a first preset condition if the station is unbalanced, displaying a normal vehicle returning interface by the vehicle if the station does not exist in the block where the vehicle is located, acquiring whether the opportunity cost of the current block in the current time interval is smaller than a preset parameter if the opportunity cost of the current block in the current time interval is smaller than the preset parameter, comparing the opportunity cost of the current block in the current time interval with the preset parameter if the current block meets the first preset condition if the opportunity cost of the current block in the current time interval is smaller than the preset parameter, displaying the normal vehicle returning interface if the current block does not meet the first preset condition, directly entering a subsequent process if the opportunity cost of the current block in the current time interval is judged, and displaying the normal vehicle returning interface, wherein the operation is simple and fast.
3. The method for optimizing and sharing the vehicle returning position comprises the steps of firstly obtaining preset information of stations of the vehicle in a preset range, setting a second preset condition to filter the stations in the preset range to obtain filtered stations, wherein the filtered stations are stations meeting requirements, respectively calculating reward quotas corresponding to each station in the filtered stations, enabling a user to select the corresponding station by himself, obtaining the reward after the vehicle is returned to the station, and enabling the user to select the corresponding station by himself by calculating the reward quotas of each station meeting the condition.
4. In the embodiment of the method for optimizing the shared vehicle returning position, the second preset condition is one or more of a low-value station and a saturated station, after the preset information of the station of the vehicle in the preset range is acquired, the station in the preset range is filtered based on the second preset condition, namely the low-value station and the saturated station relative to the low-value station in the preset range are filtered, the low-value station can be understood as a station which is lower than the value of the station in the current block and has a small order quantity, the saturated station has enough orders and does not need to be scheduled, and after the two types of stations are filtered, the station which meets the requirement for subsequent scheduling can be conveniently screened out, the station which can be screened out for subsequent scheduling can be improved, and the efficiency is improved.
5. The method for optimizing the shared vehicle returning position comprises the steps of traversing stations in a preset range, obtaining estimated income of each station in the preset range, obtaining opportunity cost of a current block, when the estimated income of the stations in the preset range is smaller than the opportunity cost obtained by the current block, indicating that the order quantity of the corresponding stations in the preset range is smaller than that of the current block, namely a low-value station, and/or obtaining the vehicle capacity of the stations in the current period, the stock vehicle of the stations in the current period and the forecast inflow vehicle of the current period of each station in the preset range, respectively making a difference between the vehicle capacity of the stations in the current period and the stock vehicle in the current period and the forecast inflow vehicle in the current period, indicating that the order quantity of the stations is larger after the difference is smaller than zero, namely a saturated station, and filtering the two types of stations, namely the stations which meet the conditions and can be dispatched, so that the vehicles can be dispatched to maximize the overall income.
6. In the embodiment of the method for optimizing and sharing the vehicle returning position, the vehicle capacity of the station in the current time period, the vehicle stock of the station in the current time period, the predicted inflow vehicle of the station in the current time period, the estimated income of the station and the vehicle dispatching amount of the station in the current time period can be known by acquiring the preset information of the station of the vehicle in the preset range, and after the information is obtained, the station can be compared with the current block, so that the value of the station can be known, and the subsequent propulsion is facilitated.
7. The invention also provides a prompting method for optimizing the sharing of the vehicle returning position, a system for optimizing the sharing of the vehicle returning position and a computer readable storage medium, which have the same beneficial effects as the method for optimizing the sharing of the vehicle returning position, and the detailed description is omitted here.
The method, the prompting method, the system and the storage medium for optimizing the shared vehicle returning position disclosed by the embodiment of the invention are described in detail, a specific embodiment is applied in the method to explain the principle and the implementation mode of the invention, and the description of the embodiment is only used for helping to understand the method and the core idea of the invention; meanwhile, for those skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and applications, and in view of the above, the content of the present specification should not be construed as a limitation to the present invention, and any modifications, equivalent substitutions and improvements made within the principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method for optimizing and sharing vehicle returning position is applied to a server and is characterized in that: the method comprises the following steps:
acquiring a block where the vehicle is located when the vehicle is parked and locked, and taking the block as a current block;
judging whether the current block meets a first preset condition or not;
if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations;
and judging whether the station returned by the user terminal to the vehicle belongs to the station with the reward quota, if so, rewarding the user terminal to correspond to the reward quota and reminding the completion of returning the vehicle.
2. The method for optimally sharing the vehicle-to-vehicle location as recited in claim 1, wherein: the step of judging whether the current block meets the first preset condition specifically comprises the following steps:
step S21: judging whether the current block has a station, if so, executing the step S22; if not, executing step S23;
step S22: judging whether the station is unbalanced in the current time period; if yes, the current block meets a first preset condition, and if not, the vehicle displays a normal vehicle returning interface;
step S23: judging whether the opportunity cost of the current block in the current time period is less than a preset parameter or not; if yes, the current block meets a first preset condition, and if not, the vehicle displays a normal vehicle returning interface.
3. The method for optimally sharing the vehicle-to-vehicle location as recited in claim 1, wherein: the preset range is an area formed by taking a GPS of a vehicle as a center and taking a difference between a circular area formed by taking m meters as a radius and a circular area formed by taking n meters as a radius, n is more than or equal to 25 meters and less than or equal to 50 meters, and m is more than or equal to 100 meters and less than or equal to 1000 meters.
4. The method for optimally sharing the vehicle-to-vehicle location as recited in claim 3, wherein: the method for acquiring all stations of the vehicle within the preset range and the corresponding reward quota specifically comprises the following steps:
acquiring preset information of a station of a vehicle within a preset range;
filtering stations within a preset range based on a second preset condition to obtain filtered stations;
and calculating the reward quota corresponding to each station in the filtered stations.
5. The method for optimally sharing the vehicle-to-vehicle location as recited in claim 4, wherein: the second preset condition is one or more of a low-value station and a saturation station.
6. The method for optimally sharing the vehicle-to-vehicle location as recited in claim 5, wherein: the filtering of the stations within the preset range based on the second preset condition specifically comprises the following steps:
traversing stations within a preset range, acquiring the estimated income of each station within the preset range, and acquiring the opportunity cost of the current block;
taking stations with estimated income smaller than the opportunity cost of the current block as low-value stations in a preset range, and filtering the low-value stations;
and/or traversing stations in a preset range to obtain the current time period station vehicle capacity of each station in the preset range, the stock vehicle of the station in the current time period and the predicted inflow vehicle of the station in the current time period;
and (3) making a difference between the current time period vehicle capacity of each station in a preset range and the sum of the current time period stock vehicle corresponding to the current time period vehicle capacity and the current time period predicted inflow vehicle, taking the station with the difference result smaller than zero as a saturated station, and filtering the saturated station.
7. The method for optimizing shared cart-to-cart locations of claim 4, wherein: the preset information of the station comprises the vehicle capacity of the station in the current time period, the vehicle stock of the station in the current time period, the predicted inflow vehicle of the station in the current time period, the predicted station income and the vehicle dispatching amount of the station in the current time period.
8. A prompting method for optimizing the returning position of a shared vehicle is used for realizing the method for optimizing the returning position of the shared vehicle, which is disclosed by any one of claims 1 to 7 and is characterized in that: the method comprises the following steps:
displaying the station returned by the user terminal vehicle;
acquiring an instruction fed back by a server;
and if the instruction fed back by the server is that the user terminal returns the vehicle to the station with the reward quota, displaying the corresponding reward quota.
9. A system for optimizing the returning position of a shared vehicle is used for realizing the method for optimizing the returning position of the shared vehicle according to any one of claims 1 to 7, and is characterized by comprising the following modules:
an acquisition module: the method comprises the steps of obtaining a block where a vehicle is located when the vehicle is parked and locked and taking the block as a current block;
a judging module: the method comprises the steps of judging whether a current block meets a first preset condition or not;
a processing module: if the first preset condition is met, acquiring all stations of the vehicle within a preset range and reward quotas corresponding to the stations;
a distribution module: and the system is used for judging whether the station returned by the user terminal to the vehicle belongs to a station with the reward quota, if so, the reward user terminal corresponds to the reward quota and reminds the completion of vehicle returning.
10. A computer-readable storage medium having stored thereon a computer program, characterized in that: the computer program when executed by a processor implements a method of optimizing shared vehicle-to-vehicle location according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310001884.1A CN115689258A (en) | 2023-01-03 | 2023-01-03 | Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310001884.1A CN115689258A (en) | 2023-01-03 | 2023-01-03 | Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115689258A true CN115689258A (en) | 2023-02-03 |
Family
ID=85057192
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310001884.1A Pending CN115689258A (en) | 2023-01-03 | 2023-01-03 | Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115689258A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116363854A (en) * | 2023-05-31 | 2023-06-30 | 北京阿帕科蓝科技有限公司 | Shared travel vehicle dispatching method and device and computer equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160343068A1 (en) * | 2014-01-31 | 2016-11-24 | Bluecarsharing | Method and system for rebalancing a facility for shared use of vehicles, and facility implementing such a method and/or system |
| CN108427998A (en) * | 2017-09-15 | 2018-08-21 | 杭州创屹机电科技有限公司 | A kind of shared bicycle integration managing scheduling system and method |
| TWI680432B (en) * | 2018-09-05 | 2019-12-21 | 逢甲大學 | Bicycle sharing management system and method |
| CN112036933A (en) * | 2020-08-14 | 2020-12-04 | 上海擎感智能科技有限公司 | Method for information processing, electronic equipment and computer storage medium |
| CN114549145A (en) * | 2022-04-25 | 2022-05-27 | 宁波小遛共享信息科技有限公司 | Vehicle returning method, server and storage medium for sharing vehicle |
-
2023
- 2023-01-03 CN CN202310001884.1A patent/CN115689258A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160343068A1 (en) * | 2014-01-31 | 2016-11-24 | Bluecarsharing | Method and system for rebalancing a facility for shared use of vehicles, and facility implementing such a method and/or system |
| CN108427998A (en) * | 2017-09-15 | 2018-08-21 | 杭州创屹机电科技有限公司 | A kind of shared bicycle integration managing scheduling system and method |
| TWI680432B (en) * | 2018-09-05 | 2019-12-21 | 逢甲大學 | Bicycle sharing management system and method |
| CN112036933A (en) * | 2020-08-14 | 2020-12-04 | 上海擎感智能科技有限公司 | Method for information processing, electronic equipment and computer storage medium |
| CN114549145A (en) * | 2022-04-25 | 2022-05-27 | 宁波小遛共享信息科技有限公司 | Vehicle returning method, server and storage medium for sharing vehicle |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116363854A (en) * | 2023-05-31 | 2023-06-30 | 北京阿帕科蓝科技有限公司 | Shared travel vehicle dispatching method and device and computer equipment |
| CN116363854B (en) * | 2023-05-31 | 2023-10-24 | 北京阿帕科蓝科技有限公司 | Shared travel vehicle dispatching method and device and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ma et al. | Designing optimal autonomous vehicle sharing and reservation systems: A linear programming approach | |
| US11449908B2 (en) | Method and system for determining transport service fee | |
| CN108475466B (en) | System and method for matching and displaying service requests and available vehicles | |
| US20200120037A1 (en) | Systems and methods for transport capacity scheduling | |
| CN108830504B (en) | Vehicle demand prediction method, system, server and computer storage medium | |
| CN111832788B (en) | Service information generation method, device, computer equipment and storage medium | |
| CN101123551B (en) | An intelligent bus system based on communication and grid computing technology | |
| Liu et al. | A panel analysis of the effect of the urban environment on the spatiotemporal pattern of taxi demand | |
| CN108154253B (en) | Travel mode recommendation method and device | |
| JP2013041324A (en) | Automobile invitation device, on-vehicle terminal device, automobile invitation method, and program therefor | |
| CN109858984B (en) | Information providing apparatus and information providing method | |
| CN111861075B (en) | Resource allocation method, resource allocation device and readable storage medium | |
| US20110082816A1 (en) | Systems and methods for optimizing vehicle towing | |
| CN115689258A (en) | Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position | |
| CN111815096A (en) | Shared automobile delivery method, electronic device and storage medium | |
| JP2019159663A (en) | Information processing system, information processing method, and information processing program | |
| Cuevas et al. | Management of on-demand transport services in urban contexts. Barcelona case study | |
| CN110730198A (en) | Bus information pushing method and device, storage medium and terminal | |
| TW201608518A (en) | Parking distribution system for cloud-based smart public bicycles | |
| Jakob et al. | Optimal parking occupancy with and without differentiated parking: A macroscopic analysis | |
| CN111815991A (en) | Shared automobile parking management and control method, electronic equipment and storage medium | |
| CN105336157A (en) | Interactive taxi calling system and method | |
| Csiszár et al. | Concept of an integrated mobile application aiding electromobility | |
| CN115423360A (en) | Public charging station planning method and device | |
| CN114091932A (en) | Resource scheduling method, device, medium and electronic equipment |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230203 |