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

Abstract

The invention provides a resource allocation method, electronic equipment, a storage medium and a computer program product. The resource allocation method comprises the following steps: according to a subject performance amount of a first node at a first moment, determining a subject prediction amount of a second node at a second moment, the first node being an upstream node of the second node, and the second moment being an arrival time of a subject from the first node to the second node at the first moment; determining a resource allocation strategy of the second node at the second moment according to the subject predicted quantity and the reservable quantity of the second node at the second moment; and according to the resource allocation strategy, determining the reserved resource quota and the non-reserved resource quota of the second node at the second moment. According to the scheme disclosed by the invention, the way of dynamically adjusting the road resources in real time is adopted, so that the road resources can better meet travel requirements, and the traffic efficiency is further improved.

Description

Technical Field

[0001] This disclosure relates to the field of reservation travel technology, and in particular to a resource allocation method, electronic device, storage medium, and computer program product. Background Technology

[0002] In the transportation sector, road resource supply is nearing saturation, making it difficult to alleviate traffic pressure through incremental development. By implementing a reservation-based travel mechanism, the efficiency of road resource allocation can be improved while ensuring travel certainty, effectively alleviating traffic congestion and enhancing the responsiveness to travel demand.

[0003] In related technologies, road resource allocation systems based on reservation mechanisms mostly adopt static configuration strategies, meaning that after allocating reserved and non-reserved resources, a fixed ratio is used. While this model protects the rights of reserved vehicles, it has significant drawbacks: firstly, the spatiotemporal misalignment between reservation demand and random traffic flow makes it difficult for the fixed ratio to adapt to dynamic needs; secondly, the lack of a real-time reallocation mechanism for non-reserved resources leads to a resource mismatch problem where reserved lanes are idle while non-reserved lanes are congested. When faced with sudden traffic events or changes in road conditions, the lack of a dynamic response mechanism limits resource utilization efficiency, making it difficult to maximize the satisfaction of travel demands. Summary of the Invention

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

[0005] According to one aspect of this disclosure, a resource allocation method is provided, comprising: determining the predicted quantity of a second node at a second time based on the subject fulfillment quantity of a first node at a first time, wherein the first node is an upstream node of the second node, and the second time is the arrival time of the subject from the first node to the second node at the first time; determining a resource allocation strategy for the second node at the second time based on the predicted quantity of the subject and the available reservation quantity of the second node at the second time; and determining the reserved resource quota and unreserved resource quota of the second node at the second time according to the resource allocation strategy.

[0006] In some implementations, determining the resource allocation strategy for the second node at the second time moment based on the predicted amount of the main entity and the available amount of the second node at the second time moment includes: calculating a first ratio of the predicted amount of the main entity to the available amount of the second node at the second time moment, the first ratio being the fulfillment rate of the second node at the second time moment; 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 implementations, determining the number of reserved and unreserved resource slots for the second node at the second time moment according to the resource allocation strategy includes: when the resource allocation strategy is a first allocation strategy, determining a first difference between the main predicted quantity and the total number of reserved slots for the second node; determining the number of resource units to be reallocated from unreserved resources to reserved resources based on the ratio of the first difference to the capacity of resource units in the second node; using the product of the number of resource units reallocated and the number of available slots for each resource unit as the number of resource units to be reallocated; using the sum of the initial number of reserved resource slots for the second node at the second time moment and the number of resource units to be reallocated as the number of reserved resource slots for the second node at the second time moment; and using the difference between the initial number of unreserved resource slots for the second node at the second time moment and the number of resource units to be reallocated as the number of unreserved resource slots for the second node at the second time moment.

[0008] In some implementations, determining the number of resource units to be reallocated from non-reserved resources to reserved resources based on the ratio of the first difference to the resource unit capacity in the second node includes: determining the expected number of resource units to be reallocated from non-reserved resources to reserved resources based on the ratio of the first difference to the resource unit capacity in the second node; when the difference between the initial number of non-reserved resource units and the fairness value of non-reserved resources is greater than or equal to the expected number of reallocations, using the expected number of reallocations as the resource unit reallocation number; or, when the difference between the initial number of non-reserved resource units and the fairness value of non-reserved resources is less than the expected number of reallocations, using the difference as the resource unit reallocation number.

[0009] In some implementations, determining the number of reserved and unreserved resource slots for the second node at the second time moment according to the resource allocation strategy includes: when the resource allocation strategy is a second allocation strategy, determining a second difference between the total number of reserved slots for the second node and the predicted number of subjects; when the second difference is greater than the capacity of resource units in the second node and the number of reserve candidates for the second node at the second time moment is greater than or equal to the candidate threshold, determining the number of resource units to be reallocated from reserved resources to unreserved resources based on the second difference; using the product of the number of resource units to be reallocated and the number of available slots for resource units as the number of resource units to be reallocated; and using the difference between the initial number of reserved resource slots for the second node at the second time moment and the number of resource units to be reallocated as the number of reserved resource slots for the second node at the second time moment; and using the sum of the initial number of unreserved resource slots for the second node at the second time moment and the number of resource units to be reallocated as the number of unreserved resource slots for the second node at the second time moment.

