CN107767043B - Vehicle dispatching method, server, client and system - Google Patents
Vehicle dispatching method, server, client and system Download PDFInfo
- Publication number
- CN107767043B CN107767043B CN201710942867.2A CN201710942867A CN107767043B CN 107767043 B CN107767043 B CN 107767043B CN 201710942867 A CN201710942867 A CN 201710942867A CN 107767043 B CN107767043 B CN 107767043B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- scheduling
- space
- time
- candidate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000009826 distribution Methods 0.000 claims description 83
- 230000001174 ascending effect Effects 0.000 claims description 8
- 230000003993 interaction Effects 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 17
- 238000012545 processing Methods 0.000 description 14
- 238000004891 communication Methods 0.000 description 13
- 230000006870 function Effects 0.000 description 12
- 238000003860 storage Methods 0.000 description 10
- 238000004088 simulation Methods 0.000 description 6
- 230000001960 triggered effect Effects 0.000 description 6
- 238000004590 computer program Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 239000004973 liquid crystal related substance Substances 0.000 description 3
- 239000000835 fiber Substances 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 230000007306 turnover Effects 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 230000003213 activating effect Effects 0.000 description 1
- 230000003466 anti-cipated effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0645—Rental transactions; Leasing transactions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of vehicle dispatching method, server, client and systems.This method comprises: determining target vehicle corresponding target space time unit in space time unit set；According to the target space time unit and the space time unit set, the scheduler task of the target vehicle is generated, implements vehicle scheduling to trigger user to target vehicle.According to the present invention it is possible to which user is guided to participate in vehicle scheduling.Promote the enthusiasm that user participates in vehicle scheduling.Improve vehicle scheduling efficiency.Reduce the human cost of vehicle scheduling.
Description
Technical Field
The invention relates to the technical field of vehicle scheduling, in particular to a vehicle scheduling method, a server, a client and a system.
Background
At present, riding through a shared bicycle becomes a emerging trip mode in a city, the short-distance trip requirement of urban crowds can be effectively met, and the bicycle is green and environment-friendly.
Along with the fact that the scale of a user sharing a bicycle is gradually huge, in practical application, the user can be unmatched between the actual vehicle using demand and vehicle throwing, the phenomenon that the vehicles are unavailable in the area with large vehicle using demand and the available vehicles are accumulated in the area with small vehicle using demand appears, and the problem of vehicle messy parking is increasingly prominent along with the increase of the vehicle throwing amount. Therefore, there is a need for a responsive schedule for the release of bicycles to avoid the above problems. However, at present, the dispatching of the shared bicycles mainly depends on manual statistics performed by operators of the shared bicycle service provider to determine a multi-region bicycle or a few-region bicycle, and corresponding manual dispatching is performed, so that the dispatching efficiency is low, and the dispatching labor cost is high.
Accordingly, the inventors have determined that there is a need for improvement in the problems of the prior art described above.
Disclosure of Invention
It is an object of the present invention to provide a new solution for dispatching vehicles.
According to a first aspect of the present invention, there is provided a vehicle scheduling method, comprising:
determining a target spatiotemporal unit corresponding to the target vehicle in the set of spatiotemporal units,
the space-time unit set comprises a plurality of space-time units obtained by dividing a scheduling region, and each space-time unit has a corresponding time period and a corresponding geographic position;
generating a scheduling task of the target vehicle according to the target space-time unit and the space-time unit set so as to trigger a user to implement vehicle scheduling on the target vehicle,
the scheduling task comprises a scheduling recommendation terminal for scheduling the target vehicle to enter and a corresponding scheduling priority.
Optionally, the step of generating the scheduling task of the target vehicle includes:
selecting candidate space-time units with the distance to the target space-time unit smaller than a preset distance from the space-time unit set;
obtaining a vehicle collection index and a vehicle distribution index of each candidate space-time unit, and calculating to obtain a vehicle net distribution index of the corresponding candidate space-time unit;
sorting in a descending order according to the vehicle net distribution index of each candidate space-time unit to obtain a distribution index sorting value of each candidate space-time unit;
and selecting the candidate time-space unit with the distribution index sorting value within a preset distribution sorting range as the scheduling recommendation end point, and setting corresponding task priority according to the distribution index sorting value to generate the corresponding scheduling task.
Optionally, the step of obtaining the vehicle collection index and the vehicle distribution index of each of the candidate spatiotemporal units comprises:
obtaining an average vehicle usage rate of the candidate spatiotemporal units;
calculating a vehicle collection index and the vehicle distribution index of the spatiotemporal unit according to the average vehicle usage rate of the candidate spatiotemporal unit and the acquired historical travel records,
wherein the historical travel record comprises a plurality of historical travels, and the historical travels comprise the spatiotemporal unit as a travel starting point and the spatiotemporal unit as a travel ending point.
Optionally, the step of obtaining the average vehicle usage rate includes:
counting the number of vehicles staying in the candidate space-time unit and the corresponding vehicle staying time,
wherein the parked vehicle is a vehicle that enters the candidate spatiotemporal unit and leaves the candidate spatiotemporal unit within a time period of the candidate spatiotemporal unit, the vehicle dwell time being a difference of a time instant at which the corresponding parked vehicle leaves the candidate spatiotemporal unit and a time instant at which the corresponding parked vehicle enters the candidate spatiotemporal unit;
and calculating the average vehicle utilization rate according to the number of the stopped vehicles and the vehicle stopping time.
Optionally, the step of calculating the vehicle collection index and the vehicle distribution index for the candidate spatiotemporal unit comprises:
for the candidate space-time unit, calculating and acquiring a first link weight set taking the candidate space-time unit as a travel starting point and a second link weight set taking the candidate space-time unit as a travel ending point according to the historical travel record,
the first link weight set comprises link weights of each link taking other space-time units in the space-time unit set as a travel end point, and the second link weight set comprises link weights of each link taking other space-time units in the space-time unit set as a travel start point;
and calculating and obtaining the vehicle distribution index according to the first link weight set and the average vehicle utilization rate, and calculating and obtaining the vehicle collection index according to the second link weight set and the average vehicle utilization rate.
Optionally, the method further comprises:
executing the sorting step of the net distribution indexes after the candidate space-time units with the vehicle net distribution indexes smaller than a preset distribution threshold value are eliminated;
and/or
After selecting the candidate space-time units meeting the reselection condition, executing the step of calculating the net distribution index,
wherein the reselection condition is that an ascending ranking value of a smaller value of the vehicle collection index and the vehicle distribution index of the candidate spatiotemporal unit is within a preset ascending ranking range, and a descending ranking value of a larger value of the vehicle collection index and the vehicle distribution index is within a preset descending ranking range.
Alternatively,
the target vehicle is a vehicle that is not being used for a predetermined period of time;
and/or
The vehicle scheduling method is implemented after a user activates the target vehicle.
According to a second aspect of the present invention, there is provided a vehicle scheduling method, comprising:
after a user activates a target vehicle, providing a scheduling task display interface to display a scheduling task corresponding to the target vehicle and trigger the user to implement vehicle scheduling on the target vehicle,
the scheduling task comprises a scheduling recommendation terminal and a corresponding scheduling priority, wherein the scheduling recommendation terminal is used for scheduling the target vehicle.
According to a third aspect of the present invention, there is provided a server for implementing vehicle scheduling, comprising:
a memory for storing executable instructions;
and the processor is used for operating the server to execute the vehicle dispatching method provided by the first aspect of the invention according to the control of the instruction.
According to a fourth aspect of the present invention, there is provided a client for implementing vehicle scheduling, comprising:
the display device is used for displaying a human-computer interaction interface;
a memory for storing executable instructions;
and the processor is used for operating the server to execute the vehicle dispatching method provided by the second aspect of the invention according to the control of the instruction.
According to a fifth aspect of the present invention, there is provided a vehicle dispatching system, comprising:
a server as provided by the third aspect of the invention, and a client for use by the fourth aspect of the invention.
The inventor of the invention finds that in the prior art, the existing vehicle scheduling mainly depends on operators of vehicle service providers to perform manual scheduling, the scheduling efficiency is low, and the scheduling labor cost is high. Therefore, the technical task to be achieved or the technical problems to be solved by the present invention are never thought or anticipated by those skilled in the art, and therefore the present invention is a new technical solution.
Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention.
Fig. 1 is a block diagram showing an example of a hardware configuration of a vehicle system that can be used to implement an embodiment of the invention.
Fig. 2 shows a flowchart of a vehicle scheduling method according to a first embodiment of the present invention.
FIG. 3 is a schematic diagram illustrating an example spatiotemporal cell in accordance with a first embodiment of the present invention.
Fig. 4 shows a flowchart of the step of generating a scheduled task according to the first embodiment of the present invention.
Fig. 5 shows a flowchart of calculating a vehicle distribution index and a vehicle collection index according to the first embodiment of the present invention.
Fig. 6 shows a flowchart of the step of calculating the average vehicle usage rate according to the first embodiment of the present invention.
Fig. 7 shows a flowchart of calculating a vehicle distribution index and a vehicle collection index according to the first embodiment of the present invention.
Fig. 8 shows an example schematic of a historical trip of the first embodiment of the invention.
Fig. 9 shows a schematic block diagram of a server of the first embodiment of the present invention.
FIG. 10 is a diagram illustrating a scheduled task presentation interface according to a second embodiment of the present invention.
Fig. 11 shows a schematic block diagram of a client of a second embodiment of the present invention.
Fig. 12 shows a schematic block diagram of a vehicle dispatching system of a third embodiment of the present invention.
Detailed Description
Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
< hardware configuration >
As shown in fig. 1, the vehicle system 100 includes a server 1000, a client 2000, a vehicle 3000, and a network 4000.
The server 1000 provides a service point for processes, databases, and communications facilities. The server 1000 may be a unitary server or a distributed server across multiple computers or computer data centers. The server may be of various types, such as, but not limited to, a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interaction server, a database server, or a proxy server. In some embodiments, each server may include hardware, software, or embedded logic components or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server, such as a blade server, a cloud server, etc., or may be a server group consisting of a plurality of servers, which may include one or more of the above types of servers, etc.
In one example, the server 1000 may be as shown in fig. 1, including a processor 1100, a memory 1200, an interface device 1300, a communication device 1400, a display device 1500, an input device 1600. Although the server may also include speakers, microphones, etc., these components are reasonably irrelevant to the present invention and are omitted here.
The processor 1100 may be, for example, a central processing unit CPU, a microprocessor MCU, or the like. The memory 1200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1300 includes, for example, a USB interface, a serial interface, an infrared interface, and the like. Communication device 1400 is capable of wired or wireless communication, for example. The display device 1150 is, for example, a liquid crystal display panel, an LED display panel touch display panel, or the like. Input devices 1160 may include, for example, a touch screen, a keyboard, and the like.
In the present embodiment, the client 2000 is an electronic device having a communication function and a service processing function. The client 2000 may be a mobile terminal, such as a mobile phone, a laptop, a tablet, a palmtop, etc. In one example, the client 2000 is a device that performs management operations on the vehicle 3000, such as a mobile phone installed with an Application (APP) that supports operation and management of the vehicle.
As shown in fig. 1, the client 2000 may include a processor 2100, a memory 2200, an interface device 2300, a communication device 2400, a display device 2500, an input device 2600, a speaker 2700, a microphone 2800, and so on. The processor 2100 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 2200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 2300 includes, for example, a USB interface, a headphone interface, and the like. Communication device 2400 is capable of wired or wireless communication, for example. The display device 2500 is, for example, a liquid crystal display panel, a touch panel, or the like. The input device 2600 may include, for example, a touch screen, a keyboard, and the like. A user can input/output voice information through the speaker 2700 and the microphone 2800.
The vehicle 3000 is any vehicle that can give the right to share the use by different users in time or separately, for example, a shared bicycle, a shared moped, a shared electric vehicle, a shared vehicle, and the like. The vehicle 3000 may be a bicycle, a tricycle, an electric scooter, a motorcycle, a four-wheeled passenger vehicle, or the like.
As shown in fig. 1, vehicle 3000 may include a processor 3100, a memory 3200, an interface device 3300, a communication device 3400, a display device 3500, an input device 3600, a positioning device 3700, sensors 3800, and so forth. The processor 3100 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 3200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface 3300 includes, for example, a USB interface, a headphone interface, and the like. The communication device 3400 can perform wired or wireless communication, for example. The output device 3500 may be, for example, a device that outputs a signal, may be a display device such as a liquid crystal display screen or a touch panel, or may be a speaker or the like that outputs voice information or the like. The input device 3600 may include, for example, a touch panel, a keyboard, or the like, and may input voice information through a microphone. The positioning device 3700 is used to provide positioning function, and may be, for example, a GPS positioning module, a beidou positioning module, etc. The sensor 3800 is used for acquiring vehicle attitude information, and may be, for example, an accelerometer, a gyroscope, or a three-axis, six-axis, nine-axis micro-electro-mechanical system (MEMS), or the like.
The network 4000 may be a wireless communication network or a wired communication network, and may be a local area network or a wide area network. In the article management system shown in fig. 1, a vehicle 3000 and a server 1000, and a client 2000 and the server 1000 can communicate with each other via a network 4000. The vehicle 3000 may be the same as the server 1000, and the network 4000 through which the client 2000 communicates with the server 1000 may be different from each other.
It should be understood that although fig. 1 shows only one server 1000, client 2000, vehicle 3000, it is not meant to limit the corresponding number, and multiple servers 1000, clients 2000, vehicles 3000 may be included in the vehicle system 100.
Taking the vehicle 3000 as an example of a shared bicycle, the vehicle system 100 is a shared bicycle system. The server 1000 is used to provide all the functionality necessary to support shared bicycle use. The client 2000 may be a mobile phone on which a shared bicycle application is installed, which may help a user to obtain a corresponding function using the vehicle 3000, and the like.
The vehicle system 100 shown in FIG. 1 is illustrative only and is not intended to limit the invention, its application, or uses in any way.
Although fig. 1 shows only one server 1000, one client 2000 and one vehicle 3000, it should be understood that, in a specific application, the vehicle system 100 may include a plurality of servers 1000, a plurality of clients 2000 and a plurality of vehicles 3000 according to actual requirements.
In an embodiment of the present invention, the memory 1200 of the server 1000 is used for storing instructions for controlling the processor 1100 to operate so as to execute the vehicle scheduling method provided by the embodiment of the present invention.
Although a number of devices are shown in fig. 1 for server 1000, the present invention may relate to only some of the devices, for example, server 1000 may relate to only memory 1200 and processor 1100.
In an embodiment of the present invention, the memory 2200 of the client 2000 is configured to store instructions for controlling the processor 2100 to operate the client 2000 to execute the vehicle dispatching method provided by the embodiment of the present invention.
Although a number of devices are shown in fig. 1 for client 2000, the present invention may relate to only some of the devices, for example, client 2000 may relate to only memory 2200 and processor 2100.
In the above description, the skilled person will be able to design instructions in accordance with the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.
< first embodiment >
In the vehicle scheduling method provided in this embodiment, the vehicle is a transportation device that is released for a user to obtain a use right in modes of time-sharing lease, local lease and the like, and the vehicle may be a two-wheeled or three-wheeled bicycle, a moped, an electric vehicle, or a motor vehicle with four or more wheels.
The vehicle dispatching method, as shown in fig. 2, includes:
step S2100, determining a target space-time unit corresponding to the target vehicle in the space-time unit set,
the space-time unit set comprises a plurality of space-time units obtained by dividing a scheduling region, and each space-time unit has a corresponding time period and a corresponding geographic position.
The vehicle scheduling method provided in this embodiment may be triggered and implemented by a device or system implementing the vehicle scheduling method in a preset cycle or based on a preset scheduling scenario. The vehicle scheduling method provided in the present embodiment may also be implemented after the user activates the target vehicle. For example, when the vehicle is a shared bicycle, after the user unlocks the target vehicle, the vehicle scheduling method provided in this embodiment may be implemented along the way as the user rides and moves, so as to generate a corresponding scheduling task for the user.
In this embodiment, the scheduling area is an area where there is a vehicle scheduling requirement, and the scheduling area may be set according to an actual vehicle scheduling requirement, for example, a certain city or a certain administrative district of a certain city. The scheduling region may be partitioned according to two dimensions, time and space, to obtain a corresponding set of spatiotemporal units comprising a plurality of spatiotemporal units, each spatiotemporal unit having a corresponding time period and geographical location. The granularity of the time period or the geographic location can be set according to the requirements of the specific application.
For example, a day 24 hours may be divided into 24 time segments, a scheduling area is divided into a fine grid of 100 meters by 100 meters, and the fine grid is divided in time and space dimensions, so as to obtain corresponding space-time units, as shown in fig. 3.
In the present embodiment, the target vehicle is a vehicle for which there is a scheduling demand. For example, the target vehicle may be a vehicle that is not being used for a predetermined period of time. Or the target vehicle may be a vehicle in an area where application requirements are small, and so on.
By obtaining the location of the target vehicle and the current time, the corresponding target spatiotemporal unit of the target vehicle pair in the set of spatiotemporal units may be determined.
And step S2200, generating a scheduling task of the target vehicle according to the target space-time unit and the space-time unit set so as to trigger a user to implement vehicle scheduling on the target vehicle.
The scheduling task comprises a scheduling recommendation terminal point for the scheduling target vehicle to enter and a corresponding scheduling priority.
In this embodiment, different scheduling priorities are set for different scheduled tasks.
By generating the scheduling tasks of the target vehicles, users using the target vehicles can be triggered, the corresponding scheduling tasks are selected according to the scheduling priorities to be implemented, the users are guided to participate in vehicle scheduling, and vehicle scheduling efficiency is improved. The labor cost of vehicle dispatching is reduced.
In addition, different scheduling priorities can also correspond to different scheduling task reward values, the priority is also high, and the higher the scheduling task reward value is. Therefore, the enthusiasm of the user for participating in vehicle dispatching is improved, the vehicle dispatching efficiency is further improved, and the labor cost of vehicle dispatching is reduced.
By generating the scheduling tasks of the target vehicles, users using the target vehicles can be triggered, the corresponding scheduling tasks are selected according to the scheduling priorities to be implemented, corresponding scheduling task rewards are obtained, the enthusiasm of the users for participating in vehicle scheduling is improved, and the vehicle scheduling efficiency is improved. The labor cost of vehicle dispatching is reduced.
Specifically, step S2200 may be as shown in fig. 4, and includes:
step S2210, selecting candidate space-time units with a distance from the target space-time unit smaller than a preset distance from the space-time unit set.
The preset distance can be set according to a specific application scene, and the set numerical value can be a numerical value with a better effect according to engineering experience or experimental simulation results in the specific application scene. For example, the preset distance may be 1 km, and the space-time unit with the distance to the target space-time unit being less than 1 km is selected as the candidate space-time unit for selecting the scheduling recommendation endpoint.
Step S2220, the vehicle collection index and the vehicle distribution index of each candidate space-time unit are obtained, and the vehicle net distribution index of the corresponding candidate space-time unit is obtained through calculation.
When the vehicle is used by a user, the vehicle leaves a certain space-time unit and enters another space-time unit according to the requirements of the user. For each spatiotemporal unit, a vehicle enters or leaves in its corresponding time period. The spatiotemporal cells, as nodes of the traffic network, have a dynamic variation of collecting vehicles (vehicle entering) or distributing vehicles (vehicle leaving).
The vehicle collection index is used to characterize the ability of a corresponding spatiotemporal unit to collect vehicles from other said spatiotemporal units over a corresponding time period. The vehicle distribution index is used to characterize the ability of a corresponding spatiotemporal unit to distribute vehicles to other said spatiotemporal units over a corresponding time period.
For example, the time period for the spatiotemporal unit u is 8:00-9:00 a.m., the vehicle collection index is indicative of the ability to collect vehicles from other said spatiotemporal units during the time period, and the vehicle distribution index is indicative of the ability to distribute vehicles to other said spatiotemporal units during the time period.
Specifically, the step of obtaining the vehicle collection index and the vehicle distribution index of each candidate space-time unit may include, as shown in fig. 5:
step S2221, the average vehicle utilization rate of the candidate space-time unit is obtained.
The average vehicle usage rate of the candidate spatiotemporal units reflects the time turnover rate of the vehicles in the candidate spatiotemporal units when used.
Specifically, the step S2221 of obtaining the average vehicle usage rate may include, as shown in fig. 6:
step S2221-1, counting the number of the vehicles staying in the candidate space-time unit and the corresponding vehicle staying time,
wherein the parked vehicle is a vehicle that enters a candidate spatiotemporal cell and leaves the candidate spatiotemporal cell within a time period of the candidate spatiotemporal cell, the vehicle parking time being a difference of a time at which the corresponding parked vehicle leaves the candidate spatiotemporal cell and a time at which the parked vehicle enters the candidate spatiotemporal cell;
and step S2221-2, calculating the average vehicle utilization rate according to the number of the stopped vehicles and the vehicle stopping time.
For example, assume that the candidate space-time unit u has n number of parked vehicles counted and ts time when the parked vehicle i enters the candidate space-time unit u in the corresponding time period T (duration (T))iTe is the time when the candidate spatio-temporal unit u leavesi(i ═ 1.., n), calculating the average vehicle usage rate d (u) of the candidate space-time unit u:
step S2222, according to the average vehicle utilization rate of the candidate space-time unit and the acquired historical travel records, calculating the vehicle collection index and the vehicle distribution index of the space-time unit,
the historical travel record comprises a plurality of historical travels, and the historical travel comprises a time-space unit as a travel starting point and a time-space unit as a travel ending point.
The historical trip record may be obtained from a historical use of the vehicle. For example, when the vehicle is a shared bicycle, the bicycle can be acquired from bicycle history order information stored in an order server of a shared bicycle system corresponding to the shared bicycle service, correspondingly, each history travel corresponds to one piece of history order information, a travel starting point is a time-space unit where a user rides a starting point, and a travel end point is a time-space unit where a user rides an end point.
Specifically, the step S2220 of calculating the vehicle collection index and the vehicle distribution index of the space-time cell may include, as shown in fig. 7:
step S2222-1, for the candidate space-time unit, according to the historical travel record, calculating and obtaining a first link weight set taking the candidate space-time unit as the travel starting point and a second link weight set taking the candidate space-time unit as the travel ending point,
the first link weight set comprises link weights of each link taking other space-time units in the space-time unit set as a travel end point, and the second link weight set comprises link weights of each link taking other space-time units in the space-time unit set as a travel start point;
step S2222-2, according to the first link weight set and the average vehicle utilization rate, calculating and obtaining a vehicle distribution index, and according to the second link weight set and the average vehicle utilization rate, calculating and obtaining a vehicle collection index.
For example, assume that all N +1 space-time units u resulting from the division of the scheduling regionn(N ═ 0.. times.n) constitutes a set of time-space cells G, where each u isn(bn,tn) With a corresponding time period tnAnd geographic location bn；
The historical travel record is a historical travel set O comprising a plurality of historical travels, and M +1 historical travels O are included in the set Oj(j ═ 0.. said., M), each historical trip is oj(start _ geogid, start _ timedrop, end _ geogid, end _ timedrop), where start _ geogid is a geographical position of a spatio-temporal unit as a trip start point, start _ timedrop is a time period of the spatio-temporal unit as the trip start point, end _ geogid is a geographical position of the spatio-temporal unit as a trip end point, and end _ timedrop is a time period of the spatio-temporal unit as the trip end point, and specifically, a link diagram corresponding to a history trip may be as shown in fig. 8;
for candidate spatio-temporal units up(bp,tp) As the starting point of the journey, in space-time units uq(bq,tq) For the end-of-travel link, the corresponding link weight W (u)p,uq) Comprises the following steps:
wherein,
similarly, ω (u) can also be obtainedn,uq) And will not be described herein.
Calculate W (u) from the abovep,uq) Can obtain candidate space-time units up(bp,tp) As the starting point of the journey, every other space-time unit up(bp,tp) E G (p ≠ q) is taken as the link weight of the travel end point, so as to obtain a first link weight set { W (u ≠ q)p,uq)}；
According to candidate space-time unit up(bp,tp) A first set of link weights { W (u) } (N) } (p ═ 0p,uq) Mean vehicle usage d (u)p) Iteratively calculating the vehicle distribution index:
initialization: PRd0(up)＝1(up∈G,p＝0,...,N)；
And (4) calculating for the t time:
when in useStopping iterative computation to obtain corresponding vehicle distribution index PRd (u)p)＝PRdt(up) α, which is a preset difference threshold, can be set according to experimental simulation or engineering experience;
for candidate spatio-temporal units up(bp,tp) As the end of the journey, in space-time units uq(bq,tq) For the link at the starting point of the journey, the corresponding link weight W (u)q,up) Comprises the following steps:
wherein,
similarly, ω (u) can also be obtainedq,un) And will not be described herein.
Calculate W (u) from the aboveq,up) Can obtain candidate space-time units up(bp,tp) As the end of the journey, every other space-time unit up(bp,tp) E G (p ≠ q) is taken as the link weight of the stroke starting point, so as to obtain a second link weight set { W (u ≠ q)q,up)}；
According to candidate space-time unit up(bp,tp) A second set of link weights { W (u) } (N) } (p ═ 0q,up) Mean vehicle usage d (u)p) Iteratively calculating the vehicle collection index:
initialization: PRc0(up)＝1(up∈G,p＝0,...,N)；
And (4) calculating for the t time:
when in useStopping iterative computation to obtain corresponding vehicle collection index PRc (u)p)＝PRct(up) Where α is a preset difference threshold, it may be set according to experimental simulation or engineering experience.
Similarly, a vehicle collection index and the vehicle distribution index for each candidate spatiotemporal unit may be calculated.
The vehicle net distribution index is used for describing the net collection capacity of the corresponding space-time unit, and can reflect the net demand degree and the subsequent distribution turnover capacity of the space-time unit, and specifically, the vehicle net distribution index can be obtained by subtracting the vehicle collection index from the vehicle distribution index:
hypothesis candidate spatio-temporal units upHas a vehicle collection index of PRcpVehicle distribution index of PRdpCorresponding vehicle net collection index PRDp＝PRdp-PRcp；
And S2230, performing descending sorting according to the vehicle net distribution index of each candidate space-time unit to obtain a distribution index sorting value of each candidate space-time unit.
Specifically, the vehicle net distribution indexes of each candidate space-time unit of the distribution index ranking value are sorted in a descending order to obtain a ranking value.
Step S2240, selecting a candidate time-space unit with the distribution index sorting value within a preset distribution sorting range as a scheduling recommendation terminal, and setting corresponding task priority according to the distribution index sorting value to generate a corresponding scheduling task.
Specifically, the distribution sequencing range may be set according to a specific application scenario, and the set numerical value may be a numerical value with a better effect according to engineering experience or an experimental simulation result in the specific application scenario.
For example, the distribution ranking range may be the top 10% of all candidate spatiotemporal units with the distribution index ranking value, so that the candidate spatiotemporal units with the vehicle net distribution index ranking at the top 10% and within a preset distance (e.g., 1 km) from the target spatiotemporal unit may be selected as the scheduling recommendation endpoint.
The task priority may be set according to the distribution index ranking value, for example, the smaller the distribution index ranking value, the earlier the ranking, the higher the task priority. The task priority may be set to a numerical value of the distribution index ranking value, or the generation task priority may be calculated from the distribution index ranking value. For example, the task priority is an award value or an award multiple of the user for implementing the corresponding scheduling task, the smaller the distribution index ranking value is, the earlier the ranking is, the higher the award multiple or the award value embodied by the task priority is.
And setting task priority according to the index sorting value of the vehicle net distribution index, triggering a user using a target vehicle, selecting a corresponding scheduling task according to the scheduling priority, and guiding the user to participate in vehicle scheduling. In addition, corresponding scheduling task rewards can be given to the users according to the task priorities, and the enthusiasm of the users for participating in vehicle scheduling is improved. And the vehicle dispatching efficiency is improved. The labor cost of vehicle dispatching is reduced.
In this embodiment, it is necessary to select a scheduling recommendation destination for the target vehicle to tune in from the candidate space-time units, which should be the space-time units having distribution capacity far exceeding the collection capacity and having vehicle tuning demand, i.e. the space-time units having higher net distribution index of vehicles and higher net collection index of vehicles. Therefore, in practical application, the time-space unit without the scheduling requirement of vehicle tuning can be eliminated, so as to improve the processing efficiency. Specifically, the vehicle scheduling method provided in this embodiment further includes:
and executing the step of sorting the net distribution indexes after the candidate space-time units with the vehicle net distribution indexes smaller than a preset distribution threshold value are eliminated.
The preset distribution threshold value can be set according to a specific application scene, and the set value can be a value with a better effect according to engineering experience or experimental simulation results in the specific application scene. For example, the preset distribution threshold may be set to 1.0.
And after the time-space units with smaller vehicle net distribution indexes are eliminated, the vehicle net distribution indexes are executed to sort and select the scheduling recommendation destination, so that the candidate time-space units without the scheduling requirement for vehicle calling can be eliminated, the selection range of the scheduling recommendation destination is reduced, and the processing efficiency is improved.
The vehicle scheduling method provided in this embodiment may further include:
after selecting the candidate spatio-temporal units meeting the reselection condition, executing the step of calculating the net collection index,
the reselection condition is that an ascending ranking value of a smaller value of the vehicle collection index and the vehicle distribution index of the candidate spatiotemporal unit is within a preset ascending ranking range, and a descending ranking value of a larger value of the vehicle collection index and the vehicle distribution index is within a preset descending ranking range.
The preset ascending sorting range and the preset descending sorting range can be set according to specific application scenes, and the set numerical value can be a numerical value with a better effect according to engineering experience or experimental simulation results under the specific application scenes. For example, the preset descending sort range may be set with the ascending sort value at the top 30%, and the preset descending sort range may be set with the descending sort value at the top 30%.
The candidate space-time units meeting the reselection condition are space-time units with larger difference between the vehicle distribution index and the vehicle collection index, and the distribution capacity and the collection capacity are not balanced, so that the scheduling requirement exists. Therefore, candidate space-time units with scheduling requirements are screened out through the reselection conditions, and then the following steps of calculating net collection indexes, sorting the net collection indexes, generating scheduling tasks and the like are executed, so that the selection range of the scheduling recommendation end point can be narrowed, and the processing efficiency is improved.
< Server >
In this embodiment, there is further provided a server 200 for implementing vehicle scheduling, as shown in fig. 9, including:
a memory 210 for storing executable instructions;
and a processor 220, configured to control the operation server 200 to execute any one of the vehicle scheduling methods provided in the present embodiment according to the instruction.
In this embodiment, the server 200 may be embodied in various forms of entities. For example, the server 200 may be a cloud server. The server 200 may also be the server 1000 as shown in fig. 1.
Those skilled in the art will appreciate that server 200 may be implemented in a variety of ways. For example, server 200 may be implemented by an instruction configuration processor. For example, the server 200 may be implemented by storing instructions in ROM and reading the instructions from ROM into a programmable device when the device is started. For example, the server 200 may be consolidated into a dedicated device (e.g., ASIC). The server 200 may be divided into separate units or may be implemented by combining them together. The server 200 may be implemented in one of the various implementations described above, or may be implemented in a combination of two or more of the various implementations described above.
The vehicle scheduling method and the server provided in the embodiment have been described above with reference to the drawings, according to the embodiment, a corresponding scheduling task including a scheduling recommendation destination at which a target vehicle is scheduled to enter and a corresponding scheduling priority may be generated according to a target vehicle used by a user, the user using the target vehicle is triggered, the corresponding scheduling task is selected according to the scheduling priority to implement, and the user is guided to participate in vehicle scheduling. In addition, corresponding scheduling task rewards can be given to the users according to the task priorities, and the enthusiasm of the users for participating in vehicle scheduling is improved. And the vehicle dispatching efficiency is improved. The labor cost of vehicle dispatching is reduced.
< second embodiment >
< method >
In the present embodiment, a vehicle scheduling method is provided, including:
after a user activates a target vehicle, providing a scheduling task display interface to display a scheduling task corresponding to the target vehicle and trigger the user to implement vehicle scheduling on the target vehicle,
the scheduling task comprises a scheduling recommendation terminal and a corresponding scheduling priority of a scheduling target vehicle.
How to select the scheduling recommendation endpoint and set the scheduling priority to generate the vehicle scheduling task is described in detail in the first embodiment of the present invention, and is not described herein again.
In this embodiment, the scheduling task display interface is a human-computer interaction interface providing display and operation, and is oriented to a user using a vehicle. The scheduling method can be provided by a user-oriented vehicle Application (APP) implementing the equipment installation of the embodiment, a user acquires a corresponding scheduling task through a scheduling task display interface after activating a target vehicle, can be triggered to select the scheduling task to be implemented according to task priority, and calls the target vehicle into a corresponding scheduling recommendation destination by using the target vehicle to be guided to participate in vehicle scheduling. In addition, corresponding scheduling task rewards can be given to the users according to the task priorities, and the enthusiasm of the users for participating in vehicle scheduling is improved. And the vehicle dispatching efficiency is improved. The labor cost of vehicle dispatching is reduced.
In a specific example, the device for implementing the vehicle dispatching method provided by the embodiment is a mobile phone, and the vehicle is a shared bicycle. After the user unlocks the shared bicycle set as the target vehicle, a scheduling task presentation interface as shown in fig. 10 is presented to the user through a shared bicycle APP (application) installed on a mobile phone and facing the user using the shared bicycle, a scheduling recommendation destination near the target vehicle is presented to the user, and the priority of the scheduling task is presented by presenting a task reward multiple (× 2, × 1.5) that can be obtained after the scheduling task is performed.
< client >
In this embodiment, there is further provided a client 300, as shown in fig. 11, including:
a display device 310 for displaying a human-computer interaction interface;
a memory 320 for storing executable instructions;
and the processor 300 is used for operating the server to execute the vehicle dispatching method provided by the embodiment according to the control of the instruction.
In the present embodiment, the client 300 may be embodied in various entity forms. For example, the client 300 may be a cell phone. The client 300 may also be a client 2000 as shown in fig. 1.
Those skilled in the art will appreciate that client 300 may be implemented in a variety of ways. For example, client 300 may be implemented by an instruction configuration processor. For example, the client 300 may be implemented by storing instructions in ROM and reading the instructions from ROM into a programmable device when the device is started. For example, the client 300 may be cured into a dedicated device (e.g., an ASIC). The client 300 may be divided into separate units or they may be combined together for implementation. The client 300 may be implemented in one of the various implementations described above, or may be implemented in a combination of two or more of the various implementations described above.
The vehicle scheduling method and the client provided by the embodiment have been described above with reference to the drawings, according to the embodiment, a corresponding scheduling task is presented to a user who activates a target vehicle, and the user is triggered to select a scheduling task to be implemented according to task priority to participate in vehicle scheduling. In addition, corresponding scheduling task rewards can be given to the users according to the task priorities, and the enthusiasm of the users for participating in vehicle scheduling is improved. And the vehicle dispatching efficiency is improved. The labor cost of vehicle dispatching is reduced.
< third embodiment >
In the present embodiment, a vehicle dispatching system 400 is provided, as shown in fig. 12, comprising:
the server 200 provided in the first embodiment, and the client 300 provided in the second embodiment.
In this embodiment, the vehicle dispatching system 400 may also include a vehicle, which may be, for example, the vehicle system 100 shown in fig. 1.
In the vehicle scheduling system 400, the server 200 may implement the vehicle scheduling method as provided in the first embodiment, generate a corresponding scheduling task for a target vehicle, provide the scheduling task to the client 300 held by a user who activates the target vehicle, and the client 300 displays the scheduling task of the target vehicle through the scheduling task display interface, which may trigger the user to select the scheduling task to be implemented according to task priority to participate in vehicle scheduling. In addition, corresponding scheduling task rewards can be given to the users according to the task priorities, and the enthusiasm of the users for participating in vehicle scheduling is improved. And the vehicle dispatching efficiency is improved. The labor cost of vehicle dispatching is reduced.
The present invention may be a system, method and/or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: 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), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present invention may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions 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 some embodiments, aspects of the present invention are implemented by personalizing an electronic circuit, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), with state information of computer-readable program instructions, which can execute the computer-readable program instructions.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). 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 also be noted 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. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.
Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.
Claims (9)
1. A vehicle scheduling method, comprising:
determining a target spatiotemporal unit corresponding to the target vehicle in the set of spatiotemporal units,
the space-time unit set comprises a plurality of space-time units obtained by dividing a scheduling region, and each space-time unit has a corresponding time period and a corresponding geographic position;
generating a scheduling task of the target vehicle according to the target space-time unit and the space-time unit set so as to trigger a user to implement vehicle scheduling on the target vehicle,
the scheduling task comprises a scheduling recommendation terminal and a corresponding scheduling priority, wherein the scheduling recommendation terminal is used for scheduling the target vehicle to enter;
the step of generating the scheduling task of the target vehicle comprises:
selecting candidate space-time units with the distance to the target space-time unit smaller than a preset distance from the space-time unit set;
obtaining a vehicle collection index and a vehicle distribution index of each candidate space-time unit, and calculating to obtain a vehicle net distribution index of the corresponding candidate space-time unit;
wherein a vehicle collection index is used to characterize the ability of the corresponding spatio-temporal unit to collect vehicles from other spatio-temporal units over a corresponding time period; the vehicle distribution index is used for representing the capacity of the corresponding space-time unit to distribute vehicles to other space-time units in the corresponding time period;
sorting in a descending order according to the vehicle net distribution index of each candidate space-time unit to obtain a distribution index sorting value of each candidate space-time unit;
and selecting the candidate time-space unit with the distribution index sorting value within a preset distribution sorting range as the scheduling recommendation end point, and setting corresponding task priority according to the distribution index sorting value to generate the corresponding scheduling task.
2. The method of claim 1, wherein said step of obtaining a vehicle collection index and a vehicle distribution index for each of said candidate spatiotemporal units comprises:
obtaining an average vehicle usage rate of the candidate spatiotemporal units;
calculating a vehicle collection index and the vehicle distribution index of the spatiotemporal unit according to the average vehicle usage rate of the candidate spatiotemporal unit and the acquired historical travel records,
wherein the historical travel record comprises a plurality of historical travels, and the historical travels comprise the spatiotemporal unit as a travel starting point and the spatiotemporal unit as a travel ending point.
3. The method of claim 2, wherein the step of obtaining an average vehicle usage rate comprises:
counting the number of vehicles staying in the candidate space-time unit and the corresponding vehicle staying time,
wherein the parked vehicle is a vehicle that enters the candidate spatiotemporal unit and leaves the candidate spatiotemporal unit within a time period of the candidate spatiotemporal unit, the vehicle dwell time being a difference of a time instant at which the corresponding parked vehicle leaves the candidate spatiotemporal unit and a time instant at which the corresponding parked vehicle enters the candidate spatiotemporal unit;
and calculating the average vehicle utilization rate according to the number of the stopped vehicles and the vehicle stopping time.
4. The method of claim 2, wherein the step of calculating the vehicle collection index and the vehicle distribution index for the candidate spatiotemporal unit comprises:
for the candidate space-time unit, calculating and acquiring a first link weight set taking the candidate space-time unit as a travel starting point and a second link weight set taking the candidate space-time unit as a travel ending point according to the historical travel record,
the first link weight set comprises link weights of each link taking other space-time units in the space-time unit set as a travel end point, and the second link weight set comprises link weights of each link taking other space-time units in the space-time unit set as a travel start point;
and calculating and obtaining the vehicle distribution index according to the first link weight set and the average vehicle utilization rate, and calculating and obtaining the vehicle collection index according to the second link weight set and the average vehicle utilization rate.
5. The method of claim 1, further comprising:
executing the sorting step of the net distribution indexes after the candidate space-time units with the vehicle net distribution indexes smaller than a preset distribution threshold value are eliminated;
and/or
After selecting the candidate space-time units meeting the reselection condition, executing the step of calculating the net distribution index,
wherein the reselection condition is that an ascending ranking value of a smaller value of the vehicle collection index and the vehicle distribution index of the candidate spatiotemporal unit is within a preset ascending ranking range, and a descending ranking value of a larger value of the vehicle collection index and the vehicle distribution index is within a preset descending ranking range.
6. The method of claim 1,
the target vehicle is a vehicle that is not being used for a predetermined period of time;
and/or
The vehicle scheduling method is implemented after a user activates the target vehicle.
7. A server for implementing vehicle scheduling, comprising:
a memory for storing executable instructions;
a processor for operating the server to execute the vehicle scheduling method according to the control of the instruction, according to any one of claims 1 to 6.
8. A vehicle dispatching system comprises a dispatching system and a dispatching system,
the server of claim 7;
and a client.
9. The vehicle dispatching system of claim 8, wherein the client comprises:
the display device is used for displaying a human-computer interaction interface;
a memory for storing executable instructions;
the processor is used for operating the client to execute the vehicle scheduling method according to the control of the instruction, and comprises the following steps:
after a user activates a target vehicle, providing a scheduling task display interface to display a scheduling task corresponding to the target vehicle and trigger the user to implement vehicle scheduling on the target vehicle,
the scheduling task comprises a scheduling recommendation terminal and a corresponding scheduling priority, wherein the scheduling recommendation terminal is used for scheduling the target vehicle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710942867.2A CN107767043B (en) | 2017-10-11 | 2017-10-11 | Vehicle dispatching method, server, client and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710942867.2A CN107767043B (en) | 2017-10-11 | 2017-10-11 | Vehicle dispatching method, server, client and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107767043A CN107767043A (en) | 2018-03-06 |
| CN107767043B true CN107767043B (en) | 2019-05-07 |
Family
ID=61266423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710942867.2A Active CN107767043B (en) | 2017-10-11 | 2017-10-11 | Vehicle dispatching method, server, client and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107767043B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108388999B (en) * | 2018-03-09 | 2021-01-05 | 汉海信息技术(上海)有限公司 | Vehicle scheduling method, server, client and system |
| CN108346010B (en) * | 2018-04-23 | 2021-07-13 | 徐漫洋 | Shared automobile scheduling method based on user demand analysis |
| CN109063957B (en) * | 2018-06-22 | 2021-11-02 | 南京师范大学 | Dynamic scheduling method and system for shared bicycle |
| CN109978383A (en) * | 2019-03-28 | 2019-07-05 | 广州市格利网络技术有限公司 | The dispatching method and dispatching platform of reusable table ware |
| CN111178736B (en) * | 2019-12-24 | 2023-09-05 | 汉海信息技术(上海)有限公司 | Vehicle delivery method and server |
| CN112070361A (en) * | 2020-08-12 | 2020-12-11 | 陕西正马物流有限公司 | Coal ash transport vehicle task allocation method and system |
| CN115841189B (en) * | 2023-01-03 | 2023-05-19 | 北京中联国成科技有限公司 | Scheduling method and system based on chip data feedback and analysis |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105096183A (en) * | 2015-08-16 | 2015-11-25 | 郭今戈 | Task-triggered public bicycle self-scheduling method and system based on Internet of Things |
| CN106251495A (en) * | 2016-08-08 | 2016-12-21 | 滁州学院 | The management system of a kind of portable city public bicycle and dispatching method |
| CN107203905A (en) * | 2017-05-19 | 2017-09-26 | 北京摩拜科技有限公司 | Dispatching method, device and the server of shared vehicle |
-
2017
- 2017-10-11 CN CN201710942867.2A patent/CN107767043B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105096183A (en) * | 2015-08-16 | 2015-11-25 | 郭今戈 | Task-triggered public bicycle self-scheduling method and system based on Internet of Things |
| CN106251495A (en) * | 2016-08-08 | 2016-12-21 | 滁州学院 | The management system of a kind of portable city public bicycle and dispatching method |
| CN107203905A (en) * | 2017-05-19 | 2017-09-26 | 北京摩拜科技有限公司 | Dispatching method, device and the server of shared vehicle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107767043A (en) | 2018-03-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107767043B (en) | Vehicle dispatching method, server, client and system | |
| CN107809469B (en) | Vehicle dispatching method, server, client and system | |
| CN107742184B (en) | Vehicle scheduling method, server, client and system | |
| CN107682419B (en) | Car pooling route providing method, client, server and car pooling system | |
| CN108388999B (en) | Vehicle scheduling method, server, client and system | |
| CN108151754B (en) | Travel service providing method, server, client and system | |
| CN108055301B (en) | Vehicle dispatching method, server, client and system | |
| CN107679652B (en) | Planning method, client, server and system of ride-sharing route | |
| CN107993434A (en) | Vehicle dispatching method, server, client and system | |
| CN108717592B (en) | Vehicle control method, server, vehicle, client and system | |
| CN107948265B (en) | Vehicle management method, vehicle, server, client and vehicle system | |
| CN109005502B (en) | Vehicle positioning method, server, vehicle and system | |
| CN109436174B (en) | Vehicle control method, server and vehicle system | |
| CN111178736B (en) | Vehicle delivery method and server | |
| CN108399690B (en) | Vehicle management method, garage management equipment and vehicle system | |
| CN104252495A (en) | Method and system for grading road sections | |
| CN108093053B (en) | Vehicle configuration method, server, vehicle and vehicle system | |
| US9816834B2 (en) | Generating a query index and querying on the basis of the query index | |
| CN111178737A (en) | Vehicle delivery method and server | |
| CN109974690B (en) | Vehicle positioning method, device and system | |
| CN111063189B (en) | Traffic flow processing method and device and electronic equipment | |
| CN109784548B (en) | Early warning method for vehicle parking, server and vehicle system | |
| CN113822709A (en) | Travel data processing method and device and server | |
| CN109359877B (en) | Vehicle scheduling method, server and vehicle system | |
| CN104956420B (en) | Watch for Train delay is notified |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201216 Address after: Room 168, building 6, 741 Hangzhou Road, Yangpu District, Shanghai 200090 Patentee after: HANHAI INFORMATION TECHNOLOGY SHANGHAI Co.,Ltd. Address before: Room Bnan 1231, 2 bungalows, No. 5 Road, College, Haidian District, Beijing, 100191 Patentee before: BEIJING MOBIKE TECHNOLOGY Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 200090 Room 102, block D2 (Building 8), No. 221, Huangxing Road, Yangpu District, Shanghai Patentee after: HANHAI INFORMATION TECHNOLOGY SHANGHAI Co.,Ltd. Address before: Room 168, building 6, 741 Hangzhou Road, Yangpu District, Shanghai 200090 Patentee before: HANHAI INFORMATION TECHNOLOGY SHANGHAI Co.,Ltd. |