CN116187722A - Car dispatching method and system based on supply and demand quantity - Google Patents
Car dispatching method and system based on supply and demand quantity Download PDFInfo
- Publication number
- CN116187722A CN116187722A CN202310456573.4A CN202310456573A CN116187722A CN 116187722 A CN116187722 A CN 116187722A CN 202310456573 A CN202310456573 A CN 202310456573A CN 116187722 A CN116187722 A CN 116187722A
- Authority
- CN
- China
- Prior art keywords
- loading point
- loading
- vehicle
- available vehicles
- allocated
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Abstract
The invention discloses a dispatching method and system based on supply and demand quantity, and relates to the technical field of vehicle transportation. The method comprises the following steps: dividing a vehicle using area; determining a number of available vehicles within each pre-partitioned area; distributing all the pre-divided areas to each loading point, and determining the number of available vehicles distributed to each loading point; when the number of available vehicles distributed by at least one loading point does not meet the number of vehicle demands, a spanning tree connecting all loading points is established, and the number of available vehicles needing to be transferred on each side of the spanning tree is calculated; according to the number of available vehicles to be transferred on each side, adjusting the pre-divided area allocated to each loading point; and dispatching the car according to the pre-divided area allocated to each loading point. The invention can dynamically adjust the dispatching range, and the dispatching range is defined flexibly and efficiently, so that each dispatching point can meet the requirement of the vehicle at the lowest cost, thereby improving the dispatching efficiency and reducing the dispatching cost.
Description
Technical Field
The invention relates to the technical field of vehicle transportation, in particular to a vehicle dispatching method and system based on supply and demand quantity.
Background
At present, when a network freight platform provides a required transport capacity for a cargo owner, a vehicle is dispatched according to the ordered sequence and the idle condition of the vehicle, a rough vehicle dispatching range is firstly defined, the rough vehicle dispatching range is usually defined according to administrative areas or service areas, and then idle vehicles in the vehicle dispatching range are screened out for dispatching. The vehicle dispatching mode fails to consider the positions of the vehicles and the demand points and the size of the demand, the demarcation of the vehicle dispatching range is not flexible and efficient, the vehicle dispatching scheme is unreasonable, the efficiency is low, the cost is high, the vehicle dispatching range is difficult to dynamically adjust, and the practicability is poor.
Disclosure of Invention
The invention aims to solve the problems that the existing dispatching scheme fails to consider the positions of vehicles and demand points and the size of demand, the dispatching range is defined in an inflexible and efficient manner, the dispatching scheme is unreasonable, low in efficiency and high in cost, the dispatching range is difficult to dynamically adjust, and the practicability is poor.
In a first aspect, a dispatching method based on supply and demand quantity is provided, including:
dividing the vehicle using area according to a preset space index mode to obtain a plurality of pre-divided areas;
when at least two loading points of vehicles are needed, acquiring positions of all available vehicles, and determining the number of available vehicles in each pre-dividing area according to the positions of all the available vehicles;
distributing all the pre-divided areas to each loading point, and determining the number of available vehicles distributed to each loading point according to the number of available vehicles in each pre-divided area;
judging whether the number of available vehicles distributed to each loading point meets the vehicle demand number, when at least one loading point does not meet the vehicle demand number, building a spanning tree connected with all loading points, and calculating the number of available vehicles to be transferred on each side of the spanning tree;
according to the quantity of available vehicles to be transferred on each side, the pre-divided area allocated to each loading point is adjusted, so that the quantity of available vehicles allocated to each loading point meets the quantity of vehicle requirements;
and dispatching the car according to the pre-divided areas allocated to each loading point.
In one possible implementation of the first aspect, allocating all the pre-divided areas to each loading point specifically includes:
and respectively judging the distance between all the pre-divided areas and each loading point, and distributing each pre-divided area to the loading point with the minimum distance.
In one possible implementation of the first aspect, calculating the number of available vehicles that need to be transferred on each edge of the spanning tree specifically includes:
starting from the first loading point of the spanning tree in sequence, judging the number of available vehicles to be transferred at each loading point sequentially through the following steps:
and determining the number of available vehicles transferred to the current loading point of the next loading point adjacent to the current loading point according to the difference value between the number of the vehicle demands of the current loading point and the number of available vehicles distributed to the current loading point.
In one possible implementation manner of the first aspect, the pre-dividing area allocated to each loading point is adjusted according to the number of available vehicles to be transferred on each side, so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements, and specifically includes:
sequencing all the pre-divided areas of the first loading point from small to large according to the distance from the second loading point, and sequentially reassigning the pre-divided areas assigned to the first loading point to the second loading point according to the sequence from small to large until the number of available vehicles of the second loading point meets the number of vehicle requirements of the second loading point;
the first loading point is a loading point for turning out of the available vehicle, and the second loading point is a loading point for turning in the available vehicle.
In one possible implementation of the first aspect, after adjusting the pre-divided area allocated to each loading point according to the number of available vehicles to be transferred on each side so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements, the method further includes:
after the pre-divided area allocated to each loading point is adjusted, determining a gap difference value between the number of the loading points which do not meet the number of the vehicle demands and the number of the allocated available vehicles when the number of the available vehicles allocated to at least one loading point does not meet the number of the vehicle demands;
the gap difference value is distributed to all other loading points according to a preset proportion, and the number of available vehicles of the loading points which do not meet the number of the vehicle requirements is determined;
and selecting a pre-divided area from the rest of loading points to be allocated to the loading points which do not meet the number of the vehicle demands according to the number of the available vehicles which are allocated to the loading points which do not meet the number of the vehicle demands by the rest of loading points.
In a second aspect, there is provided a supply and demand quantity-based dispatching system, including:
the area dividing unit is used for dividing the vehicle area according to a preset space index mode to obtain a plurality of pre-divided areas;
the position processing unit is used for acquiring the positions of all available vehicles when the number of loading points of the vehicles is at least two, and determining the number of the available vehicles in each pre-dividing area according to the positions of all the available vehicles;
the area allocation unit is used for allocating all the pre-divided areas to each loading point, and determining the number of available vehicles allocated to each loading point according to the number of available vehicles in each pre-divided area;
the vehicle transfer calculation unit is used for judging whether the number of available vehicles distributed by each loading point meets the vehicle demand number, and when at least one loading point does not meet the vehicle demand number, a spanning tree connected with all loading points is established, and the number of available vehicles required to be transferred on each side of the spanning tree is calculated;
the area adjusting unit is used for adjusting the pre-divided areas allocated to each loading point according to the number of available vehicles to be transferred on each side, so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements;
and the dispatching unit is used for dispatching the car according to the pre-divided areas allocated to each car loading point.
In one possible implementation manner of the second aspect, the area allocation unit is specifically configured to determine distances between all the pre-divided areas and each loading point, and allocate each of the pre-divided areas to a loading point with a minimum distance.
In one possible implementation manner of the second aspect, the vehicle transfer calculation unit is specifically configured to sequentially determine, from a first loading point of the spanning tree, a number of available vehicles that need to be transferred at each loading point through the following steps:
and determining the number of available vehicles transferred to the current loading point of the next loading point adjacent to the current loading point according to the difference value between the number of the vehicle demands of the current loading point and the number of available vehicles distributed to the current loading point.
In one possible implementation of the second aspect, the area adjusting unit is specifically configured to sort all the pre-divided areas of the first loading point from small to large according to distances from the second loading point, and sequentially reassign the pre-divided areas assigned to the first loading point to the second loading point in order from small to large according to the distances until the number of available vehicles of the second loading point meets the number of vehicle requirements of the second loading point;
the first loading point is a loading point for turning out of the available vehicle, and the second loading point is a loading point for turning in the available vehicle.
In one possible implementation of the second aspect, the area adjustment unit is further configured to determine, when the number of available vehicles allocated to at least one loading point does not meet the number of vehicle demands after adjusting the pre-divided area allocated to each loading point, a gap difference value between the number of vehicle demands of the loading point that does not meet the number of vehicle demands and the number of available vehicles allocated to the loading point; the gap difference value is distributed to all other loading points according to a preset proportion, and the number of available vehicles of the loading points which do not meet the number of the vehicle requirements is determined; and selecting a pre-divided area from the rest of loading points to be allocated to the loading points which do not meet the number of the vehicle demands according to the number of the available vehicles which are allocated to the loading points which do not meet the number of the vehicle demands by the rest of loading points.
According to the method, the grid structure is generated by dividing the vehicle area, the grids are distributed according to the vehicle requirements of each loading point, the corresponding available vehicles are distributed for each loading point, the positions of the vehicles and the required points and the size of the required quantity are considered, then the number of the available vehicles distributed to each loading point is adjusted through the spanning tree, the vehicle dispatching range can be dynamically adjusted, the vehicle dispatching range is flexibly and efficiently defined, and each loading point can meet the vehicle requirements at the lowest cost, so that the vehicle dispatching efficiency is improved, and the vehicle dispatching cost is reduced.
Additional aspects of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a schematic flow chart of a dispatching method according to an embodiment of the present invention;
FIG. 2 is a schematic view of vehicle area division according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a preliminary allocation result provided by an embodiment of a dispatching method of the present invention;
FIG. 4 is a schematic diagram of an adjusted distribution result provided by an embodiment of a dispatching method according to the present invention;
fig. 5 is a schematic structural diagram of a dispatching system according to an embodiment of the present invention.
Detailed Description
The principles and features of the present invention are described below with reference to the drawings, the illustrated embodiments are provided for illustration only and are not intended to limit the scope of the present invention.
As shown in fig. 1, a flow chart provided for an embodiment of a dispatching method according to the present invention includes:
s1, dividing a vehicle area according to a preset spatial index mode to obtain a plurality of pre-divided areas;
it should be noted that a conventional spatial index manner may be used, for example, an H3 index may be used, and in addition, the vehicle area may be divided into custom shapes, but such custom shapes should be capable of being densely tiled so as to cover the entire vehicle area, for example, triangles, quadrilaterals, hexagons, and the like may be used.
As shown in fig. 2, an exemplary partitioning method is given, each grid being a pre-partitioned area.
S2, when at least two loading points need to be used, acquiring positions of all available vehicles, and determining the number of available vehicles in each pre-partitioned area according to the positions of all available vehicles;
it should be noted that, the method of the present embodiment may be deployed in a server in a program or software manner, and the corresponding front-end program may be deployed in a terminal, and then the position of the available vehicle and the position of the loading point may be acquired through the terminal communicating with the server.
For example, if a driver searches for a cargo source on a platform provided by the server or entrusts the platform to distribute the cargo source, the current longitude and latitude coordinates of the vehicle can be uploaded in the APP of the platform, and the cargo owner can also upload the longitude and latitude coordinates of the loading point when the platform searches for the driver or entrusts the platform to distribute the driver. Thus, the platform palm holds a specific position of the empty car of the registered driver at a certain moment and a specific position of all loading points at the moment.
And then calling the map plug-in by calling an API interface, and determining the positions of the available vehicles and the positions of the loading points in the vehicle using area, thereby determining the number of available vehicles in each pre-partitioned area.
S3, distributing all the pre-divided areas to each loading point, and determining the number of available vehicles distributed to each loading point according to the number of available vehicles in each pre-divided area;
it should be noted that an allocation rule may be set in advance, and all the pre-divided areas may be allocated to each loading point. For example, all the pre-divided regions may be allocated to each loading point according to the nearest neighbor principle, or all the pre-divided regions may be allocated to each loading point in terms of actual road mileage between the pre-divided regions and the loading point.
For example, if the pre-divided areas are divided according to the nearest neighbor principle, the pre-divided areas are allocated to which loading points with the nearest straight line distance from which loading point; if the road is divided according to the actual road mileage, the pre-divided area is closest to the actual road of which loading point, and the pre-divided area is allocated to which loading point.
S4, judging whether the number of available vehicles distributed to each loading point meets the vehicle demand number, when the number of available vehicles distributed to at least one loading point does not meet the vehicle demand number, building a spanning tree connected with all loading points, and calculating the number of available vehicles to be transferred on each side of the spanning tree;
it should be noted that when the number of available vehicles is greater than or equal to the vehicle demand number, the vehicle demand number is considered to be satisfied.
Alternatively, a prim minimum spanning tree algorithm may be used to generate a spanning tree connecting all loading points, or all loading points may be serially connected in a preset order to generate a spanning tree connecting all loading points.
It should be understood that if the number of vehicles from each loading point is enough, the allocation is satisfied, and then the vehicle is directly dispatched according to the allocation result, and no subsequent flow is performed.
S5, adjusting the pre-divided areas allocated to each loading point according to the number of available vehicles to be transferred on each side, so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements;
specifically, if the number of available vehicles allocated to a certain loading point is insufficient, available vehicles with more than the remaining loading points may be allocated to the loading point with insufficient number, and then the nearest pre-divided area with the remaining loading points being away from the loading point with insufficient number may be divided into the loading point with insufficient number.
And S6, dispatching the car according to the pre-divided areas allocated to each loading point.
In the following, a specific example will be described, where vehicles in each pre-divided area are different or there may be no vehicles, and for convenience of description, a case where there is exactly one available vehicle in each pre-divided area will be described.
Assume that the area of the loading area is shown in fig. 2, in which there are 5 different owners, corresponding to 5 loading points { a, B, C, D, E }, and the number of loading points for each loading point is { a:162, B:108, C:217, D:101, E:91}, respectively.
First, the service area is pre-divided using the H3 index, and each pre-divided block is a hexagon or a pentagon.
Then, preliminary allocation is performed according to the nearest neighbor principle, and for any grid containing empty vehicles, the grid distance A, B, C, D, E, which is the distance of 5 loading points, is calculated, and the grid is allocated to C on the assumption that the distance C is nearest. The result of the preliminary allocation according to the nearest neighbor principle is shown in fig. 3.
Then, the number of vehicles preliminarily allocated to each loading point is calculated. In this embodiment, after preliminary distribution, the number of vehicles at each loading point is { A:125, B:119, C:92, D:191, E:152}. As compared with the number of vehicles, A, C was found to be insufficient in two-way allocation and B, D, E was found to be redundant in three-way allocation.
The minimum spanning tree is then constructed as "A-B-C-D-E" using the prim algorithm. The number of vehicles allocated between different loading points is transferred along the spanning tree. According to the preliminary allocation result and the demand of each loading point, the scheme for carrying out quantity transfer along the spanning tree can be calculated in the embodiment. The transfer scheme calculation results in this embodiment are { E- > D:61, D- > C:151, C- > B:26, B- > A:37}.
Specifically, the number of allocations and the number of targets for each demand point are set to the number that needs to be adjusted as shown in table 1.
TABLE 1 number of allocations and target number for each demand point to get the number to be adjusted
In table 1, the adjustment number is a column, + indicates that a vehicle needs to be turned in, and-indicates that a vehicle needs to be turned out, for example, a demand point a needs to be turned in 37 vehicles, and a demand point B needs to be turned out 11 vehicles.
The amount of movement is then calculated along the edges of the minimum spanning tree, either in the order "A-B-C-D-E" or in the order "E-D-C-B-A".
Taking the order of "A-B-C-D-E" as an example, the adjustment number of A is "+37", so the movement amount on "A-B" is "B- > A:37", i.e. B is transferred to A37 available vehicles.
The adjustment number of B is "-11", at which time "B- > A:37" has occurred, so the actual adjustment number of B should be "+ (37-11)", the amount of movement along the next edge "B-C" of the spanning tree is "C- > B:26", i.e., C is transferred to B26 available cars.
The adjustment number of C is "+125", at which time "C- > B:26" has occurred, so the actual adjustment number of C should be "+ (125+26)", and "D- > C:151" can be obtained, i.e., D is transferred to C151 available cars.
The adjustment number of D is "-90", at which point "D- > C:151" has occurred, so the actual adjustment number of D should be "+ (151-90)", and "E- > D:61" can be obtained, i.e., E is transferred to D61 available cars.
And then, transferring the pre-divided areas according to the corresponding rules.
For example, the processing method of "E- > D:61" is: all grids allocated to E are ordered from small to large according to the distance from D, and the first 61 grids are transferred to D.
The result of the execution is shown in fig. 4.
According to the method, the grid structure is generated by dividing the vehicle area, the grids are distributed according to the vehicle requirements of each loading point, corresponding available vehicles are distributed for each loading point, the positions of vehicles and the required points and the size of the required quantity are considered, then the number of available vehicles distributed to each loading point is adjusted through the spanning tree, the vehicle dispatching range can be dynamically adjusted, the vehicle dispatching range is flexibly and efficiently defined, the vehicle dispatching requirements can be met by each loading point at the lowest cost, accordingly, the vehicle dispatching efficiency is improved, and the vehicle dispatching cost is reduced.
Optionally, in some possible embodiments, all the pre-divided areas are allocated to each loading point, specifically including:
and respectively judging the distance between all the pre-divided areas and each loading point, and distributing each pre-divided area to the loading point with the smallest distance.
The distance here may be a euclidean distance.
By the mode provided by the embodiment, the distribution efficiency can be improved, the occupation of computing resources is reduced, and the dispatching efficiency is improved.
Optionally, in some possible embodiments, calculating the number of available vehicles that need to be transferred on each side of the spanning tree specifically includes:
starting from the first loading point of the spanning tree in sequence, judging the number of available vehicles to be transferred at each loading point sequentially through the following steps:
and determining the number of available vehicles transferred to the current loading point of the next loading point adjacent to the current loading point according to the difference value between the number of the vehicle demands of the current loading point and the number of available vehicles distributed to the current loading point.
The number of available vehicles to be transferred at each loading point is judged in the mode provided by the embodiment, so that the distribution of the vehicles is more reasonable.
Optionally, in some possible embodiments, the pre-divided area allocated to each loading point is adjusted according to the number of available vehicles to be transferred on each side, so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements, and specifically includes:
sequencing all the pre-divided areas of the first loading point from small to large according to the distance from the second loading point, and sequentially reassigning the pre-divided areas assigned to the first loading point to the second loading point according to the sequence from small to large until the number of available vehicles of the second loading point meets the number of vehicle requirements of the second loading point;
the first loading point is a loading point for turning out of the available vehicle, and the second loading point is a loading point for turning in the available vehicle.
The distance in the present embodiment may be a euclidean distance or an actual distance of a road.
For example, assuming that the loading point B1 needs to transfer N vehicles to the loading point B2, all the pre-divided regions allocated to B1 may be sorted from small to large according to the distance from B2, and the first N regions with the smallest number are allocated to B2, and the number of empty vehicles in the N regions is only required to be equal to or greater than N.
By reassigning the pre-divided areas from the distance, vehicles close to the distance can be preferentially adjusted, and the cost of vehicle calling is reduced.
Optionally, in some possible embodiments, after adjusting the pre-divided area allocated to each loading point according to the number of available vehicles to be transferred on each side so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements, the method further includes:
after the pre-divided area allocated to each loading point is adjusted, determining a gap difference value between the number of the loading points which does not meet the number of the vehicle demands and the number of the allocated available vehicles when the number of the available vehicles allocated to at least one loading point does not meet the number of the vehicle demands;
the gap difference value is distributed to all other loading points according to a preset proportion, and the number of available vehicles of the loading points which do not meet the number of vehicle requirements is determined;
and selecting a pre-divided area from the rest loading points to be allocated to the loading points which do not meet the number of the vehicle demands according to the number of the available vehicles which are allocated to the loading points which do not meet the number of the vehicle demands by the rest loading points.
It should be noted that the preset proportion may be set according to actual requirements, may be distributed evenly, or may be set in different proportions.
For example, assuming that 10 vehicles are missing at loading point a after allocation, the remaining 5 loading points may each transfer 2 available vehicles to loading point a.
If a transfer scheme meeting the demand of all loading points cannot be obtained, the total empty vehicle quantity is insufficient, and the quantity of the gaps is evenly or proportionally distributed to all the loading points, so that the vehicle demands of all the loading points can be evenly met.
The invention also provides a dispatching system based on the supply and demand quantity, as shown in fig. 5, comprising:
the area dividing unit is used for dividing the vehicle area according to a preset space index mode to obtain a plurality of pre-divided areas;
the position processing unit is used for acquiring the positions of all available vehicles when the loading points of the vehicles are at least two, and determining the number of the available vehicles in each pre-partitioned area according to the positions of all the available vehicles;
the area allocation unit is used for allocating all the pre-divided areas to each loading point, and determining the number of available vehicles allocated to each loading point according to the number of available vehicles in each pre-divided area;
the vehicle transfer calculation unit is used for judging whether the number of available vehicles distributed to each loading point meets the vehicle demand number, and when the number of available vehicles distributed to at least one loading point does not meet the vehicle demand number, a spanning tree connected with all the loading points is established, and the number of available vehicles needing to be transferred on each side of the spanning tree is calculated;
the area adjusting unit is used for adjusting the pre-divided areas allocated to each loading point according to the number of available vehicles to be transferred on each side, so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements;
and the dispatching unit is used for dispatching the vehicles according to the pre-divided areas allocated to each loading point.
According to the method, the grid structure is generated by dividing the vehicle area, the grids are distributed according to the vehicle requirements of each loading point, corresponding available vehicles are distributed for each loading point, the positions of vehicles and the required points and the size of the required quantity are considered, then the number of available vehicles distributed to each loading point is adjusted through the spanning tree, the vehicle dispatching range can be dynamically adjusted, the vehicle dispatching range is flexibly and efficiently defined, the vehicle dispatching requirements can be met by each loading point at the lowest cost, accordingly, the vehicle dispatching efficiency is improved, and the vehicle dispatching cost is reduced.
Optionally, in some possible embodiments, the area allocation unit is specifically configured to determine distances between all the pre-divided areas and each loading point, and allocate each pre-divided area to a loading point with a minimum distance.
Optionally, in some possible embodiments, the vehicle transfer calculating unit is specifically configured to sequentially determine, from a first loading point of the spanning tree, a number of available vehicles that need to be transferred at each loading point through the following steps:
and determining the number of available vehicles transferred to the current loading point of the next loading point adjacent to the current loading point according to the difference value between the number of the vehicle demands of the current loading point and the number of available vehicles distributed to the current loading point.
Optionally, in some possible embodiments, the area adjusting unit is specifically configured to sort all the pre-divided areas of the first loading point from small to large according to the distance from the second loading point, and sequentially reassign the pre-divided areas assigned to the first loading point to the second loading point in order from small to large according to the distance until the number of available vehicles of the second loading point meets the number of vehicle demands of the second loading point;
the first loading point is a loading point for turning out of the available vehicle, and the second loading point is a loading point for turning in the available vehicle.
Optionally, in some possible embodiments, the area adjusting unit is further configured to determine, after adjusting the pre-divided area allocated to each loading point, a gap difference value between the number of vehicle demands of the loading points that does not meet the number of vehicle demands and the number of available vehicles allocated to the loading point when the number of available vehicles allocated to the at least one loading point does not meet the number of vehicle demands; the gap difference value is distributed to all other loading points according to a preset proportion, and the number of available vehicles of the loading points which do not meet the number of vehicle requirements is determined; and selecting a pre-divided area from the rest loading points to be allocated to the loading points which do not meet the number of the vehicle demands according to the number of the available vehicles which are allocated to the loading points which do not meet the number of the vehicle demands by the rest loading points.
It should be understood that the foregoing embodiments are product embodiments corresponding to the previous method embodiments, and the description of the product embodiments may refer to the description of the previous method embodiments, and will not be repeated herein.
It is understood that any combination of the above embodiments can be made by a person skilled in the art without departing from the concept of the invention, and the combination is within the scope of the invention.
The reader will appreciate that in the description of this specification, a description of terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the method embodiments described above are merely illustrative, e.g., the division of steps is merely a logical function division, and there may be additional divisions of actual implementation, e.g., multiple steps may be combined or integrated into another step, or some features may be omitted or not performed.
The above-described method, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention is essentially or a part contributing to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods of the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-only memory (ROM), a random access memory (RAM, randomAccessMemory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The present invention is not limited to the above embodiments, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the present invention, and these modifications and substitutions are intended to be included in the scope of the present invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.
Claims (10)
1. A supply and demand quantity-based dispatching method, comprising:
dividing the vehicle using area according to a preset space index mode to obtain a plurality of pre-divided areas;
when at least two loading points of vehicles are needed, acquiring positions of all available vehicles, and determining the number of available vehicles in each pre-dividing area according to the positions of all the available vehicles;
distributing all the pre-divided areas to each loading point, and determining the number of available vehicles distributed to each loading point according to the number of available vehicles in each pre-divided area;
judging whether the number of available vehicles distributed to each loading point meets the vehicle demand number, when at least one loading point does not meet the vehicle demand number, building a spanning tree connected with all loading points, and calculating the number of available vehicles to be transferred on each side of the spanning tree;
according to the quantity of available vehicles to be transferred on each side, the pre-divided area allocated to each loading point is adjusted, so that the quantity of available vehicles allocated to each loading point meets the quantity of vehicle requirements;
and dispatching the car according to the pre-divided areas allocated to each loading point.
2. The supply and demand based dispatching method according to claim 1, wherein assigning all the pre-divided areas to each loading point specifically comprises:
and respectively judging the distance between all the pre-divided areas and each loading point, and distributing each pre-divided area to the loading point with the minimum distance.
3. The supply and demand based dispatching method according to claim 1, wherein calculating the number of available vehicles to be transferred on each side of the spanning tree comprises:
starting from the first loading point of the spanning tree in sequence, judging the number of available vehicles to be transferred at each loading point sequentially through the following steps:
and determining the number of available vehicles transferred to the current loading point of the next loading point adjacent to the current loading point according to the difference value between the number of the vehicle demands of the current loading point and the number of available vehicles distributed to the current loading point.
4. The supply and demand quantity-based dispatching method according to claim 1, wherein the pre-divided area allocated to each loading point is adjusted according to the quantity of available vehicles to be transferred on each side, so that the quantity of available vehicles allocated to each loading point meets the quantity of vehicle demands, and the method specifically comprises the following steps:
sequencing all the pre-divided areas of the first loading point from small to large according to the distance from the second loading point, and sequentially reassigning the pre-divided areas assigned to the first loading point to the second loading point according to the sequence from small to large until the number of available vehicles of the second loading point meets the number of vehicle requirements of the second loading point;
the first loading point is a loading point for turning out of the available vehicle, and the second loading point is a loading point for turning in the available vehicle.
5. The supply-and-demand quantity-based dispatching method according to any one of claims 1 to 4, wherein after adjusting the pre-divided area allocated to each loading point according to the quantity of available vehicles to be transferred on each side so that the quantity of available vehicles allocated to each loading point satisfies the quantity of vehicle demands, the method further comprises:
after the pre-divided area allocated to each loading point is adjusted, determining a gap difference value between the number of the loading points which do not meet the number of the vehicle demands and the number of the allocated available vehicles when the number of the available vehicles allocated to at least one loading point does not meet the number of the vehicle demands;
the gap difference value is distributed to all other loading points according to a preset proportion, and the number of available vehicles of the loading points which do not meet the number of the vehicle requirements is determined;
and selecting a pre-divided area from the rest of loading points to be allocated to the loading points which do not meet the number of the vehicle demands according to the number of the available vehicles which are allocated to the loading points which do not meet the number of the vehicle demands by the rest of loading points.
6. A supply and demand quantity-based dispatching system, comprising:
the area dividing unit is used for dividing the vehicle area according to a preset space index mode to obtain a plurality of pre-divided areas;
the position processing unit is used for acquiring the positions of all available vehicles when the number of loading points of the vehicles is at least two, and determining the number of the available vehicles in each pre-dividing area according to the positions of all the available vehicles;
the area allocation unit is used for allocating all the pre-divided areas to each loading point, and determining the number of available vehicles allocated to each loading point according to the number of available vehicles in each pre-divided area;
the vehicle transfer calculation unit is used for judging whether the number of available vehicles distributed by each loading point meets the vehicle demand number, and when at least one loading point does not meet the vehicle demand number, a spanning tree connected with all loading points is established, and the number of available vehicles required to be transferred on each side of the spanning tree is calculated;
the area adjusting unit is used for adjusting the pre-divided areas allocated to each loading point according to the number of available vehicles to be transferred on each side, so that the number of available vehicles allocated to each loading point meets the number of vehicle requirements;
and the dispatching unit is used for dispatching the car according to the pre-divided areas allocated to each car loading point.
7. The supply and demand number-based dispatching system according to claim 6, wherein the area allocation unit is specifically configured to determine distances between all the pre-divided areas and each loading point, and allocate each of the pre-divided areas to a loading point with a minimum distance.
8. The supply and demand number-based dispatching system according to claim 6, wherein the vehicle transfer calculation unit is specifically configured to sequentially determine, from a first loading point of the spanning tree, a number of available vehicles that need to be transferred at each loading point, by:
and determining the number of available vehicles transferred to the current loading point of the next loading point adjacent to the current loading point according to the difference value between the number of the vehicle demands of the current loading point and the number of available vehicles distributed to the current loading point.
9. The supply and demand based dispatch system of claim 6, wherein the area adjustment unit is specifically configured to sort all pre-divided areas of a first loading point from a small distance to a large distance from the second loading point, and sequentially reassign the pre-divided areas assigned to the first loading point to the second loading point in order from the small distance to the large distance until the number of available vehicles of the second loading point meets the number of vehicle demands of the second loading point;
the first loading point is a loading point for turning out of the available vehicle, and the second loading point is a loading point for turning in the available vehicle.
10. The supply-demand quantity-based dispatching system according to any one of claims 6 to 9, wherein the area adjustment unit is further configured to determine a gap difference value between a quantity of demand for vehicles at a loading point that does not meet the quantity of demand for vehicles and a quantity of available vehicles allocated to at least one loading point when the quantity of available vehicles allocated to the loading point does not meet the quantity of demand for vehicles after adjustment of the pre-divided area allocated to each loading point; the gap difference value is distributed to all other loading points according to a preset proportion, and the number of available vehicles of the loading points which do not meet the number of the vehicle requirements is determined; and selecting a pre-divided area from the rest of loading points to be allocated to the loading points which do not meet the number of the vehicle demands according to the number of the available vehicles which are allocated to the loading points which do not meet the number of the vehicle demands by the rest of loading points.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310456573.4A CN116187722A (en) | 2023-04-26 | 2023-04-26 | Car dispatching method and system based on supply and demand quantity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310456573.4A CN116187722A (en) | 2023-04-26 | 2023-04-26 | Car dispatching method and system based on supply and demand quantity |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116187722A true CN116187722A (en) | 2023-05-30 |
Family
ID=86452533
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310456573.4A Pending CN116187722A (en) | 2023-04-26 | 2023-04-26 | Car dispatching method and system based on supply and demand quantity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116187722A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10134300A (en) * | 1996-11-05 | 1998-05-22 | Nagoya Joho Syst Kk | Device and method for deciding optimum delivery route and delivery vehicle and medium recording program for deciding optimum delivery route and delivery vehicle |
| CN106227884A (en) * | 2016-08-08 | 2016-12-14 | 深圳市未来媒体技术研究院 | A kind of recommendation method of calling a taxi online based on collaborative filtering |
| CN109858698A (en) * | 2019-01-31 | 2019-06-07 | 杭州飞步科技有限公司 | Vehicle supply and demand optimization method, device, equipment and the storage medium of target area |
| CN109993408A (en) * | 2019-02-28 | 2019-07-09 | 河海大学 | A kind of net about vehicle transport power concocting method divided based on coverage |
| CN110728305A (en) * | 2019-09-16 | 2020-01-24 | 南京信息工程大学 | Taxi passenger-carrying hot spot region mining method based on grid information entropy clustering algorithm |
-
2023
- 2023-04-26 CN CN202310456573.4A patent/CN116187722A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH10134300A (en) * | 1996-11-05 | 1998-05-22 | Nagoya Joho Syst Kk | Device and method for deciding optimum delivery route and delivery vehicle and medium recording program for deciding optimum delivery route and delivery vehicle |
| CN106227884A (en) * | 2016-08-08 | 2016-12-14 | 深圳市未来媒体技术研究院 | A kind of recommendation method of calling a taxi online based on collaborative filtering |
| CN109858698A (en) * | 2019-01-31 | 2019-06-07 | 杭州飞步科技有限公司 | Vehicle supply and demand optimization method, device, equipment and the storage medium of target area |
| CN109993408A (en) * | 2019-02-28 | 2019-07-09 | 河海大学 | A kind of net about vehicle transport power concocting method divided based on coverage |
| CN110728305A (en) * | 2019-09-16 | 2020-01-24 | 南京信息工程大学 | Taxi passenger-carrying hot spot region mining method based on grid information entropy clustering algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI712986B (en) | Systems and methods for dispatching vehicles | |
| CN107094165B (en) | Distribution capacity determining method, distribution task obtaining method, distribution resource scheduling method and equipment | |
| US5265006A (en) | Demand scheduled partial carrier load planning system for the transportation industry | |
| CN108647927B (en) | Order allocation method and device | |
| CN106156961B (en) | Vehicle scheduling method and device | |
| CN114023094B (en) | Wharf vehicle scheduling system, method, equipment and medium | |
| WO2015062343A1 (en) | Cloud platform-based logistics storage management method and system | |
| CN114386720B (en) | Logistics system scheduling management method, system, terminal equipment and storage medium | |
| KR20160070699A (en) | Method of designing vehicle delivery routes by setting zones | |
| US20210256646A1 (en) | Diversified and connected freight allocation system and method | |
| CN109523202B (en) | Order processing method, device, equipment and computer readable storage medium | |
| Novaes et al. | Designing multi-vehicle delivery tours in a grid-cell format | |
| CN112201034B (en) | Parking berth scheduling method, system, device and storage medium | |
| CN111598341A (en) | Electric power material distribution method and system based on material allocation and path optimization | |
| CN110705805A (en) | Cargo assembling method and device, storage medium and electronic device | |
| Won et al. | Workload-based yard-planning system in container terminals | |
| CN114358677A (en) | Logistics transportation distribution method and device, computer equipment and storage medium | |
| CN111507500B (en) | Carrier route generation method and device | |
| Wang et al. | Pickup and delivery of automobiles from warehouses to dealers | |
| CN111832872A (en) | Vehicle scheduling method and device, electronic equipment and storage medium | |
| CN113379102B (en) | Multi-network trunk transport optimization method, computer equipment and storage medium | |
| CN111353732A (en) | Vehicle transportation mode identification method, device, equipment and storage medium | |
| CN113739812B (en) | Distribution plan generating method, device, system and computer readable storage medium | |
| CN116187722A (en) | Car dispatching method and system based on supply and demand quantity | |
| CN112801336A (en) | Freight regulation and control method for combined loading |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230530 |
|
| RJ01 | Rejection of invention patent application after publication |