[0010] In some implementations, after determining the second difference between the total number of reservation slots in the second node and the predicted number of subjects, the method further includes: 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 access rights for the number of subjects in the reservation resources equal to the second difference to subjects using non-reservation resources.

[0011] In some implementations, the method further includes: determining a first statistic based on the number of entities that failed to make reservations at the second node at the second time and the number of entities with guidance receiving devices in the non-reservation resources; and using the first statistic as the number of entities to make reservations; or, using the product of an environmental impact coefficient and the first statistic as the number of entities to make reservations, wherein the environmental impact coefficient characterizes the degree of influence of weather and / or traffic conditions on the number of entities using non-reservation resources.

[0012] In some implementations, after determining the resource allocation strategy of the second node at the second time, the method further includes: when the duration between the first time and the second time is less than a duration threshold, using the reserved resource quota and unreserved resource quota of the second node at the second time as the reserved resource quota and unreserved resource quota of the second node for the target time period after the second time, respectively.

[0013] In some implementations, after determining the resource allocation strategy of the second node at the second time moment, the method further includes: determining the reserved resource quotas and unreserved resource quotas of multiple downstream nodes of the second node based on the reserved resource quotas and unreserved resource quotas of the second node at the second time moment.

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

[0015] According to another aspect of this disclosure, a readable storage medium is provided, wherein executable instructions are stored therein, which, when executed by a processor, are used to implement a resource allocation method according to any embodiment of this disclosure.

[0016] According to another aspect of this disclosure, a computer program product is provided, including a computer program that, when executed by a processor, implements a resource allocation method according to any embodiment of this disclosure. Attached Figure Description

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

[0018] Figure 1 This is an application scenario diagram of the resource allocation method according to the embodiments of this disclosure.

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

[0020] Figure 3 This is a flowchart of the resource dynamic adjustment process according to the embodiments of this disclosure.

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

[0022] Figure 5 This is a schematic block diagram of an electronic device according to one embodiment of the present disclosure. Detailed Implementation

[0023] The present disclosure will now be described in further detail with reference to the accompanying drawings and examples. It should be understood that the specific examples described herein are for illustrative purposes only and are not intended to limit the scope of the disclosure. Furthermore, it should be noted that, for ease of description, only the parts relevant to the present disclosure are shown in the accompanying drawings.

[0024] It should be noted that, where there is no conflict, the embodiments and features described in this disclosure can be combined with each other. The technical solutions of this disclosure will now be described in detail with reference to the accompanying drawings and embodiments.

[0025] In the transportation sector, road resource supply is nearing saturation, making it difficult to alleviate traffic pressure through incremental development. By implementing a reservation-based travel mechanism, the efficiency of road resource allocation can be improved while ensuring travel certainty, effectively alleviating traffic congestion and enhancing the responsiveness to travel demand.

[0026] In related technologies, road resource allocation systems based on reservation mechanisms typically employ a static resource allocation strategy. This means that after the initial allocation of reserved and non-reserved resources, a fixed resource allocation ratio is maintained throughout the service period. While this rigid allocation model ensures the passage rights of reserved vehicles, it reveals significant limitations in actual operation: Firstly, reservation demand and random traffic flow exhibit spatiotemporal differences, making it difficult for fixed quotas to adapt to dynamic changes in traffic demand. Secondly, road resources during non-reserved periods cannot be dynamically reallocated based on real-time traffic conditions, leading to a contradictory situation where idle reserved lanes exist while non-reserved lanes are strained during peak hours. Especially during sudden traffic events or abrupt changes in road network operation, existing systems lack dynamic adjustment capabilities, reducing the overall utilization efficiency of road resources and hindering the maximization of travel demand.

[0027] Therefore, this disclosure proposes a resource allocation method.

[0028] Figure 1 This is a schematic diagram illustrating an application scenario of the resource allocation method according to embodiments of this disclosure. For example... Figure 1 As shown, in this application scenario, a server 100 and a terminal device 200 may be included. The server 100 and the terminal device 200 can interact with each other via a network or Bluetooth. The server 100 can be a cloud server or a physical server, and the terminal device 200 can be a smart device such as a computer, mobile phone, or tablet. As an example, the server 100 can be used to provide the basic data required to run the resource allocation method, and the terminal device 200 can execute the resource allocation method disclosed herein based on the basic data provided by the server 100.

[0029] Figure 2 This is a flowchart of a resource allocation method according to an embodiment of this disclosure. Figure 2 As shown, this disclosure proposes a resource allocation method M200. Through steps S210 to S230, the method M200 reallocates the reserved and unreserved resources of the second node at the second time according to the main performance volume of the first node at the first time. By dynamically adjusting road resources in real time, the road resources can better meet travel needs and further improve traffic efficiency.

[0030] Step S210: Determine the predicted amount of the main entity at the second time based on the main entity performance amount of the first node at the first time.

