CN107919012B - Method and system for scheduling transport capacity - Google Patents

Method and system for scheduling transport capacity Download PDF

Info

Publication number
CN107919012B
CN107919012B CN201610881882.6A CN201610881882A CN107919012B CN 107919012 B CN107919012 B CN 107919012B CN 201610881882 A CN201610881882 A CN 201610881882A CN 107919012 B CN107919012 B CN 107919012B
Authority
CN
China
Prior art keywords
area
preset
preset area
map
ratio
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
Application number
CN201610881882.6A
Other languages
Chinese (zh)
Other versions
CN107919012A (en
Inventor
叶勇
李尧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
Original Assignee
Beijing Didi Infinity Technology and Development Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Didi Infinity Technology and Development Co Ltd filed Critical Beijing Didi Infinity Technology and Development Co Ltd
Priority to CN201610881882.6A priority Critical patent/CN107919012B/en
Publication of CN107919012A publication Critical patent/CN107919012A/en
Application granted granted Critical
Publication of CN107919012B publication Critical patent/CN107919012B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis

Abstract

The invention discloses a method and a system for dispatching transport capacity. And combining the area in the transport capacity tension state with the peripheral area to form a new area, and distributing the vehicle orders in the new area formed after combination. The single driver ratio in the new area formed after combination is smaller than that in the area before the single driver ratio in the new area, so that the vehicle-using orders in the new area are distributed to the driver terminals capable of bearing the orders in the new area, the reasonable distribution of the transportation capacity resources is realized, and the pressure that the probability of getting on the vehicle is low in the transportation capacity tension area is relieved.

Description

Method and system for scheduling transport capacity
Technical Field
The invention belongs to the technical field of traffic management, and particularly relates to a method and a system for scheduling capacity.
Background
Capacity refers to the deployment of machinery and personnel engaged in transportation, such as the deployment of taxis in cities. At present, urban trip demands are seriously unevenly distributed in different areas, so that the capacity is very necessary to be effectively allocated to areas with insufficient capacity from surplus areas no matter a traditional taxi company or an Internet taxi calling platform.
However, the traditional taxi company usually releases areas with more taxi demands by means of broadcasting, and taxi drivers who passively wait for listening to the broadcasting drive to go ahead, and the allocation mode is very inefficient.
Disclosure of Invention
The invention aims to solve the technical problem of how to reasonably distribute the transportation capacity resources and improve the probability of getting to the vehicle.
Aiming at the technical problem, the invention provides a capacity scheduling method, which comprises the following steps:
s1: acquiring a first quantity of vehicle orders in a preset area on a map and a second quantity of driver terminals capable of bearing the orders in the preset area;
s2: calculating the ratio of the first quantity to the second quantity to obtain the monoscopic ratio of the preset area;
s3: and judging whether the single driver ratio of the preset area is greater than a preset threshold value, if so, expanding the preset area to obtain a new preset area with the single driver ratio less than or equal to the preset threshold value, and distributing the vehicle-using orders in the new preset area to a driver terminal capable of carrying the orders in the new preset area.
Optionally, before the step S1, the method further includes:
and dividing the map into grids by adopting a preset graph, and selecting at least one grid as the preset area.
Optionally, the S3 includes:
and judging whether the single division ratio of the preset area is greater than a preset threshold value, if so, combining the area defined by the grids adjacent to the preset area on the map and the preset area into a new area as the preset area, returning to the step S1, and otherwise, distributing the vehicle-using orders in the preset area to a driver terminal capable of carrying the orders in the preset area.
Optionally, the method further comprises:
acquiring a monoscopic ratio of an area defined by each grid, and filling the grid with a color corresponding to a preset monoscopic ratio aiming at each grid;
and displaying the map, the grids on the map and colors in the grids to serve as an original capacity map.
Optionally, after displaying the original capacity map, further comprising:
after receiving merging information for merging the preset area and the area defined by the grid adjacent to the preset area, calculating the monose ratio of a new area formed by merging, and filling the new area with a color corresponding to the monose ratio of the new area;
and displaying the new area formed after combination and the filling color in the new area on the map.
Optionally, the preset pattern is a regular hexagon.
In another aspect, the present invention further provides a system for capacity scheduling, including:
the system comprises an acquisition module, a display module and a display module, wherein the acquisition module is used for acquiring a first quantity of vehicle orders in a preset area on a map and a second quantity of driver terminals capable of bearing the orders in the preset area;
the calculating module is used for calculating the ratio of the first quantity to the second quantity to obtain the monose ratio of the preset area;
and the judging module is used for judging whether the single driver ratio of the preset area is greater than a preset threshold value or not, if so, expanding the preset area to obtain a new preset area with the single driver ratio less than or equal to the preset threshold value, and distributing the vehicle using orders in the new preset area to a driver terminal capable of carrying the orders in the new preset area.
Optionally, the system further comprises a grid dividing module, configured to adopt a preset graph to divide the map into grids before acquiring a first quantity of the vehicle orders in a preset area on the map and a second quantity of driver terminals capable of bearing the orders in the preset area, and select at least one of the grids as the preset area.
Optionally, the determining module is further configured to determine whether a single division ratio of the preset area is greater than a preset threshold, if so, merge an area defined by a grid adjacent to the preset area on the map and the preset area into a new area, which is used as the preset area, and control the obtaining module to perform an action, otherwise, allocate the vehicle-using order in the preset area to a driver terminal capable of carrying the order in the preset area.
Optionally, the obtaining module is further configured to obtain a monose ratio of an area defined by each grid, fill the grid with a color corresponding to a predefined monose ratio for each grid, and display the map, the grid on the map, and the color in the grid as an original capacity map.
According to the method and the system for dispatching the transport capacity, the single department ratio of the preset area is obtained through the statistics of the number of the vehicle using orders in the preset area and the number of the driver terminals capable of bearing the orders, and whether the preset area is in a state of transport capacity tension or not is judged through the single department ratio. And combining the area in the transport capacity tension state with the peripheral area to form a new area, and distributing the vehicle orders in the new area formed after combination. The single driver ratio in the new area formed after combination is smaller than that in the area before the single driver ratio in the new area, so that the vehicle-using orders in the new area are distributed to the driver terminals capable of bearing the orders in the new area, the reasonable distribution of the transportation capacity resources is realized, and the pressure of low vehicle-hitting probability in the transportation capacity tension area is relieved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a flow chart illustrating a method for capacity scheduling according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a map partitioned into grids using concentric circles according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a map divided into meshes by regular triangles according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a map partitioned into grids using squares, according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a map divided into meshes using regular hexagons, according to an embodiment of the present invention;
fig. 6 is a schematic specific flowchart of a method for capacity scheduling according to another embodiment of the present invention;
FIG. 7 is a schematic illustration of an original capacity map displayed by a display interface provided by one embodiment of the present invention;
FIG. 8 is a diagram illustrating a grid after merging the grids displayed by a display interface provided by one embodiment of the present invention;
fig. 9 is a block diagram of a system for capacity scheduling according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic flowchart of a method for scheduling capacity according to an embodiment of the present invention, where the method includes:
s1: acquiring a first quantity of vehicle orders in a preset area on a map and a second quantity of driver terminals capable of bearing the orders in the preset area;
s2: calculating the ratio of the first quantity to the second quantity to obtain the monoscopic ratio of the preset area;
s3: and judging whether the single driver ratio of the preset area is greater than a preset threshold value, if so, expanding the preset area to obtain a new preset area with the single driver ratio less than or equal to the preset threshold value, and distributing the vehicle-using orders in the new preset area to a driver terminal capable of carrying the orders in the new preset area.
It should be noted that the preset area corresponds to one connected area on the map, and may be two or more non-connected areas. For example, the preset region is a region numbered 1 in fig. 2.
Since the number of the vehicle orders corresponding to different times and the number of the driver terminals capable of taking over the orders are different, the single driver ratio at the current time is calculated by the number of the vehicle orders at the current time and the number of the driver terminals capable of taking over the orders. It will be appreciated that the single ratio of the preset area over a period of time is calculated from the number of in-vehicle orders and the number of driver terminals available to receive the orders within the preset area over the period of time.
The number of the taxi orders in the preset area is the number of the taxi orders which are obtained by counting in a time point or a time period in the preset area, and the number of the driver terminals which can take the orders corresponds to the number of the taxies which can take the orders in the time point or the time period.
The preset threshold is a preset threshold, for example, the preset threshold is set to 1.2. When the single-driver ratio in the preset area is larger than the preset threshold value, it indicates that the transport capacity in the preset area is tense at the time point or in the time period, that is, the number of taxis is smaller than the number of orders of the passengers to take the taxi. In order to relieve the stress of transport capacity tension, the embodiment enlarges the preset area, and increases the number of driver terminals capable of receiving orders. For example, if the capacity in the area numbered 1 in fig. 2 is low, the area is expanded to the area numbered 2, so that the vehicle orders in the areas numbered 1 and 2 are distributed to the driver terminals in the two areas which can take over the orders.
It can be understood that, in the process of expanding the preset region, the monose ratio in the expanded region needs to be recalculated, and if the monose ratio is still smaller than the threshold, the preset region needs to be further expanded until a region with the monose ratio smaller than or equal to the preset threshold is obtained.
According to the method for dispatching the transport capacity, the single department ratio of the preset area is obtained through the statistics of the number of the vehicle orders in the preset area and the number of the driver terminals capable of bearing the orders, and whether the preset area is in a state of transport capacity tension or not is judged through the single department ratio. And combining the area in the transport capacity tension state with the peripheral area to form a new area, and distributing the vehicle orders in the new area formed after combination. The single ratio in the new area formed after combination is smaller than that in the area before the single ratio in the new area, so that the vehicle-using orders in the new area are distributed to the driver terminals capable of bearing the orders in the new area, the reasonable distribution of the transportation capacity resources is realized, and the pressure that the probability of driving vehicles in the transportation capacity tension area is low is relieved.
Further, before the step S1, the method further includes:
and dividing the map into grids by adopting a preset graph, and selecting at least one grid as the preset area.
Preferably, there are no gaps between the meshes.
In order to accurately and conveniently expand the preset area, the map is divided into grids, and the expansion of the preset area is realized through the combination of the grids. However, there are many methods for dividing the map into grids, and the map can be divided by using the preset graph as an irregular graph, a regular graph, or a combination of the irregular graph and the regular graph. A simple method of dividing the map into meshes is shown in fig. 2, 3, 4, 5 and 6.
Fig. 2 divides the map into a grid using four concentric circles R1, R2, R3, and R4 and lines passing through the center of the circle. For example, the single department ratio of the area numbered 1 in fig. 2 is greater than the preset threshold, the area numbered 1 and the area numbered 2 may be combined to obtain a new area, or the new area may be formed by combining with any of the areas numbered 2 to 7, or the area numbered 1 may be expanded to a new area defined by a circle R2, the single department ratio in the new area may be calculated, and if the single department ratio is less than or equal to the preset threshold, the driving order in the new area may be allocated to the driver terminal capable of receiving the order in the new preset area.
Fig. 3 is a diagram that divides a map into meshes by using regular triangles, for example, if the monose ratio of the area numbered 1 in fig. 3 is greater than a preset threshold, all meshes (meshes numbered 2 to 14) adjacent to the mesh numbered 1 and the area numbered 1 are merged to form a new mesh, the monose ratio of the new mesh is calculated, if the monose ratio of the new mesh is greater than the preset threshold, the mesh adjacent to the new mesh can be merged with the new mesh to obtain a second new mesh (the area surrounded by the thick black line of the outermost circle in fig. 3), and the new mesh are merged until the mesh with the monose ratio less than or equal to the preset threshold is obtained.
Each triangle in fig. 3 represents a unit mesh, which is the smallest unit of the mesh. The preset area may be an area defined by one unit grid, or an area defined by a plurality of unit grids.
Similarly, fig. 4 is a schematic diagram of dividing the map into grids by using squares, for example, if the transportation capacity in the square numbered 1 in fig. 4 is tense, the area defined by the square numbered 1 may be expanded to a new area defined by the squares numbered 1 to 9 together, the unit ratio in the new area is calculated, if the area is still greater than the preset threshold, the area is further expanded until the area with the unit ratio less than or equal to the preset threshold is obtained, and the vehicle orders in the area with the unit ratio less than or equal to the preset threshold are allocated to the driver terminals capable of receiving the orders in the area.
The embodiment provides different methods for dividing the map into grids, and the grid division of the map by using which preset graph can be determined according to the shape of the area in the specific implementation process. For example, for the case where the central zone is in poor transport capacity and the peripheral zones are in rich transport capacity, concentric circles in fig. 2 may be used to divide the map into grids by placing the areas in which transport capacity is in poor transport capacity within the area numbered 1 in fig. 2. For areas with abundant transportation or considerable tension in various places, the method in fig. 3 or fig. 4 may be used to divide the map into grids.
Further, the preset pattern is a regular hexagon.
Preferably, the side length of the regular hexagon is more than or equal to 500 meters and less than or equal to 1000 meters.
As shown in fig. 5, the map is divided into meshes using regular hexagons as unit meshes, and when the capacity of the region defined by the mesh numbered 1 is insufficient, a new mesh (the region defined by the thick black line in fig. 5) is obtained by merging the regular hexagons numbered 2 to 7 adjacent to the regular hexagon numbered 1 and the regular hexagon numbered 1, and the new mesh is referred to as a secondary mesh, and the monoscopic ratio of the secondary mesh is calculated. And if the single driver ratio of the secondary grid is less than or equal to a preset threshold value, distributing the vehicle taking orders in the secondary grid to a driver terminal capable of carrying the orders in the secondary grid. If the single department ratio of the secondary grid is greater than the preset threshold value, combining the grids numbered from 8 to 19 adjacent to the secondary grid with the secondary grid to form a new grid, namely a tertiary grid, calculating the single department ratio of the tertiary grid, and if the single department ratio of the tertiary grid is less than or equal to the preset threshold value, distributing the vehicle-using orders in the tertiary grid to the driver terminals capable of carrying the orders in the tertiary grid. If the monose ratio of the three-level grid is greater than the preset threshold, further continuously combining the grid adjacent to the three-level grid with the three-level grid until the obtained monose ratio of the new grid is less than or equal to the preset threshold.
After dividing the map into grids, the step S3 further includes:
and judging whether the single division ratio of the preset area is greater than a preset threshold value, if so, combining the area defined by the grids adjacent to the preset area on the map and the preset area into a new area as the preset area, returning to the step S1, and otherwise, distributing the vehicle-using orders in the preset area to a driver terminal capable of carrying the orders in the preset area.
As a specific example, as shown in fig. 6, in step S1, for a preset area (for example, the area numbered 1 in fig. 5), a first number of the used orders in the area and a second number of the driver' S end capable of taking over the orders are obtained for the current time point;
and step S2, calculating the ratio of the first quantity to the second quantity to obtain the monoscopic ratio of the preset area.
And step S31, judging whether the single division ratio is larger than a preset threshold value.
Wherein the value of the predetermined threshold is defined to be 1 or more and 2 or less.
If the monose ratio of the preset area is greater than the preset threshold, step S32 is executed, the area defined by the grid adjacent to the preset area on the map and the preset area are merged into a new area as the preset area (for example, the area numbered 1 in fig. 5 and the areas numbered 2 to 7 in fig. 5 are merged to obtain a secondary area), step S1 is returned, the calculation and the judgment of the monose ratio are performed again on the new preset area (secondary area), and the process is circulated until the monose ratio of the new preset area is less than or equal to the preset threshold.
And when the driver ratio of the preset area is smaller than or equal to the preset threshold value, executing step S33, allocating the vehicle-using orders in the preset area to the driver terminals capable of taking orders in the preset area, and completing allocation of the transportation capacity.
The embodiment provides a method for realizing capacity allocation by means of a grid, wherein the grid divides a whole map into areas taking the grid as a unit, so that a new preset area is generated quickly, and the new preset area is subjected to monoscopic inspection, so that capacity scheduling is realized quickly.
Further, in order to facilitate understanding of the capacity situation in each area on the entire map, the method provided in this embodiment further includes:
acquiring a monoscopic ratio of an area defined by each grid, and filling the grid with a color corresponding to a preset monoscopic ratio aiming at each grid;
and displaying the map, the grids on the map and colors in the grids to serve as an original capacity map.
Further, after displaying the original capacity map, the method further includes:
after receiving merging information for merging the preset area and the area defined by the grid adjacent to the preset area, calculating the monose ratio of a new area formed by merging, and filling the new area with a color corresponding to the monose ratio of the new area;
and displaying the new area formed after combination and the filling color in the new area on the map.
It should be noted that the transportation capacity map filled with the color may be displayed at a terminal of the user or the driver (for example, corresponding software on a mobile phone is turned on, and the transportation capacity map of the corresponding area may be viewed), or may be displayed at a server side for a worker to view.
Of course, the transportation capacity map can also display the transportation capacity numerical values corresponding to different colors on the transportation capacity map, and the transportation capacity conditions of different areas on the map can be displayed more intuitively through the colors.
For example, as shown in fig. 7, on a terminal of a mobile phone or a computer, an interface for displaying an original capacity map should at least include: a map (not shown in fig. 7), a grid on the map, and filling colors within the grid (for example, the color filled in each grid is different if the ratio of the units in the grid numbered 1 and the grid numbered 19 are different). Certainly, in order to facilitate the operation, a return key, a merging region and a color-single aspect key can be further arranged, and a return key is triggered and can return to the main interface of the mobile phone or corresponding software; triggering the "merge area" key may select a grid as a preset area (an area defined by a grid with a single span exceeding a preset threshold, for example, a grid numbered 1 in fig. 7), select a plurality of grids for merging with the preset area (grids numbered 2 to 7 in fig. 7), display an interface including at least the contents shown in fig. 8 after selecting confirmation (corresponding "confirmation" key may be set), trigger the "color-single span" key, and view the value of the single span corresponding to each color.
Fig. 8 is a schematic view of a display interface obtained by merging the grid numbered 1 and the grids numbered 2 to 7 in fig. 7, where the display interface at least includes three keys of "return", "merge area", and "color-monosilane", and a new grid numbered 20 is generated by merging the grids. The grids numbered from 8 to 20 are filled with colors corresponding to the respective monoscopic ratios, and the monoscopic ratios of the grids can be checked by triggering the color-monoscopic ratio key. The "back" button is triggered to return to the interface in fig. 7 to reselect the merged grid or exit. If the monoscopic ratio in the area numbered 20 is still greater than the preset threshold, the grid merged with the grid numbered 20 may be further selected based on the grid already merged in fig. 8 by triggering the "merging area".
The single-division ratio in each grid can be visually displayed through color display, and the single-division ratio in each area on the map can be visually displayed. Of course, the monoscopic ratios in each grid can be directly marked in the grid without filling the grid with colors.
Fig. 9 is a schematic structural diagram of a system for scheduling transportation capacity provided in this embodiment, and referring to fig. 9, the system 900 for scheduling transportation capacity includes an obtaining module 901, a calculating module 902, and a determining module 903, wherein,
an obtaining module 901, configured to obtain a first quantity of orders for vehicles in a preset area on a map, and a second quantity of driver terminals capable of receiving the orders in the preset area;
a calculating module 902, configured to calculate a ratio of the first number to the second number to obtain a monoscopic ratio of the preset area;
a determining module 903, configured to determine whether an division ratio of the preset area is greater than a preset threshold, if so, expand the preset area to obtain a new preset area with a division ratio less than or equal to the preset threshold, and allocate the vehicle-using order in the new preset area to a driver terminal in the new preset area that can accept the order.
The system 900 for scheduling capacity provided in this embodiment is suitable for the method for scheduling capacity described in the above embodiments, and is not described herein again.
According to the system 900 for dispatching the transport capacity, the obtaining module 901 counts the number of the vehicle orders in the preset area and the number of the driver terminals capable of bearing the orders, the calculating module 902 calculates the monospaces ratio of the preset area, and the judging module 903 judges whether the preset area is in a state of transport capacity tension or not through the monospaces ratio. And combining the area in the transport capacity tension state with the peripheral area to form a new area, and distributing the vehicle orders in the new area formed after combination. The single driver ratio in the new area formed after combination is smaller than that in the area before the single driver ratio in the new area, so that the vehicle-using orders in the new area are distributed to the driver terminals capable of bearing the orders in the new area, the reasonable distribution of the transportation capacity resources is realized, and the pressure of low vehicle-hitting probability in the transportation capacity tension area is relieved.
The method further comprises a grid dividing module, wherein the grid dividing module is used for dividing the map into grids by adopting a preset graph before acquiring a first quantity of vehicle orders in a preset area on the map and a second quantity of driver terminals capable of bearing the orders in the preset area, and selecting at least one grid as the preset area.
Further, the judging module is further configured to judge whether the single driver ratio of the preset area is greater than a preset threshold, if so, merge an area defined by a grid adjacent to the preset area on the map and the preset area into a new area, which is used as the preset area, and control the obtaining module to perform an action, otherwise, allocate the vehicle-using order in the preset area to a driver terminal capable of carrying the order in the preset area.
Further, the obtaining module is further configured to obtain a monose ratio of an area defined by each grid, fill the grid with a color corresponding to a predefined monose ratio for each grid, and display the map, the grid on the map, and the colors in the grid as an original capacity map.
Further, the obtaining module is further configured to, after the original capacity map is displayed, calculate a monose ratio of a new region formed by merging after receiving merging information of the preset region and a region defined by a grid adjacent to the preset region, and fill the new region with a color corresponding to the monose ratio of the new region;
and displaying the new area formed after combination and the filling color in the new area on the map.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A method of capacity scheduling, comprising:
s1: acquiring a first quantity of vehicle orders in a preset area on a map and a second quantity of driver terminals capable of bearing the orders in the preset area;
s2: calculating the ratio of the first quantity to the second quantity to obtain the monoscopic ratio of the preset area;
s3: judging whether the single driver ratio of the preset area is larger than a preset threshold value or not, if so, expanding the preset area to obtain a new preset area of which the single driver ratio is smaller than or equal to the preset threshold value, and distributing the vehicle-using orders in the new preset area to a driver terminal which can bear the orders in the new preset area;
the preset area corresponds to a connected area or two or more non-connected areas on the map.
2. The method according to claim 1, further comprising, before the step S1:
and dividing the map into grids by adopting a preset graph, and selecting at least one grid as the preset area.
3. The method according to claim 2, wherein the S3 includes:
and judging whether the single division ratio of the preset area is greater than a preset threshold value, if so, combining the area defined by the grids adjacent to the preset area on the map and the preset area into a new area as the preset area, returning to the step S1, and otherwise, distributing the vehicle-using orders in the preset area to a driver terminal capable of carrying the orders in the preset area.
4. The method of claim 3, further comprising:
acquiring a monoscopic ratio of an area defined by each grid, and filling the grid with a color corresponding to a preset monoscopic ratio aiming at each grid;
and displaying the map, the grids on the map and colors in the grids to serve as an original capacity map.
5. The method of claim 4, further comprising, after displaying the original capacity map:
after receiving merging information for merging the preset area and the area defined by the grid adjacent to the preset area, calculating the monose ratio of a new area formed by merging, and filling the new area with a color corresponding to the monose ratio of the new area;
and displaying the new area formed after combination and the filling color in the new area on the map.
6. The method of claim 2, wherein the predetermined pattern is a regular hexagon.
7. A system for capacity scheduling, comprising:
the system comprises an acquisition module, a display module and a display module, wherein the acquisition module is used for acquiring a first quantity of vehicle orders in a preset area on a map and a second quantity of driver terminals capable of bearing the orders in the preset area;
the calculating module is used for calculating the ratio of the first quantity to the second quantity to obtain the monose ratio of the preset area;
the judging module is used for judging whether the single driver ratio of the preset area is larger than a preset threshold value or not, if so, expanding the preset area to obtain a new preset area with the single driver ratio smaller than or equal to the preset threshold value, and distributing the vehicle using orders in the new preset area to a driver terminal capable of bearing the orders in the new preset area;
the preset area corresponds to a connected area or two or more non-connected areas on the map.
8. The system of claim 7, further comprising a grid dividing module for dividing the map into grids using a predetermined pattern before acquiring the first number of orders for vehicles in a predetermined area on the map and the second number of driver terminals capable of taking orders in the predetermined area, and selecting at least one of the grids as the predetermined area.
9. The system according to claim 8, wherein the determining module is further configured to determine whether the single division ratio of the preset area is greater than a preset threshold, if so, merge an area defined by a grid adjacent to the preset area on the map and the preset area into a new area, which is used as the preset area, and control the obtaining module to perform the action, otherwise, allocate the vehicle-using order in the preset area to a driver terminal capable of accepting the order in the preset area.
10. The system according to claim 9, wherein the obtaining module is further configured to obtain a monoscopic ratio of an area defined by each grid, fill the grid with a color corresponding to a predefined monoscopic ratio for each grid, and display the map, the grid on the map, and the colors in the grid as an original capacity map.
CN201610881882.6A 2016-10-09 2016-10-09 Method and system for scheduling transport capacity Active CN107919012B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610881882.6A CN107919012B (en) 2016-10-09 2016-10-09 Method and system for scheduling transport capacity

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610881882.6A CN107919012B (en) 2016-10-09 2016-10-09 Method and system for scheduling transport capacity

Publications (2)

Publication Number Publication Date
CN107919012A CN107919012A (en) 2018-04-17
CN107919012B true CN107919012B (en) 2020-11-27

Family

ID=61891671

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610881882.6A Active CN107919012B (en) 2016-10-09 2016-10-09 Method and system for scheduling transport capacity

Country Status (1)

Country Link
CN (1) CN107919012B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108596723B (en) * 2018-04-24 2022-01-07 北京同城必应科技有限公司 Order pushing method, system, server and storage medium
CN110414758B (en) * 2018-04-28 2021-11-30 北京三快在线科技有限公司 Region determination method and device and electronic equipment
CN108734390A (en) * 2018-05-07 2018-11-02 北京顺丰同城科技有限公司 A kind of scheduling processing method and device of order dispatching
CN109192054B (en) * 2018-07-27 2020-04-28 阿里巴巴集团控股有限公司 Data processing method and device for map region merging
CN116562557B (en) * 2023-04-28 2024-01-26 汉唐融科(北京)科技有限公司 Flexible intelligent recruitment dispatching system

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100084010A (en) * 2009-01-15 2010-07-23 제주대학교 산학협력단 Placement scheme of empty taxis based on the location history data
CN103985247B (en) * 2014-04-24 2016-08-24 北京嘀嘀无限科技发展有限公司 Taxi Transport capacity dispatching system based on city chauffeur demand distribution density
CN104867065B (en) * 2015-06-05 2021-07-02 北京嘀嘀无限科技发展有限公司 Method and equipment for processing order
EP3258430A4 (en) * 2015-02-13 2018-07-11 Beijing Didi Infinity Technology and Development Co., Ltd. Transport capacity scheduling method and system
CN105185116B (en) * 2015-09-15 2017-08-11 广州地理研究所 The intensive minibus trip requirements thermodynamic chart construction method of network
CN105868949B (en) * 2016-03-31 2023-04-07 北京星选科技有限公司 Logistics distribution scheduling method and device

Also Published As

Publication number Publication date
CN107919012A (en) 2018-04-17

Similar Documents

Publication Publication Date Title
CN107919012B (en) Method and system for scheduling transport capacity
CN110081900A (en) A kind of charging pile intelligent recommendation method, apparatus, service terminal and storage medium
CN103996290B (en) A kind of provide the method for dial-a-cab, server and system
CN106971604B (en) Parking space resource allocation method and device
CN106408147B (en) Dispatching method and system for vehicle insurance survey task
CN103198671A (en) System and method of prompting jam conditions at exits and entrances of park
CN107845253B (en) Reservation order early warning method and server
CN110969834B (en) Processing method, processing device, computer equipment, storage medium and vehicle dispatching system
CN106920412A (en) Suitable for the intelligent transportation runtime and method of bus or train route collaboration
CN101873608A (en) Method and system for showing communication traffic volume by combining Thiessen polygons and GIS map
CN111161560B (en) Bus corridor operation order management method and device
US20200051426A1 (en) System for providing a city planning tool
CN113096435B (en) Shared parking place determining method, device, equipment and storage medium
CN111261017B (en) Map fence display method and device
CN112208384B (en) Energy optimization intelligent control system and method for parking lot charging pile
CN110033613B (en) Smart city management method and system based on regional traffic synchronism
CN107403473A (en) A kind of shared bicycle charging method and system
JP2009015739A (en) Traffic information distribution server, traffic information distribution system, and traffic information distribution method
CN112015748B (en) Method and system for visualizing supply-demand relationship between regional real-time order and transport capacity
CN106056296A (en) Order allocation method and device
JP6398434B2 (en) Map display program, map display method, and information processing apparatus
US20150105935A1 (en) Method and system for managing operation of multi-line public transportation
CN113065044B (en) Driving state checking method, device, equipment and storage medium
CN115689258A (en) Method, prompting method, system and storage medium for optimizing and sharing vehicle returning position
CN109191065A (en) The building waste haulage vehicle unified platform of integrated manager and transaction

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