Resource allocation method, electronic device, storage medium, and computer program product

Abstract

The present disclosure provides a resource allocation method, an electronic device, a storage medium and a computer program product. The resource allocation method of the present disclosure comprises: determining a subject predicted quantity of a second node at a second time according to a subject performance quantity of the first node at a first time, the first node being an upstream node of the second node, and the second time being the arrival time of the subject at the first node from the first node to the second node at the first time; determining a resource allocation strategy of the second node at the second time according to the subject predicted quantity and a bookable quantity of the second node at the second time; and determining a booked resource quota and a non-booked resource quota of the second node at the second time according to the resource allocation strategy. According to the scheme of the present disclosure, the road resources are dynamically adjusted in real time, so that the road resources can better meet the travel demand, and the traffic efficiency is further improved.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of reservation travel, and in particular to a resource allocation method, an electronic device, a storage medium and a computer program product. BACKGROUND

[0002] In the field of traffic travel, the supply of road resources has reached saturation, and it is difficult to alleviate the traffic pressure through incremental development. Through the reservation travel mechanism, the road resource allocation efficiency can be improved while ensuring the certainty of travel, effectively alleviating traffic congestion and enhancing the response ability of travel demand.

[0003] In related technologies, the road resource allocation system based on the reservation mechanism mostly adopts a static configuration strategy, that is, a fixed allocation ratio is used after the reservation and non-reservation resources are divided. Although this mode guarantees the rights and interests of reservation vehicles, it has obvious defects: on the one hand, the fixed allocation ratio cannot adapt to dynamic demand due to the spatio-temporal mismatch between reservation demand and random traffic flow; on the other hand, the non-reservation resources lack a real-time redistribution mechanism, resulting in the problem of resource mismatch between the idle reservation channels and the congested non-reservation channels. In the face of sudden traffic incidents or road condition changes, the system is limited in resource utilization efficiency due to the lack of dynamic response mechanism, and it is difficult to maximize the satisfaction of travel demand. SUMMARY

[0004] The present disclosure provides a resource allocation method, an electronic device, a storage medium and a computer program product.

[0005] According to one aspect of the present disclosure, a resource allocation method is provided, comprising: determining a subject prediction amount of a second node at a second time according to a subject performance amount of a first node at a first time, the first node being an upstream node of the second node, and the second time being the arrival time of a subject from the first node to the second node at the first time; determining a resource allocation strategy of the second node at the second time according to the subject prediction amount and a reservation amount of the second node at the second time; and determining a reservation resource quota and a non-reservation resource quota of the second node at the second time according to the resource allocation strategy.

[0006] In some embodiments, determining the resource allocation strategy of the second node at the second time according to the subject prediction amount and the reservation amount of the second node at the second time comprises: calculating a first ratio of the subject prediction amount to the reservation amount of the second node at the second time, the first ratio being a performance rate of the second node at the second time; and determining a first allocation strategy if the first ratio is greater than a first threshold, or determining a second allocation strategy if the first ratio is less than a second threshold.

[0007] In some embodiments, determining the number of reserved resources and the number of non-reserved resources of the second node at the second time according to the resource allocation strategy comprises: in the case that the resource allocation strategy is the first allocation strategy, determining a first difference between the subject prediction and the total reserved number of the second node; determining a number of resource units to be re-allocated from non-reserved resources to reserved resources according to a ratio of the first difference to the number of resource units in the second node; taking a product of the number of resource units to be re-allocated and the number of re-allocatable resource units as a resource re-allocation number; and taking a sum of an initial number of reserved resources of the second node at the second time and the resource re-allocation number as the number of reserved resources of the second node at the second time; and taking a difference between an initial number of non-reserved resources of the second node at the second time and the resource re-allocation number as the number of non-reserved resources of the second node at the second time.

[0008] In some embodiments, determining the number of resource units to be re-allocated from non-reserved resources to reserved resources according to a ratio of the first difference to the number of resource units in the second node comprises: determining an expected number of resource units to be re-allocated from non-reserved resources to reserved resources according to a ratio of the first difference to the number of resource units in the second node; in the case that a difference between the initial number of non-reserved resource units and the non-reserved resource fairness value is greater than or equal to the expected number of resource units to be re-allocated, taking the expected number of resource units to be re-allocated as the number of resource units to be re-allocated; or in the case that the difference between the initial number of non-reserved resource units and the non-reserved resource fairness value is less than the expected number of resource units to be re-allocated, taking the difference as the number of resource units to be re-allocated.

[0009] In some embodiments, determining the number of reserved resources and the number of non-reserved resources of the second node at the second time according to the resource allocation strategy comprises: in the case that the resource allocation strategy is the second allocation strategy, determining a second difference between the total reserved number of the second node and the subject prediction; in the case that the second difference is greater than the number of resource units in the second node and a number of reserved candidate subjects of the second node at the second time is greater than or equal to a candidate threshold, determining a number of resource units to be re-allocated from reserved resources to non-reserved resources according to the second difference; taking a product of the number of resource units to be re-allocated and the number of re-allocatable resource units as a resource re-allocation number; and taking a difference between an initial number of reserved resources of the second node at the second time and the resource re-allocation number as the number of reserved resources of the second node at the second time; and taking a sum of an initial number of non-reserved resources of the second node at the second time and the resource re-allocation number as the number of non-reserved resources of the second node at the second time.