[0031] Both the first and second nodes are points in the road network where there are significant changes in main traffic flow, such as intersections, crossroads, highway entrances, subway entrances, toll booths, and public transportation services. Furthermore, the first and second nodes experience substantial main traffic flow, leading to congestion at least during peak hours, thus creating a need for reservations to alleviate congestion and queuing. The main participants can be vehicles, pedestrians, etc., without restriction.

[0032] In this disclosure, the first node is the upstream node of the second node, the first node and the second node may not be spatially adjacent, and the number of first nodes is not fixed.

[0033] The first moment is the moment that has already occurred in the current travel cycle, while the second moment is the moment that has not yet occurred. Based on the average speed of the subject from the first node to the second node, the moment when the subject travels from the first node to the second node at the first moment is the second moment, that is, the second moment is the arrival time of the subject from the first node to the second node at the first moment.

[0034] The number of entities fulfilling their reservations refers to the actual number of entities using the reserved resources in the first node at the first moment. When the entity is a vehicle, it should be standardized according to the vehicle type to determine the corresponding number of standard vehicles. For example, if a five-seater sedan is considered a standard vehicle, then a medium-sized bus is considered two standard vehicles, and a large bus or public bus is considered three standard vehicles. The standard vehicle is a standard for measuring the space occupied by a vehicle, and different vehicle types occupy different amounts of space. Therefore, with a fixed node capacity, different vehicle types occupy different reservation slots. This application uses standard vehicles to standardize the number of slots for various vehicle types.

[0035] The method for determining the primary fulfillment volume of the first node at the first moment can be through roadside monitoring equipment of the first node, etc., without restriction. Due to environmental factors such as weather or primary factors, there may be situations where reservations are made but not fulfilled, which may result in idle reserved resources. Therefore, by adjusting the reservation and non-reservation resource quotas of downstream nodes in real time based on the fulfillment volume of upstream nodes, resource utilization efficiency can be maximized.

[0036] Furthermore, the number of upstream nodes for each node is not unique. Therefore, the number of first nodes may not be unique.

[0037] The principal prediction quantity is the prediction result of the principal performance quantity of the second node at the second time point based on the principal performance quantity of the first node.

[0038] In some implementations, due to spatial continuity, entities using upstream nodes often also use downstream nodes. Therefore, the entity prediction quantity of the second node at the second time step is affected by the entity performance quantities of all first nodes. Taking a car as the entity and a highway intersection as the node as an example, ideally, if the second node does not enter or leave the passage, the entity performance quantity of the second node should be the sum of the entity performance quantities of all first nodes.

[0039] If there is only one upstream node, then the main prediction of the downstream node can be: ,in, Let be the main prediction value of node i at time t+1. This is a prediction function used to predict the main performance volume of downstream nodes based on the main performance volume of upstream nodes. Let be the principal performance amount of node i-1 at time t. The principal performance amount of the first node at time t is expressed as: The main prediction of the second node at the second time point is expressed as: .

[0040] If there are multiple upstream nodes, then the main prediction quantity of the downstream node can be: ,in, This refers to the influence weight of the nth first node, i.e., the influence weight of the nth first node. right The degree of influence, where n is the number of first nodes and j is the sequence number of the first node.

[0041] It should be noted that the number of first nodes is not unique, and n represents the total number of first nodes. The distance between each first node and the second node can be different, the trigger time t of each first node can be different, and the positions of each first node can be different. Since the time taken to travel from each first node to the second node is different, the arrival time from the first node to the second node will be different for different first nodes. The second time should be the set of arrival times from each first node to the second node. Each different first node i-1 uniquely corresponds to the first time t.

[0042] Step S220: Determine the resource allocation strategy for the second node at the second time based on the main predicted quantity and the available reservation quantity of the second node at the second time.

[0043] The number of entities that can be booked by the second node at the second moment is related to the physical carrying capacity of the second node and the state of the second node at the second moment, but there are no restrictions here.

[0044] If the first ratio between the predicted amount of the main node and the available reservation amount of the second node at the second time point is greater than a first threshold, the demand for reservation resources for the second node in the current scenario is relatively large, and a first allocation strategy is configured for it. Conversely, if the first ratio is less than the second threshold, the demand for reservation resources for the second node in the current scenario is relatively small, and a second allocation strategy is configured for it.

[0045] Specifically, when the first ratio falls between the first and second thresholds, it indicates that the demand for reserved resources for the second node in the current scenario matches the initial number of reserved resource slots. In this case, no dynamic adjustment of the number of reserved and unreserved resources for the second node at the second moment is made. It should be noted that the first threshold can be 0.8, 0.95, or 1, or any other value; no restriction is placed here. Similarly, the second threshold can be any value; no restriction is placed here. The first threshold should be greater than the second threshold.

[0046] Step S230: According to the resource allocation strategy, determine the number of reserved and unreserved resource slots for the second node at the second time.

