CN116363854A - Shared travel vehicle dispatching method and device and computer equipment - Google Patents
Shared travel vehicle dispatching method and device and computer equipment Download PDFInfo
- Publication number
- CN116363854A CN116363854A CN202310628647.8A CN202310628647A CN116363854A CN 116363854 A CN116363854 A CN 116363854A CN 202310628647 A CN202310628647 A CN 202310628647A CN 116363854 A CN116363854 A CN 116363854A
- Authority
- CN
- China
- Prior art keywords
- information
- vehicle
- target
- station
- block
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 230000008901 benefit Effects 0.000 claims abstract description 64
- 239000011159 matrix material Substances 0.000 claims abstract description 43
- 238000004364 calculation method Methods 0.000 claims abstract description 24
- 238000005457 optimization Methods 0.000 claims abstract description 15
- 238000012216 screening Methods 0.000 claims abstract description 10
- 238000004590 computer program Methods 0.000 claims description 14
- 230000004044 response Effects 0.000 claims description 9
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 239000000463 material Substances 0.000 description 3
- 238000007796 conventional method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 229920006395 saturated elastomer Polymers 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012886 linear function Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Abstract
The application relates to a shared travel vehicle dispatching method, a shared travel vehicle dispatching device and computer equipment, comprising the following steps: responding to a dispatching request instruction, acquiring block geographic range information, vehicle geographic position information and current vehicle stock information of a station, and screening a target block from an initial block according to the vehicle geographic position information and the block geographic range information; inquiring target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction, and determining target calling vehicle number information according to preset vehicle calling conditions; and generating a comprehensive benefit matrix according to the distance cost information between the target block and the station, the station benefit information corresponding to the request time and the block opportunity cost information, and further carrying out transportation optimization calculation according to the number information of the target dispatching vehicles to generate a block vehicle dispatching strategy. Based on the above, the generation of the information of calling vehicles from each target block to each station can be efficiently completed.
Description
Technical Field
The present disclosure relates to the field of vehicle dispatching technologies, and in particular, to a method, an apparatus, and a computer device for dispatching a shared traveling vehicle.
Background
The sharing two-wheel vehicle is used as an important tool for short-distance travel, and great convenience is provided for urban travel of users. Because riding of users can cause the distribution of vehicles in cities to be different, the vehicles need to be scheduled in order to better serve and meet the short trip demands of the users, so that the distribution of the vehicles is adapted to the supply and demand state change of the cities.
However, matching the points of all surplus vehicles with the points of all demand vehicles in existing vehicle dispatching methods is complex and inefficient.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a shared travel vehicle dispatching method, apparatus, and computer device that can efficiently dispatch vehicles.
In a first aspect, the present application provides a shared travel vehicle dispatching method. The method comprises the following steps:
responding to a dispatching request instruction, and acquiring block geographic range information of all initial blocks, vehicle geographic position information of all vehicles and station information of all stations; the station information comprises current vehicle stock information of the station;
Screening target blocks meeting vehicle dispatching conditions from the initial blocks according to the vehicle geographic position information and the block geographic range information;
inquiring target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction, and determining target calling vehicle number information of the station according to the current vehicle stock information, the target vehicle riding information, the target capacity information and preset vehicle calling conditions;
generating a comprehensive benefit matrix according to the distance cost information between the target block and the station, the station benefit information corresponding to the request time and the block opportunity cost information;
and carrying out transportation optimization calculation based on the comprehensive income matrix and the target dispatching vehicle number information of each station, and generating a block vehicle dispatching strategy, wherein the block vehicle dispatching strategy comprises dispatching vehicle information of each target block to each station.
In one embodiment, the screening the initial block for the target block meeting the vehicle dispatching condition according to the vehicle geographic position information and the block geographic range information includes:
Matching the vehicle geographic position information with the block geographic range information, and determining vehicle information corresponding to the initial block according to a matching result; the vehicle information comprises the number of vehicles corresponding to the initial block;
and based on a preset vehicle threshold condition, taking an initial block of which the number of vehicles meets the preset vehicle threshold condition as the target block.
In one embodiment, the preset time range information table includes a plurality of time ranges, and the time ranges are divided into a plurality of time periods; the step of inquiring the target vehicle riding information and the target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction comprises the following steps:
querying a target time period in a target time range to which the request time belongs in the preset time range information table;
taking the predicted vehicle riding information corresponding to the target time range as the target vehicle riding information;
determining first weight information corresponding to the target time range and second weight information corresponding to the next time range adjacent to the target time range according to the position information of the target time period in the target time range;
And inquiring first vehicle-station capacity information corresponding to the target time range and second vehicle-station capacity information corresponding to a next time range adjacent to the target time range in the preset time range information table, and determining the target capacity information according to the first weight information, the second weight information, the first vehicle-station capacity information and the second vehicle-station capacity information.
In one embodiment, the determining the target number of vehicles in the station according to the current vehicle stock information, the target vehicle riding information, the target capacity information and the preset vehicle calling condition includes:
determining initial call-in vehicle number information according to the current vehicle stock information, the target vehicle riding information and the target capacity information;
when the initial calling vehicle number information meets a first calling number condition, taking the initial calling vehicle number information as the target calling vehicle number information;
and when the initial calling vehicle number information does not meet the first calling number condition, taking preset calling vehicle number information as the target calling vehicle number information.
In one embodiment, the method further comprises:
and when the initial calling vehicle number information does not meet the first calling number condition, if the initial calling vehicle number information meets the second calling number condition, taking preset income information as the station income information.
In one embodiment, the method further comprises:
determining distance data information from each target block to each station according to station geographic position information of the station and block geographic range information of the target block;
and determining the distance cost information corresponding to the target block to the station according to the distance data information based on a preset distance cost calculation strategy.
In one embodiment, the distance data information includes distance data corresponding to each of the target blocks and each of the stations, the comprehensive benefit matrix includes benefit information corresponding to each of the target blocks and each of the stations, and the method further includes:
taking a target block and station corresponding information contained in the distance data information with the distance data lower than a preset distance threshold value as risk corresponding information;
and updating the benefit information corresponding to the risk corresponding information into target scheduling benefit information in the comprehensive benefit matrix, and generating an updated comprehensive benefit matrix.
In a second aspect, the application further provides a shared travel vehicle dispatching device. The device comprises:
the response module is used for responding to the dispatching request instruction and acquiring block geographic range information of all initial blocks, vehicle geographic position information of all vehicles and station information of all stations; the station information comprises current vehicle stock information of the station;
the target block determining module is used for screening target blocks meeting vehicle dispatching conditions from the initial blocks according to the vehicle geographic position information and the block geographic range information;
the scheduling request instruction is used for scheduling the request instruction according to the target vehicle riding information and the target capacity information of each station, and scheduling the request instruction according to the target vehicle riding information and the target capacity information of each station;
the profit matrix determining module is used for generating a comprehensive profit matrix according to the distance cost information between the target block and the station, the station profit information corresponding to the request time and the block opportunity cost information;
The dispatching strategy determining module is used for carrying out transportation optimization calculation based on the comprehensive income matrix and the target dispatching vehicle number information of each station to generate a block vehicle dispatching strategy, and the block vehicle dispatching strategy comprises dispatching vehicle information of each target block to each station.
In one embodiment, the target block determining module is specifically configured to:
matching the vehicle geographic position information with the block geographic range information, and determining vehicle information corresponding to the initial block according to a matching result; the vehicle information comprises the number of vehicles corresponding to the initial block;
and based on a preset vehicle threshold condition, taking an initial block of which the number of vehicles meets the preset vehicle threshold condition as the target block.
In one embodiment, the preset time range information table includes a plurality of time ranges, and the time ranges are divided into a plurality of time periods; the calling vehicle number determining module is specifically configured to:
querying a target time period in a target time range to which the request time belongs in the preset time range information table;
taking the predicted vehicle riding information corresponding to the target time range as the target vehicle riding information;
Determining first weight information corresponding to the target time range and second weight information corresponding to the next time range adjacent to the target time range according to the position information of the target time period in the target time range;
and inquiring first vehicle-station capacity information corresponding to the target time range and second vehicle-station capacity information corresponding to a next time range adjacent to the target time range in the preset time range information table, and determining the target capacity information according to the first weight information, the second weight information, the first vehicle-station capacity information and the second vehicle-station capacity information.
In one embodiment, the calling vehicle number determining module is specifically configured to:
determining initial call-in vehicle number information according to the current vehicle stock information, the target vehicle riding information and the target capacity information;
when the initial calling vehicle number information meets a first calling number condition, taking the initial calling vehicle number information as the target calling vehicle number information;
and when the initial calling vehicle number information does not meet the first calling number condition, taking preset calling vehicle number information as the target calling vehicle number information.
In one embodiment, the shared travel vehicle dispatching device further includes:
and the station income information determining module is used for taking preset income information as the station income information if the initial calling vehicle number information meets a second calling number condition when the initial calling vehicle number information does not meet the first calling number condition.
In one embodiment, the shared travel vehicle dispatching device further includes:
the distance data determining module is used for determining the distance data information from each target block to each station according to the station geographic position information of the station and the block geographic range information of the target block;
the distance cost determining module is used for determining the distance cost information corresponding to the target block to the station according to the distance data information based on a preset distance cost calculating strategy.
In one embodiment, the distance data information includes distance data corresponding to each target block and each station, the comprehensive benefit matrix includes benefit information corresponding to each target block and each station, and the shared travel vehicle scheduling device further includes:
The risk corresponding information determining module is used for taking the target block and the station corresponding information which are included in the distance data information with the distance data lower than the preset distance threshold value as risk corresponding information;
and the comprehensive benefit matrix updating module is used for updating the benefit information corresponding to the risk corresponding information into target scheduling benefit information in the comprehensive benefit matrix and generating an updated comprehensive benefit matrix.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor implementing the steps of the first aspect described above when the processor executes the computer program.
In a fourth aspect, the present application also provides a computer-readable storage medium. The computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps described in the first aspect described below.
The application provides a method, a device and computer equipment for dispatching a shared traveling vehicle, wherein in the method, block geographic range information of an initial block, vehicle geographic position information and current vehicle stock information of all stations are obtained in response to a dispatching request instruction, and a target block is screened out from the initial block according to the vehicle geographic position information and the block geographic range information; inquiring target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction, and determining target calling vehicle number information according to preset vehicle calling conditions; and generating a comprehensive benefit matrix according to the distance cost information between the target block and the station, the station benefit information corresponding to the request time and the block opportunity cost information, and further carrying out transportation optimization calculation according to the number information of the target dispatching vehicles to generate a block vehicle dispatching strategy. Based on the scheme, the generation of the information of the vehicles scheduled to each station by each target block can be efficiently completed in response to the scheduling request instruction, and the scheme is based on the comprehensive profit matrix to carry out transportation optimization calculation, so that the comprehensive profit of the generated block vehicle scheduling strategy can be maximized.
Drawings
In order to more clearly illustrate the technical solutions of embodiments or conventional techniques of the present application, the drawings required for the descriptions of the embodiments or conventional techniques will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person of ordinary skill in the art.
FIG. 1 is a flow chart of a method for sharing a travel vehicle dispatch in one embodiment;
FIG. 2 is a flow chart of a method for sharing a travel vehicle dispatch in another embodiment;
FIG. 3 is a flow chart of a method for sharing a travel vehicle dispatch in another embodiment;
FIG. 4 is a block diagram of a shared travel vehicle dispatcher in one embodiment;
fig. 5 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
In one embodiment of the present application, as shown in fig. 1, a method for scheduling a shared traveling vehicle is provided, where the method is applied to a terminal (may be referred to as a management terminal) for illustration, it may be understood that the method may also be applied to a server, and may also be applied to a system including the terminal and the server, and implemented through interaction between the terminal and the server. The terminal can be integrated in the sharing bicycle, and the terminal can be, but not limited to, various personal computers and notebook computers. The server may be implemented as a stand-alone server or as a server cluster composed of a plurality of servers. In this embodiment, the method includes the steps of:
The terminal receives and responds to the dispatching request instruction, and can acquire vehicle geographic position information of all vehicles through a positioning system, wherein the vehicle geographic position information can comprise vehicle gps (Global Positioning System; global positioning system) positioning information, vehicle number id, vehicle type and the like. The terminal may store the block geographical range information of all the initial blocks in advance. The terminal may also communicate with the transceiver of each station to obtain station information of each station, which may include current vehicle stock information of the station, and the number of vehicles parked at the station.
The terminal can screen out an initial block with a parked vehicle in the geographic range of the block as a target block according to the geographic range information of the initial block and the geographic position information of each vehicle, so that the target block can complete the vehicle dispatching function.
Specifically, the terminal may communicate with the transceiver of each station to obtain predicted vehicle riding information and capacity information of each station within each time range, thereby forming a preset time range information table. The terminal can also determine the riding information and the target capacity information of the target vehicles of each station in a preset time range information table according to the request time corresponding to the scheduling request instruction. Further, for a station, the terminal determines the number of vehicles to be called in the station, namely the number information of target calling vehicles, according to the current vehicle stock information, the target vehicle riding information, the target capacity information and the preset vehicle calling conditions of the station.
And 104, generating a comprehensive benefit matrix according to the distance cost information between the target block and the station, the station benefit information corresponding to the request time and the block opportunity cost information.
The terminal can determine the distance cost information between each target block and each station according to the block geographic range information of the target block and the station geographic position information of the station. The terminal can also generate a comprehensive benefit matrix according to the distance cost information, the station benefit information corresponding to the request time and the block opportunity cost information. Specifically, the comprehensive benefit = (station benefit of station B-block opportunity cost of block a) corresponding to block a to station B is the guest unit price-block a to station B distance cost, wherein the guest unit price represents average price per unit/unit, and can be set according to actual requirements.
And 105, carrying out transportation optimization calculation based on the comprehensive income matrix and the target dispatching-in vehicle number information of each station, and generating a block vehicle dispatching strategy, wherein the block vehicle dispatching strategy comprises dispatching-in vehicle information of each target block to each station.
Specifically, the terminal performs optimal transportation calculation based on the comprehensive benefit matrix and the target dispatching-in vehicle number information of each station, and generates a block vehicle dispatching strategy which can maximize the comprehensive benefit.
In the shared traveling vehicle dispatching method, block geographic range information, vehicle geographic position information and current vehicle stock information of all stations of an initial block are obtained in response to a dispatching request instruction, and a target block is screened out from the initial block according to the vehicle geographic position information and the block geographic range information; inquiring target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction, and determining target calling vehicle number information according to preset vehicle calling conditions; and generating a comprehensive benefit matrix according to the distance cost information between the target block and the station, the station benefit information corresponding to the request time and the block opportunity cost information, and further carrying out transportation optimization calculation according to the number information of the target dispatching vehicles to generate a block vehicle dispatching strategy. Based on the scheme, the generation of the information of the vehicles scheduled to each station by each target block can be efficiently completed in response to the scheduling request instruction, and the scheme is based on the comprehensive profit matrix to carry out transportation optimization calculation, so that the comprehensive profit of the generated block vehicle scheduling strategy can be maximized.
In one embodiment of the present application, the step 102 of screening the initial block for the target block that meets the vehicle dispatching condition according to the vehicle geographic location information and the block geographic range information includes:
matching the vehicle geographic position information with the block geographic range information, and determining vehicle information corresponding to the initial block according to a matching result; the vehicle information comprises the number of vehicles corresponding to the initial block;
based on the preset vehicle threshold condition, an initial block of which the number of vehicles meets the preset vehicle threshold condition is taken as a target block.
The geographic position information of the vehicle is the positioning information of the gps (Global Positioning System; global positioning system) of the vehicle, and the geographic range information of the block is the preset geographic range information of each block stored by the terminal. The terminal matches the vehicle geographic position information of all vehicles with the geographic range information of all blocks, and for each block, the terminal can determine the information of all vehicles with the geographic positions of the vehicles within the geographic range of the block according to the matching result. Specifically, the terminal may determine, according to the matching result, the number of vehicles parked in the geographic range of the block, that is, the number of vehicles corresponding to the initial block.
In one embodiment of the present application, the terminal stores a preset vehicle threshold, and the terminal may use an initial block with the number of vehicles greater than or equal to the preset vehicle threshold as the target block, thereby completing screening of the target block. It should be noted that, the preset vehicle threshold may be set according to actual needs, which is not limited in this application.
In the shared traveling vehicle dispatching method, the terminal screens out the target blocks from the initial blocks according to the matching result of the vehicle geographic position information and the block geographic range information, so that the initial blocks of which the number of vehicles does not meet the preset vehicle threshold condition are eliminated, and possible waste of manpower and material resources in the vehicle dispatching process can be avoided.
In one embodiment of the present application, the preset time range information table includes a plurality of time ranges, the time ranges being divided into a plurality of time periods; as shown in fig. 2, the step 103 includes, according to a request time of a scheduling request instruction, querying target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table, where the target vehicle riding information and the target capacity information include:
in step 201, a target time period in a target time range to which the request time belongs is queried in a preset time range information table.
The preset time range information table comprises a plurality of time ranges, and the time ranges can be divided according to average vehicle effect of the city in the near ten days. On day effect = on day order/number of available vehicles on day, equivalent to measuring the number of cycles a vehicle is ridden per day, dividing 24 hours by the mean of the next ten days effect gives an average of several hours a single, for example: 24/5.8=4.1, rounding down to get 1 revolution of the city every 4 hours of vehicles recently, then 24 hours can be divided into a number of time ranges.
Furthermore, the terminal stores a time range division strategy, so that a target time period of a target time range to which the request time belongs can be accurately determined.
The preset time range information table stores predicted vehicle riding information and station capacity information corresponding to each time range of each station. The predicted vehicle ride-in information is a predicted value of the number of station ride-in vehicles corresponding to the target time range. The terminal may directly use predicted vehicle ride information of the station corresponding to the target time range as the target vehicle ride information.
The terminal may store a correspondence between the location information and the first weight information, and between the location information and the second weight information. For example, the time range is divided into two time periods, and when the target time period is a first time period in the target time range, a first weight corresponding to the target time range is set to be 1, and a second weight corresponding to a next time range adjacent to the target time range is set to be 0; when the target time period is in the second time period in the target time range, the first weight corresponding to the target time range is set to be 0.5, and the second weight corresponding to the next time range adjacent to the target time range is set to be 0.5.
It should be noted that, the correspondence between the position information and the first weight information, and the second weight information may be set according to actual requirements, and the comparison of the present application is not limited in any way.
The preset time range information table stores station capacity information of each station corresponding to each time range, wherein the station capacity information indicates expected values of the number of parked vehicles of the station corresponding to the time range.
Specifically, the terminal may determine a first target capacity according to a product of the first weight and the first station capacity; the terminal can also determine a second target capacity according to the product of the second weight and the second station capacity, and further determine target capacity information according to the sum of the first target capacity and the second target capacity, wherein the target capacity information indicates an expected value of the number of the station parked vehicles corresponding to the request time.
In the method for dispatching the shared traveling vehicles, the target capacity information of the station is determined based on the position information of the target time period of the request time in the target time range, so that the target capacity information of the station and the position information of the target time period of the request time in the target time range have relevance, and the dispatching accuracy of the vehicles is improved, and meanwhile, the dispatching income level is also improved.
In one embodiment of the present application, the step 103 determines the target calling vehicle number information of the station according to the current vehicle stock information, the target vehicle riding information, the target capacity information and the preset vehicle calling condition, including:
Determining initial calling vehicle number information according to the current vehicle stock information, the target vehicle riding information and the target capacity information;
when the initial calling vehicle number information meets the first calling number condition, taking the initial calling vehicle number information as target calling vehicle number information;
and when the initial calling vehicle number information does not meet the first calling number condition, taking the preset calling vehicle number information as target calling vehicle number information.
Wherein, for one station, the initial number of vehicles to be tuned in = target capacity of station-current vehicle stock of station-target number of vehicles to be ridden of that station. For a station, the initial number of vehicles to be dispatched indicates the number of vehicles to be dispatched to the station corresponding to the request time.
Further, the terminal stores a first calling number threshold, and when the number of the initial calling vehicles is smaller than the first calling number threshold, the terminal determines that the information of the number of the initial calling vehicles does not meet the first calling number condition, and carries out zero resetting processing on the number of the initial calling vehicles. It should be noted that, the first tuning number threshold is a positive integer, and specific setting may be set according to actual requirements, which is not limited in this application.
In the method, the terminal screens out the stations with the number of the initial dispatching vehicles lower than the first number threshold value, and carries out zero resetting treatment on the number of the initial dispatching vehicles of the stations, namely, the number of the dispatching vehicles required by the stations is zeroed, so that waste of manpower and material resources in the dispatching process due to too few dispatching vehicles is avoided.
In one embodiment of the present application, the shared travel vehicle dispatching method further includes:
and when the initial calling vehicle number information does not meet the first calling number condition, if the initial calling vehicle number information meets the second calling number condition, taking the preset income information as station income information.
The terminal stores station benefit information corresponding to each station in each time range, and further can determine the station benefit information of the station according to the target time range to which the request time belongs.
Further, for a station, the terminal stores a second calling number threshold, and when the number of the initial calling vehicles is lower than the first calling number and lower than the second calling number, it is determined that the number information of the initial calling vehicles meets the second calling number condition, and station benefits corresponding to the request time are subjected to zeroing processing, namely the preset station benefits in the preset benefit information are 0. When the number of the initial call vehicles is lower than the second call number, the number of the vehicles called into the station is indicated to be negative, and the station is in a saturated state at the moment, so that station income is required to be set to be 0, and the participation in the subsequent transportation optimization calculation is avoided.
According to the shared travel vehicle dispatching method, stations in a saturated state (namely stations in which vehicles are not required to be dispatched) can be effectively screened, data information of transportation optimization calculation is simplified, and a block vehicle dispatching strategy can be efficiently generated.
In one embodiment of the present application, as shown in fig. 3, the shared travel vehicle dispatching method further includes:
The station geographic position information is station gps (Global Positioning System; global positioning system) positioning information, and the block geographic range information is preset geographic range information of each block stored by the terminal.
Specifically, in the process of calculating the distance data information, for each target block, the terminal determines the center point position information of the target block according to the block geographic range information of the target block, wherein the center point position information is the centroid position of the geographic range of the target block. Further, the terminal may determine distance data information between the target block and each station according to the location information of the center point and the geographic location information of each station. The method can generate block distance data for generating Cartesian products, namely distance data information from each target block to each station.
The distance data information comprises distance data from each target block to each station. The terminal stores cost calculation strategies corresponding to each distance range, and distance cost corresponding to each target block and each station can be determined according to the distance data.
In one embodiment of the present application, the preset distance cost calculation strategy may be a piecewise linear function. Specifically, the preset distance cost calculation strategy may be:
when 0 < x+.1 km, cost= (1.4-0) ×0)/(1000-0);
when 1km < x +.2.5 km: cost= (2.1-1.4) × (x-1000)/(2500-1000) +1.4;
when x is less than or equal to 2.5km and less than or equal to 4 km: cost= (2.8-2.1) × (x-2500)/(4000-2500) +2.1;
when 4km < x is less than or equal to 5.5 km: cost= (4.2-2.8) × (x-4000)/(5500-4000) +2.8;
when 5.5km < x: cost=4.2.
Wherein x is distance data from a block to a station; cost is the cost of the distance from the block to the station in units of elements.
It should be noted that the preset distance cost calculation strategy may be set according to actual needs, which is not limited in this application.
In the method for dispatching the shared traveling vehicles, the terminal determines the distance cost information corresponding to each target block to each station based on the station geographic position information of the station, the block geographic range information of the target block and a preset distance cost calculation strategy, so that the step of generating the comprehensive profit matrix can be performed. Based on the distance cost information is combined in the process of carrying out transportation optimization calculation, so that the transportation cost can be accurately controlled, and efficient generation of a income-maximised scheduling strategy is facilitated.
In an embodiment of the present application, the distance data information includes distance data corresponding to each target block and each station, the comprehensive benefit matrix includes benefit information corresponding to each target block and each station, and the shared travel vehicle scheduling method further includes:
taking target blocks and station corresponding information contained in the distance data information with the distance data lower than a preset distance threshold value as risk corresponding information;
and updating the benefit information corresponding to the risk corresponding information into target scheduling benefit information in the comprehensive benefit matrix, and generating an updated comprehensive benefit matrix.
The terminal stores a preset distance threshold. The terminal can screen out the corresponding relation between the close-range block and the station according to a preset distance threshold. For example, the preset distance threshold is 25 meters, and the terminal determines the corresponding relationship between the target block with the distance lower than 25 meters and the station as the risk corresponding relationship. And the terminal searches the benefit information corresponding to the risk corresponding relation in the comprehensive benefit matrix, and updates the benefit value included in the benefit information into target scheduling benefit. In one embodiment of the present application, the target scheduling benefit information may include a target scheduling benefit of 999 yuan, and the target scheduling benefit may be set according to an actual requirement, which is not limited in this application.
Further, the terminal needs to perform transportation optimization calculation according to the updated comprehensive income matrix and the target dispatching vehicle number information of each station, and generates a block vehicle dispatching strategy, wherein the block vehicle dispatching strategy comprises dispatching vehicle information of each target block to each station.
In the shared traveling vehicle dispatching method, the terminal screens out the close-range target block and the station based on the distance data of the target block and the station, and updates the corresponding profit information of the target block and the station in the comprehensive profit matrix into the target dispatching profit information. Based on the method, the close-range station and the target block can be effectively screened out, so that when a block vehicle scheduling strategy is generated, the close-range scheduling information is avoided, and the possibility of wasting manpower and material resources is reduced.
It should be understood that, although the steps in the flowcharts related to the above embodiments are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a shared traveling vehicle dispatching device for realizing the above-mentioned shared traveling vehicle dispatching method. The implementation scheme of the solution to the problem provided by the device is similar to the implementation scheme described in the above method, so the specific limitation in the embodiments of the one or more shared traveling vehicle dispatching devices provided below may refer to the limitation of the shared traveling vehicle dispatching method hereinabove, and will not be repeated here.
As shown in fig. 4, the present application further provides a shared travel vehicle dispatching device 400, which includes:
a response module 410, configured to obtain block geographic range information of all initial blocks, vehicle geographic position information of all vehicles, and station information of all stations in response to a scheduling request instruction; the station information comprises current vehicle stock information of the station;
the target block determining module 420 is configured to screen a target block satisfying a vehicle scheduling condition from the initial block according to the vehicle geographic location information and the block geographic range information;
the calling vehicle number determining module 430 is configured to query, according to a request time of the scheduling request instruction, target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table, and determine target calling vehicle number information of the station according to current vehicle stock information, target vehicle riding information, target capacity information and preset vehicle calling conditions;
The profit matrix determining module 440 is configured to generate a comprehensive profit matrix according to the distance cost information between the target block and the station, the station profit information corresponding to the request time, and the block opportunity cost information;
the dispatching policy determining module 450 is configured to perform a transportation optimization calculation based on the comprehensive profit matrix and the target dispatching vehicle number information of each station, and generate a block vehicle dispatching policy, where the block vehicle dispatching policy includes dispatching vehicle information of each target block to each station.
In one embodiment of the present application, the target block determining module 420 is specifically configured to:
matching the vehicle geographic position information with the block geographic range information, and determining vehicle information corresponding to the initial block according to a matching result; the vehicle information comprises the number of vehicles corresponding to the initial block;
based on the preset vehicle threshold condition, an initial block of which the number of vehicles meets the preset vehicle threshold condition is taken as a target block.
In one embodiment of the present application, the preset time range information table includes a plurality of time ranges, the time ranges being divided into a plurality of time periods; the number of vehicles call determination module 430 is specifically configured to:
inquiring a target time period in a target time range to which the request time belongs in a preset time range information table;
Taking the predicted vehicle riding information corresponding to the target time range as target vehicle riding information;
according to the position information of the target time period in the target time range, determining first weight information corresponding to the target time range and second weight information corresponding to the next time range adjacent to the target time range;
and inquiring first vehicle-mounted capacity information corresponding to the target time range and second vehicle-mounted capacity information corresponding to the next time range adjacent to the target time range in a preset time range information table, and determining target capacity information according to the first weight information, the second weight information, the first vehicle-mounted capacity information and the second vehicle-mounted capacity information.
In one embodiment of the present application, the number of vehicles tuning determination module 430 is specifically configured to:
determining initial calling vehicle number information according to the current vehicle stock information, the target vehicle riding information and the target capacity information;
when the initial calling vehicle number information meets the first calling number condition, taking the initial calling vehicle number information as target calling vehicle number information;
and when the initial calling vehicle number information does not meet the first calling number condition, taking the preset calling vehicle number information as target calling vehicle number information.
In one embodiment of the present application, the shared travel vehicle dispatching device further includes:
the station income information determining module is used for taking preset income information as station income information if the initial calling vehicle number information meets the second calling number condition when the initial calling vehicle number information does not meet the first calling number condition.
In one embodiment of the present application, the shared travel vehicle dispatching device further includes:
the distance data determining module is used for determining the distance data information from each target block to each station according to the station geographic position information of the station and the block geographic range information of the target block;
the distance cost determining module is used for determining distance cost information corresponding to the target block to the station according to the distance data information based on a preset distance cost calculating strategy.
In an embodiment of the present application, the distance data information includes distance data corresponding to each target block and each station, the comprehensive benefit matrix includes benefit information corresponding to each target block and each station, and the shared travel vehicle dispatching device further includes:
the risk corresponding information determining module is used for taking the target block and the station corresponding information which are included in the distance data information with the distance data lower than the preset distance threshold value as risk corresponding information;
And the comprehensive benefit matrix updating module is used for updating the benefit information corresponding to the risk corresponding information into target scheduling benefit information in the comprehensive benefit matrix and generating an updated comprehensive benefit matrix.
In one embodiment of the present application, a computer device is provided, which may be a terminal, and an internal structure diagram thereof may be as shown in fig. 5. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program, when executed by the processor, implements a shared travel vehicle dispatch method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in fig. 5 is merely a block diagram of some of the structures associated with the present application and is not limiting of the computer device to which the present application may be applied, and that a particular computer device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
In one embodiment of the present application, a computer device is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the above method when executing the computer program.
In one embodiment of the present application, a computer readable storage medium is provided, on which a computer program is stored which, when executed by a processor, implements the steps of the above method.
It should be noted that, user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party.
Those skilled in the art will appreciate that implementing all or part of the above-described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the various embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random AccessMemory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the various embodiments provided herein may include at least one of relational databases and non-relational databases. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic units, quantum computing-based data processing logic units, etc., without being limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples represent only a few embodiments of the present application, which are described in more detail and are not thereby to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application shall be subject to the appended claims.
Claims (10)
1. A method of shared travel vehicle dispatch, the method comprising:
responding to a dispatching request instruction, and acquiring block geographic range information of all initial blocks, vehicle geographic position information of all vehicles and station information of all stations; the station information comprises current vehicle stock information of the station;
screening target blocks meeting vehicle dispatching conditions from the initial blocks according to the vehicle geographic position information and the block geographic range information;
Inquiring target vehicle riding information and target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction, and determining target calling vehicle number information of the station according to the current vehicle stock information, the target vehicle riding information, the target capacity information and preset vehicle calling conditions;
generating a comprehensive benefit matrix according to the distance cost information between the target block and the station, the station benefit information corresponding to the request time and the block opportunity cost information;
and carrying out transportation optimization calculation based on the comprehensive income matrix and the target dispatching vehicle number information of each station, and generating a block vehicle dispatching strategy, wherein the block vehicle dispatching strategy comprises dispatching vehicle information of each target block to each station.
2. The method for dispatching a shared traveling vehicle according to claim 1, wherein the screening the initial block for a target block satisfying a vehicle dispatching condition according to the vehicle geographic position information and the block geographic range information comprises:
matching the vehicle geographic position information with the block geographic range information, and determining vehicle information corresponding to the initial block according to a matching result; the vehicle information comprises the number of vehicles corresponding to the initial block;
And based on a preset vehicle threshold condition, taking an initial block of which the number of vehicles meets the preset vehicle threshold condition as the target block.
3. The shared travel vehicle scheduling method according to claim 1, wherein the preset time range information table includes a plurality of time ranges divided into a plurality of time periods; the step of inquiring the target vehicle riding information and the target capacity information of each station corresponding to the request time in a preset time range information table according to the request time of the scheduling request instruction comprises the following steps:
querying a target time period in a target time range to which the request time belongs in the preset time range information table;
taking the predicted vehicle riding information corresponding to the target time range as the target vehicle riding information;
determining first weight information corresponding to the target time range and second weight information corresponding to the next time range adjacent to the target time range according to the position information of the target time period in the target time range;
and inquiring first vehicle-station capacity information corresponding to the target time range and second vehicle-station capacity information corresponding to a next time range adjacent to the target time range in the preset time range information table, and determining the target capacity information according to the first weight information, the second weight information, the first vehicle-station capacity information and the second vehicle-station capacity information.
4. The method for dispatching the shared traveling vehicles according to claim 1, wherein the determining the target dispatching vehicle number information of the station according to the current vehicle stock information, the target vehicle riding information, the target capacity information and a preset vehicle dispatching condition comprises:
determining initial call-in vehicle number information according to the current vehicle stock information, the target vehicle riding information and the target capacity information;
when the initial calling vehicle number information meets a first calling number condition, taking the initial calling vehicle number information as the target calling vehicle number information;
and when the initial calling vehicle number information does not meet the first calling number condition, taking preset calling vehicle number information as the target calling vehicle number information.
5. The shared travel vehicle dispatching method of claim 4, further comprising:
and when the initial calling vehicle number information does not meet the first calling number condition, if the initial calling vehicle number information meets the second calling number condition, taking preset income information as the station income information.
6. The shared travel vehicle dispatching method of claim 1, further comprising:
determining distance data information from each target block to each station according to station geographic position information of the station and the block geographic range information of the target block;
and determining the distance cost information corresponding to the target block to the station according to the distance data information based on a preset distance cost calculation strategy.
7. The shared travel vehicle scheduling method of claim 6, wherein the distance data information includes distance data corresponding to each of the target blocks and each of the stations, the comprehensive benefit matrix includes benefit information corresponding to each of the target blocks and each of the stations, the method further comprising:
taking a target block and station corresponding information contained in the distance data information with the distance data lower than a preset distance threshold value as risk corresponding information;
and updating the benefit information corresponding to the risk corresponding information into target scheduling benefit information in the comprehensive benefit matrix, and generating an updated comprehensive benefit matrix.
8. A shared travel vehicle dispatching device, the device comprising:
The response module is used for responding to the dispatching request instruction and acquiring block geographic range information of all initial blocks, vehicle geographic position information of all vehicles and station information of all stations; the station information comprises current vehicle stock information of the station;
the target block determining module is used for screening target blocks meeting vehicle dispatching conditions from the initial blocks according to the vehicle geographic position information and the block geographic range information;
the scheduling request instruction is used for scheduling the request instruction according to the target vehicle riding information and the target capacity information of each station, and scheduling the request instruction according to the target vehicle riding information and the target capacity information of each station;
the profit matrix determining module is used for generating a comprehensive profit matrix according to the distance cost information between the target block and the station, the station profit information corresponding to the request time and the block opportunity cost information;
The dispatching strategy determining module is used for carrying out transportation optimization calculation based on the comprehensive income matrix and the target dispatching vehicle number information of each station to generate a block vehicle dispatching strategy, and the block vehicle dispatching strategy comprises dispatching vehicle information of each target block to each station.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310628647.8A CN116363854B (en) | 2023-05-31 | 2023-05-31 | Shared travel vehicle dispatching method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310628647.8A CN116363854B (en) | 2023-05-31 | 2023-05-31 | Shared travel vehicle dispatching method and device and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116363854A true CN116363854A (en) | 2023-06-30 |
| CN116363854B CN116363854B (en) | 2023-10-24 |
Family
ID=86928565
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310628647.8A Active CN116363854B (en) | 2023-05-31 | 2023-05-31 | Shared travel vehicle dispatching method and device and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116363854B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116703132A (en) * | 2023-08-08 | 2023-09-05 | 北京阿帕科蓝科技有限公司 | Management method and device for dynamic scheduling of shared vehicles and computer equipment |
| CN116911575A (en) * | 2023-09-13 | 2023-10-20 | 亿雅捷交通系统(北京)有限公司 | Method, system and equipment for scheduling full period of shared bicycle |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5168451A (en) * | 1987-10-21 | 1992-12-01 | Bolger John G | User responsive transit system |
| US20090248587A1 (en) * | 2007-08-31 | 2009-10-01 | Van Buskirk Peter C | Selectively negotiated ridershare system comprising riders, drivers, and vehicles |
| CN108427997A (en) * | 2017-09-15 | 2018-08-21 | 杭州创屹机电科技有限公司 | A kind of shared bicycle Dispatch by appointment management system and method |
| CN108460537A (en) * | 2018-03-23 | 2018-08-28 | 华南理工大学 | A method of bicycle demand is shared based on big data and user psychology prediction |
| CN110033161A (en) * | 2019-02-27 | 2019-07-19 | 山东开创云软件有限公司 | A kind of dispatching method and system of shared automobile |
| CN112766591A (en) * | 2021-01-27 | 2021-05-07 | 同济大学 | Shared bicycle scheduling method |
| CN112907103A (en) * | 2021-03-09 | 2021-06-04 | 北京邮电大学 | Method for sharing dynamic supply and demand balance of single vehicle |
| CN113313412A (en) * | 2021-06-18 | 2021-08-27 | 河海大学 | Public bicycle dispatching model based on improved circle algorithm |
| CN115545252A (en) * | 2021-06-30 | 2022-12-30 | 永安行科技股份有限公司 | Traffic prediction method and system for shared travel sites |
| CN115619051A (en) * | 2022-12-19 | 2023-01-17 | 北京阿帕科蓝科技有限公司 | Shared vehicle allocation method, system and computer storage medium |
| CN115689258A (en) * | 2023-01-03 | 2023-02-03 | 北京阿帕科蓝科技有限公司 | Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position |
-
2023
- 2023-05-31 CN CN202310628647.8A patent/CN116363854B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5168451A (en) * | 1987-10-21 | 1992-12-01 | Bolger John G | User responsive transit system |
| US20090248587A1 (en) * | 2007-08-31 | 2009-10-01 | Van Buskirk Peter C | Selectively negotiated ridershare system comprising riders, drivers, and vehicles |
| CN108427997A (en) * | 2017-09-15 | 2018-08-21 | 杭州创屹机电科技有限公司 | A kind of shared bicycle Dispatch by appointment management system and method |
| CN108460537A (en) * | 2018-03-23 | 2018-08-28 | 华南理工大学 | A method of bicycle demand is shared based on big data and user psychology prediction |
| CN110033161A (en) * | 2019-02-27 | 2019-07-19 | 山东开创云软件有限公司 | A kind of dispatching method and system of shared automobile |
| CN112766591A (en) * | 2021-01-27 | 2021-05-07 | 同济大学 | Shared bicycle scheduling method |
| CN112907103A (en) * | 2021-03-09 | 2021-06-04 | 北京邮电大学 | Method for sharing dynamic supply and demand balance of single vehicle |
| CN113313412A (en) * | 2021-06-18 | 2021-08-27 | 河海大学 | Public bicycle dispatching model based on improved circle algorithm |
| CN115545252A (en) * | 2021-06-30 | 2022-12-30 | 永安行科技股份有限公司 | Traffic prediction method and system for shared travel sites |
| CN115619051A (en) * | 2022-12-19 | 2023-01-17 | 北京阿帕科蓝科技有限公司 | Shared vehicle allocation method, system and computer storage medium |
| CN115689258A (en) * | 2023-01-03 | 2023-02-03 | 北京阿帕科蓝科技有限公司 | Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position |
Non-Patent Citations (1)
| Title |
|---|
| 王天宇 等: "基于自行车共享系统静态再平衡问题的分支定界算法", 物流科技, no. 11, pages 80 - 84 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116703132A (en) * | 2023-08-08 | 2023-09-05 | 北京阿帕科蓝科技有限公司 | Management method and device for dynamic scheduling of shared vehicles and computer equipment |
| CN116703132B (en) * | 2023-08-08 | 2023-12-12 | 北京阿帕科蓝科技有限公司 | Management method and device for dynamic scheduling of shared vehicles and computer equipment |
| CN116911575A (en) * | 2023-09-13 | 2023-10-20 | 亿雅捷交通系统(北京)有限公司 | Method, system and equipment for scheduling full period of shared bicycle |
| CN116911575B (en) * | 2023-09-13 | 2024-01-26 | 亿雅捷交通系统(北京)有限公司 | Method, system and equipment for scheduling full period of shared bicycle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116363854B (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116363854B (en) | Shared travel vehicle dispatching method and device and computer equipment | |
| CN111476588B (en) | Order demand prediction method and device, electronic equipment and readable storage medium | |
| CN111366160B (en) | Path planning method, path planning device and terminal equipment | |
| TWI670677B (en) | Systems and methods for recommending an estimated time of arrival | |
| Ma et al. | Large-scale demand driven design of a customized bus network: A methodological framework and Beijing case study | |
| US20200050938A1 (en) | Systems and methods for improvement of index prediction and model building | |
| AU2016359530A1 (en) | Systems and methods for allocating sharable orders | |
| CN116362431B (en) | Scheduling method and device for shared vehicle, computer equipment and storage medium | |
| CN115860441B (en) | Method and device for generating work order information and computer equipment | |
| CN116050947A (en) | Method, device, computer equipment and storage medium for evaluating vehicle dispatching effect | |
| CN111339230A (en) | Vehicle information display method and device, electronic equipment and storage medium | |
| CN115496275A (en) | Urban traffic carbon emission prediction method, device, electronic equipment and storage medium | |
| CN111914940A (en) | Shared vehicle station clustering method, system, device and storage medium | |
| CN116151600B (en) | Maintenance method, device, computer equipment and storage medium for shared vehicle | |
| Chen | Free-floating bike-sharing green relocation problem considering greenhouse gas emissions | |
| CN109410367B (en) | Vehicle power supply management method, computer readable storage medium and server | |
| CN116304393A (en) | Data processing method, device, computer equipment and storage medium | |
| CN110503234A (en) | A kind of method, system and the equipment of logistics transportation scheduling | |
| CN115759574A (en) | Material storage method and device, computer equipment and storage medium | |
| Liu et al. | Dynamic balance between demand-and-supply of urban taxis over trajectories | |
| CN117498362A (en) | Power grid dispatching method and device and computer equipment | |
| CN116798234B (en) | Method, device, computer equipment and storage medium for determining station parameter information | |
| Zhang et al. | Bidirectional k-nearest neighbor spatial crowdsourcing allocation protocol based on edge computing | |
| Qiu et al. | Finding vacant taxis using large scale GPS traces | |
| CN115358686B (en) | Method and device for optimizing complete vehicle logistics network and storage medium |
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 |