[0010] In some embodiments, after determining the second difference between the total reservation quota of the second node and the subject prediction quantity, the method further comprises: when the second difference is less than the resource unit capacity in the second node or the reservation candidate subject quantity is less than the candidate threshold, allocating the passage right of the subject quantity of the second difference in the reservation resource to the subject using the non-reservation resource.

[0011] In some embodiments, the method further comprises: determining a first statistical quantity according to the number of reservation failure subjects of the second node at the second time and the number of subjects with the directing receiving device set in the non-reservation resource; and taking the first statistical quantity as the reservation candidate subject quantity; or taking the product of an environmental influence coefficient and the first statistical quantity as the reservation candidate subject quantity, the environmental influence coefficient representing the influence degree of the weather environment and / or the traffic environment on the number of subjects using the non-reservation resource.

[0012] In some embodiments, after determining the resource allocation strategy of the second node at the second time, the method further comprises: when the time length between the first time and the second time is less than a time length threshold, taking the reservation resource quota and the non-reservation resource quota of the second node at the second time as the reservation resource quota and the non-reservation resource quota of the second node at a target time period after the second time, respectively.

[0013] In some embodiments, after determining the resource allocation strategy of the second node at the second time, the method further comprises: determining the reservation resource quota and the non-reservation resource quota of a plurality of downstream nodes of the second node according to the reservation resource quota and the non-reservation resource quota of the second node at the second time.

[0014] According to another aspect of the present disclosure, an electronic device is provided, comprising: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, so that the processor executes the resource allocation method of any embodiment of the present disclosure.

[0015] According to still another aspect of the present disclosure, a readable storage medium is provided, the readable storage medium storing execution instructions, the execution instructions being executed by a processor to implement the resource allocation method of any embodiment of the present disclosure.

[0016] According to yet another aspect of the present disclosure, a computer program product is provided, comprising a computer program, the computer program being executed by a processor to implement the resource allocation method of any embodiment of the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0017] The accompanying drawings, which are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the present disclosure and together with the description serve to explain the principles of the present disclosure.

[0018] Figure 1 is an application scenario of a resource allocation method according to an embodiment of the present disclosure.

[0019] Figure 2 is a flowchart of a resource allocation method according to an embodiment of the present disclosure.

[0020] Figure 3 is a flowchart of a resource dynamic adjustment process according to an embodiment of the present disclosure.

[0021] Figure 4 is a structural schematic block diagram of a resource allocation apparatus according to an embodiment of the present disclosure.

[0022] Figure 5 is a structural schematic block diagram of an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0023] The present disclosure will be described in further detail below with reference to the drawings and examples. It can be understood that the specific examples described herein are only used to explain the related content, and not to limit the present disclosure. In addition, it should be noted that, for the convenience of description, only the parts related to the present disclosure are shown in the drawings.

[0024] It should be noted that the embodiments in the present disclosure and the features in the embodiments can be combined with each other without conflict. The technical solutions of the present disclosure will be described in detail below with reference to the drawings and in combination with the embodiments.

[0025] In the field of traffic travel, the supply of road resources has reached saturation, and it is difficult to alleviate the traffic pressure by incremental development. Through the reservation travel mechanism, the road resource allocation efficiency can be improved while ensuring the certainty of travel, effectively alleviating traffic congestion and enhancing the response ability of travel demand.

[0026] In the related art, the road resource allocation system based on the reservation mechanism usually adopts a static resource configuration strategy, that is, after the initial division of the reserved resources and the non-reserved resources is completed, the fixed resource configuration ratio is maintained in the service period. Although this rigid allocation mode can ensure the right of way of the reserved vehicles, it exposes significant limitations in actual operation: on the one hand, there are differences in the spatial and temporal distribution between the reservation demand and the random traffic flow, and the fixed quota is difficult to adapt to the dynamic traffic demand changes; on the other hand, the road resources in the non-reserved period cannot be dynamically redistributed according to the real-time traffic state, resulting in the coexistence of the idle resources in the reserved channel during the idle period and the resource shortage in the non-reserved channel during the peak period. Especially in the case of sudden traffic events or sudden changes in the operation state of the road network, the existing system lacks dynamic adjustment capability, which not only reduces the overall utilization efficiency of the road resources, but also restricts the maximum satisfaction of the travel demand.

[0027] To this end, the present disclosure proposes a resource allocation method.

[0028] Figure 1 is an application scenario diagram of the resource allocation method according to the embodiments of the present disclosure. As shown in Figure 1 , in this application scenario, a server 100 and a terminal device 200 can be included. The server 100 and the terminal device 200 can be connected through a network or Bluetooth, etc. to perform data interaction. The server 100 can be a cloud server or a physical server, and the terminal device 200 can be a computer, a mobile phone, a tablet computer, etc. As an example, the server 100 can be used to provide the basic data required for running the resource allocation method, and the terminal device 200 can execute the resource allocation method of the present disclosure based on the basic data provided by the server 100.

[0029] Figure 2 is a flowchart of the resource allocation method according to the embodiments of the present disclosure. As shown in Figure 2 , the present disclosure proposes a resource allocation method M200, which reallocates the number of reserved resources and non-reserved resources of a second node at a second time according to the subject performance of the first node at a first time through steps S210 to S230. In this way, the road resources can be more in line with the travel demand by dynamically adjusting the road resources in real time, and the traffic efficiency is further improved.

[0030] In step S210, the subject predicted amount of the second node at the second time is determined according to the subject performance of the first node at the first time.