[0047] Reservation-only and non-reservation-only resources together constitute the resources of the second node. In related technologies, all resources of the second node are non-reservation-only, and all entities can freely choose resources. However, congestion and queuing problems may occur during peak hours, affecting traffic efficiency. Therefore, this disclosure categorizes all nodes, including the second node, and only entities that have made a reservation and obtained access permission can use reserved resources. Entities that have not made a reservation or have made a reservation but have not obtained access permission cannot use reserved resources. Through reservation, this disclosure allocates resource usage timetables, such as routes and timetables, to all entities that have successfully made reservations. Entities that have successfully made reservations must use the reserved resources according to the resource usage timetable. Resources that can only be used by entities with usage permission are called reservation resources, and resources that can be used without reservation are called non-reservation-only resources.

[0048] When the resource allocation strategy is the first allocation strategy, a first difference is determined between the main predicted quantity and the total reservation quota of the second node; and, based on the ratio of the first difference to the resource unit capacity in the second node, the number of resource units reallocated from non-reserved resources to reserved resources is determined; the product of the resource unit reallocation number and the reserveable quota of the resource unit is used as the resource reallocation quota; and the sum of the initial reserved resource quota and the resource reallocation quota of the second node at the second time is used as the reserved resource quota of the second node at the second time; and the difference between the initial non-reserved resource quota and the resource reallocation quota of the second node at the second time is used as the non-reserved resource quota of the second node at the second time.

[0049] Specifically, the total reservation quota is the total capacity of the reservation resources of the second node, that is, the limit of the number of entities the second node can accommodate. The total reservation quota should be greater than or equal to the number of entities that the second node can reserve at the second time. When the first ratio exceeds the first threshold, it indicates that the entities have a greater demand for reservation resources, and the demand gap is quantified by the first difference. Furthermore, the ratio between the first difference and the capacity of the resource unit is calculated. The integer part of the ratio is taken as the first part of the expected redistribution quantity. The fractional part of the ratio is then compared with the redistribution threshold. If the fractional part of the ratio is greater than the redistribution threshold, the first part plus 1 is taken as the expected redistribution quantity; otherwise, the first part is taken as the expected redistribution quantity. Subsequently, some resource units that are not reserved are treated as reserved resources to meet the subject's demand for reserved resources.

[0050] For example, if the first difference is 50 standard vehicles and the single-lane capacity is 80, the ratio is 0.62. If the redistribution threshold is 0.5, the expected redistribution quantity is 1. If the ratio of the first difference to the single-lane capacity is 1.62, the expected redistribution quantity is 2.

[0051] In some implementations, the expected redistribution quantity of non-reserved resources to reserved resources is determined based on the ratio of the first difference to the resource unit capacity in the second node; when the difference between the initial number of non-reserved resource units and the fairness value of non-reserved resources is greater than or equal to the expected redistribution quantity, the expected redistribution quantity is used as the resource unit redistribution quantity; or, when the difference between the initial number of non-reserved resource units and the fairness value of non-reserved resources is less than the expected redistribution quantity, the difference is used as the resource unit redistribution quantity.

[0052] It's important to note that the non-reservation resource fairness value is the minimum number of resource units reserved for non-reservation resources when dynamically adjusting the number of resource units for both reserved and non-reservation resources. For example, if there are 3 resource units for non-reservation resources, and the expected redistribution quantity is also 3, it means that all 3 non-reservation resource units are expected to be allocated as reserved resources. In this case, non-reservation entities will not be able to use the second node. Although the reservation mechanism can greatly alleviate resource pressure, it cannot force all entities to reserve resources. Therefore, at least 1 to 2 resource units should be reserved for non-reservation resources. That is, the non-reservation resource fairness value is 1 or 2. When the difference between the initial number of non-reservation resource units and the non-reservation resource fairness value is less than the expected redistribution quantity, the difference between the initial number of non-reservation resource units and the non-reservation resource fairness value is used as the resource unit redistribution quantity, reserving an appropriate number of resource units for non-reservation resources. At this time, entities requiring reserved resources can cope with the demand gap by waiting, switching routes, etc. The non-reservation resource fairness value can be any value and is not restricted here.

[0053] When the resource allocation strategy is the second allocation strategy, a second difference is determined between the total number of reservation slots of the second node and the predicted number of subjects. When the second difference is greater than the resource unit capacity of the second node and the number of reservation candidates of the second node at the second time is greater than or equal to the candidate threshold, the number of resource units to be reallocated from reserved resources to non-reserved resources is determined according to the second difference. The product of the number of resource units to be reallocated and the number of reservation slots of the resource unit is used as the resource reallocation slot. The difference between the initial number of reserved resources and the resource reallocation slot of the second node at the second time is used as the number of reserved resources of the second node at the second time. The sum of the initial number of non-reserved resources and the resource reallocation slot of the second node at the second time is used as the number of non-reserved resources of the second node at the second time.

[0054] In the second allocation strategy, it is demonstrated that the demand for reserved resources is relatively low. However, this may be due to uncontrollable situations such as some entities failing to make reservations, or some entities freely choosing their usage time within the grace period of their allocated resource usage schedule, leading to a concentration of fewer entities making reservations at certain times. Therefore, the supply surplus is determined by the second difference between the total number of reservations at the second node and the entities' predicted quantity.

