CN114169703B - Network taxi appointment scheduling method and device based on multiple tenants - Google Patents
Network taxi appointment scheduling method and device based on multiple tenants Download PDFInfo
- Publication number
- CN114169703B CN114169703B CN202111387067.1A CN202111387067A CN114169703B CN 114169703 B CN114169703 B CN 114169703B CN 202111387067 A CN202111387067 A CN 202111387067A CN 114169703 B CN114169703 B CN 114169703B
- Authority
- CN
- China
- Prior art keywords
- area
- target scheduling
- matching
- supply
- result
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004364 calculation method Methods 0.000 claims abstract description 10
- 230000015654 memory Effects 0.000 claims description 20
- 238000012545 processing Methods 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 239000000126 substance Substances 0.000 claims 2
- 230000004044 response Effects 0.000 abstract description 5
- 230000008569 process Effects 0.000 description 7
- 230000002093 peripheral effect Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0605—Supply or demand aggregation
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a network car booking scheduling method and device based on multiple tenants, wherein the network car booking scheduling method based on the multiple tenants comprises the following steps: obtaining network car booking travel service data of a target dispatching area, wherein the network car booking travel service data; determining a supply and demand matching result of the target scheduling area based on the network appointment travel service data; and performing driving and riding matching on the network appointment travel service data according to the supply and demand matching result to obtain a driving and riding matching result of the target scheduling area. The target dispatching area is determined by performing supply and demand matching calculation on the target dispatching area, and then driver and passenger matching is performed on the determined target dispatching area, so that not only is the quick response of network appointment vehicle dispatching ensured, but also the condition that network appointment vehicle transport capacity is unevenly distributed in different areas of different tenants is considered, and the balance of network appointment vehicle transport capacity in different areas is ensured.
Description
Technical Field
The invention relates to the field of network car booking, in particular to a network car booking scheduling method and device based on multiple tenants.
Background
The development of the network car booking technology provides more convenient conditions for people to go out, and after a user selects a departure place and a destination, the network car booking platform can perform service matching with the network car booking according to the selection of the user. Most of the conventional network appointment scheduling systems select a batch of drivers near the departure place of a user, and determine the network appointment which is finally matched with the user by performing weight sequencing. However, the scheduling method often does not consider the non-uniformity of the distribution of network appointment transport capacity of different tenants on the area, and the problem of aggravating transport capacity tension of some tenants in a specific area exists.
Disclosure of Invention
Therefore, the technical problem to be solved by the invention is to overcome the defects that the non-uniformity of the distribution of the network appointment vehicle transport capacity of different tenants on an area is not considered in the prior art and the transport capacity tension of some tenants in a specific area is aggravated, so that the network appointment vehicle scheduling method and device based on the multi-tenants are provided.
According to a first aspect, an embodiment of the present invention provides a network appointment scheduling method based on multiple tenants, where the method includes:
obtaining network car booking travel service data of a target dispatching area, wherein the network car booking travel service data comprises: passenger data and tenant data of online car booking travel demands corresponding to the target scheduling area and other scheduling areas in a first range of the target scheduling area, and online car booking data capable of providing services for each tenant;
determining a supply and demand matching result of the target scheduling area based on the network appointment travel service data;
and performing riding matching on the network appointment vehicle travel service data according to the supply and demand matching result to obtain a riding matching result of the target scheduling area.
Optionally, the determining, based on the network appointment travel service data, a supply and demand matching result of the target scheduling area includes:
performing supply-demand difference calculation based on passenger data and tenant data of online car-booking travel demands corresponding to the target scheduling area and online car-booking data which can be provided by each tenant to obtain a supply-demand difference result of the target scheduling area;
and determining a supply and demand matching result of the target scheduling area based on the supply and demand difference result of the target scheduling area.
Optionally, the supply-demand difference result is calculated by the following formula:
E(g，t)＝∑ z ∑ p d(p，z，t)-∑ z s(z，t)
wherein E (g, t) represents the supply-demand difference result, Σ z ∑ p d (p, z, t) represents the total demand of the taxi appointment in the target dispatching area, sigma z s (z, t) represents the number of network appointments for all services available under the tenants in the target area.
Optionally, the determining a supply and demand matching result of the target scheduling region based on the supply and demand difference result of the target scheduling region includes:
judging whether the supply and demand difference result exceeds a preset supply and demand difference result threshold value or not;
when the supply and demand difference result exceeds the preset supply and demand difference result threshold, determining the target scheduling area as a hot area;
and when the supply and demand difference result does not exceed the preset supply and demand difference result threshold, determining that the target scheduling area is a cold area.
Optionally, the performing driver-and-passenger matching on the network appointment travel service data according to the supply-demand matching result to obtain a driver-and-passenger matching result of the target scheduling area includes:
determining a driver-multiplier matching range of the target scheduling area based on the heat result of the target scheduling area;
extracting first network car appointment travel service data in the driving and riding matching range from the network car appointment travel service data, wherein the first network car appointment travel service data comprises: passenger data and tenant data of online car booking travel demands and online car booking data capable of providing services for each tenant are arranged in the driver and passenger matching range;
performing driver and passenger matching profit calculation based on the first network car appointment travel service data, and determining a driver and passenger matching profit result;
and sequencing the driver and product matching income results, and determining the driver and product matching results of the target scheduling area.
Optionally, the determining a driver-and-multiplier matching range of the target scheduling area based on the result of the heat degree of the target scheduling area includes:
when the target scheduling region is a hot region, determining that the driver and rider matching range of the target scheduling region is a region set formed by the target scheduling region and a second scheduling region which is a cold region in the first range of the target scheduling region;
and when the target scheduling area is a cold area, determining the driver-multiplier matching range of the target scheduling area as the target scheduling area.
Optionally, when the target scheduling area is a hot area, the driver and product matching profit result is calculated by the following formula:
the yield α (E' (g, t) -E (g, t)) + γ (∑ is) g′ (E′(g′，t)-E(g′，t)))
Where α and γ are gain coefficients, E' (g, t) -E (g, t) represents the difference between supply and demand result of the target scheduling region, Σ g′ (E ' (g ', t) -E (g ', t)) represents a supply-demand difference result of a second scheduling area which is a cold area within the first range of the target scheduling area.
According to a second aspect, an embodiment of the present invention provides a network appointment scheduling apparatus based on multiple tenants, the apparatus including:
the obtaining module is used for obtaining the network car booking travel service data of the target dispatching area, and the network car booking travel service data comprises: passenger data and tenant data of online car booking travel demands corresponding to the target scheduling area and other scheduling areas in a first range of the target scheduling area, and online car booking data capable of providing services for each tenant;
the first processing module is used for determining a supply and demand matching result of the target scheduling area based on the network appointment travel service data;
and the second processing module is used for carrying out driver-and-passenger matching on the network appointment vehicle travel service data according to the supply-demand matching result to obtain a driver-and-passenger matching result of the target scheduling area.
According to a third aspect, an embodiment of the present invention provides an electronic device, including:
a memory and a processor, the memory and the processor being communicatively coupled to each other, the memory having stored therein computer instructions, and the processor performing the method of the first aspect, or any one of the optional embodiments of the first aspect, by executing the computer instructions.
According to a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores computer instructions for causing a computer to execute the method of the first aspect, or any one of the optional implementation manners of the first aspect.
The technical scheme of the invention has the following advantages:
the network car-booking scheduling method and device based on the multi-tenant provided by the embodiment of the invention are characterized in that network car-booking travel service data of a target scheduling area are obtained, and the network car-booking travel service data comprise: passenger data and tenant data of online car booking travel demands corresponding to the target scheduling area and other scheduling areas in a first range of the target scheduling area, and online car booking data capable of providing services for each tenant; determining a supply and demand matching result of the target scheduling area based on the network appointment travel service data; and performing driving and riding matching on the network appointment travel service data according to the supply and demand matching result to obtain a driving and riding matching result of the target scheduling area. The target dispatching area is determined by performing supply and demand matching calculation on the target dispatching area, and then driver and passenger matching is performed on the determined target dispatching area, so that not only is the quick response of network appointment vehicle dispatching ensured, but also the condition that network appointment vehicle transport capacity is unevenly distributed in different areas of different tenants is considered, and the balance of network appointment vehicle transport capacity in different areas is ensured.
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 embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a multi-tenant-based network taxi appointment scheduling method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a multi-tenant-based network appointment scheduling device according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood 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.
In the description of the present invention, it should be noted that the terms "first", "second", and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
In addition, the technical features involved in the different embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
The embodiment of the invention provides a network car booking scheduling method based on multiple tenants, and as shown in fig. 1, the network car booking scheduling method based on the multiple tenants specifically comprises the following steps:
step S101: acquiring network car booking travel service data of a target dispatching area, wherein the network car booking travel service data comprises: passenger data and tenant data of online car booking travel demands corresponding to the target scheduling area and other scheduling areas in the first range of the target scheduling area, and online car booking data capable of providing services for each tenant. In practical application, a tenant corresponds to a company which is registered on the local network car booking dispatching platform and provides network car booking services.
Specifically, in practical application, the acquired network appointment vehicle travel service data not only comprise a target scheduling area, but also effectively expand the data acquisition range, comprise other scheduling areas in a first range of the target scheduling area, ensure the sufficiency of the data by effectively expanding the data acquisition range, and simultaneously consider the condition that network appointment vehicle transport capacity is unevenly distributed in different areas of different tenants, thereby ensuring the balance of the network appointment vehicle transport capacity in different areas.
Step S102: and determining a supply and demand matching result of the target scheduling area based on the network appointment vehicle travel service data. In practical application, the online appointment vehicle travel service data can be switched between a single-tenant mode and a multi-tenant mode for viewing.
Specifically, in an embodiment, the step S102 specifically includes the following steps:
step S201: and calculating the supply-demand difference based on passenger data and tenant data of the networked car booking travel demands corresponding to the target scheduling area and networked car booking data which can be provided by each tenant, so as to obtain a supply-demand difference result of the target scheduling area.
Specifically, in one embodiment, the supply-demand difference result is calculated by the following formula:
E(g，t)＝∑ z ∑ p d(p，z，t)-∑ z s(z，t)
wherein E (g, t) represents the supply-demand difference result, Σ z ∑ p d (p, z, t) represents the total demand of the taxi appointment in the target dispatching area, sigma z s (z, t) represents the number of network appointments for all available services under the tenants in the target area.
Step S202: and determining a supply and demand matching result of the target scheduling area based on the supply and demand difference result of the target scheduling area. In practical application, the embodiment of the invention adopts an exhaustion method to match the passenger data of the networked car appointment travel requirement in the target scheduling area with the networked car appointment data which can be provided by each tenant, and the larger the value of the poor supply and demand result is, the more tense the supply and demand relationship in the target scheduling area is. In practical application, the situation that other comparison methods are adopted for matching supply and demand is also within the protection scope of the multi-tenant-based network appointment scheduling method provided by the invention.
Specifically, in an embodiment, the step S202 specifically includes the following steps:
step S301: and judging whether the supply and demand difference result exceeds a preset supply and demand difference result threshold value. In practical application, the preset supply and demand difference result threshold can be adjusted according to practical conditions, and in practical application, the adjustment of the preset supply and demand difference result threshold for meeting different requirements is also within the protection range of the multi-tenant-based network taxi appointment scheduling method provided by the invention.
Step S302: and when the supply and demand difference result exceeds a preset supply and demand difference result threshold, determining the target scheduling area as a hot area.
Step S303: and when the supply and demand difference result does not exceed the preset supply and demand difference result threshold, determining that the target scheduling area is a cold area.
By pre-judging the target dispatching area, the supply and demand conditions of the target dispatching area are more clearly reflected, and therefore the quick response of the network taxi appointment dispatching is guaranteed.
Step S103: and performing driving and riding matching on the network appointment vehicle travel service data according to the supply and demand matching result to obtain a driving and riding matching result of the target scheduling area.
Specifically, in one embodiment, the driving and riding matching process is limited, and when a passenger selects a certain tenant, only the network appointment of the tenant capable of providing service can be matched; when the passenger is matched with the net appointment car, the passenger can not be matched with the net appointment cars of other tenants. By means of constraint of the driver and passenger matching process, invalid and repeated orders are avoided, misjudgment of the heat degree condition of the target scheduling area is avoided, and effectiveness of network car appointment scheduling is guaranteed.
Specifically, in an embodiment, the step S103 specifically includes the following steps:
step S401: and determining the driver-multiplier matching range of the target scheduling area based on the heat result of the target scheduling area. In practical application, the embodiment of the invention considers that the heat degrees of the target scheduling areas are different, and therefore, the driver-multiplier matching range of the target scheduling area is adjusted. The driver and crew matching range is adjusted by considering the heat condition of the target scheduling area, the condition that network appointment vehicle transport capacity distribution of different tenants in different areas is uneven is fully considered, and the balance of network appointment vehicle transport capacity in different areas is guaranteed.
Specifically, in an embodiment, the step S401 specifically includes the following steps:
step S501: and when the target scheduling region is a hot region, determining that the driver-and-rider matching range of the target scheduling region is a region set formed by the target scheduling region and a second scheduling region which is a cold region in the first range of the target scheduling region. In practical application, when the target scheduling area is a hot area, the shortage of the supply and demand relationship in the area is indicated, so that the range of the target scheduling area is expanded to the original target scheduling area and the area of which the range around the target scheduling area is a cold area, and the supply and demand relationship in each area tends to be balanced and stable, but the practical situation is not limited to the above, and the change of the range of the target scheduling area for ensuring the balance of the supply and demand relationship is also within the protection range of the multi-tenant-based network taxi appointment scheduling method provided by the invention.
Step S502: and when the target scheduling area is a cold area, determining the driver-multiplier matching range of the target scheduling area as the target scheduling area. In practical application, when the target scheduling area is a cold area, it indicates that the supply and demand relationship in the area is not tight, so the target scheduling area is only the current area.
By determining the driver-driver matching range of the target scheduling area, the condition that network appointment vehicle transport capacity distribution is uneven in different areas of different tenants is fully considered, and balance of network appointment vehicle transport capacity in different areas is guaranteed. When the target dispatching area is a hot area and the target dispatching area is expanded, the network car booking range capable of providing service is expanded, and the speed of matching the passengers and the network car booking is greatly increased on the premise of ensuring the supply and demand relationship.
Step S402: extracting first network car appointment travel service data in a driver and passenger matching range from the network car appointment travel service data, wherein the first network car appointment travel service data comprises: passenger data and tenant data of online car booking travel demands and online car booking data capable of providing services for each tenant exist in the driver and passenger matching range.
Step S403: and performing driver and passenger matching income calculation based on the first network car appointment travel service data, and determining a driver and passenger matching income result.
Specifically, when the target scheduling area is a hot area, the driver and product matching profit result is calculated by the following formula:
the yield is α (E' (g, t) -E (g, t)) + γ (∑ y) g′ (E′(g′，t)-E(g′，t)))
Where α and γ are gain coefficients, a =1, γ =0.1667, E' (g, t) -E (g, t) represents the poor supply and demand result of the target scheduling area, Σ g′ (E ' (g ', t) -E (g ', t)) represents the supply-demand difference result of the second scheduling area which is a cold zone within the first range of the target scheduling area.
Step S404: and sequencing the driver and product matching income results, and determining the driver and product matching results of the target scheduling area. In practical application, the passengers to be matched in the target scheduling area and the taxi appointment in the target scheduling area are matched and combined pairwise, the driver and passenger matching income result in the target scheduling area is calculated by each matching and combining mode, and the combination with the largest supply-demand difference income is determined, wherein the combination is the optimal matching for solving the imbalance of supply and demand under the multi-tenant view angle.
By executing the steps, the network car-booking travel service data of the target scheduling area is acquired by the network car-booking travel scheduling method based on the multi-tenant, and the network car-booking travel service data comprises the following steps: passenger data and tenant data of networked car booking travel demands corresponding to the target scheduling area and other scheduling areas in a first range of the target scheduling area, and networked car booking data capable of providing services for each tenant; determining a supply and demand matching result of a target scheduling area based on the network appointment vehicle travel service data; and performing riding matching on the network appointment vehicle travel service data according to the supply and demand matching result to obtain a riding matching result of the target scheduling area. The target dispatching area is determined by performing supply and demand matching calculation on the target dispatching area, and then driver and passenger matching is performed on the determined target dispatching area, so that not only is the quick response of network appointment vehicle dispatching ensured, but also the condition that network appointment vehicle transport capacity is unevenly distributed in different areas of different tenants is considered, and the balance of network appointment vehicle transport capacity in different areas is ensured.
The multi-tenant-based network appointment scheduling method provided by the embodiment of the invention will be described in detail below with reference to specific application examples.
1. In a city, a tenant set Z of the network car booking travel service can be provided, each tenant is marked as Z, and one tenant is a company which is registered on the network car booking dispatching platform and provides the network car booking service.
2. For a city, the city is divided into a plurality of honeycomb-shaped regular hexagonal grids, the grid set is G, and each grid is marked as G. The partitioning of the hexagonal grid currently uses uber to provide an open source geospatial indexing system, H3 grid index. The grid index level can be selected according to the travel characteristics of different cities and the supply and demand characteristics of the network appointment cars, and a more universal method is to adopt 6-level grids.
At the moment of time t, a passenger set P with network car booking travel demands is provided, and each passenger set P isThe passenger p is marked as p, and the passenger p places orders for different tenants z according to personal preference to generate travel demands, and is marked as d (p) i ,z i ,t)∈(0,1)。
4. And recording the net appointment vehicle travel demand at the t moment in the grid g as the net appointment vehicle travel demand at the view angle of a single tenant
5. And recording the net appointment travel demand of t moment in the grid g as sigma under the multi-tenant mode view angle z ∑ p d(p i ,z i ,t)
6. And under the view of a single tenant, the number of network appointments which can be provided by the tenant z at the time t in the grid g is s (z, t).
7. Under the view angle of a multi-tenant mode, the number of network appointment cars which can be provided at the t moment in the grid g is sigma z s(z,t)。
8. The supply-demand difference of the grid g at the time t is
E(g，t)＝∑ z ∑ p d(p，z，t)-∑ z s(z，t)
The larger the value is, the more tense the difference between the supply and the demand in the area is, namely the higher the heat degree of the area is, the hot area is; and conversely, the supply and demand of the area tend to be balanced, and the area can be regarded as a cold area.
9. The ride matching process begins:
1) the grid g is used for matching the taxi appointment with the passenger. The matching process needs to satisfy the following constraints:
a) the order of one passenger in one tenant can only be matched with the network appointment vehicle of the same tenant, and at most, the order is matched with one network appointment vehicle.
b) If a passenger matches the network appointment of the tenant z, the travel demand of the passenger is met, orders of the passenger on other tenants are not matched, and the orders do not need to be added when the matched supply and demand difference is calculated.
c) If the passenger is in the hot zone grid, the passenger is allowed to match a network appointment from a surrounding cold zone (on the premise that the order radius is met). If the passenger is in the cold zone grid, the passenger cannot match the network appointment to the surrounding hot zones.
2) And carrying out pairwise matching combination on the passengers to be matched in the grids and the taxi appointment cars in the grids and in the peripheral grids within the dispatching radius by using an exhaustion method, wherein the matching process meets the constraint conditions.
3) The matched supply-demand difference of the grid, i.e. E' (g, t), is calculated for each group of combinations. After the combined driver-and-demand matching, the supply-demand difference of the grid g changes to E' (g, t) -E (g, t). Meanwhile, the matching combination can match the network appointment cars (in the dispatching radius) of the peripheral cold area grids g ', so that the supply and demand difference change E' (g ', t) -E (g', t) of the peripheral grids is calculated in sequence.
4) The yield of the matching set of combinations on supply and demand in the region is
α(E′(g，t)-E(g，t))+γ(∑ g′ (E′(g′，t)-E(g′，t)))
Wherein, α and γ are revenue coefficients brought to the network taxi appointment scheduling system by the matching combination, a =1, and γ = 0.1667.
5) And exhausting all the combinations, wherein the combination with poor supply and demand and the maximum profit in the area is a group of optimal matching for solving the imbalance of supply and demand under the multi-tenant view angle.
An embodiment of the present invention provides a network car booking scheduling device based on multiple tenants, and as shown in fig. 2, the network car booking scheduling device based on multiple tenants includes:
an obtaining module 101, configured to obtain network car booking travel service data of a target scheduling area, where the network car booking travel service data includes: passenger data and tenant data of networked car booking travel demands corresponding to the target scheduling area and other scheduling areas in the first range of the target scheduling area, and networked car booking data capable of providing services for each tenant. For details, refer to the related description of step S101 in the above method embodiment, and details are not repeated herein.
The first processing module 102 is configured to determine a supply and demand matching result of the target scheduling area based on the network appointment vehicle travel service data. For details, refer to the related description of step S102 in the above method embodiment, and no further description is provided here.
And the second processing module 103 is configured to perform driving and passenger matching on the network appointment vehicle travel service data according to the supply and demand matching result to obtain a driving and passenger matching result of the target scheduling area. For details, refer to the related description of step S103 in the above method embodiment, and details are not repeated herein.
For further description of the network appointment scheduling device based on multiple tenants, reference is made to the related description of the network appointment scheduling method based on multiple tenants, and details are not repeated here.
Through the cooperative cooperation of the components, the network appointment vehicle scheduling device based on the multi-tenant provided by the embodiment of the invention determines the target scheduling area by performing supply and demand matching calculation on the target scheduling area, and then performs driving and riding matching on the determined target scheduling area, so that the quick response of network appointment vehicle scheduling is ensured, and meanwhile, the balance of network appointment vehicle transportation capacity in different areas is ensured by considering the condition that network appointment vehicle transportation capacity distribution of different tenants in different areas is not uniform.
An embodiment of the present invention provides an electronic device, as shown in fig. 3, the electronic device includes a processor 901 and a memory 902, and the memory 902 and the processor 901 are communicatively connected to each other, where the processor 901 and the memory 902 may be connected by a bus or in another manner, and fig. 3 takes the connection by the bus as an example.
The memory 902, which is a non-transitory computer readable storage medium, may be used for storing non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the methods of the embodiments of the present invention. The processor 901 executes various functional applications and data processing of the processor by executing non-transitory software programs, instructions and modules stored in the memory 902, that is, implements the methods in the above-described method embodiments.
The memory 902 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by the processor 901, and the like. Further, the memory 902 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 902 may optionally include memory located remotely from the processor 901, which may be connected to the processor 901 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
One or more modules are stored in the memory 902, which when executed by the processor 901 performs the methods in the above-described method embodiments.
The specific details of the electronic device may be understood by referring to the corresponding related descriptions and effects in the above method embodiments, and are not described herein again.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, and the implemented program can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic Disk, an optical Disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a Flash Memory (Flash Memory), a Hard Disk (Hard Disk Drive, abbreviated as HDD) or a Solid State Drive (SSD), etc.; the storage medium may also comprise a combination of memories of the kind described above.
It should be understood that the above examples are only for clarity of illustration and are not intended to limit the embodiments. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. And obvious variations or modifications derived therefrom are intended to be within the scope of the invention.
Claims (7)
1. A network taxi appointment scheduling method based on multiple tenants is characterized by comprising the following steps:
obtaining network car booking travel service data of a target dispatching area, wherein the network car booking travel service data comprises the following steps: passenger data and tenant data of online car booking travel demands corresponding to the target scheduling area and other scheduling areas in a first range of the target scheduling area, and online car booking data capable of providing services for each tenant;
determining a supply and demand matching result of the target scheduling area based on the network appointment travel service data;
performing ride matching on the network appointment travel service data according to the supply and demand matching result to obtain a ride matching result of the target scheduling area;
determining a supply and demand matching result of the target scheduling area based on the supply and demand difference result of the target scheduling area, including:
judging whether the supply and demand difference result exceeds a preset supply and demand difference result threshold value or not;
when the supply and demand difference result exceeds the preset supply and demand difference result threshold, determining the target scheduling area as a hot area;
when the supply and demand difference result does not exceed the preset supply and demand difference result threshold, determining that the target scheduling area is a cold area;
the step of performing driver-and-passenger matching on the network appointment vehicle travel service data according to the supply-and-demand matching result to obtain a driver-and-passenger matching result of the target scheduling area includes:
determining a driver-multiplier matching range of the target scheduling area based on the heat result of the target scheduling area;
extracting first network car appointment travel service data in the driving and passenger matching range from the network car appointment travel service data, wherein the first network car appointment travel service data comprise: passenger data and tenant data of online car booking travel demands and online car booking data capable of providing services for each tenant are arranged in the driver and passenger matching range;
performing driver and passenger matching profit calculation based on the first network car appointment travel service data, and determining a driver and passenger matching profit result;
sequencing the driver and product matching income results, and determining the driver and product matching results of the target scheduling area;
the determining the driver-multiplier matching range of the target scheduling area based on the heat result of the target scheduling area comprises:
when the target scheduling region is a hot region, determining that the driver and rider matching range of the target scheduling region is a region set formed by the target scheduling region and a second scheduling region which is a cold region in the first range of the target scheduling region;
and when the target scheduling area is a cold area, determining the driver-multiplier matching range of the target scheduling area as the target scheduling area.
2. The method of claim 1, wherein determining a supply-demand matching result for the target scheduling area based on the network appointment travel service data comprises:
performing supply-demand difference calculation based on passenger data and tenant data of online car-booking travel demands corresponding to the target scheduling area and online car-booking data which can be provided by each tenant to obtain a supply-demand difference result of the target scheduling area;
and determining a supply and demand matching result of the target scheduling area based on the supply and demand difference result of the target scheduling area.
3. The method of claim 2, wherein the supply-demand difference result is calculated by the formula:
wherein the content of the first and second substances,E(g,t) The result of the poor supply and demand is shown,
representing the total demand of taxi appointment in the target dispatching area,
and the network appointment quantity represents all the network appointment quantities of the services available under the tenants of the services available in the target area.
4. The method of claim 1, wherein when the target scheduling region is a hotspot, the driver-multiplier matching benefit result is calculated by the following formula:
wherein the content of the first and second substances,αandγin order to be a coefficient of gain,
indicating a poor supply and demand result for the target scheduling region,
and representing the result of the supply and demand difference of a second scheduling area which is a cold area in the first range of the target scheduling area.
5. The utility model provides a net car appointment scheduling device based on many tenants which characterized in that includes:
the obtaining module is used for obtaining the network car booking travel service data of the target dispatching area, and the network car booking travel service data comprises: passenger data and tenant data of online car booking travel demands corresponding to the target scheduling area and other scheduling areas in a first range of the target scheduling area, and online car booking data capable of providing services for each tenant;
the first processing module is used for determining a supply and demand matching result of the target scheduling area based on the network appointment trip service data;
the second processing module is used for carrying out riding matching on the network appointment vehicle travel service data according to the supply and demand matching result to obtain a riding matching result of the target scheduling area;
determining a supply and demand matching result of the target scheduling area based on the supply and demand difference result of the target scheduling area, including:
judging whether the supply and demand difference result exceeds a preset supply and demand difference result threshold value or not;
when the supply and demand difference result exceeds the preset supply and demand difference result threshold, determining the target scheduling area as a hot area;
when the supply and demand difference result does not exceed the preset supply and demand difference result threshold, determining that the target scheduling area is a cold area;
the step of performing driver-and-passenger matching on the network appointment vehicle travel service data according to the supply-and-demand matching result to obtain a driver-and-passenger matching result of the target scheduling area includes:
determining a driver-and-rider matching range of the target scheduling area based on the heat result of the target scheduling area;
extracting first network car appointment travel service data in the driving and riding matching range from the network car appointment travel service data, wherein the first network car appointment travel service data comprises: passenger data and tenant data of online car booking travel demands and online car booking data capable of providing services for each tenant are arranged in the driver and passenger matching range;
performing driver and passenger matching profit calculation based on the first network car appointment travel service data, and determining a driver and passenger matching profit result;
sequencing the driver and multiplier matching income results, and determining the driver and multiplier matching results of the target scheduling area;
the determining the driver-multiplier matching range of the target scheduling area based on the heat result of the target scheduling area comprises:
when the target scheduling region is a hot region, determining that the driver and multiplier matching range of the target scheduling region is a region set formed by the target scheduling region and a second scheduling region which is a cold region in the first range of the target scheduling region;
and when the target scheduling area is a cold area, determining the driver-multiplier matching range of the target scheduling area as the target scheduling area.
6. An electronic device, comprising:
a memory and a processor communicatively coupled to each other, the memory having stored therein computer instructions, the processor executing the computer instructions to perform the method of any of claims 1-4.
7. A computer-readable storage medium having stored thereon computer instructions for causing a computer to thereby perform the method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111387067.1A CN114169703B (en) | 2021-11-22 | 2021-11-22 | Network taxi appointment scheduling method and device based on multiple tenants |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111387067.1A CN114169703B (en) | 2021-11-22 | 2021-11-22 | Network taxi appointment scheduling method and device based on multiple tenants |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114169703A CN114169703A (en) | 2022-03-11 |
| CN114169703B true CN114169703B (en) | 2022-08-19 |
Family
ID=80479975
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111387067.1A Active CN114169703B (en) | 2021-11-22 | 2021-11-22 | Network taxi appointment scheduling method and device based on multiple tenants |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114169703B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110066823A (en) * | 2009-12-11 | 2011-06-17 | 한국과학기술원 | Method for control communication module for olev |
| CN111967720A (en) * | 2020-07-22 | 2020-11-20 | 汉海信息技术(上海)有限公司 | Scheduling method and system for network appointment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016127918A1 (en) * | 2015-02-13 | 2016-08-18 | 北京嘀嘀无限科技发展有限公司 | Transport capacity scheduling method and system |
-
2021
- 2021-11-22 CN CN202111387067.1A patent/CN114169703B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110066823A (en) * | 2009-12-11 | 2011-06-17 | 한국과학기술원 | Method for control communication module for olev |
| CN111967720A (en) * | 2020-07-22 | 2020-11-20 | 汉海信息技术(上海)有限公司 | Scheduling method and system for network appointment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114169703A (en) | 2022-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2017107740A1 (en) | Systems and methods for determining a target vehicle/provider | |
| WO2017088828A1 (en) | Systems and methods for allocating sharable orders | |
| CN109478275B (en) | System and method for distributing service requests | |
| US11398002B2 (en) | Systems and methods for determining an estimated time of arrival | |
| CN110741402B (en) | System and method for capacity scheduling | |
| CN113326126B (en) | Task processing method, task scheduling method, device and computer equipment | |
| US20200050938A1 (en) | Systems and methods for improvement of index prediction and model building | |
| US20180032928A1 (en) | Methods and systems for transport capacity scheduling | |
| JP6629878B2 (en) | System and method for allocating reservation orders | |
| TW201741993A (en) | System and method for determining routes of transportation service | |
| CN111052158A (en) | System and method for distributing service requests | |
| US20210035172A1 (en) | Systems and methods for transport pricing | |
| WO2022116447A1 (en) | Bus dispatching method and apparatus, and computer device and medium | |
| CN111433795A (en) | System and method for determining estimated arrival time of online-to-offline service | |
| US20210042817A1 (en) | Methods and systems for order allocation | |
| CN110992123B (en) | Order distribution method and device | |
| US11790289B2 (en) | Systems and methods for managing dynamic transportation networks using simulated future scenarios | |
| CN111222903B (en) | System and method for processing data from an online on-demand service platform | |
| CN111275229B (en) | Resource model training method, resource gap prediction method, device and electronic equipment | |
| CN114169703B (en) | Network taxi appointment scheduling method and device based on multiple tenants | |
| CN111833595B (en) | Shared automobile auxiliary vehicle configuration method, electronic device and storage medium | |
| CN112669603A (en) | Urban traffic cooperation method and device based on big data | |
| WO2019128477A1 (en) | Systems and methods for assigning service requests | |
| WO2021129831A1 (en) | Vehicle allocation method and apparatus, device and computer-readable storage medium | |
| Hou et al. | An incentive-compatible combinatorial auction design for charging network scheduling of battery electric vehicles |
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 |