[0031] The first node and the second node are nodes with main flow changes in a road network, such as intersections, crossroads, highway intersections, subway station entrances, toll gates, and public transportation schedules. Moreover, the first node and the second node have large main flows, and at least during peak hours, congestion occurs, and there is a need to relieve congestion and queue through reservation. The main body can be a vehicle, a pedestrian, and the like, which is not limited herein.

[0032] In the present disclosure, the first node is an upstream node of the second node, and the first node and the second node can not be adjacent in space, and the number of the first node is not fixed.

[0033] The first time is a time that has occurred in the current traffic period, and the second time is a time that has not occurred. According to the average speed of the main body from the first node to the second node, the time of the main body from the first node to the second node at the first time is the second time, that is, the second time is the arrival time of the main body from the first node to the second node at the first time.

[0034] The main body fulfillment amount is the actual number of main bodies using the reservation resources in the first node at the first time. When the main body is a vehicle, the vehicle should be standardized according to the vehicle type to determine the standard vehicle number corresponding to the vehicle. For example, a five-seat sedan is considered as one standard vehicle, so a medium-sized bus is two standard vehicles, and a large-sized bus or a public bus is three standard vehicles. The standard vehicle is a standard for measuring the space occupied by the vehicle, and different vehicle types occupy different spaces. Therefore, under the condition that the capacity of the node is fixed, different vehicle types occupy different reservation quotas, and the standard vehicle is used in the present application to standardize the quotas of various vehicle types.

[0035] The way to determine the main body fulfillment amount of the first node at the first time can be a road side monitoring device of the first node, which is not limited herein. Due to environmental factors such as weather or main body factors, there may be a situation of reservation but no fulfillment, and there may be idle reservation resources. Therefore, by changing the reservation resource quota and the non-reservation resource quota of the downstream node in real time through the fulfillment amount of the upstream node, the resource utilization efficiency can be maximized.

[0036] In addition, the number of upstream nodes of each node is not unique. Therefore, the number of the first node can not be unique.

[0037] The main body prediction amount is a prediction result of the main body fulfillment amount of the second node at the second time according to the main body fulfillment amount of the first node.

[0038] In some embodiments, due to the continuity of space, the main body of the second node is usually used in the upstream node, so the main body prediction of the second node at the second time is affected by the main body fulfillment of all the first nodes. Taking the main body as a car and the node as a highway intersection as an example, in an ideal state, without the main body entering or leaving the channel of the second node, the main body fulfillment of the second node should be the sum of the main body fulfillment of all the first nodes.

[0039] If there is only one upstream node, the main body prediction of the downstream node can be: wherein, is the main body prediction of node i at time t+1. is a prediction function for predicting the main body fulfillment of the downstream node according to the main body fulfillment of the upstream node. is the main body fulfillment of node i-1 at time t. The main body fulfillment of the first node at the first time is represented as , and the main body prediction of the second node at the second time is represented as .

[0040] If there are multiple upstream nodes, the main body prediction of the downstream node can be: wherein, is the influence weight of the nth first node, i.e., the influence degree of the nth first node on , n is the number of first nodes, and j is the serial number of the first node.

[0041] It should be noted that the number of first nodes can not be unique, and n represents the total number of first nodes. The distance between each first node and the second node can be different, the time t at which each first node is triggered can be different, and the positions of the first nodes are different. The time from each first node to the second node is different, so the arrival time from the first node to the second node is different corresponding to different first nodes, and the second time should be the set of arrival times of each first node to the second node. Different first nodes i-1 correspond to the first time t uniquely.

[0042] Step S220, determining the resource allocation strategy of the second node at the second time according to the main body prediction and the bookable amount of the second node at the second time.

[0043] The bookable amount represents the number of main bodies that can be booked by the second node at the second time, and the bookable amount is related to the physical carrying capacity of the second node and also related to the state of the second node at the second time, which is not limited here.

[0044] In a case where the first ratio between the subject prediction quantity and the bookable quantity of the second node at the second time is greater than a first threshold value, the demand for the booking resource of the second node in the current scenario is large, and the first allocation strategy is configured for the second node. Conversely, in a case where the first ratio is less than a second threshold value, the demand for the booking resource of the second node in the current scenario is small, and the second allocation strategy is configured for the second node.

[0045] The first ratio is between the first threshold value and the second threshold value, indicating that the demand for the booking resource of the second node in the current scenario is adapted to the initial booking resource quota, and no dynamic adjustment of the quota of the booking resource and the non-booking resource of the second node at the second time is performed. It should be noted that the first threshold value can be 0.8, 0.95, or 1, and can also be other values, which are not limited herein. Similarly, the second threshold value can be any value, which is not limited herein. The first threshold value should be greater than the second threshold value.

[0046] In step S230, the booking resource quota and the non-booking resource quota of the second node at the second time are determined according to the resource allocation strategy.

[0047] The booking resource and the non-booking resource jointly constitute the resource of the second node. In the related art, the resource of the second node is all non-booking resource, and all subjects can freely select the resource, but congestion and queuing problems occur in the peak period, affecting the traffic efficiency. Therefore, the present disclosure classifies each node including the second node, and only the subject who books and obtains the traffic right can use the booking resource. The subject who does not book or whose booking does not obtain the traffic right cannot use the booking resource. Through booking, the present disclosure allocates a resource use time table, such as a route and a traffic time table, to all subjects whose booking is successful. The subject whose booking is successful needs to use the booked resource according to the resource use time table. The resource that only the subject with the use right is allowed to use is called booking resource, and the resource that does not need to be booked can be used is called non-booking resource.

