CN114202911A - Vehicle scheduling method and system - Google Patents

Vehicle scheduling method and system Download PDF

Info

Publication number
CN114202911A
CN114202911A CN202210148618.7A CN202210148618A CN114202911A CN 114202911 A CN114202911 A CN 114202911A CN 202210148618 A CN202210148618 A CN 202210148618A CN 114202911 A CN114202911 A CN 114202911A
Authority
CN
China
Prior art keywords
supplemented
station
vehicles
instruction
vehicle
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
Application number
CN202210148618.7A
Other languages
Chinese (zh)
Inventor
李潇
钟辉
王安琪
江磊
刘丁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Apoco Blue Technology Co ltd
Original Assignee
Beijing Apoco Blue Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Apoco Blue Technology Co ltd filed Critical Beijing Apoco Blue Technology Co ltd
Priority to CN202210148618.7A priority Critical patent/CN114202911A/en
Publication of CN114202911A publication Critical patent/CN114202911A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/20Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/20Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/202Dispatching vehicles on the basis of a location, e.g. taxi dispatching

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to the technical field of vehicle scheduling, in particular to a vehicle scheduling method and a vehicle scheduling system, wherein the vehicle scheduling method comprises the following steps: acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented; combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction; and dispatching the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete command, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete command. The invention combines the vehicle demands of a plurality of stations to be supplemented, and carries the corresponding vehicle quantity to the plurality of stations for supplementing at one time, thereby greatly improving the space utilization rate of the operation and maintenance carrier of the working personnel and further improving the scheduling efficiency of single vehicle scheduling.

Description

