CN110598977A - Shared automobile scheduling method and related device - Google Patents
Shared automobile scheduling method and related device Download PDFInfo
- Publication number
- CN110598977A CN110598977A CN201910721894.6A CN201910721894A CN110598977A CN 110598977 A CN110598977 A CN 110598977A CN 201910721894 A CN201910721894 A CN 201910721894A CN 110598977 A CN110598977 A CN 110598977A
- Authority
- CN
- China
- Prior art keywords
- shared automobile
- shared
- time
- order
- adjustable
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000004590 computer program Methods 0.000 claims description 14
- 230000015654 memory Effects 0.000 claims description 14
- 238000004891 communication Methods 0.000 claims description 5
- 238000012216 screening Methods 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 4
- 230000009286 beneficial effect Effects 0.000 abstract description 9
- 238000005265 energy consumption Methods 0.000 abstract description 9
- 230000006870 function Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000002059 diagnostic imaging Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 239000000463 material Substances 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
-
- 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/06315—Needs-based resource requirements planning or analysis
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Accounting & Taxation (AREA)
- Educational Administration (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the application discloses a shared automobile scheduling method and a related device, wherein the method comprises the following steps: inquiring a shared automobile database according to the first time and the first place to obtain first historical data and a first adjustable shared automobile quantity; and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule. The embodiment of the application is beneficial to improving the dispatching efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost. The embodiment of the application is beneficial to improving the dispatching efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
Description
Technical Field
The application relates to the field of vehicle scheduling, in particular to a shared vehicle scheduling method and a related device.
Background
At present, the dispatching management of shared automobiles is carried out by an operation team of a platform, and vehicle operation personnel are dispatched to different areas to carry out vehicle dispatching through observing platform data. The scheduling of the vehicles in this way requires a great time cost and a great labor cost, and the scheduling uncertainty caused by the variation of the vehicle distribution from time to time, and the problems of waste of oil consumption and other losses of the scheduled vehicles are faced. For a company. The cost that manpower dispatch vehicle needs is high, wastes a large amount of manpower and materials, and efficiency is lower.
Disclosure of Invention
The embodiment of the application provides a shared automobile scheduling method and a related device, which are beneficial to improving the scheduling efficiency and the utilization rate of shared automobiles and reducing the energy consumption and the operation cost.
In a first aspect, an embodiment of the present application provides a shared automobile scheduling method, where the method includes:
inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, wherein the first historical data comprises first shared automobile demand quantity, and the first adjustable shared automobile quantity is the number of shared automobiles which can be adjusted at the first time at the first place;
and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule.
In a second aspect, an embodiment of the present application provides a shared automobile dispatching device, where the shared automobile dispatching device includes:
the system comprises an acquisition unit, a processing unit and a control unit, wherein the acquisition unit is used for inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, the first historical data comprises first shared automobile demand, and the first adjustable shared automobile quantity is the number of shared automobiles which can be adjusted at the first time at the first place;
and the order issuing unit is used for issuing a shared automobile dispatching order according to a preset rule if the first shared automobile demand is not matched with the first adjustable shared automobile quantity.
In a third aspect, an embodiment of the present application provides a server, including a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, and the program includes instructions for executing steps in any method of the first aspect of the embodiment of the present application.
In a fourth aspect, the present application provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, where the computer program makes a computer perform part or all of the steps described in any one of the methods of the first aspect of the present application.
In a fifth aspect, the present application provides a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to perform some or all of the steps as described in any one of the methods of the first aspect of the embodiments of the present application. The computer program product may be a software installation package.
It can be seen that, in the embodiment of the application, the shared automobile database is queried according to the first time and the first place to obtain the first historical data and the first adjustable shared automobile quantity; and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule. The embodiment of the application is beneficial to improving the dispatching efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a shared automobile scheduling method according to an embodiment of the present application;
FIG. 2 is a schematic flow chart illustrating a shared vehicle scheduling method according to an embodiment of the present disclosure;
FIG. 3 is a schematic flow chart diagram illustrating a shared vehicle scheduling method according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application;
fig. 5 is a block diagram illustrating functional units of a shared vehicle dispatching device according to an embodiment of the present disclosure.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," and the like in the description and claims of the present application and in the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
Referring to fig. 1, fig. 1 is a schematic flow chart of a shared vehicle scheduling method according to an embodiment of the present application, including:
101, a shared automobile scheduling device queries a shared automobile database according to a first time and a first place to obtain first historical data and a first adjustable shared automobile quantity, wherein the first historical data comprises a first shared automobile demand, and the first adjustable shared automobile quantity is the number of shared automobiles which can be scheduled at the first time at the first place.
The user makes an appointment or order placement and other operations through the shared automobile APP, the first historical data can further comprise historical automobile use conditions, use time, appointment conditions and the like of various places, and the first shared automobile demand is the quantity of shared automobiles needed by the first place at the first time.
And 102, if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule.
The shared automobile dispatching order is marked with a specific mark to remind a user that the order is discounted or awarded by points, and the points can be used for deducting the automobile rental fee in the next automobile rental.
It can be seen that, in the embodiment of the present application, the shared automobile scheduling device firstly queries the shared automobile database according to a first time and a first location to obtain a first historical data and a first adjustable shared automobile quantity, and secondly issues a shared automobile scheduling order according to a preset rule if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity. Therefore, the shared automobile scheduling method in the embodiment of the application is beneficial to improving the scheduling efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
In one possible example, if the first shared vehicle demand does not match the first adjustable shared vehicle demand, issuing a shared vehicle dispatch order comprises:
if the first shared automobile demand is greater than the first adjustable shared automobile quantity, issuing a first shared automobile scheduling order, wherein the first shared automobile scheduling order is that shared automobiles of N second places are adjusted to the first place, the second shared automobile demand of each second place in the N second places is less than a second adjustable shared automobile quantity, the second adjustable shared automobile quantity is the number of shared automobiles which can be scheduled at the first time by the second place, and N is a positive integer;
and if the first shared automobile demand is smaller than the first adjustable shared automobile quantity, issuing a second shared automobile scheduling order, wherein the second shared automobile scheduling order is to schedule the shared automobiles of the first place to M second places, the second shared automobile demand of each of the M second places is larger than the first adjustable shared automobile quantity, and M is a positive integer.
Therefore, the shared automobiles of the places where the supply is over demand are dispatched to the places where the supply is under demand, so that the supply and demand conditions of two or more places of the vehicles can be balanced, and the utilization rate of the vehicles is improved.
In one possible example, the first time includes rush hour, sub-rush hour, normal time and valley time, and the issuing a first shared automobile dispatch order if the first shared automobile demand is greater than the first tunable shared automobile quantity comprises:
if the first time is the peak time, inquiring the shared automobile database to obtain the quantity of the externally-adjustable shared automobiles of G second places, generating X first shared automobile dispatching orders according to the quantity of the first shared automobiles, the quantity of the first adjustable shared automobiles and the quantity of the externally-adjustable shared automobiles, and issuing the first shared automobile dispatching orders;
and if the first time is the sub-peak time, inquiring the shared automobile database to obtain H shared automobile quantity which can be adjusted outside of the second places, generating Y first shared automobile dispatching orders according to the first shared automobile demand quantity, the first adjustable shared automobile quantity and the shared automobile quantity which can be adjusted outside, and issuing the first shared automobile dispatching orders, wherein G, X, H, Y are positive integers, and H < G, Y < X.
In the working day, the time of the user on and off duty is different because of different work, and the following time is taken as an example, and the time of the user on and off duty is 5 pm for most of the users: 30-7: 30, the next part of the user's off-duty time is 7 pm: 30-10: 00, peak time and sub-peak time of shared automobile demand can occur, peak time, sub-peak time, normal time and valley time of a first place can be obtained by analyzing the shared automobile use condition and demand condition of each time slot of each day in a shared automobile database, at the peak time or the sub-peak time, the shared automobile demand of the first place is larger than the adjustable shared automobile quantity, the shared automobile needs to be adjusted to the first place from shared automobiles of other places, at the normal time, the supply and demand balance of the shared automobile does not need to be adjusted, at the valley time, the shared automobile demand of the first place is smaller than the adjustable shared automobile quantity, and the shared automobile of the first place needs to be externally adjusted to other places. The shared automobile database is inquired, the shared automobile use condition and the demand condition of a first place and a plurality of second places around the first place can be known, wherein the first place is a place with the most demand for the shared automobile, the shared automobile of the second places in the 'supply and demand' state around the first place needs to be called into the first place according to the demand, G and H can be preset and can be flexibly selected according to the actual condition, for the first place, the dispatching range in peak time is wider than that in second peak time, the number of the dispatched second places is more, the number of the first shared automobile dispatching orders is larger, discount is more, and users are encouraged to participate in shared automobile dispatching.
Therefore, the time is divided by sharing the supply and demand change conditions of the automobile in different time periods, and the scheduling area range is determined according to the divided time, so that the scheduling requirement of the peak time can be better met, and the scheduling pressure is relieved.
In one possible example, if the first time is the peak time, the issuing the first shared bus dispatch order comprises:
acquiring position information of a first user, wherein the first user is a user in a shared automobile schedulable area;
and screening G second users located at the second places from the first users according to the position information, and pushing the first shared automobile scheduling order and order receiving reward information to the second users.
The shared automobile dispatchable area can be a city, a town or a parcel, the activity range of the user can be obtained according to historical data in the shared automobile database, and the first user is determined according to the activity range. When a first shared automobile dispatching order is issued, order receiving reward information is issued at the same time, the order and the reward information are pushed to a general user when the user starts a corresponding APP, for a second user, the order and the reward information are pushed in a bullet screen or screen pull-down window mode, and the reward can comprise a red packet, expense discount or integral (the integral can be used for deducting the expense of the automobile rented for the next automobile rented) and the like.
Therefore, the operation cost of the platform can be reduced, the operation time can be saved, and the vehicle utilization rate can be improved by enabling the user to participate in scheduling.
In one possible example, the method further comprises:
if the first time is the peak time, the required time length from the G second places to the first place is T1, T2,, TG, and when T1, T2,, TG precede the first time respectively, the first shared automobile scheduling order is issued to the second users located at the G second places, and T1, T2,, TG is a positive number.
Considering that traffic jam is easy to occur at peak time and a certain time is needed for shunting from other places, a certain time margin T can be increased, and when the time T1+ T, T2+ T, TG + T is before the first time, a first shared automobile scheduling order is issued.
Similarly, if the first time is the sub-peak time, the time required from H second locations to the first location is W1, W2,, WH, and when W1, W2,, WG are before the first time, the first shared automobile scheduling order is issued to the second users located at H second locations, W1, W2,, WG is a positive number.
Therefore, the traffic jam problem of the vehicles in the dispatching process can be prevented by dispatching the vehicles in advance, and the vehicles dispatched outside can be ensured to reach a predetermined place at the peak time or the secondary peak time, so that the dispatching pressure is relieved.
In one possible example, after issuing the shared automobile scheduling order according to a preset rule if the first shared automobile demand does not match the first adjustable shared automobile demand, the method further includes:
and if the user receives the shared automobile dispatching order, updating the shared automobile dispatching order of the first place.
And if the shared automobile dispatching order is received within the preset time, no user receives the shared automobile dispatching order, and the shared automobile dispatching order is cancelled.
If the first time is the sub-peak time, the preset time is the sub-peak time plus a first reserved time, the first reserved time may be 10min, 20min, 30min, and the like, and if the first time is the peak time, the preset time is the peak time plus a second reserved time, the second reserved time may be 10min, 20min, 30min, and the like.
Therefore, the shared automobile scheduling method in this example can flexibly determine the supply and demand of the shared automobile according to time and place, so as to adjust the issuance of the first shared automobile scheduling order, and at peak time or sub-peak time, the order is issued to call in the automobile, at valley time, the automobile is called out, and at normal time, no adjustment is made.
In one possible example, after issuing the first shared vehicle dispatch order if the first shared vehicle demand is greater than the first adjustable shared vehicle volume, the method further comprises:
acquiring an appointed carpooling order of the first place, wherein the appointed carpooling order comprises an appointed time and an appointed place;
and matching the order according to the reserved time and the reserved place, and sending the order matching information to a reserved order matching user.
In order to better dispatch vehicles and balance the use condition of the vehicles, in addition to the aforesaid dispatching of the vehicles by issuing a first shared vehicle dispatching order and giving a certain reward or discount to users, the users can also relieve the pressure of 'supply shortage' by way of order sharing, before the users reserve the shared vehicles, the users need to pass the identity authentication of the platform, and before reserving the shared vehicles, the users have an option of 'car sharing', when the users select the option, the users are indicated to agree with car sharing, each car sharing is two parties, at most 4 people, the users input the reservation time (namely departure time) and the destination A and the number of people, the system arranges the car sharing before the reservation time, if the departure time and the reservation time are less than the preset time, such as 3min, and the destination B and the destination A are the same or cover each other (the destination A is a part of the destination B, or the destination B is a part of the destination A), the users share the shared automobile, and the shared automobile scheduling terminal, such as a mobile phone, informs the two parties of successful car sharing, so that the users can check personal information registered by the other party of the car sharing, and the safety of the car sharing is improved. If the reserved time is exceeded (the reserved time is not exceeded), the carpooling is not successfully performed, the reserved carpooling order is automatically converted into a common reserved order, and the user is informed.
Therefore, the energy is effectively saved by reserving the car sharing, the platform operation cost is reduced, the utilization rate and the unit quantity of the vehicles are improved, and the car renting cost of the renters is reduced.
Referring to fig. 2, fig. 2 is a schematic flowchart of a shared vehicle scheduling method according to an embodiment of the present application, including:
201. inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, wherein the first historical data comprises first shared automobile demand;
202. if the first shared automobile demand is larger than the first adjustable shared automobile demand, acquiring position information of a first user, wherein the first user is a user in a shared automobile adjustable area;
203. screening out second users located in G second places from the first users according to the position information, generating a first shared automobile dispatching order, and pushing the first shared automobile dispatching order and order receiving reward information to the second users, wherein the second shared automobile demand of each second place in the G second places is less than a second adjustable shared automobile quantity;
204. and if the second user receives the first shared automobile scheduling order, updating the first shared automobile scheduling order of the first place.
It can be seen that, in the embodiment of the present application, the shared automobile scheduling device firstly queries a shared automobile database according to a first time and a first location to obtain a first historical data and a first adjustable shared automobile quantity, secondly, if a first shared automobile demand is greater than the first adjustable shared automobile quantity, issues a first shared automobile scheduling order, and finally, if a user receives the first shared automobile scheduling order, updates the first shared automobile scheduling order at the first location. Therefore, the shared automobile scheduling method in the embodiment of the application is beneficial to improving the scheduling efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
Referring to fig. 3, fig. 3 is a schematic flowchart of a shared vehicle scheduling method according to an embodiment of the present application, including:
301. inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, wherein the first historical data comprises first shared automobile demand;
302. if the first shared automobile demand is greater than the first adjustable shared automobile quantity, inquiring the shared automobile database to obtain the externally adjustable shared automobile quantity of G second places, wherein the second shared automobile demand of each second place in the G second places is less than the second adjustable shared automobile quantity;
303. generating a first shared automobile scheduling order according to the first shared automobile demand, the first adjustable shared automobile quantity and the adjustable shared automobile quantity, and issuing the first shared automobile scheduling order;
304. acquiring an appointed carpooling order of the first place, wherein the appointed carpooling order comprises an appointed time and an appointed place;
305. the order matching is carried out according to the reservation time and the reservation place, and order matching information is sent to a reservation order matching user;
306. and if the user receives the first shared automobile scheduling order, updating the first shared automobile scheduling order of the first place according to the first shared automobile demand, the first adjustable shared automobile quantity, the externally adjustable shared automobile quantity and the order splicing information.
It can be seen that, in the embodiment of the present application, the shared automobile scheduling device firstly queries a shared automobile database according to a first time and a first location to obtain a first historical data and a first adjustable shared automobile quantity, secondly, if a first shared automobile demand is greater than the first adjustable shared automobile quantity, issues a first shared automobile scheduling order, and finally, if a user receives the first shared automobile scheduling order, updates the first shared automobile scheduling order at the first location. Therefore, the shared automobile scheduling method in the embodiment of the application is beneficial to improving the scheduling efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a server according to an embodiment of the present application, and as shown, the server includes a processor, a memory, a communication interface, and one or more programs, which are stored in the memory and configured to be executed by the processor.
Optionally, the one or more programs include instructions for performing the steps of:
inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, wherein the first historical data comprises first shared automobile demand quantity, and the first adjustable shared automobile quantity is the number of shared automobiles which can be adjusted at the first time at the first place;
and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule.
It can be seen that, in the embodiment of the application, the shared automobile database is queried according to the first time and the first place to obtain the first historical data and the first adjustable shared automobile quantity; and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule. The embodiment of the application is beneficial to improving the dispatching efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
In one possible example, in the aspect that the shared automobile scheduling order is issued if the first shared automobile demand does not match the first adjustable shared automobile demand, the instructions in the program are specifically configured to perform the following operations:
if the first shared automobile demand is greater than the first adjustable shared automobile quantity, issuing a first shared automobile scheduling order, wherein the first shared automobile scheduling order is that shared automobiles of N second places are adjusted to the first place, the second shared automobile demand of each second place in the N second places is less than a second adjustable shared automobile quantity, the second adjustable shared automobile quantity is the number of shared automobiles which can be scheduled at the first time by the second place, and N is a positive integer;
and if the first shared automobile demand is smaller than the first adjustable shared automobile quantity, issuing a second shared automobile scheduling order, wherein the second shared automobile scheduling order is to schedule the shared automobiles of the first place to M second places, the second shared automobile demand of each of the M second places is larger than the first adjustable shared automobile quantity, and M is a positive integer.
In one possible example, the first time includes rush hour, sub-rush hour, normal time and valley time, and in the aspect of issuing the first shared automobile dispatch order if the first shared automobile demand is greater than the first tunable shared automobile quantity, the instructions in the program are specifically configured to:
if the first time is the peak time, inquiring the shared automobile database to obtain the quantity of the externally-adjustable shared automobiles of G second places, generating X first shared automobile dispatching orders according to the quantity of the first shared automobiles, the quantity of the first adjustable shared automobiles and the quantity of the externally-adjustable shared automobiles, and issuing the first shared automobile dispatching orders; alternatively, the first and second electrodes may be,
and if the first time is the sub-peak time, inquiring the shared automobile database to obtain H shared automobile quantity which can be adjusted outside of the second places, generating Y first shared automobile dispatching orders according to the first shared automobile demand quantity, the first adjustable shared automobile quantity and the shared automobile quantity which can be adjusted outside, and issuing the first shared automobile dispatching orders, wherein G, X, H, Y are positive integers, and H < G, Y < X.
In one possible example, if the first time is the peak time, the instructions in the program are specifically configured to, in the aspect of issuing the first shared automobile dispatch order, perform the following:
acquiring position information of a first user, wherein the first user is a user in a shared automobile schedulable area;
and screening G second users located at the second places from the first users according to the position information, and pushing the first shared automobile scheduling order and order receiving reward information to the second users.
In one possible example, the instructions in the program are specifically for performing the following:
if the first time is the peak time, the required time length from the G second places to the first place is T1, T2,, TG, and when T1, T2,, TG precede the first time respectively, the first shared automobile scheduling order is issued to the second users located at the G second places, and T1, T2,, TG is a positive number.
In one possible example, after the shared automobile scheduling order is issued according to a preset rule if the first shared automobile demand amount does not match the first adjustable shared automobile amount, the instructions in the program are specifically configured to perform the following operations:
and if the user receives the shared automobile dispatching order, updating the shared automobile dispatching order of the first place.
And if the shared automobile dispatching order is received within the preset time, no user receives the shared automobile dispatching order, and the shared automobile dispatching order is cancelled.
In one possible example, after the shared automobile scheduling order is issued according to a preset rule if the first shared automobile demand amount does not match the first adjustable shared automobile amount, the instructions in the program are specifically configured to perform the following operations:
acquiring an appointed carpooling order of the first place, wherein the appointed carpooling order comprises an appointed time and an appointed place;
and matching the order according to the reserved time and the reserved place, and sending the order matching information to a reserved order matching user.
The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It is understood that the medical imaging apparatus includes hardware structures and/or software modules for performing the respective functions in order to realize the functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the various illustrative elements and algorithm steps described in connection with the embodiments provided herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The embodiment of the present application may perform the division of the functional units for the medical imaging apparatus according to the above method examples, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 5 is a block diagram of functional units of a shared vehicle dispatching device 500 according to an embodiment of the present application. The shared vehicle scheduling apparatus 500 includes:
an obtaining unit 501, configured to query a shared automobile database according to a first time and a first location to obtain first historical data and a first adjustable shared automobile quantity, where the first historical data includes a first shared automobile demand, and the first adjustable shared automobile quantity is a quantity of shared automobiles that can be scheduled at the first time at the first location;
an order issuing unit 502, configured to issue a shared automobile scheduling order according to a preset rule if the first shared automobile demand amount is not matched with the first adjustable shared automobile amount;
it can be seen that, in the embodiment of the application, the shared automobile database is queried according to the first time and the first place to obtain the first historical data and the first adjustable shared automobile quantity; and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule. The embodiment of the application is beneficial to improving the dispatching efficiency and the utilization rate of the shared automobile and reducing the energy consumption and the operation cost.
In a possible example, in the aspect of issuing the shared automobile scheduling order if the first shared automobile demand is not matched with the first adjustable shared automobile demand, the order issuing unit 502 is specifically configured to:
if the first shared automobile demand is greater than the first adjustable shared automobile quantity, issuing a first shared automobile scheduling order, wherein the first shared automobile scheduling order is that shared automobiles of N second places are adjusted to the first place, the second shared automobile demand of each second place in the N second places is less than a second adjustable shared automobile quantity, the second adjustable shared automobile quantity is the number of shared automobiles which can be scheduled at the first time by the second place, and N is a positive integer;
and if the first shared automobile demand is smaller than the first adjustable shared automobile quantity, issuing a second shared automobile scheduling order, wherein the second shared automobile scheduling order is to schedule the shared automobiles of the first place to M second places, the second shared automobile demand of each of the M second places is larger than the first adjustable shared automobile quantity, and M is a positive integer.
In one possible example, the first time includes peak time, sub-peak time, normal time and valley time, and in the aspect of issuing the first shared automobile scheduling order if the first shared automobile demand is greater than the first adjustable shared automobile demand, the order issuing unit 502 is specifically configured to:
if the first time is the peak time, inquiring the shared automobile database to obtain the quantity of the externally-adjustable shared automobiles of G second places, generating X first shared automobile dispatching orders according to the quantity of the first shared automobiles, the quantity of the first adjustable shared automobiles and the quantity of the externally-adjustable shared automobiles, and issuing the first shared automobile dispatching orders; alternatively, the first and second electrodes may be,
and if the first time is the sub-peak time, inquiring the shared automobile database to obtain H shared automobile quantity which can be adjusted outside of the second places, generating Y first shared automobile dispatching orders according to the first shared automobile demand quantity, the first adjustable shared automobile quantity and the shared automobile quantity which can be adjusted outside, and issuing the first shared automobile dispatching orders, wherein G, X, H, Y are positive integers, and H < G, Y < X.
In a possible example, if the first time is the peak time, in terms of issuing the first shared automobile scheduling order, the order issuing unit 502 is specifically configured to:
acquiring position information of a first user, wherein the first user is a user in a shared automobile schedulable area;
and screening G second users located at the second places from the first users according to the position information, and pushing the first shared automobile scheduling order and order receiving reward information to the second users.
In one possible example, the order issuing unit 502 is further configured to:
if the first time is the peak time, the required time length from the G second places to the first place is T1, T2,, TG, and when T1, T2,, TG precede the first time respectively, the first shared automobile scheduling order is issued to the second users located at the G second places, and T1, T2,, TG is a positive number.
In a possible example, after the shared automobile scheduling order is issued according to a preset rule if the first shared automobile demand is not matched with the first adjustable shared automobile demand, the order issuing unit 502 is specifically configured to:
and if the user receives the shared automobile dispatching order, updating the shared automobile dispatching order of the first place.
And if the shared automobile dispatching order is received within the preset time, no user receives the shared automobile dispatching order, and the shared automobile dispatching order is cancelled.
In a possible example, the shared automobile dispatching terminal further includes an order splicing unit 503, and after the first shared automobile dispatching order is issued if the first shared automobile demand is greater than the first adjustable shared automobile demand, the order splicing unit 503 is specifically configured to:
acquiring an appointed carpooling order of the first place, wherein the appointed carpooling order comprises an appointed time and an appointed place;
and matching the order according to the reserved time and the reserved place, and sending the order matching information to a reserved order matching user.
Embodiments of the present application also provide a computer storage medium, wherein the computer storage medium stores a computer program for electronic data exchange, and the computer program enables a computer to execute part or all of the steps of any one of the methods as described in the above method embodiments.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any of the methods as described in the above method embodiments. The computer program product may be a software installation package.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of the units is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit may be stored in a computer readable memory if it is implemented in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the above-mentioned method of the embodiments of the present application. And the aforementioned memory comprises: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A method for shared vehicle dispatch, the method comprising:
inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, wherein the first historical data comprises first shared automobile demand quantity, and the first adjustable shared automobile quantity is the number of shared automobiles which can be adjusted at the first time at the first place;
and if the first shared automobile demand quantity is not matched with the first adjustable shared automobile quantity, issuing a shared automobile scheduling order according to a preset rule.
2. The method of claim 1, wherein issuing a shared vehicle dispatch order if the first shared vehicle demand does not match the first adjustable shared vehicle demand comprises:
if the first shared automobile demand is greater than the first adjustable shared automobile quantity, issuing a first shared automobile scheduling order, wherein the first shared automobile scheduling order is that shared automobiles of N second places are adjusted to the first place, the second shared automobile demand of each second place in the N second places is less than a second adjustable shared automobile quantity, the second adjustable shared automobile quantity is the number of shared automobiles which can be scheduled at the first time by the second place, and N is a positive integer;
and if the first shared automobile demand is smaller than the first adjustable shared automobile quantity, issuing a second shared automobile scheduling order, wherein the second shared automobile scheduling order is to schedule the shared automobiles of the first place to M second places, the second shared automobile demand of each of the M second places is larger than the first adjustable shared automobile quantity, and M is a positive integer.
3. The method of claim 2, wherein the first time includes peak time, sub-peak time, normal time, and valley time, and wherein issuing a first shared automobile dispatch order if the first shared automobile demand is greater than the first tunable shared automobile quantity comprises:
if the first time is the peak time, inquiring the shared automobile database to obtain the quantity of the externally-adjustable shared automobiles of G second places, generating X first shared automobile dispatching orders according to the quantity of the first shared automobiles, the quantity of the first adjustable shared automobiles and the quantity of the externally-adjustable shared automobiles, and issuing the first shared automobile dispatching orders;
and if the first time is the sub-peak time, inquiring the shared automobile database to obtain H shared automobile quantity which can be adjusted outside of the second places, generating Y first shared automobile dispatching orders according to the first shared automobile demand quantity, the first adjustable shared automobile quantity and the shared automobile quantity which can be adjusted outside, and issuing the first shared automobile dispatching orders, wherein G, X, H, Y are positive integers, and H < G, Y < X.
4. The method of claim 3, wherein said issuing said first shared bus dispatch order if said first time is said rush hour comprises:
acquiring position information of a first user, wherein the first user is a user in a shared automobile schedulable area;
and screening G second users located at the second places from the first users according to the position information, and pushing the first shared automobile scheduling order and order receiving reward information to the second users.
5. The method of claim 3, further comprising:
if the first time is the peak time, the required time length from the G second places to the first place is T1, T2,, TG, and when T1, T2,, TG precede the first time respectively, the first shared automobile scheduling order is issued to the second users located at the G second places, and T1, T2,, TG is a positive number.
6. The method of claim 1, wherein after issuing a shared vehicle dispatch order according to a predetermined rule if the first shared vehicle demand does not match the first adjustable shared vehicle quantity, the method further comprises:
and if the user receives the shared automobile dispatching order, updating the shared automobile dispatching order of the first place.
And if the shared automobile dispatching order is received within the preset time, no user receives the shared automobile dispatching order, and the shared automobile dispatching order is cancelled.
7. The method of claim 1, wherein after issuing a shared vehicle dispatch order according to a predetermined rule if the first shared vehicle demand does not match the first adjustable shared vehicle quantity, the method further comprises:
acquiring an appointed carpooling order of the first place, wherein the appointed carpooling order comprises an appointed time and an appointed place;
and matching the order according to the reserved time and the reserved place, and sending the order matching information to a reserved order matching user.
8. A shared vehicle dispatching device, comprising:
the system comprises an acquisition unit, a processing unit and a control unit, wherein the acquisition unit is used for inquiring a shared automobile database according to first time and a first place to obtain first historical data and first adjustable shared automobile quantity, the first historical data comprises first shared automobile demand, and the first adjustable shared automobile quantity is the number of shared automobiles which can be adjusted at the first time at the first place;
and the order issuing unit is used for issuing a shared automobile dispatching order according to a preset rule if the first shared automobile demand is not matched with the first adjustable shared automobile quantity.
9. A server, comprising a processor, memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs including instructions for performing the steps in the method of any of claims 1-7.
10. A computer-readable storage medium, characterized in that a computer program for electronic data exchange is stored, wherein the computer program causes a computer to perform the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910721894.6A CN110598977A (en) | 2019-08-06 | 2019-08-06 | Shared automobile scheduling method and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910721894.6A CN110598977A (en) | 2019-08-06 | 2019-08-06 | Shared automobile scheduling method and related device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110598977A true CN110598977A (en) | 2019-12-20 |
Family
ID=68853578
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910721894.6A Pending CN110598977A (en) | 2019-08-06 | 2019-08-06 | Shared automobile scheduling method and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110598977A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112529650A (en) * | 2020-11-25 | 2021-03-19 | 深圳市元征科技股份有限公司 | Vehicle management method and system and electronic equipment |
| CN112669604A (en) * | 2020-12-17 | 2021-04-16 | 广东南方通信建设有限公司 | Urban traffic scheduling method and device |
| CN113159883A (en) * | 2021-03-23 | 2021-07-23 | 深圳前海联动云软件科技有限公司 | Automobile leasing dynamic inventory management method and system |
| CN114819757A (en) * | 2022-06-24 | 2022-07-29 | 北京阿帕科蓝科技有限公司 | Method, system and computer readable storage medium for adjusting station position |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103079169A (en) * | 2013-01-17 | 2013-05-01 | 成都美璞科技有限公司 | Intelligent taxi hailing system and method based on web page |
| CN104933571A (en) * | 2015-05-13 | 2015-09-23 | 北京嘀嘀无限科技发展有限公司 | Taxi-taking method and system |
| CN105139089A (en) * | 2015-08-20 | 2015-12-09 | 北京嘀嘀无限科技发展有限公司 | Method and device for balancing travel supplies and demands |
| CN106504520A (en) * | 2016-12-01 | 2017-03-15 | 广州麦仑信息科技有限公司 | Multiple go out pedestrian share a carrying service vehicle method and system |
| CN107507293A (en) * | 2017-08-31 | 2017-12-22 | 深圳市元征科技股份有限公司 | passenger monitoring method and terminal device |
| US20180060827A1 (en) * | 2016-08-25 | 2018-03-01 | Ford Global Technologies, Llc | Methods and apparatus for automonous vehicle scheduling |
| CN109284880A (en) * | 2017-07-20 | 2019-01-29 | 北京嘀嘀无限科技发展有限公司 | Data processing method, device, server, mobile terminal and readable storage medium storing program for executing |
| CN109673165A (en) * | 2017-08-16 | 2019-04-23 | 北京嘀嘀无限科技发展有限公司 | System and method for dispatching buses |
-
2019
- 2019-08-06 CN CN201910721894.6A patent/CN110598977A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103079169A (en) * | 2013-01-17 | 2013-05-01 | 成都美璞科技有限公司 | Intelligent taxi hailing system and method based on web page |
| CN104933571A (en) * | 2015-05-13 | 2015-09-23 | 北京嘀嘀无限科技发展有限公司 | Taxi-taking method and system |
| CN105139089A (en) * | 2015-08-20 | 2015-12-09 | 北京嘀嘀无限科技发展有限公司 | Method and device for balancing travel supplies and demands |
| US20180060827A1 (en) * | 2016-08-25 | 2018-03-01 | Ford Global Technologies, Llc | Methods and apparatus for automonous vehicle scheduling |
| CN106504520A (en) * | 2016-12-01 | 2017-03-15 | 广州麦仑信息科技有限公司 | Multiple go out pedestrian share a carrying service vehicle method and system |
| CN109284880A (en) * | 2017-07-20 | 2019-01-29 | 北京嘀嘀无限科技发展有限公司 | Data processing method, device, server, mobile terminal and readable storage medium storing program for executing |
| CN109673165A (en) * | 2017-08-16 | 2019-04-23 | 北京嘀嘀无限科技发展有限公司 | System and method for dispatching buses |
| CN107507293A (en) * | 2017-08-31 | 2017-12-22 | 深圳市元征科技股份有限公司 | passenger monitoring method and terminal device |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112529650A (en) * | 2020-11-25 | 2021-03-19 | 深圳市元征科技股份有限公司 | Vehicle management method and system and electronic equipment |
| CN112669604A (en) * | 2020-12-17 | 2021-04-16 | 广东南方通信建设有限公司 | Urban traffic scheduling method and device |
| CN113159883A (en) * | 2021-03-23 | 2021-07-23 | 深圳前海联动云软件科技有限公司 | Automobile leasing dynamic inventory management method and system |
| CN113159883B (en) * | 2021-03-23 | 2023-12-01 | 深圳前海联动云软件科技有限公司 | Dynamic inventory management method and system for car leases |
| CN114819757A (en) * | 2022-06-24 | 2022-07-29 | 北京阿帕科蓝科技有限公司 | Method, system and computer readable storage medium for adjusting station position |
| CN114819757B (en) * | 2022-06-24 | 2022-09-23 | 北京阿帕科蓝科技有限公司 | Method, system and computer readable storage medium for adjusting station position |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110598977A (en) | Shared automobile scheduling method and related device | |
| US11673483B2 (en) | Methods and systems for facilitating charging sessions for electric vehicles | |
| CN105761482B (en) | The real-time reserving method of taxi and system based on fairness | |
| CN110705753B (en) | Vehicle dispatching method and device based on dispatching model, computer equipment and storage medium | |
| CN107393193A (en) | A kind of community parking position shared system and method based on public platform | |
| US10981464B1 (en) | Methods and systems for facilitating charging sessions for electric vehicles | |
| CN107170278A (en) | A kind of shared method in parking stall and server | |
| CN105096183A (en) | Task-triggered public bicycle self-scheduling method and system based on Internet of Things | |
| CN105096187A (en) | Parking space renting system based on cloud platform and method thereof | |
| CN105551236B (en) | Vehicle dispatching method and vehicle dispatch system | |
| CN103489308A (en) | Computer-implemented taxi booking system | |
| CN108334965A (en) | A kind of method and apparatus of parking position reservation | |
| CN107346465A (en) | It is mobile to mend electric car intelligent management system | |
| CN109670808A (en) | Reimbursement of expense method, apparatus, computer installation, storage medium and vehicle washing system | |
| CN106327177A (en) | Account resource sharing method and system | |
| CN104008671A (en) | Membership system city parking place scheduling method | |
| JP2019169110A (en) | Information distribution device | |
| CN111768174A (en) | Activity management method, apparatus, device and medium | |
| KR101742963B1 (en) | Relay system and method for personal based sharing of rental cars | |
| CN113379084B (en) | Air ticket renewal method and air ticket renewal device | |
| CN102819914A (en) | Invoice distribution system and method of invoice distribution system | |
| CN114926913A (en) | Preferential parking management method, parking management terminal and readable storage medium | |
| CN110826943B (en) | Method and related equipment for judging whether bus allocation is needed or not and determining bus allocation number | |
| CN110111217A (en) | A kind of Destination Management method, apparatus, block chain node device and storage medium | |
| CN109816130A (en) | A kind of queuing reservation car-washing method and its system |
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 |