[0048] In a case where the resource allocation strategy is the first allocation strategy, a first difference value between the subject prediction quantity and the total booking quota of the second node is determined, and a resource unit reallocation quantity converted from the non-booking resource to the booking resource is determined according to a ratio of the first difference value to the resource unit capacity in the second node. A product of the resource unit reallocation quantity and the bookable quota of the resource unit is taken as a resource reallocation quota, a sum of the initial booking resource quota of the second node at the second time and the resource reallocation quota is taken as the booking resource quota of the second node at the second time, and a difference between the initial non-booking resource quota of the second node at the second time and the resource reallocation quota is taken as the non-booking resource quota of the second node at the second time.

[0049] Specifically, the total reservation quota is the total carrying capacity of the reservation resource of the second node, i.e., the limit of the number of subjects that can be carried by the second node. The total reservation quota should be greater than or equal to the reservable amount of the second node at the second time. In the case where the first ratio exceeds the first threshold value, it indicates that the demand of the subjects for the reservation resource is large, and the demand gap is quantified by the first difference value.

[0050] Further, a ratio between the first difference value and the capacity of the resource unit is calculated, and the integer part of the ratio is taken as a first part of the expected reallocation quantity, and the decimal part of the ratio is compared with the reallocation threshold value. If the decimal part of the ratio is greater than the reallocation threshold value, the first part plus 1 is taken as the expected reallocation quantity; otherwise, the first part is taken as the expected reallocation quantity. Further, part of the non-reservation resource is taken as the reservation resource to meet the demand of the subjects for the reservation resource.

[0051] For example, the first difference value is 50 standard cars, the capacity of the single lane is 80, the ratio of the two is 0.62, and if the reallocation threshold value is 0.5, the expected reallocation quantity is 1. If the ratio of the first difference value and the capacity of the single lane is 1.62, the expected reallocation quantity is 2.

[0052] In some embodiments, according to the ratio of the first difference value and the capacity of the resource unit in the second node, the expected reallocation quantity of the non-reservation resource converted to the reservation resource is determined; when the difference between the initial number of non-reservation resource units and the non-reservation resource fairness value is greater than or equal to the expected reallocation quantity, the expected reallocation quantity is taken as the resource unit reallocation quantity; or when the difference between the initial number of non-reservation resource units and the non-reservation resource fairness value is less than the expected reallocation quantity, the difference is taken as the resource unit reallocation quantity.

[0053] It should be noted that the non-reservation resource fairness value is the minimum number of resource units reserved for the non-reservation resource when the resource unit quantities of the reservation resource and the non-reservation resource are dynamically adjusted. For example, the resource unit of the non-reservation resource is 3, and if the expected reallocation quantity is also 3, it indicates that 3 non-reservation resource units are expected to be converted to the reservation resource, and then the non-reservation subjects will not be able to use the second node. Although the reservation mechanism can greatly alleviate the resource pressure, it cannot force all subjects to reserve use, and therefore 1 to 2 resource units should be reserved for the non-reservation resource. That is, the non-reservation resource fairness value is 1 or 2, and when the difference between the initial number of non-reservation resource units and the non-reservation resource fairness value is less than the expected reallocation quantity, the difference between the initial number of non-reservation resource units and the non-reservation resource fairness value is taken as the resource unit reallocation quantity, and an appropriate amount of resource units is reserved for the non-reservation resource. At this time, the demand subjects for the reservation resource can cope with the demand gap through waiting, switching routes, etc. The non-reservation resource fairness value can be any value, which is not limited here.

[0054] In the case that the resource allocation strategy is the second allocation strategy, a second difference between the total reservation quota of the second node and the subject prediction is determined; in the case that the second difference is greater than the resource unit accommodation capacity in the second node and the number of reservation candidate subjects of the second node at the second time is greater than or equal to the candidate threshold, the number of resource units re-allocated from the reserved resources to the non-reserved resources is determined according to the second difference; the product of the number of resource units re-allocated and the reservation quota of the resource unit is taken as the resource re-allocation quota; the difference between the initial reserved resource quota of the second node at the second time and the resource re-allocation quota is taken as the reserved resource quota of the second node at the second time; and the sum of the initial non-reserved resource quota of the second node at the second time and the resource re-allocation quota is taken as the non-reserved resource quota of the second node at the second time.

[0055] In the second allocation strategy, it is proved that the demand for the reserved resources is less, which may be due to some subjects failing to reserve, or some subjects freely choosing the use time in the tolerant time period of the allocated resource use time table, resulting in the difficult-to-control situation that fewer subjects appear at some time. Therefore, the second difference between the total reservation quota of the second node and the subject prediction is used to determine the supply surplus.

[0056] Specifically, if the second difference is greater than the resource unit accommodation capacity in the second node, it is proved that there is at least one resource unit that can be used as a non-reserved resource. However, whether to convert the resource unit from a reserved resource to a non-reserved resource mainly depends on whether the subjects in the non-reserved resource have reservation willingness. If a large part of the subjects in the non-reserved resource are failed reservation subjects, or can obtain the use permission message of the reserved resource according to the guidance and use the reserved resource in time, then the excess reserved resource quota can be allocated to these reservation candidate subjects. On the contrary, if most of the subjects have no reservation willingness or do not have the guidance receiving equipment to obtain the use permission of the reserved resource, then the excess resource unit is converted from the reserved resource to the non-reserved resource.