[0055] Specifically, if the second difference is greater than the resource unit capacity in the second node, it proves that at least one resource unit can be used as a non-reservation resource. However, whether to convert the resource unit from a reserved resource to a non-reservation resource depends mainly on whether the subjects in the non-reservation resource have the intention to reserve. If a large portion of the subjects in the non-reservation resource are subjects who failed to reserve, or who can obtain the permission message for using the reserved resource according to the guidance and use the reserved resource in a timely manner, then the extra reservation resource slots can be allocated to these reserve candidate subjects. Conversely, if most subjects have no intention to reserve or do not have the guidance receiving device to obtain the permission to use the reserved resource, then the extra resource unit will be converted from a reserved resource to a non-reservation resource.

[0056] In other words, when the second difference is less than the resource unit capacity in the second node or the number of reserve candidates is less than the candidate threshold, the right to use the number of candidates with the second difference in the reserved resources is allocated to the candidates using the non-reserved resources.

[0057] The alternative entities for reservations can be entities that have failed to make a reservation, or entities equipped with guidance receiving devices. Furthermore, the alternative threshold can be set according to needs and is not limited here.

[0058] This disclosed resource allocation method adjusts the allocation of reserved and unreserved resources for downstream nodes based on the real-time traffic of upstream nodes, solving the problem of the traditional "rigid allocation" of resources. For example, during peak hours, the system automatically increases the number of reserved resource units on downstream nodes based on the fulfillment volume of upstream nodes, allowing reserved entities to avoid queuing. When traffic is low, the extra resource units are either transferred back to unreserved resources or allocated to entities using unreserved resources to reserve resources, avoiding resource waste. This intelligent allocation ensures that reserved entities enjoy smooth access while guaranteeing that unreserved entities have at least basic resources available, improving resource utilization and reducing congestion.

[0059] Figure 3 This is a flowchart of the resource dynamic adjustment process according to the embodiments of this disclosure. The following is in conjunction with... Figure 3 Explain the process of dynamic resource adjustment.

[0060] In step S301, the subject submits a reservation request. The subject can make a reservation within a specified period, providing the desired node and desired time slot, such as the origin, destination, start time, and arrival time. The subject can also provide the purpose of use to determine usage rigidity and priority. Priority can be linked to the subject's account information, i.e., its historical performance record; a higher historical performance record results in higher priority. In step S302, the reservation is successful.

[0061] In step S303, resource usage timetables are allocated to each entity based on their reservation requests. These timetables record the times or periods during which entities will use each node. However, due to the limited capacity of the reserved resources, not all entities can successfully make reservations. Entities that fail to make reservations are marked as reserve candidates and, in principle, can only use unreserved resources. However, if there are temporarily available slots in the reserved resources, these reserve candidates may be given priority.

[0062] Furthermore, during the journey, the predicted volume of downstream nodes at each road node is determined in real time based on the main vehicle performance volume at each road node. In step S304, the main vehicle performance volume of the first node at the first moment is collected by roadside equipment, and then in step S305, the predicted volume of the second node at the second moment is determined. Here, the first node is the upstream node of the second node. The second moment is the arrival time of the main vehicle from the first node to the second node at an average speed (which can be the average vehicle speed from the first node to the second node).

[0063] Of course, the number of first nodes varies dynamically for different second nodes, and can be 1 or any other number; there is no restriction here.

[0064] Further, based on the main forecast and the available reservations of the second node at the second time, the resource allocation strategy for the second node at the second time is determined. That is, a first ratio is calculated between the main forecast and the available reservations of the second node at the second time, where the first ratio represents the fulfillment rate for the second node at the second time. In step S306, it is determined whether the first ratio is greater than a first threshold. If the first ratio is greater than the first threshold, a first allocation strategy is determined in step S307. If the first ratio is not greater than the first threshold, it is determined in step S308 whether the first ratio is less than a second threshold. If the first ratio is less than the second threshold, a second allocation strategy is determined in step S309. If the first ratio is not less than (or equal to) the second threshold, the process proceeds to step S310, where the strategy remains unchanged.

[0065] If the first ratio is greater than the first threshold, the number of reserved and unreserved resources is adjusted according to the first allocation strategy. In step S311, the resource reallocation quota is determined based on the ratio of the first difference to the resource unit capacity. First, the first difference between the main predicted quantity and the total reservation quota of the second node is determined; and, based on the ratio of the first difference to the resource unit capacity in the second node, the number of resource units reallocated from unreserved resources to reserved resources is determined; the product of the resource unit reallocation number and the reserveable quota of the resource unit is used as the resource reallocation quota. In step S312, the reservation resource quota and the unreserved resource quota are determined. The sum of the initial reservation resource quota and the resource reallocation quota of the second node at the second time is used as the reservation resource quota of the second node at the second time; and the difference between the initial unreserved resource quota and the resource reallocation quota of the second node at the second time is used as the unreserved resource quota of the second node at the second time.

