CN113449053B - Vehicle scheduling method and device - Google Patents
Vehicle scheduling method and device Download PDFInfo
- Publication number
- CN113449053B CN113449053B CN202010224894.8A CN202010224894A CN113449053B CN 113449053 B CN113449053 B CN 113449053B CN 202010224894 A CN202010224894 A CN 202010224894A CN 113449053 B CN113449053 B CN 113449053B
- Authority
- CN
- China
- Prior art keywords
- scheduled
- task
- vehicle
- attribute information
- tasks
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Abstract
The invention discloses a vehicle dispatching method and device, and relates to the technical field of warehouse logistics. One embodiment of the method comprises the following steps: determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled; determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled; and distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information. The embodiment realizes automatic dispatching of the vehicles, thereby improving the dispatching efficiency of the vehicles.
Description
Technical Field
The invention relates to the technical field of warehouse logistics, in particular to a vehicle dispatching method and device.
Background
During the processing of a logistics order, the dispatching of vehicles is often involved, so that the dispatched vehicles are utilized to transport the articles corresponding to the logistics order.
The prior art generally adopts a manual mode to realize the dispatching of the vehicles. Specifically, after the logistics order is obtained, a dispatcher contacts with a driver of the vehicle to determine whether the vehicle can transport the articles in the logistics order, so that the dispatching of the vehicle is realized.
In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art:
the vehicles are dispatched manually, and the people to be dispatched are contacted with drivers one by one according to the logistics orders, so that the vehicle dispatching efficiency is lower.
Disclosure of Invention
In view of the above, the embodiments of the present invention provide a method and an apparatus for vehicle scheduling, which can automatically allocate a vehicle to be scheduled for a task to be scheduled according to first attribute information of the task to be scheduled and second attribute information of the vehicle to be scheduled, at least according to a starting position of the task to be scheduled and a current position of the vehicle to be scheduled, thereby implementing automatic scheduling of the vehicle and further improving efficiency of vehicle scheduling.
To achieve the above object, according to one aspect of an embodiment of the present invention, there is provided a method of vehicle scheduling.
The method for scheduling the vehicle comprises the following steps: determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled;
Determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled;
and distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information.
Optionally, the determining, according to the starting position indicated by the attribute information, one or more vehicles to be scheduled corresponding to the starting position includes:
and determining a dispatching range according to the starting position and the dispatching radius, and determining the vehicle to be dispatched according to the dispatching range.
Optionally, when the number of tasks to be scheduled is multiple, determining the scheduling range according to the starting position and the scheduling radius includes:
and determining the center positions of a plurality of tasks to be scheduled and the scheduling radius according to the starting positions of the tasks to be scheduled, and determining the scheduling range according to the center positions and the scheduling radius.
Optionally, when the number of tasks to be scheduled is at least three, determining the center positions of the plurality of tasks to be scheduled according to the starting positions of the tasks to be scheduled includes:
Determining the circle centers of the circumferences corresponding to the three tasks to be scheduled by adopting a three-point method according to the starting positions respectively corresponding to the three tasks to be scheduled in the tasks to be scheduled;
and determining the center positions of a plurality of tasks to be scheduled and the scheduling radius according to the circle center of the circle and the starting positions of other tasks to be scheduled except the three tasks to be scheduled in the tasks to be scheduled.
Optionally, the determining the vehicle to be scheduled according to the scheduling range includes:
searching a vehicle in a dispatching range corresponding to the central position and the dispatching radius;
when the vehicle is found, taking the found vehicle as the vehicle to be dispatched;
and when the vehicle is not found, expanding the scheduling range, and finding the vehicle in the expanded scheduling range.
Optionally, the allocating the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information includes:
and calculating the distance between the current position and the starting position, and distributing the vehicles to be scheduled for the tasks to be scheduled according to the sequence of the distances from small to large.
Optionally, when the task to be scheduled is a plurality of tasks,
And calculating the total distance between the vehicle to be scheduled and each task to be scheduled according to the distance between the current position and the starting position of each task to be scheduled, and distributing the vehicle to be scheduled for the task to be scheduled according to the sequence from the small total distance to the large total distance.
Optionally, the first attribute information further indicates at least a volume of an item corresponding to the task to be scheduled and/or a weight of the item corresponding to the task to be scheduled, and any one or more of the following: the method comprises the steps of determining a target position of a task to be scheduled, a vehicle duration corresponding to the task to be scheduled, a running distance corresponding to the task to be scheduled, the number of articles corresponding to the task to be scheduled and a vehicle type required by the task to be scheduled;
the second attribute information further indicates at least a volume and/or a payload of the vehicle to be scheduled, and any one or more of: the current task state of the vehicle to be scheduled and the vehicle type of the vehicle to be scheduled.
Optionally, the allocating the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information includes:
And distributing the to-be-scheduled vehicles with the volume which is not smaller than the volume of the article corresponding to the to-be-scheduled task and the weight which is not smaller than the weight of the article corresponding to the to-be-scheduled task.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided an apparatus for vehicle scheduling.
The device for scheduling the vehicles comprises: the system comprises a task determining module, a vehicle determining module and a scheduling module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the task determining module is used for determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled;
the vehicle determining module is used for determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled;
and distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information.
Optionally, the vehicle determining module is configured to determine a scheduling range according to the starting position and the scheduling radius, and determine the vehicle to be scheduled according to the scheduling range.
Optionally, the vehicle determining module is configured to determine a center position of the plurality of tasks to be scheduled and the scheduling radius according to starting positions of the tasks to be scheduled, and determine the scheduling range according to the center position and the scheduling radius.
Optionally, a vehicle to be scheduled, the volume of which is not smaller than the volume of the article corresponding to the task to be scheduled and the weight of which is not smaller than the weight of the article corresponding to the task to be scheduled, is allocated to the task to be scheduled.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided an electronic device for vehicle scheduling.
The electronic device for vehicle dispatching in the embodiment of the invention comprises: one or more processors; and the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the vehicle scheduling method according to the embodiment of the invention.
To achieve the above object, according to still another aspect of the embodiments of the present invention, there is provided a computer-readable storage medium.
A computer readable storage medium of an embodiment of the present invention has stored thereon a computer program which, when executed by a processor, implements a method of vehicle scheduling of an embodiment of the present invention.
One embodiment of the above invention has the following advantages or benefits: the method and the device can automatically allocate the vehicle to be scheduled for the task to be scheduled according to the first attribute information of the task to be scheduled and the second attribute information of the vehicle to be scheduled, wherein the first attribute information indicates the starting position of the task to be scheduled, and the second attribute information indicates the current position of the vehicle to be scheduled, so that the vehicle to be scheduled can be automatically scheduled according to at least the starting position of the task to be scheduled and the current position of the vehicle to be scheduled, and further the vehicle scheduling efficiency is improved.
Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a method of vehicle dispatch according to an embodiment of the present invention;
FIG. 2 is a schematic illustration of a scheduling scope in accordance with an embodiment of the present invention;
FIG. 3 is a schematic diagram of the main steps of a method of determining vehicles to be scheduled according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of the main steps of another method of vehicle dispatch according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of the major modules of an apparatus for vehicle dispatch according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 7 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
It should be noted that the embodiments of the present invention and the technical features in the embodiments may be combined with each other without collision.
Fig. 1 is a schematic diagram of the main steps of a method of vehicle scheduling according to an embodiment of the present invention.
As shown in fig. 1, a method for scheduling a vehicle according to an embodiment of the present invention mainly includes the following steps:
Step S101: determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled.
The task to be scheduled may be a logistics transportation task, for example, an order delivery task related to an e-commerce platform, an order receiving task generated when a user returns a goods to the e-commerce platform, or a logistics transportation task corresponding to a shipping behavior between the users. In addition, the task to be scheduled can be a network taxi-taking task and the like.
The first attribute information may indicate, in addition to the starting position of the task to be scheduled, at least a volume of an item corresponding to the task to be scheduled and/or a weight of the item corresponding to the task to be scheduled, and any one or more of the following: the method comprises the steps of determining a target position of a task to be scheduled, a vehicle duration corresponding to the task to be scheduled, a running distance corresponding to the task to be scheduled, the number of articles corresponding to the task to be scheduled and a vehicle type required by the task to be scheduled. When the vehicle to be scheduled is allocated to the task to be scheduled, the vehicle to be scheduled is determined from the plurality of dimensions indicated by the first attribute information of the task to be scheduled, so that accuracy and flexibility of vehicle scheduling are improved.
Step S102: and determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled.
No matter what type of task to be scheduled is a logistics transportation task or a network vehicle-restraining task, when the task to be scheduled is executed by utilizing the vehicle to be scheduled, the vehicle to be scheduled needs to travel to the starting position of the task to be scheduled. The starting position is a position of the to-be-dispatched vehicle for receiving an article corresponding to the to-be-dispatched task or other positions (such as a contact position designated by a user) indicated by the to-be-dispatched task for the logistics transportation task. For network taxi tasks, the starting location is typically the passenger's boarding location. It can be understood that, for different types of tasks to be scheduled, the process of executing the method for vehicle scheduling provided by the embodiment of the present invention is the same, so for convenience of description, the method for vehicle scheduling provided by the embodiment of the present invention is mainly explained in detail below taking logistic transportation as an example.
When the vehicle to be scheduled executes the task to be scheduled, the vehicle to be scheduled needs to travel to the starting position of the task to be scheduled, and when the vehicle to be scheduled is determined, the scheduling range can be determined according to the starting position and the scheduling radius, and the vehicle to be scheduled is determined according to the scheduling range.
In one embodiment of the present invention, when a task to be scheduled is single, a scheduling range may be determined according to a starting position of the task to be scheduled and a preset scheduling radius (e.g., 1 km), for example, a coordinate of the starting position of the task to be scheduled a in a map is a (x 1, y 1), and then a circular area with a (x 1, y 1) as a center and a radius of 1km may be determined as the scheduling range, and a vehicle to be scheduled may be searched in the area. Of course, the scheduling range may not be limited to a circular area, but may be changed according to actual requirements or actual geographical conditions. For example, the scheduling range may be determined as a square area centered on a (x 1, y 1) with a side length of 1 km. For another example, when an unrealistic area (mountain, river, etc.) exists in a circular area having a radius of 1km around a (x 1, y 1), the scheduling range is defined as an area other than the unrealistic area in the circular area.
In one embodiment of the present invention, when the number of tasks to be scheduled is multiple, a center position of the multiple tasks to be scheduled and the scheduling radius may be determined according to a starting position of each task to be scheduled, and the scheduling range may be determined according to the center position and the scheduling radius.
For example, when there are two tasks to be scheduled, the starting positions of the two tasks to be scheduled (task B to be scheduled and task C to be scheduled) in the map are B (x 2, y 2) and C (x 3, y 3), respectively. The midpoint of the two task lines to be scheduled can be used as the center position of the two tasks to be scheduled, that is, the coordinates of the center positions of the task B to be scheduled and the task C to be scheduled can beThe corresponding scheduling radius of the task B to be scheduled and the task C to be scheduled can be a preset scheduling radius (for example, still 1 km), or can be according to the task B to be scheduled and the task C to be scheduledThe distance between them determines the scheduling radius. For example, the distance between the task B to be scheduled and the task C to be scheduled is directly taken as the scheduling radius, namely the scheduling radius r isThe scheduling range at this time may be +.>Is the center of a circle and the radius isIs a circular region of (a). For another example, half the distance between task B to be scheduled and task C to be scheduled can be used as the scheduling radius, i.e. the scheduling radius r is +.>The scheduling range at this time may be +.>Is the center of a circle and the radius is->Is a circular region of (a). Of course, when there are two scheduling tasks, the specific shape of the scheduling range may not be limited, that is, the above-mentioned using the circular area as the scheduling range is only one possible scheme provided by the embodiment of the present invention, and in the specific implementation process, the scheduling range may be selected according to the actual requirement or the actual geographic situation.
In addition, when the number of the tasks to be scheduled is at least three, determining the circle centers of the circumferences corresponding to the three tasks to be scheduled by adopting a three-point method according to the starting positions respectively corresponding to the three tasks to be scheduled in the tasks to be scheduled; and determining the center positions of a plurality of tasks to be scheduled and the scheduling radius according to the circle center of the circle and the starting positions of other tasks to be scheduled except the three tasks to be scheduled in the tasks to be scheduled.
For example, when the number of tasks to be scheduled is three, the starting positions of the three tasks to be scheduled (task D to be scheduled, task E to be scheduled, and task F to be scheduled) in the map are D (x 4, y 4), E (x 5, y 5), and F (x 6, y 6), respectively. Then a three-point method may be used to determine the center location of the three tasks to be scheduled. As shown in fig. 2, the circles where the three starting positions D, E and F are located may be determined, and the center of the circle may be the center position of the three tasks to be scheduled, and the radius of the circle may be the scheduling radius.
Specifically, according to the standard equation of the circle shown in the following formula (1), and the starting positions D (x 4, y 4), E (x 5, y 5) and F (x 6, y 6) of the task D, the task E and the task F to be scheduled, since D, E and F are both located on the circumference, the respective coefficients M, N, O and P of the standard equation of the circle can be obtained according to the coordinates of D, E and F, and the solution results are shown in the following formulas (2) to (5), so that the circumference where the three starting positions are located and the standard equation corresponding to the circumference can be determined according to the starting positions of the task D, the task E and the task F to be scheduled. And then the circle center of the circle where D, E and F are located can be obtained according to the standard equation of the circle, and assuming that the coordinates of the circle center are (x, y), the coordinates of the circle center can be shown in the following formula (6), and then the circle center of the circle can be used as the center position of each task to be scheduled. The radius of the circle where D, E and F are located can be obtained according to the standard equation, the radius can be expressed by the following formula (7), then the radius r of the circle can be directly used as the scheduling radius, and the scheduling radius can be determined based on the multiple of the radius r, for example, the scheduling radius is determined to be 1.3r.
Mx 2 +My 2 +Nx+Oy+P＝0.............(1)
Wherein x represents the abscissa of the circle center, y represents the ordinate of the circle center, and M, N, O and P are coefficients corresponding to the circumference respectively.
M＝x4(y5-y6)-y4(x5-x6)+x5y6-x6y5.......(2)
N＝(x4 2 +y4 2 )(y6-y5)+(x5 2 +y5 2 )(y4-y6)+(x6 2 +y6 2 )(y5-y4).........(3)
O＝(x4 2 +y4 2 )(x5-x6)+(x5 2 +y5 2 )(x6-x4)+(x6 2 +y6 2 )(x4-x5)..........(4)
P＝(x4 2 +y4 2 )(x6y5-x5y6)+(x5 2 +y5 2 )(x4y6-x6y4)+(x6 2 +y6 2 )(x5y4-x4y5).........(5)
In the formulas (2) to (5), M, N, O and P are coefficients corresponding to circles, respectively, (x 4, y 4) are coordinates of a start position of the task to be scheduled D, (x 5, y 5) are coordinates of a start position of the task to be scheduled E, and (x 6, y 6) are coordinates of a start position of the task to be scheduled F.
Wherein, (x, y) is the center coordinates, M, N and O are the coefficients corresponding to the circumferences respectively.
Wherein r is the radius of a circle, (x, y) is the center coordinates, and M, N, O and P are coefficients corresponding to the circumference respectively.
It should be noted that, when the number of tasks to be scheduled is three and the starting positions D (x 4, y 4), E (x 5, y 5) and F (x 6, y 6) of the three tasks to be scheduled D, the task to be scheduled E and the task to be scheduled F are not located in the same circumference, that is, when the standard equation of the circumference is not solved, the circumference may be determined according to the starting positions of two tasks to be scheduled in the three tasks to be scheduled, and the starting position of the third task to be scheduled is located in the circumference. For example, a circumference is determined according to the starting positions D and E of the task D and the task E to be scheduled, and the starting position F of the task F to be scheduled is located within the circumference. And then taking the determined circular range as a scheduling range. Of course, the shape determined according to the starting positions of the two tasks to be scheduled is not necessarily limited to a circle, and may be square, rectangle, or the like, for example.
When the number of the tasks to be scheduled is more than three, the center positions and the scheduling radius of a plurality of tasks to be scheduled can be determined according to the determined circle centers of the circles and the starting positions of other tasks to be scheduled except the three tasks to be scheduled.
For example, when the number of tasks to be scheduled is four, the starting position of the fourth task G to be scheduled is G (x 7, y 7) in addition to the task D to be scheduled, the task E to be scheduled, and the task F to be scheduled described above. The center position and the scheduling radius corresponding to the four tasks to be scheduled can be determined according to the position relation between the starting position and the circumference of the fourth task to be scheduled G. For example, when G (x 7, y 7) is in the circumference or on the circumference, the center position is still the center (x, y), the scheduling radius is still r, and when G (x 7, y 7) is out of the circumference, the midpoint of the two-point connecting line can be used as the center position of the four tasks to be scheduled according to the determined center coordinates (x, y) and G (x 7, y 7), and the scheduling radius can be determined according to the distance between the center coordinates (x, y) and G (x 7, y 7).
When the number of tasks to be scheduled is five, the new circle center coordinates and the new circle radius can be redetermined according to the circle center coordinates (x, y) and the initial positions of the other two tasks to be scheduled, the newly determined circle center coordinates are used as the center positions of the five tasks to be scheduled, the newly determined circle radius is used as the scheduling radius, or the scheduling radius is determined based on the multiple of the newly determined circle radius, for example, the newly determined circle radius is R, and then 1.5R can be used as the scheduling radius.
Therefore, when a plurality of tasks to be scheduled are provided, the cyclic operation can be performed by combining the above various conditions to determine the central positions and the scheduling radiuses of the plurality of tasks to be scheduled, and the scheduling range is determined according to the central positions and the scheduling radiuses, so that when the vehicles to be scheduled are determined in the scheduling range, the determined vehicles to be scheduled are uniformly distributed among the tasks to be scheduled, namely, the distance distribution between the vehicles to be scheduled and the tasks to be scheduled is uniform, the time for the vehicles to be scheduled to travel to the starting positions of the tasks to be scheduled can be shortened, and the vehicle scheduling efficiency and the task execution efficiency are improved.
In one embodiment of the invention, when the vehicle to be scheduled is determined in the scheduling range, the vehicle can be searched in the scheduling range corresponding to the central position and the scheduling radius; when the vehicle is found, taking the found vehicle as the vehicle to be dispatched; and when the vehicle is not found, expanding the scheduling range according to the preset radius, and finding the vehicle in the expanded scheduling range.
For example, when the determined circumference radius is r and 1.3r is taken as the dispatching radius, firstly searching the vehicle in a dispatching range with the radius of 1.3r by taking (x, y) as the circle center, and if the vehicle is found in the range, directly taking the found vehicle as the vehicle to be dispatched. If no vehicle is found in the range, the scheduling range is automatically expanded, for example, the scheduling range is expanded to 2r, and if the vehicle is continuously found in the scheduling range with the radius of 2r and the center of the circle (x, y). It can be appreciated that the scheduling range can be expanded multiple times according to the search result of the vehicle until the vehicle meeting the requirement of the task to be scheduled is found in the scheduling range. For example, when a vehicle is not found within a scheduling range of 2r radius with (x, y) as the center, the radius of 3r of the scheduling range may be continuously enlarged. In the expansion process of the scheduling range, for convenience of operation, the scheduling radius may be automatically expanded based on an integer multiple of the circumference radius, for example, when no vehicle is found in the scheduling range with the radius of 2r, the scheduling radius may be expanded to 3r, and if no vehicle is found in the scheduling range with the radius of 3r, the scheduling radius may be further expanded to 4r.
Thus, as shown in fig. 3, the determining process of the vehicle to be scheduled according to the embodiment of the present invention may include the following steps:
step S301: and determining the center positions of a plurality of tasks to be scheduled and the scheduling radius according to the starting positions of the tasks to be scheduled, and determining the scheduling range according to the center positions and the scheduling radius.
Step S302: and searching for the vehicle in the dispatching range, executing step S303 when the vehicle is found, otherwise executing step S304.
Step S303: and taking the searched vehicle as the vehicle to be dispatched, and ending the current flow.
Step S304: the scheduling range is enlarged and step S302 is performed.
The scheduling range may be enlarged multiple times according to the search result of the vehicle in step S302 until a vehicle meeting the requirement of the task to be scheduled is found in the scheduling range.
Step S103: and distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information.
When a vehicle to be scheduled is allocated to the task to be scheduled according to the starting position of the task to be scheduled and the current position of the vehicle to be scheduled, the distance between the current position and the starting position can be calculated first, and then the vehicle to be scheduled is allocated to the task to be scheduled according to the sequence of the distance from small to large, so that the distance between the allocated vehicle to be scheduled and the starting position allocated to the corresponding task to be scheduled is relatively short, and the scheduling efficiency of the vehicle and the execution efficiency of the task are further improved.
In one embodiment of the present invention, when the number of tasks to be scheduled is multiple, a total distance between the vehicle to be scheduled and each task to be scheduled is calculated according to a distance between the current position and a starting position of each task to be scheduled, and the vehicle to be scheduled is allocated to the task to be scheduled according to an order from the total distance to the large.
When the number of tasks to be scheduled is multiple, one vehicle to be scheduled can accept multiple tasks to be scheduled, that is, the same vehicle to be scheduled can be allocated to multiple tasks to be scheduled. At this time, the vehicles to be scheduled can be distributed for the tasks to be scheduled in order from small to large according to the total distance between the vehicles to be scheduled and each task to be scheduled, so that the distance distribution between the vehicles to be scheduled and the starting positions of the corresponding tasks to be scheduled is uniform, the time for the vehicles to be scheduled to travel to the starting positions of the tasks to be scheduled can be shortened, and the vehicle scheduling efficiency and the task execution efficiency are improved.
In addition, since the second attribute information indicates, in addition to the current position of the vehicle to be scheduled, at least a volume and/or a weight that can be carried by the vehicle to be scheduled, any one or more of the following: the current task state of the vehicle to be scheduled and the vehicle type of the vehicle to be scheduled. The first attribute information may indicate, in addition to the starting position of the task to be scheduled, at least a volume of an item corresponding to the task to be scheduled and/or a weight of the item corresponding to the task to be scheduled, and any one or more of the following: the method comprises the steps of determining a target position of a task to be scheduled, a vehicle duration corresponding to the task to be scheduled, a running distance corresponding to the task to be scheduled, the number of articles corresponding to the task to be scheduled and a vehicle type required by the task to be scheduled.
Therefore, the vehicle to be scheduled, which has the capacity not smaller than the volume of the article corresponding to the task to be scheduled and the weight of the article corresponding to the task to be scheduled, can be allocated to the task to be scheduled.
That is, as shown in fig. 4, the method for distributing vehicles provided by the embodiment of the present invention may include the following steps:
step S401: determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled, a volume of an article corresponding to the task to be scheduled and a weight of the article corresponding to the task to be scheduled.
Step S402: and determining a plurality of vehicles to be scheduled corresponding to the initial position and second attribute information of each vehicle to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicle to be scheduled, the capacity of the vehicle to be scheduled and the loadable capacity of the vehicle to be scheduled.
Step S403: and respectively calculating the distance between the current position and the starting position of each vehicle to be scheduled.
Step S404: and determining vehicles to be scheduled, wherein the volume of the vehicles to be scheduled is not smaller than the volume of the article corresponding to the task to be scheduled, and the weight of the vehicles to be scheduled is not smaller than the weight of the article corresponding to the task to be scheduled, from a plurality of vehicles to be scheduled according to the sequence from small distance to large distance.
Step S405: and distributing the determined vehicles to be scheduled to the tasks to be scheduled.
The vehicle to be scheduled determined in this step S404 refers to a vehicle to be scheduled, in which the volume of the allowable volume determined in the step S404 is not smaller than the volume of the article corresponding to the task to be scheduled, and the weight of the allowable volume is not smaller than the weight of the article corresponding to the task to be scheduled.
It should be noted that, the contents indicated by the first attribute information and the second attribute information correspond to each other, for example, when the first attribute information indicates a vehicle type required by the task to be scheduled, the second attribute information also indicates a vehicle type of the vehicle to be scheduled accordingly. The model of the vehicle to be scheduled may include a brand of the vehicle and a specific model of the vehicle. That is, when the first attribute information indicates the vehicle type required for the task to be scheduled, the vehicle type of the vehicle to be scheduled needs to be made to conform to the vehicle type required for the task to be scheduled when the vehicle to be scheduled is determined.
In addition, the current task state of the vehicle to be scheduled indicated by the second attribute information may include: whether the vehicle to be scheduled is in a task execution state. When the vehicle to be scheduled is in a task execution state, the fact that the vehicle to be scheduled currently has a transport task being executed or the task to be executed is accepted is indicated, and the volume of the vehicle to be scheduled is the difference between the total volume of the vehicle to be scheduled and the volume of the carried object or the difference between the total volume of the vehicle to be scheduled and the volume of the object corresponding to the task to be executed. Correspondingly, the loadable weight of the vehicle to be dispatched is the difference between the loadable total weight of the vehicle to be dispatched and the loaded weight, or the difference between the loadable total weight of the vehicle to be dispatched and the weight of the object corresponding to the accepted task to be executed. When the vehicle to be scheduled is in an unwatched state, namely, the vehicle to be scheduled is in an idle state, the volume of the vehicle to be scheduled is the total volume of the vehicle to be scheduled, and the weight of the vehicle to be scheduled is the total weight of the vehicle to be scheduled.
When the vehicle to be scheduled is in a task execution state, the task execution state can also indicate the remaining running distance, the vehicle duration and the like from the completion of task execution. When the vehicle to be scheduled is in an idle state, the vehicle to be scheduled, of which the volume is not smaller than the volume of the article corresponding to the task to be scheduled and the weight of the article corresponding to the task to be scheduled, can be allocated to the task to be scheduled according to the size relation of the distance between the vehicle to be scheduled and the starting position of the task to be scheduled. When the first attribute information indicates the number of the articles corresponding to the task to be scheduled, the weight and/or the volume corresponding to the task to be scheduled can be determined according to the number and the article attribute (such as the specific gravity of the articles and the like).
When the vehicle to be scheduled is in a task execution state, the vehicle to be scheduled, which can be used for allocating the volume which is not smaller than the volume of the article corresponding to the task to be scheduled and the weight which is not smaller than the weight of the article corresponding to the task to be scheduled, to the task to be scheduled according to the size relation of the distance between the vehicle to be scheduled and the starting position of the task to be scheduled by combining the factors such as the residual running distance of the vehicle to be scheduled from the task execution completion, the vehicle using time length and the like. In practical application, when the vehicle to be scheduled is in the task execution state, the method can further determine whether the vehicle to be scheduled can accept a new task to be scheduled or not by communicating with a driver of the vehicle to be scheduled, so as to determine whether the vehicle to be scheduled can allocate the new task to be scheduled or not.
For example, when the first attribute information indicates the destination position of the task to be scheduled, the running path of the task to be scheduled can be determined according to the destination position and the starting position of the task to be scheduled, so that the running distance corresponding to the task to be scheduled can be determined, and then the vehicle duration of the task to be scheduled can be determined according to the road condition (such as whether congestion and the number of traffic lights) of the running path in the map. And then the vehicle to be scheduled which can execute the task to be scheduled can be determined according to the vehicle duration of the task to be scheduled and the task execution state of the vehicle to be scheduled. It can be understood that when the first attribute information of the task to be scheduled indicates the running distance, the vehicle duration of the task to be scheduled can also be determined according to the running distance and the road condition displayed by the map.
It should be noted that, the driving duration of the task to be scheduled not only indicates the driving duration from the starting position to the destination position, but also indicates the starting period of the task to be scheduled for starting execution. For example, the time period of the to-be-scheduled task for indicating the article to be collected is 8:00-9:00, that is, the time period of the to-be-scheduled task for starting to collect the article is 8:00-9:00 when the to-be-scheduled vehicle is required to start collecting the article from 8:00-9:00. The road conditions of the running paths of the tasks to be scheduled are also determined according to the starting time period, that is, the running time of the vehicles to be scheduled in the running paths can be calculated according to the starting time period of the tasks to be scheduled, and the corresponding road conditions can be determined based on the running time.
By combining the embodiments, when the vehicle to be scheduled is allocated to the task to be scheduled, the vehicle to be scheduled can be determined from the multiple dimensions indicated by the first attribute information of the task to be scheduled and the second attribute information of the multiple dimensions of the vehicle to be scheduled, so that accuracy and flexibility of vehicle scheduling are improved.
In addition, in the vehicle dispatching method provided by the embodiment of the invention, each task to be dispatched, the first attribute information of the task to be dispatched, the vehicle to be dispatched and the second attribute information of the vehicle to be dispatched, which are searched in the dispatching range, can be displayed in a map (such as a GIS map), so that the task to be dispatched and the vehicle to be dispatched can be visually checked, and the improvement of the vehicle dispatching efficiency and the improvement of the user experience are facilitated. Further, after the allocation of the vehicle to be scheduled is completed, information (such as a starting position and a starting time period) of the corresponding task to be scheduled can be directly sent to a driver of the vehicle to be scheduled.
According to the method for scheduling the vehicle, disclosed by the embodiment of the invention, the vehicle to be scheduled can be automatically distributed to the task to be scheduled according to the first attribute information of the task to be scheduled and the second attribute information of the vehicle to be scheduled, wherein the first attribute information indicates the starting position of the task to be scheduled, and the second attribute information indicates the current position of the vehicle to be scheduled, so that the vehicle to be scheduled is automatically scheduled according to at least the starting position of the task to be scheduled and the current position of the vehicle to be scheduled, and the vehicle scheduling efficiency is further improved.
Fig. 5 is a schematic diagram of main modules of an apparatus for vehicle scheduling according to an embodiment of the present invention.
As shown in fig. 5, a vehicle scheduling apparatus 500 according to an embodiment of the present invention includes: a task determination module 501, a vehicle determination module 502, and a scheduling module 503; wherein, the liquid crystal display device comprises a liquid crystal display device,
the task determining module 501 is configured to determine a task to be scheduled, and first attribute information of the task to be scheduled, where the first attribute information indicates a starting position of the task to be scheduled;
the vehicle determining module 502 is configured to determine, according to a start position indicated by the first attribute information, one or more vehicles to be scheduled corresponding to the start position, and second attribute information of the vehicles to be scheduled, where the second attribute information indicates a current position of the vehicles to be scheduled;
The scheduling module 503 is configured to allocate the vehicle to be scheduled to the task to be scheduled according to the first attribute information and the second attribute information.
In one embodiment of the present invention, the vehicle determining module 502 is configured to determine a scheduling range according to the starting position and the scheduling radius, and determine the vehicle to be scheduled according to the scheduling range.
In one embodiment of the present invention, the vehicle determining module 502 is configured to determine, when the number of tasks to be scheduled is multiple, a center position of the multiple tasks to be scheduled and the scheduling radius according to a starting position of each task to be scheduled, and determine the scheduling range according to the center position and the scheduling radius.
In one embodiment of the present invention, the vehicle determining module 502 is configured to determine, when the number of tasks to be scheduled is at least three, a center of a circle corresponding to the three tasks to be scheduled by using a three-point method according to starting positions corresponding to the three tasks to be scheduled in the tasks to be scheduled respectively; and determining the center positions of a plurality of tasks to be scheduled and the scheduling radius according to the circle center of the circle and the starting positions of other tasks to be scheduled except the three tasks to be scheduled in the tasks to be scheduled.
In one embodiment of the present invention, the vehicle determining module 502 is configured to search for a vehicle in a scheduling range corresponding to the center position and the scheduling radius; when the vehicle is found, taking the found vehicle as the vehicle to be dispatched; and when the vehicle is not found, expanding the scheduling range, and finding the vehicle in the expanded scheduling range.
In one embodiment of the present invention, the scheduling module 503 is configured to calculate a distance between the current position and the starting position, and allocate the vehicle to be scheduled to the task to be scheduled according to the order of the distance from the small to the large.
In one embodiment of the present invention, the scheduling module 503 is configured to calculate, when the number of tasks to be scheduled is multiple, a total distance between the vehicle to be scheduled and each task to be scheduled according to a distance between the current position and a start position of each task to be scheduled, and allocate the vehicle to be scheduled to the task to be scheduled according to an order of the total distance from small to large.
In one embodiment of the present invention, the scheduling module 503 is configured to allocate the volume of the to-be-scheduled vehicle to the to-be-scheduled task, where the volume of the to-be-scheduled vehicle is not smaller than the volume of the item corresponding to the to-be-scheduled task, and the weight of the to-be-scheduled vehicle is not smaller than the weight of the item corresponding to the to-be-scheduled task.
According to the vehicle dispatching device, according to the first attribute information of the task to be dispatched and the second attribute information of the vehicle to be dispatched, the first attribute information indicates the starting position of the task to be dispatched, and the second attribute information indicates the current position of the vehicle to be dispatched, so that the vehicle to be dispatched can be automatically distributed to the task to be dispatched at least according to the starting position of the task to be dispatched and the current position of the vehicle to be dispatched, automatic dispatching of the vehicle is achieved, and vehicle dispatching efficiency is improved.
Fig. 6 illustrates an exemplary system architecture 600 of a method of vehicle dispatch or an apparatus of vehicle dispatch to which embodiments of the present invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605. The network 604 is used as a medium to provide communication links between the terminal devices 601, 602, 603 and the server 605. The network 604 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 605 via the network 604 using the terminal devices 601, 602, 603 to receive or send messages, etc. Various communication client applications, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc., may be installed on the terminal devices 601, 602, 603.
The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 605 may be a server providing various services, such as a background management server providing support for shopping-type websites browsed by the user using the terminal devices 601, 602, 603. The background management server can analyze and other processing on the received data such as the product information inquiry request and the like, and feed back processing results (such as target push information and product information) to the terminal equipment.
It should be noted that, the method for scheduling vehicles provided in the embodiment of the present invention is generally executed by the server 605, and accordingly, the device for scheduling vehicles is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 7, there is illustrated a schematic diagram of a computer system 700 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU) 701, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the system 700 are also stored. The CPU 701, ROM 702, and RAM 703 are connected to each other through a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input section 706 including a keyboard, a mouse, and the like; an output portion 707 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 708 including a hard disk or the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. The drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read therefrom is mounted into the storage section 708 as necessary.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 709, and/or installed from the removable medium 711. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 701.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of 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 also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams 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.
The modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor includes a task determination module, a vehicle determination module, and a scheduling module. The names of these modules do not constitute a limitation of the module itself in some cases, and for example, the task determination module may also be described as "a module that determines a task to be scheduled and first attribute information of the task to be scheduled".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled; determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled; and distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information.
According to the technical scheme provided by the embodiment of the invention, the vehicle to be scheduled can be automatically distributed to the task to be scheduled according to the first attribute information of the task to be scheduled and the second attribute information of the vehicle to be scheduled, wherein the first attribute information indicates the starting position of the task to be scheduled, and the second attribute information indicates the current position of the vehicle to be scheduled, so that the vehicle to be scheduled can be automatically scheduled according to at least the starting position of the task to be scheduled and the current position of the vehicle to be scheduled, and the vehicle scheduling efficiency is further improved.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (9)
1. A method of vehicle dispatch comprising:
determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled;
determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled;
distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information;
the number of tasks to be scheduled is at least three, and the determining one or more vehicles to be scheduled corresponding to the starting position according to the starting position indicated by the first attribute includes:
Determining the circle centers of the circumferences corresponding to the three tasks to be scheduled by adopting a three-point method according to the starting positions respectively corresponding to the three tasks to be scheduled in the tasks to be scheduled;
determining the center positions and the dispatching radiuses of a plurality of tasks to be dispatched according to the circle center of the circle and the starting positions of other tasks to be dispatched except the three tasks to be dispatched;
determining a scheduling range according to the central position and the scheduling radius;
and determining the vehicle to be scheduled according to the scheduling range.
2. The method of claim 1, wherein the determining the vehicle to be scheduled according to the scheduling scope comprises:
searching a vehicle in a dispatching range corresponding to the central position and the dispatching radius;
when the vehicle is found, taking the found vehicle as the vehicle to be dispatched;
and when the vehicle is not found, expanding the scheduling range, and finding the vehicle in the expanded scheduling range.
3. The method of claim 1, wherein the assigning the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information comprises:
And calculating the distance between the current position and the starting position, and distributing the vehicles to be scheduled for the tasks to be scheduled according to the sequence of the distances from small to large.
4. The method of claim 3, wherein when the task to be scheduled is a plurality of tasks,
and calculating the total distance between the vehicle to be scheduled and each task to be scheduled according to the distance between the current position and the starting position of each task to be scheduled, and distributing the vehicle to be scheduled for the task to be scheduled according to the sequence of the total distance from small to large.
5. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the first attribute information at least indicates the volume of the article corresponding to the task to be scheduled and/or the weight of the article corresponding to the task to be scheduled, and any one or more of the following: the method comprises the steps of determining a target position of a task to be scheduled, a vehicle duration corresponding to the task to be scheduled, a running distance corresponding to the task to be scheduled, the number of articles corresponding to the task to be scheduled and a vehicle type required by the task to be scheduled;
the second attribute information further indicates at least a volume and/or a payload of the vehicle to be scheduled, and any one or more of: the current task state of the vehicle to be scheduled and the vehicle type of the vehicle to be scheduled.
6. The method of claim 5, wherein the assigning the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information comprises:
and distributing the to-be-scheduled vehicles with the volume which is not smaller than the volume of the article corresponding to the to-be-scheduled task and the weight which is not smaller than the weight of the article corresponding to the to-be-scheduled task.
7. An apparatus for scheduling a vehicle, comprising: the system comprises a task determining module, a vehicle determining module and a scheduling module; wherein, the liquid crystal display device comprises a liquid crystal display device,
the task determining module is used for determining a task to be scheduled and first attribute information of the task to be scheduled, wherein the first attribute information indicates a starting position of the task to be scheduled;
the vehicle determining module is used for determining one or more vehicles to be scheduled corresponding to the initial position and second attribute information of the vehicles to be scheduled according to the initial position indicated by the first attribute information, wherein the second attribute information indicates the current position of the vehicles to be scheduled; the method is particularly used for: the number of the tasks to be scheduled is at least three, and the circle centers of the circumferences corresponding to the three tasks to be scheduled are determined by adopting a three-point method according to the starting positions corresponding to the three tasks to be scheduled in the tasks to be scheduled; determining the center positions and the dispatching radiuses of a plurality of tasks to be dispatched according to the circle center of the circle and the starting positions of other tasks to be dispatched except the three tasks to be dispatched; determining a scheduling range according to the central position and the scheduling radius; determining the vehicle to be scheduled according to the scheduling range;
And the scheduling module is used for distributing the vehicle to be scheduled for the task to be scheduled according to the first attribute information and the second attribute information.
8. An electronic device for vehicle dispatch, comprising:
one or more processors;
storage means for storing one or more programs,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-6.
9. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010224894.8A CN113449053B (en) | 2020-03-26 | 2020-03-26 | Vehicle scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010224894.8A CN113449053B (en) | 2020-03-26 | 2020-03-26 | Vehicle scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113449053A CN113449053A (en) | 2021-09-28 |
| CN113449053B true CN113449053B (en) | 2023-09-26 |
Family
ID=77807246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010224894.8A Active CN113449053B (en) | 2020-03-26 | 2020-03-26 | Vehicle scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113449053B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101834903A (en) * | 2010-04-22 | 2010-09-15 | 惠州Tcl移动通信有限公司 | Taxi dispatching system, mobile terminal and information transceiving equipment |
| CN107545486A (en) * | 2016-06-28 | 2018-01-05 | 滴滴（中国）科技有限公司 | One kind uses car order processing method and server |
| CN109191826A (en) * | 2018-08-31 | 2019-01-11 | 北京图森未来科技有限公司 | A kind of vehicle dispatching method, vehicle scheduling server |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8875143B2 (en) * | 2009-12-31 | 2014-10-28 | Bmc Software, Inc. | Utility-optimized scheduling of time-sensitive tasks in a resource-constrained environment |
-
2020
- 2020-03-26 CN CN202010224894.8A patent/CN113449053B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101834903A (en) * | 2010-04-22 | 2010-09-15 | 惠州Tcl移动通信有限公司 | Taxi dispatching system, mobile terminal and information transceiving equipment |
| CN107545486A (en) * | 2016-06-28 | 2018-01-05 | 滴滴（中国）科技有限公司 | One kind uses car order processing method and server |
| CN109191826A (en) * | 2018-08-31 | 2019-01-11 | 北京图森未来科技有限公司 | A kind of vehicle dispatching method, vehicle scheduling server |
Non-Patent Citations (1)
| Title |
|---|
| GPS***在公交领域的应用;费小锋;祁同林;;科技信息(01);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113449053A (en) | 2021-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110645983B (en) | Path planning method, device and system for unmanned vehicle | |
| CN107767206B (en) | Order allocation method and device | |
| CN108492068B (en) | Method and device for path planning | |
| JP2021519735A (en) | Methods and equipment for transporting product shelves | |
| US20210312359A1 (en) | Method and device for scheduling automated guided vehicle | |
| CN107633358B (en) | Facility site selection and distribution method and device | |
| CN111178686B (en) | Distribution method and device of network appointment vehicles, electronic equipment and storage medium | |
| CN109345166B (en) | Method and apparatus for generating information | |
| KR20140109566A (en) | Server and Method for Providing Call Allocation Service | |
| CN111461383A (en) | Method and device for planning distribution path | |
| CN109934427B (en) | Method and device for generating item distribution scheme | |
| CN113128743A (en) | Goods picking path planning method and device | |
| CN113205300B (en) | Distribution vehicle scheduling method and device, electronic equipment and computer readable medium | |
| CN112200336A (en) | Method and device for planning vehicle driving path | |
| CN113449053B (en) | Vehicle scheduling method and device | |
| WO2019037368A1 (en) | Delivery task processing method and apparatus, electronic device, and computer storage medium | |
| JP2020140372A (en) | Information processing apparatus, information processing method, and program | |
| CN113919734A (en) | Order distribution method and device | |
| CN114202210A (en) | Task allocation method and device | |
| CN113919595A (en) | Shop distribution path planning method, device, equipment and storage medium | |
| CN109615159B (en) | Request processing method and device | |
| CN112486033A (en) | Simulation test method and device for equipment | |
| CN111553548B (en) | Goods picking method and device | |
| CN112446565A (en) | Method and device for matching vehicles for orders | |
| CN111835848B (en) | Data fragmentation method and device, electronic equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |