Parking space distribution method and device applied to chemical plant area, electronic equipment, storage medium and program product
By generating vehicle queuing sequences outside the plant and acquiring information in real time, combined with parking lot and loading point data, parking spaces are dynamically allocated, solving the problem of insufficient parking demand in the chemical plant area and achieving optimization and efficient management of the vehicle entry process.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- RICHFIT INFORMATION TECH
- Filing Date
- 2024-11-22
- Publication Date
- 2026-05-22
AI Technical Summary
The lack of parking space and demand in the chemical plant area leads to vehicles queuing outside the plant, occupying road resources, increasing traffic congestion, and the lack of systematic management results in low parking space utilization.
By generating vehicle queuing sequences outside the factory, combining information from parking lots and loading points inside the factory, the number of vehicles is obtained in real time, the average waiting time is calculated, parking spaces are dynamically allocated, and the exhaustive comparison method is used to optimize parking space allocation, taking into account parking space utilization and waiting time, and then parking space information is sent.
It has improved the intelligence and management efficiency of the vehicle entry process, reduced vehicle waiting time, increased parking space utilization, reduced operating costs, and provided a convenient entry service experience.
Smart Images
Figure CN122073083A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of vehicle management, and more particularly to a parking space allocation method, device, electronic equipment, storage medium, and program product applied in a chemical plant area. Background Technology
[0002] In chemical plant areas, daily operations involve loading numerous different types of chemical materials onto trucks. However, due to space limitations within the plant area, the number of parking areas is often insufficient to meet the parking demand. This supply-demand imbalance results in vehicles frequently queuing outside the plant to wait for loading, not only consuming valuable road resources but also exacerbating traffic congestion.
[0003] Therefore, there is an urgent need for a solution that can dynamically allocate parking spaces based on actual needs and conditions. Summary of the Invention
[0004] This application provides a parking space allocation method, device, electronic device, storage medium, and program product applicable to chemical plant areas, which can reduce waiting time for vehicles outside the plant and improve the utilization efficiency of parking spaces.
[0005] In a first aspect, embodiments of this application provide a parking space allocation method applied to a chemical plant area, including:
[0006] In response to a vehicle entry reservation request, an off-site queuing sequence matching each vehicle in the vehicle entry reservation request is generated; wherein, the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles.
[0007] Determine parking information for the factory's parking lots and loading point information; and obtain the actual number of vehicles outside the factory in real time.
[0008] Based on the queue sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information, the average waiting time for vehicles outside the factory is determined; and parking spaces are allocated to vehicles outside the factory based on the parking lot information, the average waiting time for vehicles outside the factory, and the actual number of vehicles outside the factory.
[0009] In one possible implementation, determining the average waiting time for vehicles outside the factory based on the off-site queuing sequence, the actual number of vehicles, and the loading point information includes:
[0010] Based on the off-site queuing sequence and the loading point information, an exhaustive comparison method is used to determine the initial allocation information, which represents the initial parking space allocation information for vehicles outside the factory.
[0011] The average waiting time for vehicles outside the factory is determined based on the initial allocation information, the actual number of vehicles outside the factory, and the loading point information.
[0012] In one possible implementation, the average waiting time for vehicles outside the factory is:
[0013] Where T represents the average waiting time for vehicles outside the factory, and B i A represents the actual number of vehicles outside the factory at the i-th loading point. i T represents the initial allocation information for the i-th shipping point. i This indicates the shipment time of the product at the i-th shipment point.
[0014] In one possible implementation, if the initial allocation information is greater than the actual number of vehicles outside the factory, the initial allocation information is reallocated.
[0015] In one possible implementation, parking spaces are allocated to vehicles outside the factory based on the parking lot information, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory, including:
[0016] The parking space utilization rate is determined based on the parking lot information and the initial allocation information.
[0017] Parking spaces are allocated to vehicles outside the factory based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
[0018] In one possible implementation, parking spaces are allocated to vehicles outside the factory based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory, including:
[0019] When the parking space utilization rate is at its highest, the initial allocation information is determined to be the parking space allocation for vehicles outside the factory.
[0020] When the parking space utilization rates are the same and the average waiting time of vehicles outside the factory is the shortest, the initial allocation information is determined to allocate parking spaces to vehicles outside the factory.
[0021] When the parking space utilization rate is the same, the average waiting time of vehicles outside the factory is the same, and the actual number of vehicles outside the factory is the minimum, the initial allocation information is determined to allocate parking spaces to vehicles outside the factory.
[0022] In one possible implementation, a response message is sent, which includes parking space information for allocating a parking space for the vehicle.
[0023] Secondly, embodiments of this application provide a parking space allocation device applied in a chemical plant area, comprising:
[0024] A generation module is used to generate an off-site queuing sequence that matches each vehicle in the vehicle entry reservation request in response to the vehicle entry reservation request; wherein the off-site queuing sequence includes multiple loading points; and the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles.
[0025] The determination module is used to determine the parking information of the parking lot within the factory and the loading point information of the loading point; and to obtain the actual number of vehicles outside the factory in real time.
[0026] The allocation module is used to determine the average waiting time of vehicles outside the factory based on the queue sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information; and to allocate parking spaces to vehicles outside the factory based on the parking lot information, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
[0027] In one possible implementation, the allocation module includes:
[0028] The allocation submodule is used to determine the initial allocation information by using an exhaustive comparison method based on the off-site queuing sequence and the loading point information. The initial allocation information is characterized as the initial parking space allocation information for vehicles outside the factory.
[0029] The determination submodule is used to determine the average waiting time of vehicles outside the factory based on the initial allocation information, the actual number of vehicles outside the factory, and the loading point information.
[0030] In one possible implementation, the average waiting time for vehicles outside the factory is:
[0031] Where T represents the average waiting time for vehicles outside the factory, and B i A represents the actual number of vehicles outside the factory at the i-th loading point. i T represents the initial allocation information for the i-th shipping point. i This indicates the shipment time of the product at the i-th shipment point.
[0032] In one possible implementation, a first allocation submodule is used to reallocate the initial allocation information when the initial allocation information is greater than the actual number of vehicles outside the factory.
[0033] In one possible implementation, the allocation module further includes:
[0034] The first determining module is used to determine the parking space utilization rate based on the parking lot information and the initial allocation information.
[0035] The second allocation submodule is used to allocate parking spaces to vehicles outside the factory based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
[0036] In one possible implementation, the second allocation submodule includes:
[0037] The first determining submodule is used to determine the initial allocation information as parking space allocation for vehicles outside the factory when the parking space utilization rate is the highest.
[0038] The second determining submodule is used to determine the initial allocation information to allocate parking spaces to vehicles outside the factory when the parking space utilization rates are the same and the average waiting time of the vehicles outside the factory is the shortest.
[0039] The third determining submodule is used to determine the initial allocation information to allocate parking spaces to vehicles outside the factory when the parking space utilization rate is the same, the average waiting time of vehicles outside the factory is the same, and the actual number of vehicles outside the factory is the minimum.
[0040] In one possible implementation, a response module is used to send response information, which includes parking space information for allocating parking spaces for vehicles.
[0041] Thirdly, embodiments of this application provide an electronic device, including: a memory and a processor;
[0042] The memory stores computer-executed instructions;
[0043] The processor executes computer execution instructions stored in the memory, causing the processor to perform the first aspect and / or various possible implementations of the first aspect as described above.
[0044] Fourthly, embodiments of this application provide a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the first aspect and / or various possible implementations of the first aspect.
[0045] Fifthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the first aspect and / or various possible implementations of the first aspect.
[0046] This application provides a parking space allocation method, device, electronic equipment, storage medium, and program product applicable to chemical plant areas. Based on vehicle entry reservation requests, it generates a matching off-site queuing sequence for each vehicle. This sequence considers not only the order in which vehicles enter the plant but also the distribution of multiple loading points, enabling vehicles to reach designated loading and unloading areas more quickly and conveniently. Simultaneously, the method can obtain real-time detailed information about the plant's parking lots, including the number and location of parking spaces, as well as the actual number of vehicles parked outside the plant. Based on the off-site queuing sequence, the actual number of vehicles outside the plant, and the loading time at loading points, the average waiting time for vehicles outside the plant is calculated. Combining parking lot information, the average waiting time for vehicles outside the plant, and the actual number of vehicles outside the plant, parking spaces are accurately allocated to vehicles outside the plant. This optimizes and automates the vehicle entry process, improves overall management efficiency, reduces operating costs, and provides vehicle owners with a more convenient and efficient entry service experience. Attached Figure Description
[0047] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.
[0048] Figure 1 A flowchart illustrating a parking space allocation method applied to a chemical plant area, provided as an embodiment of this application. Figure 1 ;
[0049] Figure 2 A flowchart illustrating a parking space allocation method applied to a chemical plant area, provided as an embodiment of this application. Figure 2 ;
[0050] Figure 3 A schematic diagram of a parking space allocation device applied in a chemical plant area, provided in an embodiment of this application. Figure 1 ;
[0051] Figure 4 A schematic diagram of a parking space allocation device applied in a chemical plant area, provided in an embodiment of this application. Figure 2 ;
[0052] Figure 5 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application.
[0053] The accompanying drawings illustrate specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to particular embodiments. Detailed Implementation
[0054] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.
[0055] In chemical plant areas, the products produced need to be transported to different destinations by specialized transport vehicles. Due to the varying properties of the products, for safety and quality assurance reasons, it is usually required that each transport vehicle carry only one type of product to prevent cross-contamination between different products or safety accidents caused by chemical reactions.
[0056] When loading products onto vehicles, vehicle scheduling and management become particularly important. In existing technology, drivers need to contact the factory's dispatch center or gatehouse in advance to make an appointment, informing them of their arrival time, vehicle information, and the type of products to be loaded. When a vehicle arrives at the factory gate, the vehicle information needs to be manually verified, and the actual arrival time recorded. Based on the number of vehicles currently in the parking lot, experienced personnel determine and direct vehicles from outside the factory to enter the factory parking lot to wait for loading.
[0057] Manual recording and management of vehicle information is prone to errors and is inefficient, especially during peak hours, which can lead to vehicle congestion and increased waiting times. Since information transmission relies mainly on manual communication, information synchronization is often not timely enough, which can lead to information asymmetry and affect the accuracy of decision-making. Due to the lack of systematic management tools, parking space utilization is low, which may result in some parking spaces being idle for a long time while other areas are overcrowded. Long waiting times and the lack of effective communication channels may lead to dissatisfaction among drivers and customers, affecting customer relationships.
[0058] This application provides a parking space allocation method, device, electronic equipment, storage medium, and program product applicable to chemical plant areas, which can solve the above-mentioned problems.
[0059] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will now be described with reference to the accompanying drawings.
[0060] Figure 1 A flowchart illustrating a parking space allocation method applied to a chemical plant area, provided as an embodiment of this application. Figure 1 ,like Figure 1 As shown, the method includes:
[0061] S101. In response to the vehicle entry reservation request, generate an off-site queuing sequence that matches each vehicle in the vehicle entry reservation request; wherein, the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles.
[0062] For example, firstly, the system receives multiple vehicle entry reservation requests. These requests may come from different vehicles from different transportation companies or suppliers, typically containing basic vehicle information (such as license plate number, vehicle type, estimated arrival time, etc.) and information about the products they plan to load. The system parses these reservation requests, extracting key information such as the vehicle's reservation time, the estimated arrival time of each vehicle, and the type of product to be loaded. Based on the product information provided in the reservation requests, the system determines the loading point each vehicle needs to go to. These loading points are determined based on product type, as each product has a dedicated loading point, and multiple loading points share a parking lot. While generating a queue sequence, the system also allocates parking space information for different vehicles at each loading point based on the specific needs in the reservation requests and the actual situation of the factory area. These allocations consider the vehicle's reservation time, the vehicle's waiting time outside the factory, and the utilization rate of parking spaces to ensure efficient resource utilization and smooth vehicle flow. As reservation requests change and the actual vehicle arrival situation changes, the system needs to update the queue sequence and parking space allocation outside the factory in real time. At the same time, the system also needs to send notifications to the vehicles, informing them of their estimated arrival time at the factory, loading point, and parking space location.
[0063] S102. Determine the parking information of the parking lot within the factory and the loading point information of the loading point; and obtain the actual number of vehicles outside the factory in real time.
[0064] For example, parking information within the factory is determined to facilitate rational planning of vehicle parking and scheduling. This information includes the specific location of the parking lot within the factory area and the number of parking spaces. Loading point information is also determined to optimize vehicle loading and transportation processes. This information includes the specific location of the loading point within the factory area, the parking lot location used by the loading point, the average loading time per vehicle at the loading point, and the minimum number of parking spaces guaranteed at each loading point. Real-time acquisition of the actual number of vehicles outside the factory provides a basis for vehicle scheduling and resource allocation. Passenger flow monitoring equipment is installed at the factory entrance to automatically record vehicle information entering the factory. This equipment can calculate the number of vehicles entering and leaving the factory in real time by recognizing license plate numbers, vehicle models, and other information. The actual number of vehicles reflects the current scale of vehicles requiring service outside the factory. Fewer vehicles mean more flexible resource scheduling and lower operating costs.
[0065] By acquiring parking lot and loading point information, vehicle parking and transportation routes can be rationally planned, improving vehicle dispatching efficiency. Simultaneously, real-time access to the number of vehicles outside the factory helps in timely adjustments to resource allocation, ensuring vehicles receive prompt service. Clearly defining loading times and minimum guaranteed parking spaces at loading points helps in the rational arrangement of vehicle loading and transportation plans, improving production efficiency.
[0066] S103. Determine the average waiting time for vehicles outside the factory based on the queuing sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information; and allocate parking spaces for vehicles outside the factory based on parking lot information, the average waiting time for vehicles outside the factory, and the actual number of vehicles outside the factory.
[0067] For example, the average waiting time for vehicles outside the factory is calculated based on real-time acquisition of the queue sequence outside the factory, real-time acquisition of the actual number of vehicles outside the factory (this can be achieved through passenger flow monitoring devices or camera recognition technology installed at the factory entrance), and acquisition of information from loading points (the average time for each vehicle to load products at the loading point). The average waiting time refers to the time required for a vehicle to be allocated a parking space from its arrival outside the factory. A shorter waiting time means higher service efficiency, and vehicles can be processed or parked more quickly. Parking spaces are allocated to vehicles outside the factory based on the number of parking spaces inside the factory, the average waiting time outside the factory, and the actual number of vehicles outside the factory. By acquiring the queue sequence and the actual number of vehicles outside the factory in real time, combined with loading point information, the average waiting time for vehicles outside the factory can be accurately calculated, thereby optimizing parking space allocation strategies and improving service efficiency.
[0068] This application provides a parking space allocation method for chemical plant areas. Based on vehicle entry reservation requests, a matching off-site queuing sequence is generated for each vehicle. This sequence considers not only the order in which vehicles enter the plant but also the distribution of multiple loading points, enabling vehicles to reach designated loading and unloading areas more quickly and conveniently. Simultaneously, this method can obtain real-time detailed information about the plant's parking lots, including the number and location of parking spaces, as well as the actual number of vehicles parked outside the plant. Based on the off-site queuing sequence, the actual number of vehicles outside the plant, and the loading time at each loading point, the average waiting time for vehicles outside the plant is calculated. Combining parking lot information, the average waiting time for vehicles outside the plant, and the actual number of vehicles outside the plant, parking spaces are accurately allocated to vehicles outside the plant. This optimizes and automates the vehicle entry process, improves overall management efficiency, reduces operating costs, and provides vehicle owners with a more convenient and efficient entry service experience.
[0069] Figure 2 A flowchart illustrating a parking space allocation method applied to a chemical plant area, provided as an embodiment of this application. Figure 2 ,like Figure 2 As shown, the method includes:
[0070] S201. In response to the vehicle entry reservation request, generate an off-site queuing sequence that matches each vehicle in the vehicle entry reservation request; wherein the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles.
[0071] For example, this step is the same as step S101 above, and will not be repeated here.
[0072] S202. Based on the queuing sequence outside the factory and the loading point information, the initial allocation information is determined by exhaustive comparison method. The initial allocation information is represented by the initial allocation of parking spaces for vehicles outside the factory.
[0073] In one example, if the initial allocation information is greater than the actual number of vehicles outside the factory, the initial allocation information is reassigned.
[0074] For example, based on the queuing sequence outside the factory and the information of the loading point (the minimum guaranteed parking space at each loading point), the exhaustive comparison method is used to determine the initial parking space information allocated to vehicles outside the factory.
[0075] Taking j loading points sharing a single parking lot as an example:
[0076] Determine the number of trucks allocated to loading point A1: from the minimum guaranteed number of trucks C at each loading point. i Starting with the total number of parking spaces in the parking lot minus the minimum guaranteed number of unassigned loading points (N - (C2 + C3 + ... + C...)). j Until then, increment by one unit each time, iterating through the number of vehicles at loading point number one.
[0077] Determine the number of trucks to be allocated at loading point number two, A2; from the minimum guaranteed number of trucks C i Starting with the sum of the total number of parking spaces in the parking lot minus the allocated parking spaces minus the minimum guaranteed parking spaces at the unallocated loading points (N-A1-(C4+C5+...+C...)). j Until then, increment by one unit each time, iterating through the number of vehicles at loading point number two.
[0078] Determine the number of vehicles A at loading point i. i From the minimum guaranteed number of parking spaces C i Starting with the total number of parking spaces in the parking lot minus the sum of the allocated parking spaces minus the minimum guaranteed parking spaces at the unallocated loading points. So far, increment by one unit each time, iterating through the number of vehicles at loading point i.
[0079] If the number of parking spaces allocated to each loading point exceeds the actual number of vehicles outside the factory, the initial allocation information is reassigned. To find the optimal parking space allocation strategy, an exhaustive search method is used to traverse all possible scenarios, calculate the average waiting time for vehicles outside the factory and the parking space utilization rate under each possible allocation scenario, and determine the optimal number of parking spaces allocated to each loading point based on the average waiting time for vehicles outside the factory and the parking space utilization rate.
[0080] S203. Based on the initial allocation information, the actual number of vehicles outside the factory, and the loading point information, determine the average waiting time for vehicles outside the factory.
[0081] In one example, the average waiting time for vehicles outside the factory was
[0082] Where T represents the average waiting time for vehicles outside the factory; B i A represents the actual number of vehicles outside the factory at the i-th loading point; i T represents the initial allocation information for the i-th shipping point; i This indicates the shipment time of the product at the i-th shipment point.
[0083] For example, based on the initially allocated parking space information, the actual number of vehicles outside the factory is used to calculate the average waiting time of vehicles outside the factory, taking into account the product loading time at the loading point. The calculation formula is as follows:
[0084] Where T represents the average waiting time for vehicles outside the factory, and B... i A represents the actual number of vehicles outside the factory at the i-th loading point. i This represents the initial allocation information for the i-th shipping point, determined by step S202; T i This indicates the shipment time of the product at the i-th shipment point.
[0085] S204. Determine the parking space utilization rate based on parking lot information and initial allocation information.
[0086] For example, the parking space utilization rate is calculated based on parking lot information and initial allocation information, using the following formula:
[0087] Where U represents vehicle utilization rate, A i This represents the initial allocation information for the i-th loading point, where N is the total number of parking spaces in the factory's parking lot.
[0088] S205. Based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory, allocate parking spaces to vehicles outside the factory.
[0089] In one example, when the parking space utilization rate is the highest, the initial allocation information is determined to be the allocation of parking spaces to vehicles outside the factory; when the parking space utilization rate is the same and the average waiting time of vehicles outside the factory is the shortest, the initial allocation information is determined to be the allocation of parking spaces to vehicles outside the factory; when the parking space utilization rate is the same, the average waiting time of vehicles outside the factory is the same, and the actual number of vehicles outside the factory is the fewest, the initial allocation information is determined to be the allocation of parking spaces to vehicles outside the factory.
[0090] For example, based on the initial parking space allocation information determined in step S202, the actual number of vehicles outside the factory, and the loading point information, the average waiting time outside the factory in step S203 is determined; based on the initial parking space allocation information and parking lot information determined in step S202, the parking space utilization rate in step S204 is determined; based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory, the number of available parking spaces inside the factory is allocated to different loading point queues outside the factory; based on the number of available parking spaces inside the factory and the queuing sequence of the loading point queues outside the factory, a specific parking space is allocated to each vehicle.
[0091] Calculate the parking space utilization rate, average waiting time for vehicles outside the factory, and the actual number of vehicles outside the factory for each possible allocation scheme. Among all possible allocation schemes, select the one with the highest parking space utilization rate for allocating parking spaces to vehicles outside the factory. When parking space utilization rates are the same, vehicle turnover efficiency needs further consideration. Selecting the scheme with the shortest average waiting time for vehicles outside the factory can reduce waiting time and increase vehicle processing speed, thereby further improving customer satisfaction and service efficiency. Among schemes with the same parking space utilization rate and average waiting time, selecting the scheme with the fewest actual vehicles outside the factory for parking space allocation ensures that the allocation scheme is closer to the actual situation, avoiding over-allocation or under-allocation. This helps reduce resource waste, improve resource utilization efficiency, and also maintain the order and stability of the parking lot.
[0092] S206. Send a response message, which includes parking space information for allocating parking spaces for the vehicle.
[0093] For example, once a parking space is allocated, the system immediately generates a response message. This message includes information about the parking space assigned to the vehicle, such as the space number, location description (e.g., which entrance or loading point it's near), and type. The system also includes additional prompts in the response message, such as suggestions to follow the indicated route and to pay attention to traffic safety. The response message can be sent to the vehicle in various ways, such as via SMS, email, or mobile app push notifications. The specific method depends on the system configuration and the vehicle owner's preferences.
[0094] This application provides a parking space allocation method for chemical plant areas. Upon receiving a vehicle reservation request to enter the plant, the system generates a queue sequence of vehicles outside the plant based on these requests. Then, using this queue sequence and relevant information about loading points, the system uses an exhaustive comparison method to initially determine a parking location for each vehicle—this is the initial allocation information. Next, the system calculates an average waiting time based on this initial allocation information, the actual number of vehicles currently outside the plant, and the situation at the loading points. Simultaneously, the system considers the actual conditions within the parking lot and the initially given allocation plan to calculate the parking space utilization rate. Finally, by comprehensively considering factors such as parking space utilization rate, average waiting time, and the actual number of vehicles, the system can more rationally reallocate parking locations for vehicles outside the plant and provide specific parking location information back to each vehicle. This effectively solves the problem of disorderly queuing of vehicles outside the plant, reduces vehicle waiting time, and improves parking space utilization efficiency.
[0095] Figure 3 A schematic diagram of a parking space allocation device applied in a chemical plant area, provided in an embodiment of this application. Figure 1 ,like Figure 3 As shown, the parking space allocation device 30 provided in this embodiment for use in a chemical plant area includes:
[0096] The generation module 301 is used to generate an off-site queuing sequence that matches each vehicle in the vehicle entry reservation request in response to the vehicle entry reservation request; wherein the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles.
[0097] The determination module 302 is used to determine the parking information of the parking lot in the factory and the loading point information of the loading point; and to obtain the actual number of vehicles outside the factory in real time.
[0098] The allocation module 303 is used to determine the average waiting time of vehicles outside the factory based on the queuing sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information; and to allocate parking spaces to vehicles outside the factory based on parking lot information, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
[0099] This embodiment provides a parking space allocation device applied in a chemical plant area, which can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and will not be described in detail here.
[0100] Figure 4 A schematic diagram of a parking space allocation device applied in a chemical plant area, provided in an embodiment of this application. Figure 2 ,like Figure 4 As shown, the parking space allocation device 40 provided in this embodiment, applied to a parking space allocation device in a chemical plant area, includes:
[0101] The generation module 401 is used to generate an off-site queuing sequence that matches each vehicle in the vehicle entry reservation request in response to the vehicle entry reservation request; wherein the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles.
[0102] The determination module 402 is used to determine the parking information of the parking lot in the factory and the loading point information of the loading point; and to obtain the actual number of vehicles outside the factory in real time.
[0103] The allocation module 403 is used to determine the average waiting time of vehicles outside the factory based on the queuing sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information; and to allocate parking spaces to vehicles outside the factory based on parking lot information, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
[0104] In one example, module 403 is assigned, which includes:
[0105] The allocation submodule 4031 is used to determine the initial allocation information based on the queuing sequence and loading point information outside the factory using an exhaustive comparison method. The initial allocation information is represented by the initial allocation of parking spaces for vehicles outside the factory.
[0106] The determination submodule 4032 is used to determine the average waiting time of vehicles outside the factory based on the initial allocation information, the actual number of vehicles outside the factory, and the loading point information.
[0107] In one example, the average waiting time for vehicles outside the factory was
[0108] Where T represents the average waiting time for vehicles outside the factory, and B... i A represents the actual number of vehicles outside the factory at the i-th loading point. i T represents the initial allocation information for the i-th shipping point. i This indicates the shipment time of the product at the i-th shipment point.
[0109] In one example, the first allocation submodule 404 is used to reallocate the initial allocation information when the initial allocation information is greater than the actual number of vehicles outside the factory.
[0110] In one example, allocation module 403 also includes:
[0111] The first determining module 4033 is used to determine the parking space utilization rate based on parking lot information and initial allocation information.
[0112] The second allocation submodule 4034 is used to allocate parking spaces to vehicles outside the factory based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
[0113] In one example, the second allocation submodule 4034 includes:
[0114] The first determining submodule 40341 is used to determine the initial allocation information for vehicles outside the factory when the parking space utilization rate is the highest.
[0115] The second determining submodule 40342 is used to determine the initial allocation information to allocate parking spaces to vehicles outside the factory when the parking space utilization rate is the same and the average waiting time of vehicles outside the factory is the shortest.
[0116] The third determining submodule 40343 is used to determine the initial allocation information for allocating parking spaces to vehicles outside the factory when the parking space utilization rate is the same, the average waiting time of vehicles outside the factory is the same, and the actual number of vehicles outside the factory is the minimum.
[0117] In one example, response module 405 is used to send response information, which includes parking space information for allocating parking spaces for vehicles.
[0118] This embodiment provides a parking space allocation device applied in a chemical plant area, which can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and will not be described in detail here.
[0119] Figure 5 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Figure 5 As shown, the electronic device 50 provided in this embodiment includes at least one processor 501 and a memory 502. Optionally, the device 50 further includes a communication component 503. The processor 501, memory 502, and communication component 503 are connected via a bus 504.
[0120] In a specific implementation, at least one processor 501 executes computer execution instructions stored in memory 502, causing at least one processor 501 to perform the above-described method.
[0121] The specific implementation process of processor 501 can be found in the above method embodiments, and its implementation principle and technical effect are similar. It will not be repeated here.
[0122] In the above embodiments, it should be understood that the processor can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), etc. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in this invention can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules within the processor.
[0123] The memory may include random access memory (RAM) and may also include non-volatile memory (NVM), such as at least one disk storage device.
[0124] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, the buses shown in the accompanying drawings are not limited to a single bus or a single type of bus.
[0125] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described method.
[0126] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the above-described method.
[0127] The aforementioned readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk. The readable storage medium can be any available medium accessible to a general-purpose or special-purpose computer.
[0128] An exemplary readable storage medium is coupled to a processor, enabling the processor to read information from and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can reside in an Application Specific Integrated Circuit (ASIC). Alternatively, the processor and the readable storage medium can exist as discrete components in the device.
[0129] The division of units is merely a logical functional division; in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, devices, or units, and may be electrical, mechanical, or other forms.
[0130] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0131] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.
[0132] If a function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0133] Those skilled in the art will understand that all or part of the steps of the above-described method embodiments can be implemented by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When executed, the program performs the steps of the above-described method embodiments; and the aforementioned storage medium includes various media capable of storing program code, such as ROM, RAM, magnetic disks, or optical disks.
[0134] Finally, it should be noted that other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein, and is not limited to the precise structures described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of the invention is limited only by the appended claims.
Claims
1. A parking space allocation method applied in a chemical plant area, characterized in that, include: In response to a vehicle entry reservation request, an off-site queuing sequence matching each vehicle in the vehicle entry reservation request is generated; wherein, the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles; Determine parking information within the factory and loading point information; and obtain the actual number of vehicles outside the factory in real time; Based on the queue sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information, the average waiting time for vehicles outside the factory is determined; and parking spaces are allocated to vehicles outside the factory based on the parking lot information, the average waiting time for vehicles outside the factory, and the actual number of vehicles outside the factory.
2. The method according to claim 1, characterized in that, Based on the off-site queuing sequence, the actual number of vehicles, and the loading point information, the average waiting time for off-site vehicles is determined, including: Based on the off-site queuing sequence and the loading point information, an exhaustive comparison method is used to determine the initial allocation information, which represents the initial parking space allocation information for vehicles outside the factory. The average waiting time for vehicles outside the factory is determined based on the initial allocation information, the actual number of vehicles outside the factory, and the loading point information.
3. The method according to claim 2, characterized in that, The average waiting time for vehicles outside the factory was: Where T represents the average waiting time for vehicles outside the factory, and B i A represents the actual number of vehicles outside the factory at the i-th loading point. i T represents the initial allocation information for the i-th shipping point. i This indicates the shipment time of the product at the i-th shipment point.
4. The method according to claim 2, characterized in that, When the initial allocation information is greater than the actual number of vehicles outside the factory, the initial allocation information is reallocated.
5. The method according to claim 2, characterized in that, Based on the parking lot information, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory, parking spaces are allocated to vehicles outside the factory, including: Based on the parking lot information and the initial allocation information, the parking space utilization rate is determined; Parking spaces are allocated to vehicles outside the factory based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
6. The method according to claim 5, characterized in that, Based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory, parking spaces are allocated to vehicles outside the factory, including: When the parking space utilization rate is at its highest, the initial allocation information is determined to be the parking space allocated to vehicles outside the factory; When the parking space utilization rates are the same and the average waiting time of the vehicles outside the factory is the shortest, the initial allocation information is determined to allocate parking spaces to the vehicles outside the factory. When the parking space utilization rate is the same, the average waiting time of vehicles outside the factory is the same, and the actual number of vehicles outside the factory is the minimum, the initial allocation information is determined to allocate parking spaces to vehicles outside the factory.
7. The method according to any one of claims 1-6, characterized in that, Send a response message, which includes parking space information for allocating parking spaces for the vehicle.
8. A parking space allocation device applied in a chemical plant area, characterized in that, include: A generation module is used to generate an off-site queuing sequence matching each vehicle in the vehicle entry reservation request in response to the vehicle entry reservation request; wherein the off-site queuing sequence includes multiple loading points; the vehicle entry reservation request indicates the allocation of parking spaces for multiple vehicles; The determination module is used to determine the parking information of the parking lot within the factory and the loading point information of the loading point; and to obtain the actual number of vehicles outside the factory in real time; The allocation module is used to determine the average waiting time of vehicles outside the factory based on the queue sequence outside the factory, the actual number of vehicles outside the factory, and the loading point information; and to allocate parking spaces to vehicles outside the factory based on the parking lot information, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
9. The apparatus according to claim 8, characterized in that, The allocation module includes: The allocation submodule is used to determine the initial allocation information by using an exhaustive comparison method based on the off-site queuing sequence and the loading point information. The initial allocation information is characterized as the initial parking space allocation information for vehicles outside the factory. The determination submodule is used to determine the average waiting time of vehicles outside the factory based on the initial allocation information, the actual number of vehicles outside the factory, and the loading point information.
10. The apparatus according to claim 9, characterized in that, The average waiting time for vehicles outside the factory was: Where T represents the average waiting time for vehicles outside the factory, and B i A represents the actual number of vehicles outside the factory at the i-th loading point. i T represents the initial allocation information for the i-th shipping point. i This indicates the shipment time of the product at the i-th shipment point.
11. The apparatus according to claim 9, characterized in that, The first allocation submodule is used to reallocate the initial allocation information when the initial allocation information is greater than the actual number of vehicles outside the factory.
12. The apparatus according to claim 9, characterized in that, The allocation module also includes: The first determining module is used to determine the parking space utilization rate based on the parking lot information and the initial allocation information; The second allocation submodule is used to allocate parking spaces to vehicles outside the factory based on the parking space utilization rate, the average waiting time of vehicles outside the factory, and the actual number of vehicles outside the factory.
13. The apparatus according to claim 12, characterized in that, The second allocation submodule includes: The first determining submodule is used to determine the initial allocation information as the parking space allocation for vehicles outside the factory when the parking space utilization rate is the highest. The second determining submodule is used to determine the initial allocation information as the parking space allocation for vehicles outside the factory when the parking space utilization rates are the same and the average waiting time of the vehicles outside the factory is the shortest. The third determining submodule is used to determine the initial allocation information to allocate parking spaces to vehicles outside the factory when the parking space utilization rate is the same, the average waiting time of vehicles outside the factory is the same, and the actual number of vehicles outside the factory is the minimum.
14. The apparatus according to any one of claims 8-13, characterized in that, The response module is used to send response information, which includes parking space information for allocating parking spaces for vehicles.
15. An electronic device, characterized in that, include: Memory, processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory, causing the processor to perform the method as described in any one of claims 1-7.
16. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1-7.
17. A computer program product comprising a computer program that, when executed by a processor, implements the method of any one of claims 1-7.