[0066] Of course, during the allocation process, it is necessary to ensure that the number of non-reserved resource units is at least not zero, so that non-reserved entities can pass through the second node. The minimum value of the non-reserved resource units reserved for the second node is the non-reserved resource fairness value, and the specific value is not limited. Specifically, based on the ratio of the first difference to the resource unit capacity in the second node, the expected redistribution quantity of resource units that are converted from non-reserved resources to reserved resources is determined; when the 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 redistribution quantity, the expected redistribution quantity is used as the resource unit redistribution quantity; or, when the difference between the initial number of non-reserved resource units and the non-reserved resource fairness value is less than the expected redistribution quantity, the difference is used as the resource unit redistribution quantity.

[0067] In step S309, when the resource allocation strategy is the second allocation strategy, the second difference between the total number of reservations for the second node and the main predicted quantity is determined.

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

[0069] If the number of reservation candidates for the second node at the second time moment is greater than or equal to the candidate threshold, then step S312 is executed to determine the number of reserved resource slots and the number of unreserved resource slots. That is, based on the second difference, the number of resource units to be reallocated from reserved resources to unreserved resources is determined; the product of the number of resource units to be reallocated and the number of available slots for the resource unit is used as the number of resource reallocation slots; the difference between the initial number of reserved resource slots and the number of resource reallocation slots of the second node at the second time moment is used as the number of reserved resource slots of the second node at the second time moment; and the sum of the initial number of unreserved resource slots and the number of resource reallocation slots of the second node at the second time moment is used as the number of unreserved resource slots of the second node at the second time moment.

[0070] Additionally, when the second difference is less than the resource unit capacity in the second node or the number of reserve candidates is less than the candidate threshold, step S315 is executed to allocate the access permission for reserved resources to the candidates using non-reserved resources. That is, the access permission for the number of candidates with the second difference in reserved resources is allocated to the candidates using non-reserved resources. Of course, non-reserved candidates can also be guided to use reserved resources through offline guidance devices.

[0071] In step S310, if the first ratio is between the first threshold and the second threshold, the number of resource units for the initial reserved resource quota and the initial non-reserved resource quota remains unchanged. Then, step S312 is executed to determine the reserved resource quota and the non-reserved resource quota. That is, the initial reserved resource quota is used as the reserved resource quota, and the initial non-reserved resource quota is used as the non-reserved resource quota.

[0072] Furthermore, based on the number of entities that failed to make reservations at the second node at the second time point and the number of entities with guidance receiving devices in the non-reservation resources, a first statistic is determined; and the first statistic is used as the number of reservation candidates; or, the product of the environmental impact coefficient and the first statistic is used as the number of reservation candidates. The environmental impact coefficient characterizes the degree of influence of weather and / or traffic conditions on the number of entities in the non-reservation resources. The environmental impact coefficient varies depending on the situation and is not limited here. The environmental impact coefficient should be any value between 0 and 1, inversely proportional to the degree of impact; the worse the environment, the smaller the environmental impact coefficient. If the environment is suitable for travel, the environmental impact coefficient approaches 1.

[0073] In some implementations, after determining the resource allocation strategy of the second node at the second moment, the method further includes: when the duration between the first moment and the second moment is less than a duration threshold, the reserved resource quota and unreserved resource quota of the second node at the second moment are respectively used as the reserved resource quota and unreserved resource quota of the second node for the target time period after the second moment.

[0074] In other words, when the interval between adjacent time points is detected to be less than a time threshold, the current optimization scheme is automatically extended to cover subsequent time periods, forming a batch resource allocation scheme. This time-period binding strategy maintains dynamic responsiveness while ensuring that each resource allocation decision lasts at least the basic operating cycle of the target time period. This avoids ineffective adjustments caused by minor fluctuations in main traffic flow, reduces the frequency of command refreshes by roadside control equipment and the main navigation system, thereby reducing overall system adjustment energy consumption, and ensuring that the main system has a stable adaptation buffer period to changes in resource layout.

[0075] Specifically, after allocating the number of resource units to the second node for reserved and unreserved resources at the second time point, the allocated reserved and unreserved resource quotas are valid for the target time period after the second time point of the second node.

[0076] Furthermore, after determining the resource allocation strategy of the second node at the second moment, the method also includes: determining the reserved and unreserved resource quotas of multiple downstream nodes of the second node based on the reserved and unreserved resource quotas of the second node at the second moment.

[0077] Similarly, once the second node completes resource allocation, it can automatically push coordination plans to multiple downstream nodes based on the road network topology. This multi-node synchronous adjustment design maintains the vertical consistency of the resource unit partitioning strategy, preventing secondary aggregation of entities caused by "upstream adding reserved resource units but downstream not expanding synchronously," and significantly reducing the system's computation frequency through batch decision-making. Entities can obtain continuous and stable resource layout information from multiple nodes in advance, avoiding safety hazards caused by frequent lane changes. At the same time, roadside guidance screens and other equipment do not need to be refreshed individually at each node, effectively improving the overall coordination of traffic flow.