Vehicle scheduling method and system
Technical Field
The invention relates to the technical field of vehicle scheduling, in particular to a vehicle scheduling method and system.
Background
At present, riding through a shared electric bicycle becomes a emerging trip mode in a city, the short-distance trip requirement of urban crowds can be effectively met, and the bicycle is green and environment-friendly.
As the scale of users of the shared electric bicycle is getting larger and larger, the demand for vehicles increases explosively, and the demand for vehicles becomes more and more obvious along with the tidal effect formed by traffic peaks, season changes and the like, therefore, the release of the shared electric bicycle needs to be scheduled to ensure that the shared travel demand of the users is effectively met.
At present, the dispatching of the shared electric bicycle is mainly carried out by depending on a worker of a service provider of the shared electric bicycle. After the initial bicycle number of each vehicle release point is determined, along with the continuous riding and parking of a user, the bicycle number of each vehicle release point is dynamically changed at any moment, so that vehicle release points, which lack vehicles and cannot meet the requirements of the user, exist after the vehicles are ridden out, and operators need to prepare vehicles to call in aiming at the vehicle release points so as to meet the requirements of the vehicles on the vehicle release points.
At present, when vehicle scheduling is implemented, the number of single vehicles of each vehicle release point is generally obtained by depending on an operation system of the vehicle, but in some situations, the vehicle call-in demand of the vehicle release points is less, the number of vehicles to be scheduled is less, the vehicle carrier space of workers is often larger, and under the condition, the vehicle carrier space of the workers cannot be fully utilized, so that the problems of resource waste and low efficiency are caused.
Disclosure of Invention
The invention provides a vehicle dispatching method and system in order to solve the problem of low vehicle dispatching efficiency.
In order to solve the technical problems, the invention provides the following technical scheme: a vehicle scheduling method comprising the steps of:
acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented;
combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction;
and dispatching the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete command, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete command.
Preferably, the to-be-supplemented station list information further includes a to-be-supplemented station list and location information corresponding to stations in the to-be-supplemented station list.
Preferably, the specific steps of obtaining the list information of the stations to be replenished and the number of vehicles to be replenished at each station to be replenished are as follows:
presetting information of the minimum number of vehicles in a station and the maximum number of vehicles capable of being accommodated in the station;
acquiring real-time vehicle quantity information of a station, judging whether the real-time vehicle quantity information of the station is lower than the lowest vehicle quantity of a preset station, and if so, adding the station into a list of stations to be replenished;
and calculating the number of the vehicles to be supplemented at the station based on the real-time vehicle number information of the station and the maximum vehicle number information which can be accommodated at the station.
Preferably, the specific step of combining the number of the vehicles to be supplemented at the plurality of stations to be supplemented into a complete command is as follows:
presetting an initial instruction, and adding stations to be supplemented one by one into the initial instruction;
and judging whether the number of the vehicles to be supplemented in the initial instruction is greater than the preset number of the dispatched vehicles, if so, taking the initial instruction out of the station to be supplemented which is added with the initial instruction at the last time and returning the initial instruction to the list information of the station to be supplemented to obtain a complete instruction.
Preferably, the specific steps of adding the stations to be replenished into the initial instruction one by one are as follows:
firstly, selecting any station to be replenished in a station list to be replenished and adding an initial instruction;
calculating the distance between each station to be supplemented which is remained in the station list to be supplemented and the last station to be supplemented which is added with the initial instruction;
and selecting the station to be supplemented with the initial instruction with the shortest distance to the last station to be supplemented with the initial instruction.
Preferably, the step of presetting the initial instruction and obtaining the complete instruction is repeated until no station to be supplemented exists in the station list to be supplemented, and at least one complete instruction is obtained.
Preferably, when the number of the vehicles to be supplemented in the initial instruction is judged to be smaller than the preset number of the dispatching vehicles, and at the moment, no station to be supplemented exists in the station list to be supplemented, a complete instruction is obtained.
Preferably, the method further comprises the following steps after the complete instruction is obtained:
acquiring the position information of a worker and the position information of a vehicle;
based on the position information of the first station to be supplemented, the position information of the staff and the position information of the vehicles, which are added with the complete command, the time for the staff to schedule the corresponding number of the vehicles to reach the first station to be supplemented is estimated;
and sending the corresponding complete instruction to the staff in the preset time range, and scheduling the corresponding number of vehicles by the staff according to the number of the vehicles to be supplemented in the complete instruction.
Preferably, when the staff supplies the vehicles to the station to be supplied in the complete instruction, the vehicles are sequentially supplied according to the sequence of adding the complete instruction to the station to be supplied.
In order to solve the above technical problems, the present invention provides another technical solution as follows: a vehicle dispatch system comprising the following modules:
an information acquisition module: acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented;
the instruction processing module: combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction;
an instruction receiving module: and enabling the staff to receive the corresponding complete instruction, scheduling the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete instruction, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete instruction.
Compared with the prior art, the vehicle dispatching method and the vehicle dispatching system provided by the invention have the following beneficial effects:
1. the vehicle dispatching method comprises the steps of firstly obtaining a list of stations to be supplied and the number of vehicles to be supplied of each station to be supplied, thereby determining which stations need to be supplied and how many vehicles need to be dispatched, then combining a plurality of stations to be supplied to generate a complete instruction, wherein the complete instruction comprises a plurality of stations needing to be supplied with vehicles, and the number of the vehicles required by each station can be known through the complete instruction, and a worker can dispatch the vehicle supply requirements of the stations at one time after receiving the complete instruction, and respectively carry out vehicle supply corresponding to the requirements of the stations to be supplied.
2. The invention can enable corresponding vehicle dispatching staff to know the position of the station to be supplemented through the position information of the station to be supplemented, and is convenient to find the shortest route for dispatching the vehicle to each station to be supplemented in advance, thereby improving the efficiency of vehicle dispatching.
3. According to the invention, the minimum vehicle quantity information of the station is preset, and whether the station needs to be supplemented with the vehicles can be directly judged after the real-time vehicle quantity information of the station is obtained, and then the vehicle quantity needing to be supplemented can be calculated through the maximum vehicle quantity information which can be accommodated by the station.
4. According to the invention, whether the number of the vehicles to be supplemented in the initial instruction is greater than the preset number of the scheduled vehicles is judged, so that the carrying equipment of a worker can only carry a certain number of vehicles, if the number of the vehicles to be supplemented in the initial instruction is greater than the preset number of the scheduled vehicles, the worker cannot finish the scheduled number in the complete instruction at one time, and the number of the vehicles to be supplemented in some stations is very small, and a plurality of stations to be supplemented are combined into one complete instruction, so that the space of the carrying equipment is fully utilized, and the vehicle scheduling efficiency is improved.
5. According to the invention, the initial instruction is added from the second to the initial instruction, the distance between the station to be supplemented and the station to be supplemented to which the initial instruction is added is the shortest, and when a worker dispatches a vehicle, the station which arrives each time is the station closest to the station, so that the distance of the worker can be shortened, the time can be saved, and the efficiency of dispatching the vehicle by the worker can be improved.
6. According to the invention, at least one complete instruction is obtained by repeating the steps of presetting the initial instruction and obtaining the complete instruction until no station to be supplemented exists in the station list to be supplemented, so that the stations to be supplemented are multiple in the normal condition, sometimes all stations to be supplemented cannot be supplemented by generating one complete instruction, and multiple complete instructions are usually required to be generated so as to achieve the purpose of supplementing all stations to be supplemented.
7. According to the invention, as the station to be supplemented does not exist in the station list to be supplemented, namely the station to be supplemented cannot be added into the initial instruction, a complete instruction is directly generated at the moment, so that each station to be supplemented in the station list to be supplemented is distributed into the corresponding complete instruction, and the vehicle can be conveniently supplemented to all stations to be supplemented by corresponding staff.
8. According to the invention, the time for the staff to schedule the corresponding vehicles to reach the first station to be supplemented is estimated, so that the staff capable of quickly scheduling the corresponding vehicles and supplementing the stations is found, and the vehicle scheduling efficiency is improved.
9. In the invention, the working personnel sequentially supply the vehicles according to the sequence of adding the complete instruction into the stations to be supplied, and the distance between the stations to be supplied, which are added with the complete instruction from the second station to be supplied, and the station to be supplied, which is added with the complete instruction, is the shortest, so that the distance for the working personnel to supply the vehicles according to the sequence is the shortest, the time is the shortest, and the efficiency of vehicle dispatching is greatly improved. .
10. The embodiment of the invention also provides a vehicle dispatching system, which has the same beneficial effects as the vehicle dispatching method and is not repeated herein.
[ description of the drawings ]
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a flowchart illustrating steps of a vehicle dispatching method according to a first embodiment of the present invention.
Fig. 2 is a flowchart illustrating a specific step of step S1 of the vehicle dispatching method according to the first embodiment of the present invention.
Fig. 3 is a flowchart illustrating a specific step of step S2 of the vehicle dispatching method according to the first embodiment of the present invention.
Fig. 4 is a flowchart illustrating a specific step of step S21 of the vehicle dispatching method according to the first embodiment of the present invention.
Fig. 5 is a flowchart illustrating specific steps after step S2 of the vehicle dispatching method according to the first embodiment of the present invention.
Fig. 6 is a block diagram of a vehicle dispatching system provided by a second embodiment of the invention.
The attached drawings indicate the following:
1. a vehicle dispatch system;
10. an information acquisition module; 20. an instruction processing module; 30. and an instruction receiving module.
[ detailed description ] embodiments
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, a first embodiment of the present invention provides a vehicle dispatching method, including the following steps:
s1: acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented;
s2: combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction;
s3: and dispatching the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete command, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete command.
The station number list to be supplied and the number of vehicles to be supplied of each station to be supplied are obtained firstly, so that the number of vehicles to be supplied at which stations need to be supplied and need to be dispatched is determined, then a plurality of stations to be supplied are combined to generate a complete instruction, the complete instruction comprises a plurality of stations which need to be added with vehicle supply, the number of the vehicles required at each station can be known through the complete instruction, the workers can dispatch the vehicle supply demands of the stations at one time after receiving the complete instruction, and the vehicles are respectively replenished corresponding to the demands of each station to be supplied, by the mode, the number of the vehicles which can be carried at one time can be replenished for the stations, the space utilization rate of operation and maintenance carriers of the workers is greatly improved, and the dispatching efficiency of single vehicle dispatching is improved.
The "vehicle" is a transportation device to which a user obtains a use right in a time-sharing rental mode, a local rental mode, or the like, and may be a two-wheeled or three-wheeled bicycle, a moped, an electric vehicle, or a motor vehicle with four or more wheels.
The station is a geographical area or a building where the vehicles are parked, each station should be a station where the number of vehicles needs to be supplemented, and each station should include a unique station identifier for distinguishing the stations, which may be a unique number, a unique name number, a unique identifier of the station, and the like.
The complete command is a command or information including information of stations to be supplemented and the number of vehicles to be supplemented at each station, and is used for sending the command or information to corresponding staff so that the staff can schedule the vehicles according to the information in the complete command. The corresponding staff refers to a person who performs vehicle scheduling, and may be a management, operation or maintenance person of an operator who provides vehicle use services. Dispatching refers to dispatching a vehicle from a certain starting place to a certain destination through related staff, so that the dispatched vehicle can provide service at the corresponding destination.
Further, the list information of the stations to be supplemented also includes a list of the stations to be supplemented and position information corresponding to the stations in the list of the stations to be supplemented.
The station list to be supplemented comprises the names and the number of the stations to be supplemented, so that the stations which need to be supplemented can be more clearly known.
It can be understood that, in this way, the corresponding vehicle dispatching staff can know the positions of the stations to be supplemented, and can conveniently find the shortest route for dispatching the vehicle to each station to be supplemented in advance, so as to improve the efficiency of vehicle dispatching.
Further, with reference to fig. 2, the step S1 includes the following steps:
s11: presetting information of the minimum number of vehicles in a station and the maximum number of vehicles capable of being accommodated in the station;
s12: acquiring real-time vehicle quantity information of a station, judging whether the real-time vehicle quantity information of the station is lower than the lowest vehicle quantity of a preset station, and if so, adding the station into a list of stations to be replenished;
s13: and calculating the number of the vehicles to be supplemented at the station based on the real-time vehicle number information of the station and the maximum vehicle number information which can be accommodated at the station.
The station number information can be obtained by presetting the lowest vehicle number information of the station, whether the station needs to be supplemented with the vehicle can be directly judged after the real-time vehicle number information of the station is obtained, and the number of the vehicles needing to be supplemented can be calculated by the maximum vehicle number information which can be accommodated with the station.
The preset minimum station quantity information and the station containable maximum vehicle quantity information are different in preset value according to different stations.
Further, referring to fig. 3, the specific step of step S2 is:
s21: presetting an initial instruction, and adding stations to be supplemented one by one into the initial instruction;
s22: and judging whether the number of the vehicles to be supplemented in the initial instruction is larger than the preset number of the dispatched vehicles, if so, taking the initial instruction out of the station to be supplemented which is added with the initial instruction at the last time and returning the initial instruction to a list of the station to be supplemented to obtain a complete instruction.
The "preset scheduled vehicle number" in step S22 corresponds to the number of vehicles that can be carried by the carrying device of the staff scheduled vehicle at one time, and the preset scheduled vehicle number is different according to the carrying device.
The number of vehicles to be supplied in the initial instruction is larger than the number of preset dispatching vehicles, so that the number of the vehicles to be supplied in the initial instruction cannot be completed by the staff at one time, the number of the vehicles to be supplied in some stations is small, and the stations to be supplied are combined into one complete instruction, so that the space of the carrying equipment is fully utilized, and the efficiency of vehicle dispatching is improved.
It can be understood that, if the number of the vehicles to be supplemented in the initial instruction is judged to be less than the preset number of the scheduled vehicles, the stations to be supplemented are added into the initial instruction until the number of the vehicles to be supplemented in the initial instruction is judged to be greater than the preset number of the scheduled vehicles, at this moment, the stations to be supplemented are stopped being added into the initial instruction, and the stations to be supplemented which are added into the initial instruction at the last time are taken out of the initial instruction and returned to the station list to be supplemented to obtain a complete instruction.
And if the number of the vehicles to be supplemented in the initial instruction is equal to the preset number of the scheduled vehicles, stopping adding the stations to be supplemented in the initial instruction to directly generate a complete instruction.
Further, referring to fig. 4, the specific step of step S21 is:
s211: firstly, selecting any station to be replenished in a station list to be replenished and adding an initial instruction;
s212: calculating the distance between each station to be supplemented which is remained in the station list to be supplemented and the last station to be supplemented which is added with the initial instruction;
s213: and selecting the station to be supplemented with the initial instruction with the shortest distance to the last station to be supplemented with the initial instruction.
The distance in step S212 is calculated by the position information of the station in the station list to be supplemented, the distance is the distance of the shortest route between the station and the station, and is not a straight distance, and the route is suitable for the staff to schedule the vehicle of the vehicle to pass through.
It is understood that the step S212 is performed from the second station to be replenished added to the initial instruction, that is, the second station to be replenished added to the initial instruction is shortest from the first, the third station is shortest from the second, the fourth station is shortest from the third, and so on.
By the method, when the staff dispatches the vehicle, the station which arrives at each time is the station closest to the previous station, so that the distance of the staff can be shortened to save time, and the efficiency of dispatching the vehicle by the staff is improved.
Further, the step of presetting the initial instruction and obtaining the complete instruction is repeated until no station to be supplemented exists in the station list to be supplemented, and at least one complete instruction is obtained.
It can be understood that there are multiple stations to be replenished in general, and sometimes it is not possible to replenish all stations to be replenished by generating one complete instruction, and multiple complete instructions are usually required to be generated to achieve the purpose of replenishing all stations to be replenished.
It can be understood that the steps of obtaining a complete instruction first and then obtaining the complete instruction repeatedly are required, and a plurality of initial instructions are not generally preset at one time, so that the problem that the scheduling efficiency is influenced by adding the same station to be supplied to the plurality of initial instructions is avoided.
Further, when the number of the vehicles to be supplemented in the initial instruction is judged to be smaller than the preset number of the dispatching vehicles, and at the moment, no station to be supplemented is arranged in the station list to be supplemented, a complete instruction is obtained.
The station to be supplemented is not arranged in the station list to be supplemented, namely the station to be supplemented cannot be added into the initial instruction, and a complete instruction is directly generated at the moment, so that each station to be supplemented in the station list to be supplemented is distributed into the corresponding complete instruction, and the vehicle can be conveniently supplemented to all stations to be supplemented by corresponding staff.
Referring to fig. 5, further, the step S2 is followed by the following steps:
s23: acquiring the position information of a worker and the position information of a vehicle;
s24: based on the position information of the first station to be supplemented, the position information of the staff and the position information of the vehicles, which are added with the complete command, the time for the staff to schedule the corresponding number of the vehicles to reach the first station to be supplemented is estimated;
s25: and sending the corresponding complete instruction to the staff in the preset time range, and scheduling the corresponding number of vehicles by the staff according to the number of the vehicles to be supplemented in the complete instruction.
Wherein the staff and vehicles described in step S23 include all staff and vehicles, wherein each vehicle should include a unique vehicle identification for distinguishing the vehicle, which may be a unique number, a unique identification, etc. of the vehicle.
It can be understood that the time for the staff to schedule the corresponding vehicles to reach the first station to be supplemented is estimated, so that the staff capable of quickly scheduling the corresponding vehicles and supplementing the stations is found, and the vehicle scheduling efficiency is improved.
Further, when the staff supplies the vehicles to the station to be supplied in the complete instruction, the vehicles are sequentially supplied according to the sequence of adding the complete instruction to the station to be supplied.
It can be understood that, since the stations to be supplemented, which are added with the complete command from the second, are the shortest distance from the last station to be supplemented, which is added with the complete command, the distance for the staff to perform vehicle quantity replenishment driving according to the sequence is the shortest, and the time is also the shortest, so that the vehicle dispatching efficiency is greatly improved.
In summary, when a plurality of stations to be supplemented need to be supplemented simultaneously, the number of the stations to be supplemented of the plurality of stations to be supplemented is combined to generate a complete instruction, the complete instruction comprises a plurality of stations to be supplemented which need to be supplemented with vehicles, and comprises the vehicle distribution number corresponding to each station to be supplemented, and a worker carries the vehicles with the total required number of the plurality of stations at one time through carrying equipment.
Referring to fig. 6, a second embodiment of the invention provides a vehicle dispatching system 1, which includes the following modules:
the information acquisition module 10: acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented;
the instruction processing module 20: combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction;
the instruction accepting module 30: and enabling the staff to receive the corresponding complete instruction, scheduling the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete instruction, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete instruction.
In the embodiments provided herein, it should be understood that "B corresponding to a" means that B is associated with a from which B can be determined. It should also be understood, however, that determining B from a does not mean determining B from a alone, but may also be determined from a and/or other information.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Those skilled in the art should also appreciate that the embodiments described in this specification are exemplary and alternative embodiments, and that the acts and modules illustrated are not required in order to practice the invention.
In various embodiments of the present invention, it should be understood that the sequence numbers of the above-mentioned processes do not imply an inevitable order of execution, and the execution order of the processes should be determined by their functions and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
The flowchart and block diagrams in the figures of the present application illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Compared with the prior art, the vehicle dispatching method and the vehicle dispatching system provided by the invention have the following beneficial effects:
1. the vehicle dispatching method comprises the steps of firstly obtaining a list of stations to be supplied and the number of vehicles to be supplied of each station to be supplied, thereby determining which stations need to be supplied and how many vehicles need to be dispatched, then combining a plurality of stations to be supplied to generate a complete instruction, wherein the complete instruction comprises a plurality of stations needing to be supplied with vehicles, and the number of the vehicles required by each station can be known through the complete instruction, and a worker can dispatch the vehicle supply requirements of the stations at one time after receiving the complete instruction, and respectively carry out vehicle supply corresponding to the requirements of the stations to be supplied.
2. The invention can enable corresponding vehicle dispatching staff to know the position of the station to be supplemented through the position information of the station to be supplemented, and is convenient to find the shortest route for dispatching the vehicle to each station to be supplemented in advance, thereby improving the efficiency of vehicle dispatching.
3. According to the invention, the minimum vehicle quantity information of the station is preset, and whether the station needs to be supplemented with the vehicles can be directly judged after the real-time vehicle quantity information of the station is obtained, and then the vehicle quantity needing to be supplemented can be calculated through the maximum vehicle quantity information which can be accommodated by the station.
4. According to the invention, whether the number of the vehicles to be supplemented in the initial instruction is greater than the preset number of the scheduled vehicles is judged, so that the carrying equipment of a worker can only carry a certain number of vehicles, if the number of the vehicles to be supplemented in the initial instruction is greater than the preset number of the scheduled vehicles, the worker cannot finish the scheduled number in the complete instruction at one time, and the number of the vehicles to be supplemented in some stations is very small, and a plurality of stations to be supplemented are combined into one complete instruction, so that the space of the carrying equipment is fully utilized, and the vehicle scheduling efficiency is improved.
5. According to the invention, the initial instruction is added from the second to the initial instruction, the distance between the station to be supplemented and the station to be supplemented to which the initial instruction is added is the shortest, and when a worker dispatches a vehicle, the station which arrives each time is the station closest to the station, so that the distance of the worker can be shortened, the time can be saved, and the efficiency of dispatching the vehicle by the worker can be improved.
6. According to the invention, at least one complete instruction is obtained by repeating the steps of presetting the initial instruction and obtaining the complete instruction until no station to be supplemented exists in the station list to be supplemented, so that the stations to be supplemented are multiple in the normal condition, sometimes all stations to be supplemented cannot be supplemented by generating one complete instruction, and multiple complete instructions are usually required to be generated so as to achieve the purpose of supplementing all stations to be supplemented.
7. According to the invention, as the station to be supplemented does not exist in the station list to be supplemented, namely the station to be supplemented cannot be added into the initial instruction, a complete instruction is directly generated at the moment, so that each station to be supplemented in the station list to be supplemented is distributed into the corresponding complete instruction, and the vehicle can be conveniently supplemented to all stations to be supplemented by corresponding staff.
8. According to the invention, the time for the staff to schedule the corresponding vehicles to reach the first station to be supplemented is estimated, so that the staff capable of quickly scheduling the corresponding vehicles and supplementing the stations is found, and the vehicle scheduling efficiency is improved.
9. In the invention, the working personnel sequentially supply the vehicles according to the sequence of adding the complete instruction into the stations to be supplied, and the distance between the stations to be supplied, which are added with the complete instruction from the second station to be supplied, and the station to be supplied, which is added with the complete instruction, is the shortest, so that the distance for the working personnel to supply the vehicles according to the sequence is the shortest, the time is the shortest, and the efficiency of vehicle dispatching is greatly improved. .
10. The embodiment of the invention also provides a vehicle dispatching system, which has the same beneficial effects as the vehicle dispatching method and is not repeated herein.
The vehicle scheduling method and system disclosed by the embodiment of the invention are described in detail, a specific example is applied in the text to explain the principle and the implementation of the invention, and the description of the embodiment is only used for helping to understand the method and the core idea of the invention; meanwhile, for the persons skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present description should not be construed as a limitation to the present invention, and any modification, equivalent replacement, and improvement made within the principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A vehicle scheduling method, characterized by: the method comprises the following steps:
acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented;
combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction;
and dispatching the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete command, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete command.
2. The vehicle scheduling method of claim 1, wherein: the station list information to be supplemented also comprises a station list to be supplemented and position information corresponding to stations in the station list to be supplemented.
3. The vehicle scheduling method of claim 2, wherein: the specific steps of obtaining the list of stations to be supplemented and the number of vehicles to be supplemented at each station to be supplemented are as follows:
presetting information of the minimum number of vehicles in a station and the maximum number of vehicles capable of being accommodated in the station;
acquiring real-time vehicle quantity information of a station, judging whether the real-time vehicle quantity information of the station is lower than the lowest vehicle quantity of a preset station, and if so, adding the station into a list of stations to be replenished;
and calculating the number of the vehicles to be supplemented at the station based on the real-time vehicle number information of the station and the maximum vehicle number information which can be accommodated at the station.
4. The vehicle scheduling method of claim 3, wherein: the concrete steps of combining the number of the vehicles to be supplied of a plurality of stations to be supplied into a complete command are as follows:
presetting an initial instruction, and adding stations to be supplemented one by one into the initial instruction;
and judging whether the number of the vehicles to be supplemented in the initial instruction is larger than the preset number of the dispatched vehicles, if so, taking the initial instruction out of the station to be supplemented which is added with the initial instruction at the last time and returning the initial instruction to a list of the station to be supplemented to obtain a complete instruction.
5. The vehicle scheduling method of claim 4, wherein: the concrete steps of adding stations to be supplied into the initial instruction one by one are as follows:
firstly, selecting any station to be replenished in a station list to be replenished and adding an initial instruction;
calculating the distance between each station to be supplemented which is remained in the station list to be supplemented and the last station to be supplemented which is added with the initial instruction;
and selecting the station to be supplemented with the initial instruction with the shortest distance to the last station to be supplemented with the initial instruction.
6. The vehicle scheduling method of claim 4, wherein: and repeating the steps of presetting the initial instruction and obtaining the complete instruction until no station to be supplemented exists in the station list to be supplemented, and obtaining at least one complete instruction.
7. The vehicle scheduling method of claim 6, wherein: and when the number of the vehicles to be supplemented in the initial instruction is judged to be less than the preset number of the scheduled vehicles and no station to be supplemented exists in the station list to be supplemented at the moment, obtaining a complete instruction.
8. The vehicle scheduling method of claim 6, wherein: the method also comprises the following steps after the complete instruction is obtained:
acquiring the position information of a worker and the position information of a vehicle;
based on the position information of the first station to be supplemented, the position information of the staff and the position information of the vehicles, which are added with the complete command, the time for the staff to schedule the corresponding number of the vehicles to reach the first station to be supplemented is estimated;
and sending the corresponding complete instruction to the staff in the preset time range, and scheduling the corresponding number of vehicles by the staff according to the number of the vehicles to be supplemented in the complete instruction.
9. The vehicle scheduling method of claim 8, wherein: and when the staff supplies the vehicles to the station to be supplied in the complete instruction, sequentially supplying the vehicles according to the sequence of adding the complete instruction to the station to be supplied.
10. A vehicle dispatch system characterized by: the system comprises the following modules:
an information acquisition module: acquiring list information of stations to be supplemented and the number of vehicles to be supplemented of each station to be supplemented;
the instruction processing module: combining the number of the vehicles to be supplemented of a plurality of stations to be supplemented to generate a complete instruction;
an instruction receiving module: and enabling the staff to receive the corresponding complete instruction, scheduling the corresponding number of vehicles at one time based on the number of the vehicles to be supplemented in the complete instruction, and supplementing the number of the vehicles to be supplemented corresponding to each station to be supplemented in the complete instruction.
CN202210148618.7A 2022-02-18 2022-02-18 Vehicle scheduling method and system Pending CN114202911A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210148618.7A CN114202911A (en) 2022-02-18 2022-02-18 Vehicle scheduling method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210148618.7A CN114202911A (en) 2022-02-18 2022-02-18 Vehicle scheduling method and system