[0057] That is, in the case that the second difference is less than the resource unit accommodation capacity in the second node or the number of reservation candidate subjects is less than the candidate threshold, the use permission of the number of subjects in the second difference in the reserved resource is allocated to the subjects using the non-reserved resource.

[0058] The reservation candidate subject can be a failed reservation subject, or a subject with a guidance receiving equipment. In addition, the candidate threshold can be set according to the demand, which is not limited here.

[0059] The resource allocation method of the present disclosure adjusts the number of reservations and non-reservations of downstream nodes according to the real-time subject flow of upstream nodes, solving the problem of traditional resource "rigid division". For example, during the morning rush hour, the resource units of the reservation resources of the downstream nodes are temporarily increased according to the subject fulfillment amount of the upstream nodes, so that the reservation subjects do not need to queue; when the subject flow is low, the extra resource units are converted back to non-reservation resources, or the use permission of the reservation resources is allocated to the subjects using the non-reservation resources, avoiding resource waste. This intelligent allocation not only allows the reservation subjects to enjoy smoothness, but also ensures that the non-reservation subjects have at least basic resources available, improving the utilization rate of resources and reducing congestion.

[0060] Figure 3 is a resource dynamic adjustment process flowchart according to the embodiments of the present disclosure. The resource dynamic adjustment process will be described below in combination with Figure 3

[0061] In step S301, the subject makes a reservation application. The subject can make a reservation in the reservation period, and provide the desired node and the desired use period of the node, such as the starting point of travel, the end point of travel, the starting period of travel, the desired arrival period, etc. The subject can also provide the purpose of use to determine the use rigidity and priority. Of course, the priority can be bound to the account information of the subject, that is, bound to the historical fulfillment of the subject. The higher the historical fulfillment rate, the higher the priority. In step S302, the reservation is successful.

[0062] In step S303, a resource use schedule is allocated to each subject according to the reservation application of each subject. The resource use schedule records the time or period of the subject using each node. Of course, due to the limited carrying capacity of the reservation resources, not all subjects can successfully reserve. For the subjects who fail to reserve, they will be marked as reservation alternative subjects, and in principle can only use non-reservation resources, but if there are temporary vacancies in the reservation resources, they can be preferentially provided to these reservation alternative subjects.

[0063] Further, in the travel process, the subject prediction amount of the downstream nodes at the subsequent time is determined in real time according to the subject fulfillment amount of each road node. In step S304, the subject fulfillment amount of the first node at the first time is collected by the roadside device, and then the subject prediction amount of the second node at the second time is determined in step S305. The first node is the upstream node of the second node. The second time is the arrival time of the subject from the first node to the second node at the average speed (which can be the average speed from the first node to the second node).

[0064] Of course, for different second nodes, the number of first nodes is dynamically changed and can be 1 or the remaining number, which is not limited here.​

[0065] Further, according to the subject prediction and the bookable amount of the second node at the second time, a resource allocation strategy of the second node at the second time is determined. That is, a first ratio of the subject prediction to the bookable amount of the second node at the second time is calculated, and the first ratio is the fulfillment rate of the second node at the second time. In step S306, it is determined whether the first ratio is greater than a first threshold value. In the case where the first ratio is greater than the first threshold value, a first allocation strategy is determined in step S307. In the case where the first ratio is not greater than the first threshold value, it is determined in step S308 whether the first ratio is less than a second threshold value. In the case where the first ratio is less than the second threshold value, a second allocation strategy is determined in step S309. In the case where the first ratio is not less than (equal to) the second threshold value, step S310 is entered, and the allocation strategy is kept unchanged.

[0066] If the first ratio is greater than the first threshold value, the number of the bookable resource and the non-bookable resource is adjusted according to the first allocation strategy. In step S311, the number of resource reallocation is determined according to the ratio of the first difference value to the capacity of the resource unit. First, the first difference value between the subject prediction and the total bookable number of the second node is determined; and then, the number of resource units converted from the non-bookable resource to the bookable resource is determined according to the ratio of the first difference value to the capacity of the resource unit in the second node; and the product of the number of resource units and the bookable number of the resource unit is taken as the number of resource reallocation. In step S312, the number of the bookable resource and the non-bookable resource is determined. The sum of the initial bookable number of the second node at the second time and the number of resource reallocation is taken as the bookable number of the second node at the second time; and the difference between the initial non-bookable number of the second node at the second time and the number of resource reallocation is taken as the non-bookable number of the second node at the second time.

[0067] Of course, in the process of allocation, it is necessary to ensure that the non-bookable resource unit is at least 0, so as to ensure that the non-bookable subject can pass through the second node. The minimum value of the non-bookable resource unit reserved for the second node is the non-bookable resource fairness value, and the specific value is not limited. Specifically, the expected number of resource units converted from the non-bookable resource to the bookable resource is determined according to the ratio of the first difference value to the capacity of the resource unit in the second node; when the difference between the initial non-bookable number of resource units and the non-bookable resource fairness value is greater than or equal to the expected number of resource units, the expected number of resource units is taken as the number of resource reallocation; or when the difference between the initial non-bookable number of resource units and the non-bookable resource fairness value is less than the expected number of resource units, the difference is taken as the number of resource reallocation.