[0078] Ultimately, entities that fulfill their obligations and adjust the applicable resource units in accordance with the guidelines will be rewarded, including by increasing their reservation priority, thereby improving the success rate of their subsequent reservations.

[0079] In addition, to encourage active booking, positive incentives can be provided. These incentives can be offered by third parties, such as toll-free highway bookings. These incentives not only stimulate booking enthusiasm but also, to some extent, balance the differences in rights between those who book and those who don't.

[0080] In subsequent adjustments to reserved and non-reserved resources, these usage and acquisition methods will serve as important constraints, affecting the dynamic coordination of resources. The reservation system is not static; it needs to be flexibly adjusted according to actual circumstances to meet the needs of different stakeholders and changes in resources. During the adjustment process, the priority of reservation holders, the rights of non-reservation holders, and the effectiveness of positive incentives must be fully considered to ensure the rational allocation and efficient utilization of resources. These methods will act as constraints affecting the dynamic coordination of resources in subsequent adjustments to reserved and non-reserved resources.

[0081] It should be noted that ambulances, police cars, and other special vehicles are not subject to usage restrictions and can pass through all nodes at any time.

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

[0083] like Figure 4 As shown, a resource allocation device 400 is illustrated, comprising: an estimation module 410, used to determine the predicted quantity of a second node at a second time based on the subject fulfillment quantity of a first node at a first time, wherein the first node is an upstream node of the second node, and the second time is the arrival time of the subject from the first node to the second node at the first time; an allocation strategy determination module 420, used to determine the resource allocation strategy of the second node at the second time based on the subject predicted quantity and the available reservation quantity of the second node at the second time; and an adjustment module 430, used to determine the reserved resource quota and unreserved resource quota of the second node at the second time according to the resource allocation strategy.

[0084] The resource allocation device 400 disclosed herein may be in the form of computer software, and each module of the resource allocation device 400 may be in the form of computer software modules.

[0085] The various modules of the resource allocation device 400 disclosed herein are set up to implement the various steps of the resource allocation method. The execution principle and steps can be referred to the above text and will not be repeated here.

[0086] Figure 5 This is a schematic block diagram of an electronic device according to one embodiment of the present disclosure. Figure 5 As shown, this disclosure also provides an electronic device 1000, including: a processor 1200 and a memory 1300, the memory 1300 storing execution instructions; the processor 1200 executes the execution instructions stored in the memory 1300, causing the processor 1200 to execute a resource allocation method.

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

[0088] Bus 1100 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Component (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of representation, only one connection line is used in this diagram, but this does not imply that there is only one bus or only one type of bus.

[0089] This disclosure also provides a readable storage medium storing a computer program that, when executed by a processor, is used to implement the methods described above. A "readable storage medium" can be any means capable of containing, storing, communicating, propagating, or transmitting a program for use by or in conjunction with an instruction execution system, apparatus, or device. More specific examples of a readable storage medium include: an electrical connection with one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and programmable read-only memory (EPROM or flash memory), fiber optic devices, and portable read-only memory (CDROM), etc.

[0090] This disclosure also provides a computer program product, the methods of which can be implemented wholly or partially through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented wholly or partially as 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, all or part of the processes or functions of this disclosure are performed.

[0091] Computer programs or instructions can be stored in a readable storage medium or transferred from one readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The readable storage medium can be any available medium capable of access, or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video optical disc; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be a volatile or non-volatile storage medium, or it can include both volatile and non-volatile types of storage media.

[0092] Those skilled in the art will understand that embodiments of this disclosure can be provided as methods, electronic devices, readable storage media, or computer program products. Therefore, this disclosure can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this disclosure can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0093] This disclosure is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this 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, 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, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0094] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0095] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0096] In the description of this specification, the references to terms such as "one embodiment / mode," "some embodiments / modes," "example," "specific example," or "some examples," etc., refer to specific features, structures, or characteristics described in connection with that embodiment / mode or example, which are included in at least one embodiment / mode or example of this disclosure. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment / mode or example. Moreover, the specific features, structures, or characteristics described may be combined in any suitable manner in one or more embodiments / modes or examples. Furthermore, without contradiction, those skilled in the art can combine and integrate the different embodiments / modes or examples described in this specification, as well as the features of different embodiments / modes or examples.

[0097] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this disclosure, "a plurality of" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0098] Those skilled in the art should understand that the above embodiments are merely for illustrating the present disclosure and are not intended to limit the scope of the disclosure. Those skilled in the art can make other changes or modifications based on the above disclosure, and these changes or modifications still fall within the scope of the present disclosure.

Claims

1. A resource allocation method, characterized in that: include: Determine the predicted amount of the subject at the second node at the second moment according to the subject performance amount of the first node at the first moment, the first node is the upstream node of the second node, and the second moment is the arrival time of the subject from the first node to the second node at the first moment; Determine a resource allocation strategy for the second node at the second moment according to the predicted quantity of the subject and the reservable quantity of the second node at the second moment; as well as According to the resource allocation strategy, the reserved resource quota and the non-reserved resource quota of the second node at the second moment are determined.