Publications (1)

Publication Number Publication Date
CN114202911A true CN114202911A (en) 2022-03-18

Family

ID=80645649

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210148618.7A Pending CN114202911A (en) 2022-02-18 2022-02-18 Vehicle scheduling method and system

Country Status (1)

Country Link
CN (1) CN114202911A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114819757A (en) * 2022-06-24 2022-07-29 北京阿帕科蓝科技有限公司 Method, system and computer readable storage medium for adjusting station position

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107766994A (en) * 2017-12-04 2018-03-06 长沙理工大学 A kind of shared bicycle dispatching method and scheduling system
CN108805335A (en) * 2018-05-17 2018-11-13 杭州电子科技大学 A kind of public bicycles dispatching method
CN111090935A (en) * 2019-12-13 2020-05-01 河海大学常州校区 Public bicycle appointment scheduling and path planning method
CN111178737A (en) * 2019-12-24 2020-05-19 北京摩拜科技有限公司 Vehicle delivery method and server
CN111564053A (en) * 2020-04-24 2020-08-21 上海钧正网络科技有限公司 Vehicle scheduling method and device, vehicle scheduling equipment and storage medium
CN112036615A (en) * 2020-08-17 2020-12-04 上海钧正网络科技有限公司 Vehicle scheduling method, device, equipment and storage medium
US20210070192A1 (en) * 2019-09-09 2021-03-11 Electricite De France Replenishing station assignment
CN113269364A (en) * 2021-06-01 2021-08-17 上海汽车集团股份有限公司 Scheduling method and device for shared vehicles
CN113610321A (en) * 2021-08-23 2021-11-05 宁波小遛共享信息科技有限公司 Shared vehicle scheduling method and device for parking points and computer equipment

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107766994A (en) * 2017-12-04 2018-03-06 长沙理工大学 A kind of shared bicycle dispatching method and scheduling system
CN108805335A (en) * 2018-05-17 2018-11-13 杭州电子科技大学 A kind of public bicycles dispatching method
US20210070192A1 (en) * 2019-09-09 2021-03-11 Electricite De France Replenishing station assignment
CN111090935A (en) * 2019-12-13 2020-05-01 河海大学常州校区 Public bicycle appointment scheduling and path planning method
CN111178737A (en) * 2019-12-24 2020-05-19 北京摩拜科技有限公司 Vehicle delivery method and server
CN111564053A (en) * 2020-04-24 2020-08-21 上海钧正网络科技有限公司 Vehicle scheduling method and device, vehicle scheduling equipment and storage medium
CN112036615A (en) * 2020-08-17 2020-12-04 上海钧正网络科技有限公司 Vehicle scheduling method, device, equipment and storage medium
CN113269364A (en) * 2021-06-01 2021-08-17 上海汽车集团股份有限公司 Scheduling method and device for shared vehicles
CN113610321A (en) * 2021-08-23 2021-11-05 宁波小遛共享信息科技有限公司 Shared vehicle scheduling method and device for parking points and computer equipment

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114819757A (en) * 2022-06-24 2022-07-29 北京阿帕科蓝科技有限公司 Method, system and computer readable storage medium for adjusting station position