[0068] In step S309, in the case where the resource allocation strategy is the second allocation strategy, the second difference value between the total bookable number of the second node and the subject prediction is determined.

[0069] In step S313, it is determined whether the second difference value is greater than the resource unit capacity. If the second difference value is greater than the resource unit capacity in the second node, step S314 is executed to determine whether the number of reservation candidates is greater than or equal to the candidate threshold value.

[0070] If the number of reservation candidates in the second node at the second time is greater than or equal to the candidate threshold value, step S312 is executed to determine the reservation resource quota and the non-reservation resource quota. That is, according to the second difference value, the number of resource units to be reallocated from the reservation resource to the non-reservation resource is determined; the product of the number of resource units to be reallocated and the number of available reservation quotas of the resource units is taken as the resource reallocation quota; the difference between the initial reservation resource quota of the second node at the second time and the resource reallocation quota is taken as the reservation resource quota of the second node at the second time; and the sum of the initial non-reservation resource quota of the second node at the second time and the resource reallocation quota is taken as the non-reservation resource quota of the second node at the second time.

[0071] In addition, when the second difference value is less than the resource unit capacity in the second node or the number of reservation candidates is less than the candidate threshold value, step S315 is executed to allocate the use right of the reservation resource to the subject using the non-reservation resource. That is, the passage right of the number of subjects corresponding to the second difference value in the reservation resource is allocated to the subject using the non-reservation resource. Of course, the non-reservation subject can also be guided to use the reservation resource through an offline guiding device.

[0072] In step S310, if the first ratio is between the first threshold value and the second threshold value, the number of resource units of the initial reservation resource quota and the initial non-reservation resource quota is maintained unchanged. Then, step S312 is executed to determine the reservation resource quota and the non-reservation resource quota. That is, the initial reservation resource quota is taken as the reservation resource quota, and the initial non-reservation resource quota is taken as the non-reservation resource quota.

[0073] In addition, according to the number of reservation failure subjects of the second node at the second time and the number of subjects provided with the guiding receiving device in the non-reservation resource, the first statistical quantity is determined; and the first statistical quantity is taken as the number of reservation candidates; or the product of the environmental influence coefficient and the first statistical quantity is taken as the number of reservation candidates, the environmental influence coefficient representing the influence degree of the weather environment and / or the traffic environment on the number of subjects in the non-reservation resource. The environmental influence coefficient has different values according to different conditions, which is not limited here. The environmental influence coefficient should be any value between 0 and 1, and is inversely proportional to the influence degree. If the environment is worse, the environmental influence coefficient is smaller. If the environment is suitable for travel, the environmental influence coefficient tends to 1.

[0074] In some embodiments, after determining the resource allocation strategy of the second node at the second time, the method further comprises: when the time length between the first time and the second time is less than the time length threshold, taking the number of reserved resources and the number of non-reserved resources of the second node at the second time as the number of reserved resources and the number of non-reserved resources of the second node at a target time period after the second time, respectively.

[0075] That is, when the time length of the adjacent time interval is detected to be less than the time length threshold, the current optimization scheme is automatically extended to cover the subsequent time period, forming a batch resource allocation scheme. This time period binding strategy not only maintains the dynamic response capability, but also ensures that each resource allocation decision lasts at least the basic operation period of the target time period, avoiding invalid adjustments caused by small fluctuations in the subject flow, and reducing the instruction refresh frequency of the roadside control device and the subject navigation system, thereby reducing the energy consumption of the overall system while ensuring that the subject has a stable adaptation buffer period for changes in resource layout.

[0076] Specifically, after allocating the number of resource units for the reserved resources and the non-reserved resources of the second node at the second time, the number of reserved resources and the number of non-reserved resources allocated are valid for the target time period after the second time of the second node.

[0077] Further, after determining the resource allocation strategy of the second node at the second time, the method further comprises: determining the number of reserved resources and the number of non-reserved resources of a plurality of downstream nodes of the second node based on the number of reserved resources and the number of non-reserved resources of the second node at the second time.

[0078] Similarly, after the second node completes the resource configuration, a coordination plan can also be automatically pushed to the downstream nodes based on the road network topology. This multi-node synchronous adjustment design ensures the vertical continuity of the resource unit division strategy, preventing the phenomenon of secondary aggregation of subjects caused by the expansion of reserved resource units in the upstream but not in the downstream, and significantly reducing the system operation frequency through batch decision-making. The subject can learn about the stable resource layout of multiple nodes in advance, avoiding safety hazards caused by frequent lane changes, and the roadside guide screen and other devices also do not need to be refreshed and displayed individually at each node, effectively improving the overall coordination of traffic flow.

[0079] Finally, the subject in compliance and the subject adjusting the resource unit according to the guidance are given rewards, including increasing their reservation priority, so that the success rate of their subsequent reservations is improved.

[0080] In addition, in order to encourage the subject to actively reserve, a certain positive incentive can also be given to the reserving subject. This positive incentive can be reflected in the reward measures provided by the third party, such as free highway tolls for highway reservations. These reward measures not only stimulate the enthusiasm of the subject for reservation, but also balance the differences in rights and interests between the reserving and non-reserving subjects to some extent.