2. The resource allocation method according to claim 1, characterized in that: Determining a resource allocation strategy for the second node at the second moment according to the predicted quantity of the subject and the reservable quantity of the second node at the second moment includes: Calculating a first ratio of the predicted quantity of the subject to the available reservation quantity of the second node at the second moment, wherein the first ratio is a fulfillment rate for the second node at the second moment; and When the first ratio is greater than a first threshold, a first allocation strategy is determined; or, when the first ratio is less than a second threshold, a second allocation strategy is determined.

3. The resource allocation method according to claim 2, characterized in that: Determining the reserved resource quota and the non-reserved resource quota of the second node at the second moment according to the resource allocation strategy includes: In the case where the resource allocation strategy is the first allocation strategy, determining a first difference between the subject prediction amount and the total reservation quota of the second node; determining the number of resource units to be reallocated from non-reserved resources to reserved resources according to a ratio of the first difference to the capacity of resource units in the second node; The resource reallocation quota is the product of the reallocation quantity of the resource units and the reservable quota of the resource units; and The sum of the initial reserved resource quota and the resource reallocation quota of the second node at the second moment is used as the reserved resource quota of the second node at the second moment; and the difference between the initial non-reserved resource quota and the resource reallocation quota of the second node at the second moment is used as the non-reserved resource quota of the second node at the second moment.

4. The resource allocation method according to claim 3, characterized in that: Determining the number of resource units to be reallocated from non-reserved resources to reserved resources according to a ratio of the first difference to the capacity of resource units in the second node includes: determining an expected reallocation quantity from non-reserved resources to reserved resources according to a ratio of the first difference to the capacity of resource units in the second node; When the difference between the initial number of non-reserved resource units and the non-reserved resource fair value is greater than or equal to the expected reallocation number, the expected reallocation number is used as the resource unit reallocation number; or, when the difference between the initial number of non-reserved resource units and the non-reserved resource fair value is less than the expected reallocation number, the difference is used as the resource unit reallocation number.

5. The resource allocation method according to claim 2, characterized in that: Determining the reserved resource quota and the non-reserved resource quota of the second node at the second moment according to the resource allocation strategy includes: In the case where the resource allocation strategy is the second allocation strategy, determining a second difference between the total reservation quota of the second node and the subject prediction quantity; When the second difference is greater than the capacity of resource units in the second node and the number of candidate reservation subjects of the second node at the second moment is greater than or equal to the candidate threshold, determining the number of resource units to be reallocated from reserved resources to non-reserved resources according to the second difference; The resource reallocation quota is the product of the reallocation quantity of the resource units and the reservable quota of the resource units; and The difference between the initial reserved resource quota of the second node at the second moment and the resource reallocation quota is used as the reserved resource quota of the second node at the second moment; and the sum of the initial non-reserved resource quota and the resource reallocation quota of the second node at the second moment is used as the non-reserved resource quota of the second node at the second moment.

6. The resource allocation method according to claim 5, characterized in that: After determining the second difference between the total reservation quota of the second node and the predicted quantity of the subject, the method further includes: When the second difference is smaller than the capacity of the resource unit in the second node or the number of the candidate reservation subjects is smaller than the candidate threshold, access rights for the number of subjects of the second difference in the reserved resources are allocated to subjects using non-reserved resources.

7. The resource allocation method according to claim 5 or 6, characterized in that: Also includes: Determine a first statistic according to the number of entities whose reservations of the second node have failed at the second moment and the number of entities in which guidance receiving devices are set in non-reserved resources; as well as The first statistic is used as the number of candidate reservation entities; or, the product of an environmental impact coefficient and the first statistic is used as the number of candidate reservation entities, wherein the environmental impact coefficient represents the degree of influence of weather environment and / or traffic environment on the number of entities using non-reservation resources.

8. The resource allocation method according to claim 1, characterized in that: After determining the resource allocation strategy of the second node at the second moment, the method further includes: When the duration between the first moment and the second moment is less than a duration threshold, the reserved resource quota and non-reserved resource quota of the second node at the second moment are respectively used as the reserved resource quota and non-reserved resource quota of the second node in the target time period after the second moment.

9. The resource allocation method according to claim 1, characterized in that: After determining the resource allocation strategy of the second node at the second moment, the method further includes: The reserved resource quotas and non-reserved resource quotas of a plurality of downstream nodes of the second node are determined according to the reserved resource quotas and non-reserved resource quotas of the second node at the second moment.

10. An electronic device, characterized in that: include: A memory storing execution instructions; as well as A processor, wherein the processor executes the execution instruction stored in the memory, so that the processor executes the resource allocation method according to any one of claims 1 to 9.

11. A readable storage medium, characterized in that: The readable storage medium stores execution instructions, which are used to implement the resource allocation method according to any one of claims 1 to 9 when executed by a processor.

12. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the resource allocation method according to any one of claims 1 to 9 is implemented.

Images