CN116993138B - Scheduling method and server for shared vehicles - Google Patents
Scheduling method and server for shared vehicles Download PDFInfo
- Publication number
- CN116993138B CN116993138B CN202311271693.3A CN202311271693A CN116993138B CN 116993138 B CN116993138 B CN 116993138B CN 202311271693 A CN202311271693 A CN 202311271693A CN 116993138 B CN116993138 B CN 116993138B
- Authority
- CN
- China
- Prior art keywords
- vehicle
- throwing
- shared
- scheduling
- task
- 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 36
- 238000012423 maintenance Methods 0.000 abstract description 82
- 239000000969 carrier Substances 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 239000012141 concentrate Substances 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000010408 sweeping Methods 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/20—Administration of product repair or maintenance
-
- 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)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a dispatching method and a server for a shared vehicle, wherein the dispatching method comprises the following steps: displaying a plurality of vehicle throwing tasks to a dispatching terminal; receiving a vehicle-throwing task selected by a dispatching terminal, and creating a vehicle-throwing task group; displaying a plurality of trolley points to a dispatching terminal; receiving a dispatching request of a dispatching terminal to a sharing vehicle; if the shared vehicle is at the pull point and the real-time pull number of the pull point is a positive value, creating a scheduling order for the shared vehicle; receiving a vehicle throwing request of a dispatching terminal for a shared vehicle; if the shared vehicle is at a vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, completing a dispatching order for the shared vehicle and releasing the shared vehicle; and when all the scheduling orders are completed, ending the vehicle-throwing task group. The dispatching order, the vehicle-throwing task and the vehicle-throwing task group are not forcibly associated, and the operation and maintenance personnel do not need to care that a specific shared vehicle needs to be thrown to a specific vehicle-throwing point in the dispatching process, so that the dispatching efficiency of the operation and maintenance personnel can be improved.
Description
Technical Field
The invention relates to the technical field of shared vehicles, in particular to a dispatching method and a server of a shared vehicle.
Background
The shared vehicles are put in towns for use by users. The use of the shared vehicles by the users is random, and in general, after the shared vehicles are used for a period of time without intervention of external conditions, the distribution of the shared vehicles in towns is not uniform, and the shared vehicles may concentrate in certain areas, resulting in that the shared vehicles cannot be effectively used. At this time, the operators who provide the shared vehicles need to schedule the shared vehicles so that the shared vehicles can be reasonably distributed in towns for convenience of users.
Currently, the scheduling method of the shared vehicle is generally as follows: the operator informs operation and maintenance personnel of the vehicle throwing point and the vehicle pulling point, and informs the number of the vehicle throwing and pulling vehicles to establish an order. The operation and maintenance personnel need to obtain a fixed number of shared vehicles from the vehicle pulling point, and put the fixed number of shared vehicles into the vehicle throwing point through the carrier so as to complete the order. The scheduling method can effectively guide operation staff to make orders, but lacks flexibility.
Accordingly, there is a need to provide a new method of tuning the degree of sharing of vehicles.
Disclosure of Invention
The invention aims to provide a dispatching method and a server for a shared vehicle, so as to solve the problem that the existing dispatching method for the shared vehicle lacks flexibility.
In one aspect, a method for scheduling a shared vehicle is provided, including: displaying a plurality of vehicle-throwing tasks to a dispatching terminal so that the dispatching terminal can select at least one vehicle-throwing task as a vehicle-throwing task group; the vehicle-throwing task comprises a vehicle-throwing point and a corresponding initial vehicle-throwing quantity; receiving the vehicle-throwing task selected by the dispatching terminal, and creating the vehicle-throwing task group; displaying a plurality of trolley points to the dispatching terminal; receiving a pulling request of the dispatching terminal for the shared vehicle; if the shared vehicle is at the pull point and the real-time pull number of the pull point is a positive value, creating a scheduling order for the shared vehicle; comparing the carrier capacity of the dispatching terminal with the order quantity of the dispatching order, wherein the order quantity is not allowed to exceed the carrier capacity; receiving a vehicle throwing request of the dispatching terminal for the shared vehicle; if the shared vehicle is at the vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, completing the dispatching order for the shared vehicle, and releasing the shared vehicle; and ending the vehicle-throwing task group when all the scheduling orders are completed.
And when all the dispatching orders are completed, namely all the sharing vehicles are put in the vehicle-throwing point, ending the vehicle-throwing task group. In this embodiment, each shared vehicle is a dispatch order, and when the dispatch order is completed, the shared vehicle is released and the user can use the shared vehicle. In the prior art, when a plurality of shared vehicles are used as a scheduling order, the operation and maintenance personnel release the shared vehicles only after all the shared vehicles in the scheduling order are put in, so that the scheduling method of the embodiment has remarkable progress, the timeliness of the user in using the vehicle is improved, and the user experience is improved.
In addition, in the embodiment, the vehicle-throwing task is determined according to the vehicle-throwing point, the vehicle-throwing task group is determined according to the vehicle-throwing task, the dispatching order is not forcibly associated with the vehicle-throwing task and the vehicle-throwing task group, and the operation and maintenance personnel do not need to care that a specific shared vehicle needs to be thrown to the specific vehicle-throwing point in the dispatching process, so that the dispatching efficiency of the operation and maintenance personnel can be improved. The vehicle-throwing task groups are associated with vehicle-throwing points, the vehicle-throwing points are not associated with vehicle-pulling points, operation and maintenance personnel freely select the vehicle-pulling points and throw the shared vehicles to the vehicle-throwing points, the vehicle-pulling points are not limited under the condition that the number of the shared vehicles of the selected vehicle-throwing points can be preferentially met, and the dispatching efficiency of the operation and maintenance personnel is further improved.
In addition, the number of the vehicles to be shared can be more accurately met through the real-time vehicle pulling number and the real-time vehicle throwing number, and the problem that the number of the vehicles to be shared is too large or too small, which is possibly caused by the vehicle pulling points and the vehicle throwing points, in the prior art is solved.
Optionally, the receiving the vehicle-throwing task selected by the scheduling terminal, and creating the vehicle-throwing task group includes: and sequentially receiving at least one vehicle-throwing task, and creating a vehicle-throwing task group when the sum of the vehicle-throwing numbers of all the vehicle-throwing tasks is just larger than the capacity of the carrier.
Optionally, the initial total vehicle-throwing amount of the vehicle-throwing task group is not greater than the vehicle capacity, and the initial total vehicle-throwing amount is the sum of the initial vehicle-throwing amounts of all the vehicle-throwing tasks in the vehicle-throwing task group.
Optionally, if the real-time vehicle-throwing quantity of all the vehicle-throwing points in the vehicle-throwing task group is zero and all the dispatching orders are not completed, ending the vehicle-throwing task group and recommending new vehicle-throwing points to the dispatching terminal so that the dispatching terminal can select the new vehicle-throwing points and complete the rest dispatching orders.
Optionally, the displaying the plurality of pull points to the scheduling terminal includes: and displaying a plurality of trolley tasks to the dispatching terminal, wherein the trolley tasks comprise the trolley points and the corresponding initial trolley numbers.
Optionally, when the plurality of pull points are displayed to the scheduling terminal, the scheduling method further includes: and displaying all the vehicle-throwing tasks in the vehicle-throwing task group to the dispatching terminal.
Optionally, after the displaying the plurality of pull tasks to the scheduling terminal, the scheduling method further includes: receiving at least one pulling task selected by the dispatching terminal as a pulling task group, wherein the pulling tasks in the pulling task group are not displayed to other dispatching terminals; receiving a pulling request of the dispatching terminal for the shared vehicle; and if the shared vehicle is at the pull point in the pull task group and the real-time pull number of the pull point is a positive value, creating the scheduling order for the shared vehicle.
Optionally, after the vehicle-throwing task group is created, the vehicle-throwing tasks in the vehicle-throwing task group are not displayed to other dispatching terminals.
Optionally, after creating the vehicle-throwing task group, the scheduling method further includes: setting a pulling time and a throwing time; if at least one scheduling order is not created within the pull time, canceling the vehicle-throwing task group, and releasing the vehicle-throwing task in the vehicle-throwing task group to other scheduling terminals; if at least one scheduling order is not completed within the time length of the vehicle, canceling the vehicle-throwing task group, and releasing the vehicle-throwing task in the vehicle-throwing task group to other scheduling terminals; the pull duration refers to a duration after the set of mission tasks is created; the time length of the drop refers to the duration after the first of the dispatch orders is created.
In another aspect, there is provided a server for sharing a vehicle, including: the sending unit is used for displaying a plurality of vehicle-throwing tasks to the dispatching terminal so that the dispatching terminal can select at least one vehicle-throwing task as a vehicle-throwing task group; the vehicle-throwing task comprises a vehicle-throwing point and a corresponding initial vehicle-throwing quantity; the receiving unit is used for receiving the vehicle-throwing task selected by the scheduling terminal and creating the vehicle-throwing task group; the sending unit is further used for displaying a plurality of trolley points to the dispatching terminal; the receiving unit is also used for receiving a pull request of the dispatching terminal for the shared vehicle; the processing unit is used for creating a scheduling order for the shared vehicle if the shared vehicle is at the pull point and the real-time pull number of the pull point is a positive value; the comparison unit is used for comparing the carrier capacity of the dispatching terminal with the order quantity of the dispatching order, and the order quantity is not allowed to exceed the carrier capacity; the receiving unit is also used for receiving a vehicle throwing request of the dispatching terminal for the shared vehicle; if the shared vehicle is at the vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, the processing unit is further used for completing the dispatching order for the shared vehicle and releasing the shared vehicle; and when all the scheduling orders are completed, the processing unit is further used for ending the vehicle-throwing task group.
Drawings
Fig. 1 is a flowchart of a method for scheduling a shared vehicle according to an embodiment of the invention.
Fig. 2 is a schematic diagram of a dispatching terminal displaying a vehicle-throwing task according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of a pull task displayed by a scheduling terminal according to an embodiment of the present invention.
Fig. 4 is a schematic diagram of a scheduling order establishment displayed by a scheduling terminal according to an embodiment of the present invention.
Fig. 5 is a schematic diagram of a scheduling order completion displayed by a scheduling terminal according to an embodiment of the present invention.
Fig. 6 is a schematic block diagram of a method for scheduling a shared vehicle according to an embodiment of the present invention.
Detailed Description
In order that the above objects, features and advantages of the invention will be readily understood, a more particular description of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings.
The existing dispatching orders already determine specific vehicle-throwing points, vehicle-pulling points and dispatching quantity, and operation and maintenance personnel can only dispatch the shared vehicles with the determined dispatching quantity from the vehicle-pulling points to the vehicle-throwing points, so that the orders are calculated and completed. In this scheduling manner, the vehicle-throwing point, the vehicle-pulling point and the shared vehicle are strongly associated, and after the operation and maintenance personnel obtain the shared vehicle from the vehicle-pulling point, the specific shared vehicle must be thrown to the specific vehicle-throwing point to complete the scheduling order, resulting in low scheduling efficiency. In addition, the dispatching process of operation and maintenance personnel needs a long time, the number of the spare shared vehicles at the pulling points can change with time, and the number of the shared vehicles required at the throwing points can also change with time. If the operation and maintenance personnel execute according to the original order, the number of the shared vehicles of the pull point and the drop point is increased or decreased.
Therefore, the existing determination method for scheduling orders has flaws, which can reduce scheduling efficiency.
Referring to fig. 1, the present invention provides a scheduling method of a shared vehicle.
S101, displaying a plurality of taxi tasks to a dispatching terminal.
The dispatch tasks are performed by an operator who serves the operator of the shared vehicle, who typically has a dispatch terminal, which may be a smart phone, smart tablet, or other dedicated electronic device.
Before the operation and maintenance personnel do the dispatching task, the dispatching terminal needs to be opened, as shown in fig. 2, the server can send the dispatching terminal with the dispatching task, and the dispatching task is displayed in a display screen of the dispatching terminal. The vehicle-throwing task comprises a vehicle-throwing point (particularly referred to as a vehicle-throwing point position) and a corresponding initial vehicle-throwing quantity. The parking spot is actually a parking spot, and when the parking spot lacks a shared vehicle and needs to be accessed from the outside, the parking spot at the moment is the parking spot; when the surplus shared vehicle of the parking spot needs to be called out to the outside, the parking spot at the moment is the vehicle pulling spot. The task of parking refers to the number of shared vehicles that a particular parking spot lacks at the current time.
It should be noted that, the parking spot is taken as a vehicle-throwing point or a vehicle-pulling point, and the initial vehicle-throwing number when the parking spot is taken as the vehicle-throwing point is obtained by the server according to the analysis and calculation of big data or is obtained by manual input of a worker according to a set rule, which are not included in the invention content of the embodiment and are not described herein in detail.
S102, receiving a vehicle-throwing task selected by a dispatching terminal, and creating a vehicle-throwing task group.
The operation and maintenance personnel can select a vehicle-throwing task through the dispatching terminal, can select one vehicle-throwing task, and can also select a plurality of vehicle-throwing tasks as a vehicle-throwing task group. When operation and maintenance personnel select a plurality of vehicle-throwing tasks, the plurality of vehicle-throwing tasks form a vehicle-throwing task group; when the operation and maintenance personnel select one of the vehicle-throwing tasks, the vehicle-throwing tasks form a vehicle-throwing task group. The initial total vehicle-throwing amount of the vehicle-throwing task group is the sum of the initial vehicle-throwing amounts of all the vehicle-throwing tasks contained in the vehicle-throwing task group. The vehicle-throwing task group shown in fig. 2 comprises a vehicle-throwing task 1 and a vehicle-throwing task 3, namely, a user selects the vehicle-throwing task 1 and the vehicle-throwing task 3 as the vehicle-throwing task group through a dispatching terminal, and the user can specifically click the vehicle-throwing task on the upper half part of the dispatching terminal to make the user join the vehicle-throwing task group. The vehicle throwing task 1 comprises 6 shared vehicles, and the vehicle throwing task 3 comprises 4 shared vehicles, so that the initial total vehicle throwing amount of the vehicle throwing task group is 10 shared vehicles.
S103, displaying a plurality of pull points to the dispatching terminal.
Referring to fig. 3, after a set of taxi tasks is created, the server presents a plurality of pull points to the dispatch terminal. As previously described, the pull point refers to a parking spot where a spare shared vehicle is in possession of being brought out to the outside. The pull points show the specific positions of the pull points, so that operation and maintenance personnel are guided to dispatch the shared vehicles through the pull points. Specifically, the server can display the pull points which are closer to the vehicle throwing point in the vehicle throwing task group to the dispatching terminal, so that the dispatching time of operation and maintenance personnel is saved, and the dispatching efficiency is improved.
S104, receiving a dispatching request of the dispatching terminal to the sharing vehicle.
After the server displays a plurality of pull points to the dispatching terminal, an operation and maintenance person can know the specific positions of the pull points, so that the user can come to the pull points and initiate a dispatching request to the shared vehicles of the pull points. Specifically, the operation and maintenance personnel can initiate the dispatching request through the sharing vehicle of the code scanning pull point. The pull points typically have multiple shared vehicles, and the service personnel can randomly pick up the shared vehicles and initiate a dispatch request.
It should be noted that, in this embodiment, the operation and maintenance personnel may go to the pull points displayed in step S103 to select the shared vehicle and initiate the scheduling request, or may go to the pull points not displayed in step S103 to select the shared vehicle and initiate the scheduling request.
S105, if the shared vehicle is at the pull point and the real-time pull number of the pull point is positive, creating a scheduling order for the shared vehicle.
Referring to fig. 4, after receiving a dispatching request of a dispatching terminal to a shared vehicle, the server determines a specific position of the shared vehicle, and if the shared vehicle is not at a pull point, a dispatching order is not created for the shared vehicle; if the shared vehicle is at the pull point and the real-time pull number of the pull point is a positive value, the server creates a scheduling order for the shared vehicle. When the shared vehicle is not at the pull point, the server can also remind the operation and maintenance personnel to go to the pull point to dispatch the shared vehicle.
As shown in fig. 4, after the dispatch order is created, the shared vehicle with the scanned code is displayed in the dispatch terminal, that is, a dispatch order is created, and the shared vehicle is occupied by the operation and maintenance personnel, and cannot be used by other operation and maintenance personnel and users. The scheduling terminal displays 10 shared vehicles (namely 10 scheduling orders) to be scheduled, 5 scheduling orders are created, and the scheduling terminal displays an information list of 5 shared vehicles corresponding to the 5 scheduling orders. The display page also comprises a lock opening button and a lock closing button, wherein the lock opening button means that a specific sharing vehicle can be unlocked so as to facilitate the transportation of the sharing vehicle; closing the lock means that a specific shared vehicle can be locked, and the safety of the shared vehicle is ensured.
Because of the natural inflow and outflow of the shared vehicles and the changing adjustment of the vehicle demand prediction, the surplus shared vehicles at the pull points can change along with time, and the pull points and the drop points can also change along with time. Therefore, when the dispatching terminal initiates a dispatching request, the server needs to judge whether the parking spot where the shared vehicle is located at the current moment is a pull point, judge whether the real-time pull number of the pull point is a positive value, and create a dispatching order for the shared vehicle when the condition is met. Here, the real-time number of the pulling points is the number of the spare shared vehicles at the pulling points.
S106, comparing the carrier capacity of the dispatching terminal with the order quantity of the dispatching order, wherein the order quantity does not allow the carrier capacity to be exceeded.
After creating the scheduling order, the server may count the order volume of the scheduling order. The server also obtains the carrier capacity of the dispatching terminal, compares the order quantity with the carrier capacity, and when the order quantity is increased to be equal to the carrier capacity, the server does not create a dispatching order any more so as to ensure that the order quantity does not exceed the carrier capacity. As described above, the operation and maintenance personnel creates the scheduling orders by the scheduling terminal for sharing the vehicle by scanning codes, and the scheduling orders are gradually increased, so that the server can ensure that the order quantity does not exceed the capacity of the vehicle. When different carriers are possibly adopted for each task of operation and maintenance personnel, the operation and maintenance personnel can upload the carrier capacity to the server through the scheduling terminal before each task; when the operation and maintenance personnel have respective fixed carriers, the server can store the carrier capacity corresponding to the dispatching terminal. So that the server can acquire the capacity of the vehicle in real time.
S107, receiving a vehicle throwing request of the dispatching terminal to the sharing vehicle.
With continued reference to fig. 4, after the operation and maintenance personnel creates the scheduling order through the code scanning shared vehicle, the operation and maintenance personnel can select a "continue code scanning" button to select to continue creating the order, and can also select a "go to the vehicle" button to select to put the code scanning shared vehicle to a vehicle throwing point in the vehicle throwing task group. And when the 'go to the car' button is selected, the dispatching terminal displays the specific position of the car-throwing point in the car-throwing task group, so that the operation and maintenance personnel are guided to throw the shared car. Specifically, the server can display a plurality of vehicle-throwing points in the vehicle-throwing task group to the dispatching terminal for selection of operation and maintenance personnel, and guide the operation and maintenance personnel to throw the shared vehicle to the specific vehicle-throwing point according to the selection of the operation and maintenance personnel.
After the operation and maintenance personnel arrive at the vehicle-throwing point in the vehicle-throwing task group, a vehicle-throwing request can be initiated for the shared vehicle. Specifically, the operation and maintenance personnel can initiate a vehicle throwing request in a mode of sharing vehicles by sweeping codes. As previously described, the server creates a plurality of dispatch orders, each including a shared vehicle, at which point the service personnel may randomly pick up the shared vehicle and initiate a drop request.
S108, if the shared vehicle is at a vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is positive, completing the dispatching order for the shared vehicle and releasing the shared vehicle.
After receiving a vehicle-throwing request of a dispatching terminal for a shared vehicle, the server judges the specific position of the shared vehicle, and if the shared vehicle is not at a vehicle-throwing point in a vehicle-throwing task group, the dispatching order is not completed for the shared vehicle; if the shared vehicle is at the vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, the server completes the dispatching order for the shared vehicle. When the shared vehicle is not at the vehicle-throwing point in the vehicle-throwing task group, the server can remind the operation and maintenance personnel to throw the shared vehicle to the specific vehicle-throwing point.
The number of demands of the shared vehicles at the point of delivery varies with time due to the natural inflow and outflow of the shared vehicles and the varying adjustment of the prediction of vehicle demand. Therefore, the initial number of the vehicles to be thrown and the real-time number of the vehicles to be thrown are not necessarily the same, when the dispatching terminal initiates the vehicle throwing request, the server needs to judge whether the real-time number of the vehicles to be thrown at the point where the shared vehicle is positioned at the current moment is positive or not, and when the real-time number of the vehicles to be thrown is positive, the server completes the dispatching order for the shared vehicle.
Referring to fig. 5, when the shared vehicle is launched to the launch point in the launch task group, the scanned shared vehicle is displayed in the dispatch terminal, i.e., a dispatch order is completed. The dispatch terminal displays a list of information of the 5 sharing vehicles that have completed the dispatch order. As described above, the initial number of the vehicles to be thrown in the task 1 is 6 shared vehicles, and if the real-time number of the vehicles to be thrown in the task 1 is also 6 shared vehicles before the operation and maintenance personnel start to throw in the vehicle, then 5 shared vehicles are thrown in the task 1 because 5 scheduling orders have been completed.
At this time, if the operation and maintenance personnel still have the scheduling order, the 'continue code scanning' button can be selected, and the shared vehicle is continuously launched to complete the scheduling order. If the operation and maintenance personnel do not schedule the order, a 'finish car-throwing' button can be selected to finish the task of the car-throwing task group.
S109, when all the scheduling orders are completed, the vehicle-throwing task set is ended.
And when all the dispatching orders are completed, namely all the sharing vehicles are put in the vehicle-throwing point, ending the vehicle-throwing task group. In this embodiment, each shared vehicle is a dispatch order, and when the dispatch order is completed, the shared vehicle is released and the user can use the shared vehicle. In the prior art, when a plurality of shared vehicles are used as a scheduling order, the operation and maintenance personnel release the shared vehicles only after all the shared vehicles in the scheduling order are put in, so that the scheduling method of the embodiment has remarkable progress, the timeliness of the user in using the vehicle is improved, and the user experience is improved.
In addition, in the embodiment, the vehicle-throwing task is determined according to the vehicle-throwing point, the vehicle-throwing task group is determined according to the vehicle-throwing task, the dispatching order is not forcibly associated with the vehicle-throwing task and the vehicle-throwing task group, and the operation and maintenance personnel do not need to care that a specific shared vehicle needs to be thrown to the specific vehicle-throwing point in the dispatching process, so that the dispatching efficiency of the operation and maintenance personnel can be improved. The vehicle-throwing task groups are associated with vehicle-throwing points, the vehicle-throwing points are not associated with vehicle-pulling points, operation and maintenance personnel freely select the vehicle-pulling points and throw the shared vehicles to the vehicle-throwing points, the vehicle-pulling points are not limited under the condition that the number of the shared vehicles of the selected vehicle-throwing points can be preferentially met, and the dispatching efficiency of the operation and maintenance personnel is further improved.
In addition, the number of the vehicles to be shared can be more accurately met through the real-time vehicle pulling number and the real-time vehicle throwing number, and the problem that the number of the vehicles to be shared is too large or too small, which is possibly caused by the vehicle pulling points and the vehicle throwing points, in the prior art is solved.
In this embodiment, after the operation and maintenance personnel select the vehicle-throwing task to create the vehicle-throwing task group, the vehicle-throwing task is not limited, and if other operation and maintenance personnel select the same vehicle-throwing task to create the vehicle-throwing task group, the problem of repeatedly throwing the shared vehicle at the vehicle-throwing point is caused, so that the overall dispatching efficiency is reduced. Therefore, in other modifications, the mission of the mission group may be restricted. Specifically, after the server creates the vehicle-throwing task group, the vehicle-throwing tasks in the vehicle-throwing task group are not displayed to other dispatching terminals. That is, after the server creates the task group for vehicle delivery, the corresponding operation and maintenance personnel occupy the task for vehicle delivery, that is, the corresponding vehicle delivery point, and other operation and maintenance personnel are not allowed to select the same task for vehicle delivery to create the task group for vehicle delivery, so that the problem of repeatedly delivering the shared vehicle at the vehicle delivery point is avoided.
As described above, the operation and maintenance personnel can select a vehicle-throwing task through the dispatching terminal, can select one vehicle-throwing task, and can also select a plurality of vehicle-throwing tasks as a vehicle-throwing task group. That is, the number of the mission tasks in the mission task group is not limited. According to the technical scheme, the number of the vehicle-throwing tasks in the vehicle-throwing task group can be limited, so that the dispatching efficiency is further improved.
In one of the modifications, the initial total vehicle-throwing amount of the vehicle-throwing task group is not greater than the capacity of the carrier, wherein the initial total vehicle-throwing amount is the sum of the initial vehicle-throwing amounts of all the vehicle-throwing tasks in the vehicle-throwing task group, so as to limit the number of the vehicle-throwing tasks in the vehicle-throwing task group. For example, the vehicle has a capacity of 12 vehicles, and the mission 1 shown in fig. 2 includes 6 shared vehicles, and the mission 3 includes 4 shared vehicles. When the operation and maintenance personnel select the vehicle-throwing task 1 and the vehicle-throwing task 3, the initial total vehicle-throwing quantity of the vehicle-throwing task group at the moment is 10. At this time, the operation and maintenance personnel will cause the initial total vehicle throwing amount to exceed the capacity of the vehicle no matter selecting the vehicle throwing task 2, the vehicle throwing task 4, the vehicle throwing task 5 or the vehicle throwing task 6. Therefore, after selecting the task 1 and the task 3, the operation and maintenance personnel cannot select any other task, and the task group includes the task 1 and the task 3.
That is, the operation and maintenance personnel occupy the vehicle-throwing task 1 and the vehicle-throwing task 3, the vehicle-throwing task 2, the vehicle-throwing task 4, the vehicle-throwing task 5 or the vehicle-throwing task 6 is not occupied, and other operation and maintenance personnel can select and create a vehicle-throwing task group. Therefore, the vehicle-throwing tasks can be reasonably distributed, and the scheduling efficiency is improved. Meanwhile, the capacities of the vehicle-throwing task groups and the carriers are matched, the larger the carrier capacity of operation and maintenance personnel is, the more shared vehicles can be scheduled at one time, the more the initial total vehicle-throwing amount of the vehicle-throwing task groups is, and the more the vehicle-throwing tasks can be included.
In another variation thereof, the server may create the task group as follows: the server sequentially receives the vehicle-throwing tasks, and when the sum of the vehicle-throwing numbers of all the vehicle-throwing tasks is just larger than the capacity of the carrier, a vehicle-throwing task group is created. For example, the vehicle has a capacity of 12 vehicles, and the mission 1 shown in fig. 2 includes 6 shared vehicles, the mission 3 includes 4 shared vehicles, and the mission 6 includes 5 shared vehicles. When the operation and maintenance personnel select the vehicle-throwing task 1 and the vehicle-throwing task 3 in sequence, the sum of the vehicle-throwing quantity at the moment is 10 (smaller than the carrier capacity of 12), and when the operation and maintenance personnel select the vehicle-throwing task 6, the sum of the vehicle-throwing quantity at the moment is 16 (larger than the carrier capacity of 12), at the moment, the server creates a vehicle-throwing task group, the vehicle-throwing task group comprises the vehicle-throwing task 1, the vehicle-throwing task 3 and the vehicle-throwing task 6, and the operation and maintenance personnel can not select other vehicle-throwing tasks any more.
That is, the operation and maintenance personnel occupy the vehicle-throwing task 1, the vehicle-throwing task 3 and the vehicle-throwing task 6, the vehicle-throwing task 2, the vehicle-throwing task 4 and the vehicle-throwing task 5 are not occupied, and other operation and maintenance personnel can select and create a vehicle-throwing task group. Therefore, the vehicle-throwing tasks can be reasonably distributed, and the scheduling efficiency is improved. Meanwhile, the capacities of the vehicle-throwing task groups and the carriers are matched, the larger the carrier capacity of operation and maintenance personnel is, the more shared vehicles can be scheduled at one time, the more the initial total vehicle-throwing amount of the vehicle-throwing task groups is, and the more the vehicle-throwing tasks can be included.
As described above, after the server creates the task group for picking up vehicles, the server presents a plurality of pull points to the dispatch terminal to guide the operation and maintenance personnel to get the shared vehicles from the pull points.
In another variation thereof, the server may also create the task group as follows: the server sequentially receives the vehicle-throwing tasks, and when the sum of the vehicle-throwing numbers of all the vehicle-throwing tasks is exactly equal to the capacity of the carrier, a vehicle-throwing task group is created. For example, the vehicle has a capacity of 12 vehicles, and the mission 1 shown in fig. 2 includes 6 shared vehicles, the mission 3 includes 4 shared vehicles, and the mission 6 includes 5 shared vehicles. When the operation and maintenance personnel select the vehicle-throwing task 1, the vehicle-throwing task 3 and the vehicle-throwing task 6 in sequence, the sum of the vehicle-throwing quantity of the vehicle-throwing task 1 and the vehicle-throwing task 3 is 10 (less than 12 vehicles), and when the operation and maintenance personnel select the vehicle-throwing task 6, only 2 shared vehicles in the vehicle-throwing task 6 are occupied. The sum of the number of the vehicles is 12, at this time, the server creates a vehicle-throwing task group, and the vehicle-throwing task group comprises a part (2 shared vehicles) of the vehicle-throwing tasks 1, 3 and 6, so that the operation and maintenance personnel can not select other vehicle-throwing tasks.
That is, the operation and maintenance personnel occupy one part of the vehicle-throwing task 1, the vehicle-throwing task 3 and the vehicle-throwing task 6, the other part of the vehicle-throwing task 2, the vehicle-throwing task 4, the vehicle-throwing task 5 and the vehicle-throwing task 6 is not occupied, and other operation and maintenance personnel can select and create a vehicle-throwing task group. Therefore, the vehicle-throwing tasks can be reasonably distributed, and the scheduling efficiency is improved. Meanwhile, the capacities of the vehicle-throwing task groups and the carriers are matched, the larger the carrier capacity of operation and maintenance personnel is, the more shared vehicles can be scheduled at one time, the more the initial total vehicle-throwing amount of the vehicle-throwing task groups is, and the more the vehicle-throwing tasks can be included.
In one variation, the server may present a plurality of pull tasks to the dispatch terminal, where the pull tasks include pull points (specifically referred to herein as drop point locations) and corresponding initial pull numbers. The initial number of pull cars and the real-time number of pull cars are not necessarily the same because the natural inflow and outflow of the shared vehicles and the predicted change in demand of the vehicles are adjusted, and the margin of the shared vehicles at the pull points is changed with time. Through showing the pull car task, can make fortune dimension personnel know the rich remainder of the sharing vehicle of pull car point to can select suitable pull car point according to the total volume of throwing car task set, further promote fortune dimension personnel's dispatch efficiency.
Further, after displaying the plurality of pulling tasks to the dispatching terminal, the server may further require the operation and maintenance personnel to select at least one pulling task required, and the server further receives the at least one pulling task selected by the dispatching terminal as a pulling task group, where the pulling tasks in the pulling task group are not displayed to other dispatching terminals. That is, after the server creates the pull task group, the corresponding operation and maintenance personnel occupy the pull task, that is, the corresponding pull point, and other operation and maintenance personnel are not allowed to select the same pull task to create the pull task group, so that the problem of repeatedly acquiring the shared vehicle at the pull point is avoided.
At this time, when the operation and maintenance personnel arrive at the pull-up point, after a scheduling request is initiated for the shared vehicle at the pull-up point, the server will judge the specific position of the shared vehicle, and if the shared vehicle is not at the pull-up point in the pull-up task group, a scheduling order is not created for the shared vehicle; if the pull points of the shared vehicles in the pull task group and the real-time pull number of the pull points is a positive value, the server creates a scheduling order for the shared vehicles.
In another variation, when the server receives the vehicle-throwing task selected by the dispatching terminal and creates the vehicle-throwing task group, the server also displays all the vehicle-throwing tasks in the vehicle-throwing task group to the dispatching terminal. As shown in fig. 3, a vehicle-throwing task 1 and a vehicle-throwing task 3 in a vehicle-throwing task group are displayed in a page of a dispatching terminal, and on one hand, an operator can intuitively feel the distance between the vehicle-throwing task and the vehicle-throwing task by displaying the vehicle-throwing task and the vehicle-throwing task, so that which vehicle-throwing point is used for acquiring a shared vehicle is determined; on the other hand, the operation and maintenance personnel can pay attention to the number of the shared vehicles required by the vehicle throwing task in real time, and the operation and maintenance personnel are guided to acquire the corresponding number of the shared vehicles from the vehicle pulling point.
As described above, the mission group is ended when all the dispatch orders are completed, that is, all the shared vehicles are launched at the launch point.
In one of the modifications, if the real-time vehicle-throwing quantity of all the vehicle-throwing points in the vehicle-throwing task group is zero and all the dispatching orders are not completed, the vehicle-throwing task group is ended and new vehicle-throwing points are recommended to the dispatching terminal, so that the dispatching terminal can select the new vehicle-throwing points and complete the rest dispatching orders. For example: when the user selects the vehicle-throwing task 1 and the vehicle-throwing task 3 as the vehicle-throwing task group through the dispatching terminal, the initial total vehicle-throwing quantity of the vehicle-throwing task group is 10 shared vehicles. If the server has a carrier capacity of 12, the server can create up to 12 dispatch orders (i.e., 12 shared vehicles). If the total vehicle throwing amount is 10, when the 10 dispatching orders are completed, the real-time vehicle throwing amount of all vehicle throwing points in the vehicle throwing task group is zero, and 2 dispatching orders are left unfinished, and at the moment, the server finishes the vehicle throwing task group. And, the server also recommends a new vehicle-throwing point to the dispatching terminal, wherein the new vehicle-throwing point is a vehicle-throwing point which is not included in the vehicle-throwing task group, so as to finish the rest 2 dispatching orders.
Therefore, the scheduling flexibility is further improved, and the scheduling efficiency is improved.
In another variation, the server also sets the pull duration and the drop duration after creating the drop task group. Wherein the pull duration refers to a duration after the creation of the task set for delivery, and the delivery duration refers to a duration after the creation of the first scheduled order. If at least one scheduling order is not created in the pull time, canceling the vehicle-throwing task group, and releasing the vehicle-throwing task in the vehicle-throwing task group to other scheduling terminals. And if at least one scheduling order is not completed within the time length of the vehicle, canceling the vehicle-throwing task group, and releasing the vehicle-throwing task in the vehicle-throwing task group to other scheduling terminals.
By setting the vehicle pulling time length, operation and maintenance personnel can be supervised and urged to catch up the vehicle pulling point as soon as possible to obtain the shared vehicle after the vehicle pulling task is selected to create the vehicle pulling task group, and the problem that other operation and maintenance personnel cannot make a bill for the vehicle pulling task contained in the vehicle pulling task group because the operation and maintenance personnel occupy the vehicle pulling task group for too long is avoided. By setting the time length of the vehicle throwing, operation and maintenance personnel can be supervised and urged to finish the first scheduling order as soon as possible after the first scheduling order is created, and the situation that other operation and maintenance personnel cannot order the vehicle throwing tasks contained in the vehicle throwing task group because the operation and maintenance personnel occupy the vehicle throwing task group for too long can also be prevented.
Referring to fig. 6, the present embodiment further provides a server for sharing a vehicle, including: the sending unit is used for displaying a plurality of vehicle-throwing tasks to the dispatching terminal so that the dispatching terminal can select at least one vehicle-throwing task as a vehicle-throwing task group; the vehicle-throwing task comprises a vehicle-throwing point and a corresponding initial vehicle-throwing quantity; the receiving unit is used for receiving the vehicle-throwing task selected by the scheduling terminal and creating the vehicle-throwing task group; the sending unit is further used for displaying a plurality of trolley points to the dispatching terminal;
the receiving unit is also used for receiving a pull request of the dispatching terminal for the shared vehicle; the processing unit is used for creating a scheduling order for the shared vehicle if the shared vehicle is at the pull point and the real-time pull number of the pull point is a positive value; the comparison unit is used for comparing the carrier capacity of the dispatching terminal with the order quantity of the dispatching order, and the order quantity is not allowed to exceed the carrier capacity; the receiving unit is also used for receiving a vehicle throwing request of the dispatching terminal for the shared vehicle; if the shared vehicle is at the vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, the processing unit is further used for completing the dispatching order for the shared vehicle and releasing the shared vehicle; and when all the scheduling orders are completed, the processing unit is further used for ending the vehicle-throwing task group.
Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be made by one skilled in the art without departing from the spirit and scope of the invention, and the scope of the invention should be assessed accordingly to that of the appended claims.
Claims (10)
1. A method of scheduling a shared vehicle, comprising:
displaying a plurality of vehicle-throwing tasks to a dispatching terminal so that the dispatching terminal can select at least one vehicle-throwing task as a vehicle-throwing task group; the vehicle-throwing task comprises a vehicle-throwing point and a corresponding initial vehicle-throwing quantity;
receiving the vehicle-throwing task selected by the dispatching terminal, and creating the vehicle-throwing task group;
displaying a plurality of trolley points to the dispatching terminal;
receiving a scheduling request of the scheduling terminal for the shared vehicle;
if the shared vehicles are at the pull points and the real-time pull quantity of the pull points is a positive value, creating a scheduling order for the shared vehicles, wherein each shared vehicle is one scheduling order;
comparing the carrier capacity of the dispatching terminal with the order quantity of the dispatching order, wherein the order quantity is not allowed to exceed the carrier capacity;
receiving a vehicle throwing request of the dispatching terminal for the shared vehicle;
if the shared vehicle is at the vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, completing the dispatching order for the shared vehicle, and releasing the shared vehicle;
ending the vehicle-throwing task group when all the scheduling orders are completed;
when the parking point lacks a shared vehicle and needs to be called from the outside, the parking point at the moment is the vehicle throwing point; when the surplus shared vehicle of the parking spot needs to be called out to the outside, the parking spot at the moment is the vehicle pulling spot; the vehicle-throwing task refers to the number of shared vehicles which are lack of a specific parking spot at the current moment; the real-time pulling number is the number of the spare shared vehicles at the pulling points.
2. The scheduling method of claim 1, wherein the receiving the task for delivery selected by the scheduling terminal, creating the task group for delivery comprises: and sequentially receiving at least one vehicle-throwing task, and creating a vehicle-throwing task group when the sum of the vehicle-throwing numbers of all the vehicle-throwing tasks is just larger than the capacity of the carrier.
3. The scheduling method of claim 1, wherein an initial total projected volume of the projected task group is not greater than the vehicle capacity, the initial total projected volume being a sum of the initial projected volumes of all of the projected tasks in the projected task group.
4. The scheduling method of claim 1, wherein if the real-time number of the vehicle-throwing points in the vehicle-throwing task group is zero and all the scheduling orders are not completed, ending the vehicle-throwing task group and recommending new vehicle-throwing points to the scheduling terminal so that the scheduling terminal can select the new vehicle-throwing points and complete the remaining scheduling orders.
5. The scheduling method of claim 1, wherein the presenting the plurality of pull points to the scheduling terminal comprises: and displaying a plurality of trolley tasks to the dispatching terminal, wherein the trolley tasks comprise the trolley points and the corresponding initial trolley numbers.
6. The scheduling method of claim 1, wherein when the plurality of pull points are presented to the scheduling terminal, the scheduling method further comprises: and displaying all the vehicle-throwing tasks in the vehicle-throwing task group to the dispatching terminal.
7. The scheduling method of claim 5, wherein after the presenting the plurality of pull tasks to the scheduling terminal, the scheduling method further comprises:
receiving at least one pulling task selected by the dispatching terminal as a pulling task group, wherein the pulling tasks in the pulling task group are not displayed to other dispatching terminals;
receiving a scheduling request of the scheduling terminal for the shared vehicle;
and if the shared vehicle is at the pull point in the pull task group and the real-time pull number of the pull point is a positive value, creating the scheduling order for the shared vehicle.
8. The scheduling method of claim 1, wherein after the set of taxi tasks is created, the taxi tasks in the set of taxi tasks are no longer presented to other scheduling terminals.
9. The scheduling method of claim 8, wherein after creating the set of mission tasks, the scheduling method further comprises: setting a pulling time and a throwing time;
if at least one scheduling order is not created within the pull time, canceling the vehicle-throwing task group, and releasing the vehicle-throwing task in the vehicle-throwing task group to other scheduling terminals;
if at least one scheduling order is not completed within the time length of the vehicle, canceling the vehicle-throwing task group, and releasing the vehicle-throwing task in the vehicle-throwing task group to other scheduling terminals;
the pull duration refers to a duration after the set of mission tasks is created;
the time length of the drop refers to the duration after the first of the dispatch orders is created.
10. A server for sharing a vehicle, comprising:
the sending unit is used for displaying a plurality of vehicle-throwing tasks to the dispatching terminal so that the dispatching terminal can select at least one vehicle-throwing task as a vehicle-throwing task group; the vehicle-throwing task comprises a vehicle-throwing point and a corresponding initial vehicle-throwing quantity;
the receiving unit is used for receiving the vehicle-throwing task selected by the scheduling terminal and creating the vehicle-throwing task group;
the sending unit is further used for displaying a plurality of trolley points to the dispatching terminal;
the receiving unit is also used for receiving a dispatching request of the dispatching terminal to the shared vehicle;
the processing unit is used for creating a scheduling order for the shared vehicles if the shared vehicles are at the pull points and the real-time pull quantity of the pull points is a positive value, wherein each shared vehicle is one scheduling order;
the comparison unit is used for comparing the carrier capacity of the dispatching terminal with the order quantity of the dispatching order, and the order quantity is not allowed to exceed the carrier capacity;
the receiving unit is also used for receiving a vehicle throwing request of the dispatching terminal for the shared vehicle;
if the shared vehicle is at the vehicle-throwing point in the vehicle-throwing task group and the real-time vehicle-throwing quantity of the vehicle-throwing point is a positive value, the processing unit is further used for completing the dispatching order for the shared vehicle and releasing the shared vehicle;
when all the scheduling orders are completed, the processing unit is further used for ending the vehicle-throwing task set;
when the parking point lacks a shared vehicle and needs to be called from the outside, the parking point at the moment is the vehicle throwing point; when the surplus shared vehicle of the parking spot needs to be called out to the outside, the parking spot at the moment is the vehicle pulling spot; the vehicle-throwing task refers to the number of shared vehicles which are lack of a specific parking spot at the current moment; the real-time pulling number is the number of the spare shared vehicles at the pulling points.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311271693.3A CN116993138B (en) | 2023-09-28 | 2023-09-28 | Scheduling method and server for shared vehicles |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311271693.3A CN116993138B (en) | 2023-09-28 | 2023-09-28 | Scheduling method and server for shared vehicles |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116993138A CN116993138A (en) | 2023-11-03 |
| CN116993138B true CN116993138B (en) | 2024-02-20 |
Family
ID=88528844
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311271693.3A Active CN116993138B (en) | 2023-09-28 | 2023-09-28 | Scheduling method and server for shared vehicles |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116993138B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107578163A (en) * | 2017-08-30 | 2018-01-12 | 顾泰来 | A kind of shared vehicle dispatching method, device and server |
| CN109360413A (en) * | 2018-12-11 | 2019-02-19 | 北京首汽智行科技有限公司 | A kind of vehicle dispatching method and system |
| CN110858073A (en) * | 2018-08-06 | 2020-03-03 | 北京京东尚科信息技术有限公司 | Dispatching method and dispatching device for automatic guided transport vehicle |
| CN111080116A (en) * | 2019-12-11 | 2020-04-28 | 东南大学 | Cooperative scheduling method for shared bicycle and public bicycle |
| CN111539629A (en) * | 2020-04-23 | 2020-08-14 | 北京首汽智行科技有限公司 | Route generation method based on shared vehicle |
| CN111564053A (en) * | 2020-04-24 | 2020-08-21 | 上海钧正网络科技有限公司 | Vehicle scheduling method and device, vehicle scheduling equipment and storage medium |
| EP3751481A1 (en) * | 2019-05-13 | 2020-12-16 | Siemens Mobility GmbH | Method for redistributing bicycles of a bicycle rental system |
| CN113408942A (en) * | 2021-07-12 | 2021-09-17 | 东南大学 | Shared bicycle dynamic redeployment method giving consideration to real-time determination and future uncertain information |
| JP2021157208A (en) * | 2020-03-25 | 2021-10-07 | 株式会社Ｊｖｃケンウッド | Vehicle allocation management control device, vehicle allocation management method, and program |
| CN113610321A (en) * | 2021-08-23 | 2021-11-05 | 宁波小遛共享信息科技有限公司 | Shared vehicle scheduling method and device for parking points and computer equipment |
| CN114595953A (en) * | 2022-03-01 | 2022-06-07 | 杭州骑迹科技有限公司 | Method and system for dispatching shared electric bicycle |
| CN115759661A (en) * | 2022-11-24 | 2023-03-07 | 中铁二院工程集团有限责任公司 | Vehicle scheduling method, device and system based on PRT |
| CN116579575A (en) * | 2023-05-24 | 2023-08-11 | 同济大学 | Dynamic scheduling decision method for space-time efficient matching and sharing of supply and demand electric motorcades |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004094913A (en) * | 2002-07-08 | 2004-03-25 | Honda Motor Co Ltd | Shared vehicle dispatch instruction device and vehicle reservation controller |
-
2023
- 2023-09-28 CN CN202311271693.3A patent/CN116993138B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107578163A (en) * | 2017-08-30 | 2018-01-12 | 顾泰来 | A kind of shared vehicle dispatching method, device and server |
| CN110858073A (en) * | 2018-08-06 | 2020-03-03 | 北京京东尚科信息技术有限公司 | Dispatching method and dispatching device for automatic guided transport vehicle |
| CN109360413A (en) * | 2018-12-11 | 2019-02-19 | 北京首汽智行科技有限公司 | A kind of vehicle dispatching method and system |
| EP3751481A1 (en) * | 2019-05-13 | 2020-12-16 | Siemens Mobility GmbH | Method for redistributing bicycles of a bicycle rental system |
| CN111080116A (en) * | 2019-12-11 | 2020-04-28 | 东南大学 | Cooperative scheduling method for shared bicycle and public bicycle |
| JP2021157208A (en) * | 2020-03-25 | 2021-10-07 | 株式会社Ｊｖｃケンウッド | Vehicle allocation management control device, vehicle allocation management method, and program |
| CN111539629A (en) * | 2020-04-23 | 2020-08-14 | 北京首汽智行科技有限公司 | Route generation method based on shared vehicle |
| CN111564053A (en) * | 2020-04-24 | 2020-08-21 | 上海钧正网络科技有限公司 | Vehicle scheduling method and device, vehicle scheduling equipment and storage medium |
| CN113408942A (en) * | 2021-07-12 | 2021-09-17 | 东南大学 | Shared bicycle dynamic redeployment method giving consideration to real-time determination and future uncertain information |
| CN113610321A (en) * | 2021-08-23 | 2021-11-05 | 宁波小遛共享信息科技有限公司 | Shared vehicle scheduling method and device for parking points and computer equipment |
| CN114595953A (en) * | 2022-03-01 | 2022-06-07 | 杭州骑迹科技有限公司 | Method and system for dispatching shared electric bicycle |
| CN115759661A (en) * | 2022-11-24 | 2023-03-07 | 中铁二院工程集团有限责任公司 | Vehicle scheduling method, device and system based on PRT |
| CN116579575A (en) * | 2023-05-24 | 2023-08-11 | 同济大学 | Dynamic scheduling decision method for space-time efficient matching and sharing of supply and demand electric motorcades |
Non-Patent Citations (1)
| Title |
|---|
| "Multi-objective optimal scheduling model for shared bikes based on spatiotemporal big data";Xiaoxia Wang等;《Journal of Cleaner Production》;第421卷;第1-13页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116993138A (en) | 2023-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11584237B2 (en) | Mobile internet-based integrated vehicle energy replenishment system and method, and storage medium | |
| CN114141047B (en) | Parking space management method, equipment and system | |
| CN109242285B (en) | Method, device and equipment for dispatching operation and maintenance work orders | |
| CN107059690B (en) | Parking space lock control method, device, server and system and parking space lock | |
| CN110111211A (en) | A kind of reserving method of charging pile, device, service terminal and storage medium | |
| CN104933891A (en) | Information processing method, client and service platform | |
| CN105812478B (en) | A kind of cell phone application communication system and load-balancing method and method of hiring a car | |
| CN105827718B (en) | A kind of client communication system and load-balancing method and method of hiring a car | |
| CN108764566A (en) | Goods delivery method, apparatus and computer readable storage medium | |
| CN107578163A (en) | A kind of shared vehicle dispatching method, device and server | |
| CN108334965A (en) | A kind of method and apparatus of parking position reservation | |
| CN106485936A (en) | Parking lot management control method and device | |
| CN108171351A (en) | A kind of shared lease platform and method based on Internet of Things | |
| CN108615120A (en) | A kind of intercity vehicle is lined up worksheet processing method and medium | |
| CN111695711A (en) | Reservation method and device | |
| CN116993138B (en) | Scheduling method and server for shared vehicles | |
| CN110378638A (en) | Delivery management method, apparatus, storage medium and electronic equipment | |
| CN109035451A (en) | Parking Fee calculation method, device and computer readable storage medium | |
| CN112884403A (en) | Article distribution method and device, electronic equipment and storage medium | |
| CN108694549A (en) | The rental method of service is sent in full-automatic logistics with charge free | |
| CN108491940A (en) | System and method is booked in parking stall timesharing | |
| CN111178558B (en) | Network appointment order processing method and device, computer equipment and readable storage medium | |
| CN111179629A (en) | Distributed parking lot parking space reservation management system | |
| CN116308058A (en) | Intelligent dispatching management system and method for digital storage of bulk raw materials | |
| CN109166342A (en) | Parking stall resource consolidation shared platform and method |
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 |