[0081] In the subsequent adjustment of the reserved resources and the non-reserved resources, the use and the obtaining will be important limiting conditions, which will affect the dynamic coordination of the resources. The reservation system is not fixed, and it needs to be flexibly adjusted according to the actual situation to meet the needs of different subjects and the changes of the resources. In the adjustment process, the priority of the reservation subject, the rights and interests of the non-reservation subject, and the effectiveness of the positive incentive measures must be fully considered to ensure the reasonable allocation and efficient use of the resources. The above-mentioned several ways will be used as limiting conditions to affect the dynamic coordination of the resources in the subsequent adjustment of the reserved resources and the non-reserved resources.

[0082] It should be noted that for ambulances, police cars and other special vehicles, there is no limit on the use of permissions, and all nodes can pass at any time.

[0083] Figure 4 is a structural schematic block diagram of a resource allocation device according to an embodiment of the present disclosure.

[0084] As shown in Figure 4 , a resource allocation device 400 is shown, which comprises an estimation module 410 configured to determine a subject prediction quantity of a second node at a second time according to a subject compliance quantity of the first node at a first time, the first node being an upstream node of the second node, and the second time being the arrival time of the subject from the first node to the second node at the first time; a distribution strategy determination module 420 configured to determine a resource distribution strategy of the second node at the second time according to the subject prediction quantity and a reservable quantity of the second node at the second time; and an adjustment module 430 configured to determine a reserved resource quota and a non-reserved resource quota of the second node at the second time according to the resource distribution strategy.

[0085] The resource allocation device 400 of the present disclosure can be in the form of computer software, and each module of the resource allocation device 400 can be in the form of a computer software module.

[0086] Each module of the resource allocation device 400 of the present disclosure is provided to realize each step of the resource allocation method, and the execution principle and steps can be referred to the foregoing, which will not be described here.

[0087] Figure 5 is a structural schematic block diagram of an electronic device according to an embodiment of the present disclosure. As shown in Figure 5 , the present disclosure further provides an electronic device 1000, which comprises a processor 1200 and a memory 1300, the memory 1300 stores execution instructions, and the processor 1200 executes the execution instructions stored in the memory 1300, so that the processor 1200 executes the resource allocation method.

[0088] The hardware structure of the electronic device 1000 can be implemented using a bus architecture. The bus architecture can include any number of interconnecting buses and bridges, depending on the specific application of the hardware and the overall design constraints. The bus 1100 connects various circuits including one or more processors 1200, memory 1300, and / or hardware modules together. The bus 1100 can also connect various other circuits 1400 such as peripheral devices, voltage regulators, power management circuits, external antennas, etc.

[0089] The bus 1100 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one connection line is shown in the figure, but it does not mean that there is only one bus or one type of bus.

[0090] The present disclosure also provides a readable storage medium having a computer program stored therein, the computer program being executed by a processor to implement the above method. The "readable storage medium" can be any device that can contain, store, communicate, propagate or transport programs for use by or in conjunction with an instruction execution system, apparatus or device. More specific examples of the readable storage medium include the following: an electrical connection having one or more wires (electronic device), a portable computer disk cartridge (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM), etc.

[0091] The present disclosure also provides a computer program product, and the method of the present disclosure can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed, the flow or function of the present disclosure is executed in whole or in part.

[0092] The computer program or instructions can be stored in or transferred from one computer-readable medium to another, e.g., from one website or computer to another website or computer, by way of wired or wireless communication. The computer-readable medium can be any available medium or a combination of one or more of the available media that can be accessed by a server, data center, or the like, and includes both volatile and nonvolatile media, removable and non-removable media. The computer-readable medium can be a magnetic medium, e.g., a floppy disk, a hard disk drive, a magnetic tape; optical media, e.g., a compact disk, CD, or a digital video disk, DVD; or a semiconductor medium, e.g., a solid state hard drive. The computer-readable medium can be a volatile or non-volatile medium, or can include both volatile and non-volatile media.

[0093] Those skilled in the art will appreciate that embodiments of the present disclosure can be further implemented as a method, an electronic device, a readable storage medium, or a computer program product. Accordingly, the present disclosure can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure can take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROMs, optical storage, etc.) embodying computer-readable program code.

[0094] The present disclosure is described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart illustrations and / or block diagrams. Figure 1 one or more functions specified in the flowchart illustrations and / or block diagrams. Figure 1 means for carrying out one or more functions specified in the flowchart illustrations and / or block diagrams.

[0095] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instructions which implement the functions specified in the flowchart illustrations and / or block diagrams. Figure 1 one or more functions specified in the flowchart illustrations and / or block diagrams. Figure 1 means for carrying out one or more functions specified in the flowchart illustrations and / or block diagrams.

[0096] These computer program instructions can also be loaded into a computer or other programmable data processing devices, so that a series of operational steps are performed on the computer or other programmable data processing devices to generate computer-implemented processes, thus the instructions executed on the computer or other programmable data processing devices provide the function of implementing the processes specified in the flowchart Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0097] In the description of the present disclosure, the description of the terms "one embodiment / way", "some embodiments / ways", "example", "specific example", or "some examples" and the like means that the specific features, structures, or characteristics described in connection with the embodiment / way or example are included in at least one embodiment / way or example of the present disclosure. In the present specification, the illustrative description of the above terms does not necessarily refer to the same embodiment / way or example. Also, the specific features, structures, or characteristics described can be combined in any appropriate manner in one or more embodiments / ways or examples. In addition, the person skilled in the art can combine and combine the different embodiments / ways or examples described in the present specification and the features of the different embodiments / ways or examples without contradiction and combination.