Similar Documents

Publication Publication Date Title
CN111311116B (en) Intelligent park-based vehicle scheduling method, device, equipment and storage medium
CN107067707B (en) Bus operation and passenger trip optimization system
CN108875094B (en) Public transportation information system
CN105551236B (en) Vehicle dispatching method and vehicle dispatch system
CN111932123B (en) Method, device and system for selecting shared vehicle station based on flow direction
CN105551233A (en) Smart route changing bus system and dynamic scheduling optimization method thereof
CN104464274A (en) Car-sharing taxi taking method and server
CN110136427A (en) A kind of automatic Pilot taxi dispatching system based on car networking big data
CN108417014B (en) Shared bicycle management and scheduling system and method
CN102592470B (en) Traffic information publishing method, device and system
EP3110653B1 (en) Self-managing charging poles
CN108537353A (en) About vehicle method, about vehicle device and about vehicle system
JP2019086900A (en) Vehicle allocation system, vehicle allocation device to be used thereof, and vehicle allocation method
CN114202911A (en) Vehicle scheduling method and system
CN111461485A (en) Task allocation method, device, equipment and computer readable storage medium
CN104166897A (en) Public bike scheduling monitoring method
CN106557826A (en) Many people are used in conjunction with reserving method, client and the system of the shared vehicles
CN105702017A (en) Vehicle scheduling method and device
CN113066230A (en) Shared vehicle parking spot adjustment method, apparatus, storage medium, and program product
CN112950041A (en) Shared vehicle scheduling method, device, storage medium and computer program product
CN115526549A (en) Shared vehicle scheduling profit calculation method, server, and storage medium
CN103034959B (en) A kind of method and apparatus being scheduling
CN114971136A (en) Bus and tour bus scheduling method
CN112508423B (en) Guide route generation method and device
CN102426023A (en) Prompt method of navigation path including ferry and navigation terminal thereof

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