[0098] In addition, the terms "first", "second" are only for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the technical features indicated. Therefore, the features defined with "first", "second" can explicitly or implicitly include at least one of the features. In the description of the present disclosure, the meaning of "multiple" is at least two, for example, two, three, etc., unless otherwise explicitly specified.

[0099] The person skilled in the art should understand that the above-mentioned embodiments are only for clearly illustrating the present disclosure, and not for limiting the scope of the present disclosure. Based on the above disclosure, other changes or modifications can also be made by those skilled in the art, and these changes or modifications are still within the scope of the present disclosure.

Claims

1. A resource allocation method characterized by, The method comprises: determining a subject prediction quantity of a second node at a second time according to a subject fulfillment quantity of a first node at a first time, the first node being an upstream node of the second node, and the second time being an arrival time of a subject from the first node to the second node at an average speed from the first node to the second node at the first time, the subject fulfillment quantity being an actual number of subjects using a reserved resource in the first node at the first time, the subject being a vehicle or a pedestrian; determining a resource allocation strategy of the second node at the second time according to the subject prediction quantity and a reservable quantity of the second node at the second time, comprising: calculating a first ratio of the subject prediction quantity to the reservable quantity of the second node at the second time, the first ratio being a fulfillment rate of the second node at the second time; determining a first allocation strategy when the first ratio is greater than a first threshold value, and determining a second allocation strategy when the first ratio is less than a second threshold value; and determining a reserved resource quota and a non-reserved resource quota of the second node at the second time according to the resource allocation strategy, comprising: when the resource allocation strategy is the first allocation strategy, determining a first difference between the subject prediction quantity and a total reserved quota of the second node; determining a resource unit reallocation quantity converted from a non-reserved resource to a reserved resource according to a ratio of the first difference to a capacity of a resource unit in the second node; taking a product of the resource unit reallocation quantity and a reservable quota of the resource unit as a resource reallocation quota; taking a sum of an initial reserved resource quota of the second node at the second time and the resource reallocation quota as the reserved resource quota of the second node at the second time; and taking a difference between the initial non-reserved resource quota of the second node at the second time and the resource reallocation quota as the non-reserved resource quota of the second node at the second time; only allowing a resource used by a subject having a use right to be a reserved resource, and allowing a resource used without reservation to be a non-reserved resource; when the resource allocation strategy is the second allocation strategy, determining a second difference between the total reserved quota of the second node and the subject prediction quantity; when the second difference is greater than the capacity of the resource unit in the second node and a reserved subject number of the second node at the second time is greater than or equal to a threshold value, determining a resource unit reallocation quantity converted from a reserved resource to a non-reserved resource according to the second difference; taking a product of the resource unit reallocation quantity and a reservable quota of the resource unit as a resource reallocation quota; taking a difference between the initial reserved resource quota of the second node at the second time and the resource reallocation quota as the reserved resource quota of the second node at the second time; and taking a sum of the initial non-reserved resource quota of the second node at the second time and the resource reallocation quota as the non-reserved resource quota of the second node at the second time; after determining the resource allocation strategy of the second node at the second time, the method further comprises: determining, according to the first difference and a ratio of the resource unit capacity in the second node, a resource unit reallocation quantity from non-reservation resources to reservation resources, including:

2. The resource allocation method of claim 1, wherein, determining, according to the first difference and a ratio of the resource unit capacity in the second node, an expected resource unit reallocation quantity from non-reservation resources to reservation resources; when the difference between the initial non-reservation resource unit quantity and the non-reservation resource fairness value is greater than or equal to the expected resource unit reallocation quantity, taking the expected resource unit reallocation quantity as the resource unit reallocation quantity; or when the difference between the initial non-reservation resource unit quantity and the non-reservation resource fairness value is less than the expected resource unit reallocation quantity, taking the difference as the resource unit reallocation quantity. after determining a second difference between the total reservation quota of the second node and the subject prediction quantity, further including:

3. The resource allocation method of claim 1, wherein, when the second difference is less than the resource unit capacity in the second node or the number of reservation candidate subjects is less than the candidate threshold, allocating the passage right of the subject quantity of the second difference in the reservation resource to the subjects using non-reservation resources. further including:

4. The resource allocation method of claim 1 or 3, wherein, determining a first statistical quantity according to the number of reservation failure subjects of the second node at the second time and the number of subjects with a guide receiving device in the non-reservation resource; and taking the first statistical quantity as the number of reservation candidate subjects; or taking the product of an environmental impact coefficient and the first statistical quantity as the number of reservation candidate subjects, the environmental impact coefficient representing the influence degree of weather environment and / or traffic environment on the number of subjects using non-reservation resources. after determining the resource allocation strategy of the second node at the second time, further including:

5. The method of claim 1, wherein, when the time length between the first time and the second time is less than a time length threshold, taking the reservation resource quota and the non-reservation resource quota of the second node at the second time as the reservation resource quota and the non-reservation resource quota of the second node at a target time period after the second time, respectively. including:

6. An electronic device, comprising: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, so that the processor executes the resource allocation method in any one of claims 1 to 5. The readable storage medium stores execution instructions, and the execution instructions are executed by the processor to implement the resource allocation method in any one of claims 1 to 5.

7. A readable storage medium, characterized by, The computer program is executed by the processor to implement the resource allocation method in any one of claims 1 to 5.

8. A computer program product comprising a computer program, characterized in that, ​

Images