Vehicle dispatching method and device, storage medium and processor

Abstract

Embodiments of the present application provide a vehicle scheduling method and device, a storage medium and a processor. The method comprises: determining a first utilization rate of each dock; determining a priority of each dock according to the first utilization rate; determining a loading and unloading sequence of each vehicle in the parking lot according to the priority; and calling the loading and unloading number in sequence according to the loading and unloading sequence, so that the vehicles enter each dock in sequence for loading and unloading. The first utilization rate of each dock is determined to sort the priority of the dock. The loading and unloading number of the vehicles in the parking lot can be called in sequence according to the priority of the dock, so that the vehicles enter the dock in sequence for loading and unloading. The waste of loading and unloading resources of the dock can be reduced, the occurrence of vehicle congestion can be reduced, and the efficiency of loading and unloading operation of the vehicles can be improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of intelligent logistics management, and particularly relates to a vehicle scheduling method and device, a storage medium and a processor. BACKGROUND

[0002] The logistics transportation management system is mainly about the specific management of the transportation link in the logistics link, including vehicle management and the management of goods in the transportation process of the vehicle. When the vehicle transports goods, it needs to enter the factory area for loading and unloading. In the prior art, when the vehicle enters the factory area for loading and unloading, the on-site scheduling management is performed by the staff, which consumes a lot of manpower and resources. Moreover, when there are too many vehicles, the staff may have improper management and operation errors, which easily causes vehicle congestion or waste of stacking resources, and affects the subsequent loading and unloading operation of the vehicle. SUMMARY

[0003] The embodiments of the present application provide a vehicle scheduling method, device, storage medium and processor.

[0004] In order to achieve the above-mentioned purpose, the first aspect of the present application provides a vehicle scheduling method, comprising:

[0005] determining the first utilization rate of each stacking port;

[0006] determining the priority of each stacking port according to the first utilization rate;

[0007] determining the loading and unloading sequence of each vehicle in the parking lot according to the priority order;

[0008] loading and unloading calling numbers are performed in sequence according to the loading and unloading sequence, so that the vehicles enter each stacking port for loading and unloading in sequence.

[0009] In the embodiments of the present application, determining the priority of each stacking port according to the first utilization rate comprises: determining the priority order of each stacking port in the order of the first utilization rate from small to large, wherein the stacking port with the smallest first utilization rate has the highest priority.

[0010] In the embodiments of the present application, determining the priority of each stacking port according to the first utilization rate further comprises: in the case that the first utilization rates of the stacking ports are equal, determining the default order of each stacking port or the order of entering the idle state of each stacking port; determining the priority of the stacking ports with the same first utilization rate according to the default order or the order of entering the idle state; wherein the stacking port with the higher priority is in the front of the default order, or the stacking port with the higher priority enters the idle state first.

[0011] In the embodiment of the present application, the loading and unloading calling is performed in sequence according to the loading and unloading sequence, so that the vehicles enter the each stack port in sequence for loading and unloading, comprising: determining the queuing information of each vehicle, the queuing information comprising the stack port identifier and the factory entry reservation number reserved by each vehicle; determining the reserved stack port of each vehicle according to the stack port identifier; in the case that the reserved stack ports of the plurality of vehicles are the same, determining the loading and unloading sequence of the vehicles with the same reserved stack port according to the size of the factory entry reservation number; wherein the smaller the factory entry reservation number is, the earlier the loading and unloading sequence of the vehicle is.

[0012] In the embodiment of the present application, the method further comprises: obtaining the factory entry reservation number of each vehicle; determining the factory entry sequence of each vehicle according to the factory entry reservation number, wherein the smaller the factory entry reservation number is, the earlier the factory entry sequence is; and performing the factory entry calling in sequence according to the factory entry sequence, so that the vehicles enter the parking lot in sequence for waiting for loading and unloading.

[0013] In the embodiment of the present application, determining the factory entry sequence of each vehicle according to the factory entry reservation number comprises: determining the reserved stack port number of each vehicle in the parking lot; determining the reservation quantity for each stack port in the parking lot according to the reserved stack port number; and determining the factory entry sequence of each vehicle according to the reservation quantity and the factory entry reservation number of each vehicle; wherein the fewer the reservation quantity of the stack port corresponding to the factory entry reservation number is, the earlier the factory entry sequence of the vehicle corresponding to the factory entry reservation number is.

[0014] In the embodiment of the present application, the method further comprises: determining the parking quantity in the parking lot according to the number of vehicles that have performed the factory entry calling; determining the second utilization rate of the parking lot according to the parking quantity and the total number of parking spaces of the parking lot; performing the factory entry calling in sequence according to the factory entry sequence in the case that the second utilization rate is lower than a preset value; and stopping the factory entry calling in the case that the second utilization rate is higher than the preset value.

[0015] In the embodiment of the present application, determining the parking quantity in the parking lot according to the number of vehicles that have performed the factory entry calling comprises: determining the first function for each vehicle, wherein the first function value of the vehicle that has performed the factory entry calling is a first value, and the first function value of the vehicle that has not performed the factory entry calling is a second value; and determining the parking quantity in the parking lot according to the first function value of all the vehicles.

[0016] In the embodiment of the present application, determining the second utilization rate of the parking lot according to the parking quantity and the total number of parking spaces of the parking lot comprises: determining the second function for each vehicle, wherein the second function value of the vehicle that has performed the loading and unloading calling is a first value, and the second function value of the vehicle that has not performed the loading and unloading calling is a second value; and determining the second utilization rate of the parking lot according to the first function value and the second function value of all the vehicles in the parking lot and the total number of parking spaces.

[0017] The second aspect of the present application provides a processor configured to execute the vehicle scheduling method described above.

[0018] The third aspect of the present application provides a vehicle scheduling device, comprising a processor configured to execute the vehicle scheduling method described above.

[0019] The fourth aspect of the present application provides a machine readable storage medium, the machine readable storage medium has instructions stored thereon, the instructions, when executed by a processor, cause the processor to be configured to execute the vehicle scheduling method described above.

[0020] Through the above technical solution, the priority order of each stack port is determined by the first utilization rate, and the loading and unloading order of the vehicle into the stack port of the parking lot can be determined according to the priority order. Then, the vehicles in the parking lot are called according to the loading and unloading order, so that the vehicles can enter the stack port in turn for loading and unloading. The waste of loading and unloading resources of the stack port can be reduced, the occurrence of vehicle congestion can be reduced, and the efficiency of loading and unloading operation of the vehicles can be improved.

[0021] Other features and advantages of the embodiments of the present application will be described in detail in the following specific implementation part. BRIEF DESCRIPTION OF DRAWINGS

[0022] The accompanying drawings are included to provide a further understanding of the embodiments of the present application, and constitute a part of the specification, and are used together with the following specific implementation to explain the embodiments of the present application, but do not constitute a limitation on the embodiments of the present application. In the drawings:

[0023] Figure 1 The application environment schematic diagram of the vehicle scheduling method according to the embodiments of the present application is schematically shown;

[0024] Figure 2 The flowchart of the vehicle scheduling method according to the embodiments of the present application is schematically shown;

[0025] Figure 3a The function diagram of the first function according to the embodiments of the present application is schematically shown;

[0026] Figure 3b The function diagram of the second function according to the embodiments of the present application is schematically shown;

[0027] Figure 4 The flowchart of the vehicle loading and unloading business process according to the embodiments of the present application is schematically shown;

[0028] Figure 5 The structural block diagram of the vehicle scheduling device according to the embodiments of the present application is schematically shown;

[0029] Figure 6 The internal structure diagram of the computer device according to the embodiments of the present application is schematically shown. DETAILED DESCRIPTION

[0030] In order to make the objectives, technical solutions and advantages of the embodiments of the present application clearer, the following will be combined with the accompanying drawings for clear, complete description of the technical solutions in the embodiments of the present application. It should be appreciated that the specific implementations described herein are merely used to explain and illustrate the embodiments of the present application and should not be used to limit the embodiments of the present application. Based on the embodiments herein, all other embodiments obtained by those of ordinary skill in the art without creative effort belong to the scope of protection of the present application.

[0031] The vehicle scheduling method provided by the present application can be applied to the application environment as shown in Figure 1 The vehicle can wait for an entry call at the entrance of the factory area. After the vehicle is called into the factory, the vehicle can enter the parking lot P in the factory area. Among them, there can be multiple vehicles in the parking lot P that are called into the factory. Further, the vehicle can wait for a loading and unloading call in the parking lot. After the vehicle is loaded, it can enter the loading and unloading point to unload until the loading and unloading is completed. For example, unloading operations can be performed at the loading and unloading point of the stack A, the stack B and the stack. After the vehicle unloads, it can leave the factory area from the exit, thereby completing the entire loading and unloading business.

[0032] Figure 2 The flowchart of the vehicle scheduling method according to the embodiments of the present application is schematically shown. As shown in Figure 2 In an embodiment of the present application, a vehicle scheduling method is provided. The embodiment is mainly illustrated by taking the method applied to the above Figure 1 application environment as an example, which includes the following steps:

[0033] S202, determining the first utilization rate of each stack;

[0034] S204, determining the priority of each stack according to the first utilization rate;

[0035] S206, determining the loading and unloading sequence of each vehicle in the parking lot according to the priority in order;

[0036] S208, sequentially calling loading and unloading according to the loading and unloading sequence, so that the vehicle enters each stack for loading and unloading in turn.

[0037] The vehicle can refer to a vehicle capable of transporting goods. When the vehicle is full or empty, the vehicle can perform loading and unloading operations at the stack of the loading and unloading point. Among them, the stack refers to a loading and unloading service point for loading and unloading goods in logistics transportation. The loading and unloading point can include multiple stacks, and each stack can include multiple loading and unloading service locations. When multiple vehicles need to perform loading and unloading operations, the vehicles need to be scheduled so that the vehicles can enter the corresponding stacks for loading and unloading.

[0038] The processor can first determine the first utilization rate of each stack. The first utilization rate refers to the resource utilization rate of the stack. Specifically, the first utilization rate refers to the utilization rate of the loading and unloading service positions of each stack occupied for loading and unloading operations. For example, stack A has three loading and unloading service positions, and the first utilization rate of stack A refers to the utilization rate of the three loading and unloading service positions of stack A occupied for loading and unloading services. For example, for the three loading and unloading service positions included in stack A, if two of the loading and unloading service positions are occupied for loading and unloading operations, then the first utilization rate of stack A is 67%. The greater the value of the first utilization rate indicates that the loading and unloading service position occupancy rate of the stack is higher, and the priority of the corresponding stack is lower. Thus, in the case of determining the first utilization rate of each stack, the processor can further determine the priority of each stack according to the first utilization rate of each stack.

[0039] The processor can determine the loading and unloading sequence of each vehicle in the parking lot according to the priority order, and then call the vehicles in the parking lot in the loading and unloading sequence to make the vehicles enter each stack for loading and unloading in turn. Assuming that the priority order of stacks A, B, and C is stack C, stack A, and stack B in turn, the loading and unloading sequence of the vehicles in the parking lot is: vehicles reserving stack C, vehicles reserving stack A, and vehicles reserving stack B in turn. The vehicles can enter each stack for loading and unloading in the above sequence. In this way, the loading and unloading service position occupancy rate of the stack can be improved, and the efficiency of the loading and unloading operation of the vehicles can be improved.

[0040] In one embodiment, determining the priority of each stack according to the first utilization rate comprises determining the priority order of each stack according to the first utilization rate from small to large, wherein the stack with the smallest first utilization rate has the highest priority.

[0041] The processor can arrange the first utilization rates of each stack from small to large, and determine the priority order of each stack according to the order of the first utilization rates. The greater the value of the first utilization rate of a stack indicates that the loading and unloading service position occupancy rate of the stack is higher, and the priority of the stack is lower. Conversely, the smaller the value of the first utilization rate of a stack indicates that the loading and unloading service position occupancy rate of the stack is lower, and the priority of the stack is higher. That is, the stack with the largest first utilization rate has the lowest priority, and the stack with the smallest first utilization rate has the highest priority. Assuming that the first utilization rates of stacks A, B, and C are 20%, 30%, and 40% respectively, the priority of stack A is the highest, the priority of stack C is the lowest, and the priority order of the stacks is stack A, stack B, and stack C.

[0042] In an embodiment, determining the priority of each stack according to the first utilization rate further comprises: in the case that the first utilization rates of the stacks are equal, determining a default order of each stack or a sequence in which each stack enters an idle state; determining the priority of the stacks with the same first utilization rate according to the default order or the sequence in which each stack enters the idle state; wherein the stack with a higher priority is in the front of the default order, or the stack with a higher priority enters the idle state first.

[0043] In the case that the first utilization rates of the stacks are equal, the processor can determine a default order of each stack or a sequence in which each stack enters an idle state. The default order refers to an initial order between each stack, and the stack with a higher priority is in the front of the default order. The idle state refers to a state in which the loading and unloading service position of the stack has no vehicle for loading and unloading operation, and the stack with a higher priority enters the idle state first. The processor can determine the priority of the stacks with the same first utilization rate according to the default order or the sequence in which each stack enters the idle state. Assuming that the first utilization rates of stacks A, B and C are 0%, 0% and 0% respectively when the vehicle has not entered the factory, the first utilization rates of stacks A, B and C are the same. At this time, the processor can determine the sequence of the default order of each stack. For example, the default order of stacks A, B and C is A, B and C in turn, and in the case that the first utilization rates of A, B and C are the same, the priority of stack A is higher than that of stack B, and the priority of stack B is higher than that of stack C. Alternatively, the first utilization rates of stacks A, B and C are 20%, 20% and 80% respectively, and the first utilization rates of stacks A and B are the same. At this time, the processor can determine the sequence in which each stack enters the idle state, and if stack A finishes loading and unloading and enters the idle state before stack B, the priority of stack A is higher than that of stack B.

[0044] In an embodiment, the loading and unloading call numbers are sequentially called according to the loading and unloading order so that the vehicle sequentially enters each stack for loading and unloading, which comprises: determining the queuing information of each vehicle, the queuing information comprising the stack identifier and the factory reservation number reserved by each vehicle; determining the reserved stack of each vehicle according to the stack identifier; in the case that the reserved stacks of multiple vehicles are the same, determining the loading and unloading order of the vehicles with the same reserved stack according to the size of the factory reservation number; wherein the smaller the factory reservation number, the earlier the loading and unloading order of the vehicle.

[0045] The processor can determine queuing information of each vehicle. The queuing information can include a stacking port identifier and an entry factory reservation number reserved by each vehicle. The queuing information of the vehicle is determined according to the stacking port reserved by the vehicle and the order in which the vehicle arrives outside the factory before the vehicle enters the factory. Specifically, a calling number applet can be installed on a user terminal of the vehicle, and the user can input the license plate number through the applet to initiate a reservation request to reserve a loading and unloading stacking port in the factory. The processor can determine the queuing information corresponding to each vehicle according to the reservation request and the time when the request is initiated. For example, in the case of stacking ports A, B, and C, the queuing information of the vehicles reserving stacking port A can be A00001, A00002, and A00003 in order of the vehicles, the queuing information of the vehicles reserving stacking port B can be B00001, B00002, and B00003, and the queuing information of the vehicles reserving stacking port C can be C00001, C00002, and C00003. The stacking port identifier is A, B, and C, and the entry factory reservation number is 00001, 00002, and 00003.

[0046] The processor can determine the reserved stacking port of each vehicle according to the stacking port identifier. In the case where the reserved stacking ports of a plurality of vehicles are the same, the processor can determine the loading and unloading order of the vehicles reserving the same stacking port according to the size of the entry factory reservation number. The smaller the entry factory reservation number of the vehicle, the earlier the loading and unloading order. For example, in the case where the vehicles reserving stacking port A are A00001, A00002, and A00003, the loading and unloading order is A00001, A00002, and A00003 in turn. For another example, there are five vehicles with queuing information A00001, A00002, B00002, B00003, and C00002 in the parking lot, and the vehicles A00001 and A00002 reserve stacking port A. The unloading order of the vehicles for stacking port A is A00001 and A00002, and the unloading order of the vehicles for stacking port B is B00002 and B00003. Further, if the priority order of stacking ports A, B, and C is B, A, and C in turn, the loading and unloading order of the five vehicles is B00002, B00003, A00001, A00002, and C00002 in turn. The processor sequentially calls the loading and unloading numbers according to the above loading and unloading order, so that each vehicle enters the corresponding stacking port for loading and unloading in turn.

[0047] In one embodiment, the method further includes obtaining an entry factory reservation number of each vehicle, and determining an entry factory order of each vehicle according to the entry factory reservation number, wherein the smaller the entry factory reservation number, the earlier the entry factory order. The entry factory calling numbers are sequentially called according to the entry factory order, so that the vehicles enter the parking lot for waiting loading and unloading in turn.

[0048] The entry reservation number of the vehicle is allocated according to the order of arrival of the vehicle outside the factory area. Before there is a free parking space in the parking lot in the factory area, the vehicle is queued outside the factory area to wait for the factory entry call number. The processor can obtain the factory entry reservation number of each vehicle, and determine the factory entry order of each vehicle according to the factory entry reservation number. The factory entry order refers to the order of the vehicle entering the parking lot from outside the factory area. The smaller the factory entry reservation number, the earlier the factory entry order. For example, the entry reservation numbers of the vehicles are A00001, A00002 and A00003, and the factory entry orders of the vehicles are A00001, A00002 and A00003 in turn. Further, the processor can call the factory entry in order according to the factory entry order, so that the vehicles enter the parking lot in turn to wait for loading and unloading. Further, after the vehicle enters the parking lot, it can enter the reserved dock for loading and unloading according to the loading and unloading call number.

[0049] In one embodiment, determining the factory entry order of each vehicle according to the factory entry reservation number comprises: determining the reserved dock number of each vehicle in the parking lot; determining the reservation quantity for each dock in the parking lot according to the reserved dock number; determining the factory entry order of each vehicle according to the reservation quantity and the factory entry reservation number of each vehicle; wherein the fewer the reservation quantity of the dock corresponding to the factory entry reservation number, the earlier the factory entry order of the vehicle corresponding to the factory entry reservation number.

[0050] The processor can determine the reserved dock number of each vehicle in the parking lot. Specifically, during the process of calling the factory entry and the loading and unloading, the processor can obtain the call state of each vehicle, and determine the queuing information of each vehicle in the parking lot according to the call state. The queuing information includes the dock identifier reserved by each vehicle, i.e. the reserved dock number. For the vehicles that have been called for factory entry and have not been called for loading and unloading, the processor can determine that these vehicles are queued in the parking lot to wait for the loading and unloading call number. The processor can determine the dock reserved by each vehicle in the parking lot according to the reserved dock number. Further, the processor can determine the reservation quantity for each dock in the parking lot. The reservation quantity refers to the number of vehicles reserving each dock in the parking lot. The processor can determine the factory entry order of each vehicle according to the reservation quantity and the factory entry reservation number of each vehicle. The fewer the reservation quantity of the dock corresponding to the factory entry reservation number, the earlier the factory entry order of the vehicle corresponding to the factory entry reservation number.

[0051] For example, the queue information of the vehicles in the parking lot includes A00002, B00002, B00003, C00002, C00003, and the queue information of the vehicles waiting outside the parking lot includes A00003, B00004, C00004. Then, the number of the vehicles reserving the A bay is 1, the number of the vehicles reserving the B bay is 2, and the number of the vehicles reserving the C bay is 2. Then, since the number of the vehicles reserving the A bay is the least, the vehicle with the queue number A00003 can be called in first. Further, the processor can determine the first utilization rates of the bays B and C to determine the priority order between the bays B and C. The bay with the higher priority can be called in first. Since the bay with the higher priority has a lower first utilization rate, the vehicle in the bay with the higher priority can be called in first and then leave the parking lot to load or unload. Assuming that the priority of the bay B is higher than that of the bay C, the number of the vehicles reserving the bay B in the parking lot will be less than the number of the vehicles reserving the bay C. Therefore, after the vehicle with the queue number A00003 is called in, the vehicles with the queue numbers B00004 and C00004 can be called in in the order B00004, C00004.

[0052] In one embodiment, the method further comprises: determining the number of the vehicles parked in the parking lot according to the number of the vehicles that have been called in; determining the second utilization rate of the parking lot according to the number of the vehicles parked and the total number of the parking spaces in the parking lot; calling in the vehicles in the order of the in-plant sequence when the second utilization rate is lower than a preset value; and stopping calling in the vehicles when the second utilization rate is higher than the preset value.

[0053] The second utilization rate refers to the occupancy rate of the parking spaces in the parking lot. The processor can determine the vehicles waiting in the parking lot as the vehicles that have been called in and have not been called in for loading or unloading, and can determine the number of the vehicles in the parking lot. Further, the processor can determine the second utilization rate of the parking lot according to the number of the vehicles parked and the total number of the parking spaces in the parking lot. When the second utilization rate of the parking lot is determined, the processor can compare the second utilization rate with a preset value. The preset value can be 1. When the second utilization rate is 1, there is no idle parking space in the parking lot. Therefore, the processor can call in the vehicles in the order of the in-plant sequence when the second utilization rate is lower than the preset value, and can stop calling in the vehicles when the second utilization rate is higher than the preset value.

[0054] In one embodiment, determining the number of the vehicles parked in the parking lot according to the number of the vehicles that have been called in comprises: determining a first function for each vehicle, wherein the first function value of the vehicle that has been called in is a first value, and the first function value of the vehicle that has not been called in is a second value; and determining the number of the vehicles parked in the parking lot according to the first function values of all the vehicles.

[0055] In one embodiment, determining the second utilization rate of the parking lot according to the number of parked vehicles and the total number of parking spaces in the parking lot comprises: determining a second function for each vehicle, wherein the second function value of a vehicle that has performed the loading and unloading call is a first numerical value, and the second function value of a vehicle that has not performed the loading and unloading call is a second numerical value; and determining the second utilization rate of the parking lot according to the first function value, the second function value of all vehicles in the parking lot, and the total number of parking spaces.

[0056] In determining the number of parked vehicles in the parking lot according to the number of vehicles that have performed the factory call, the processor can determine a first function for each vehicle, wherein the first function value of a vehicle that has performed the factory call is a first numerical value, and the first function value of a vehicle that has not performed the factory call is a second numerical value. The processor can determine the number of parked vehicles in the parking lot according to the first function value of all vehicles. Further, the processor can determine a second function for each vehicle, and then determine the second utilization rate of the parking lot according to the first function value, the second function value of all vehicles in the parking lot, and the total number of parking spaces.

[0057] The first function and the second function can both refer to a gate function. The first function refers to a gate function representing the factory call state, and the second function refers to a gate function representing the loading and unloading call state. Figure 3a , Figure 3a A function diagram of the first function is schematically shown. The first function can be R=G R (T), T is a time variable, and R is the function value of the first function. As shown in FIG. 1, when a vehicle has performed the factory call, the first function value R is 1; when a vehicle has not performed the factory call, the first function value R is 0. Figure 3b , Figure 3b A function diagram of the second function is schematically shown. The second function can be Z=G z (T), T is a time variable, and Z is the function value of the second function. The value range of R and Z can both be 0 or 1.

[0058] When T<-t, the values of R and Z are both 0, i.e., the calling state of the vehicle is that the vehicle has not been called into the factory and has not been called for loading and unloading. At this time, it is indicated that the vehicle is waiting in the parking lot outside the factory for the calling into the factory. When the value of T is in the range of (-t, 0), the value of R is 1 and the value of Z is 0. That is, the calling state of the vehicle is that the vehicle has been called into the factory and has not been called for loading and unloading. At this time, it is indicated that the vehicle has entered or is about to enter the parking lot of the factory and is waiting for the calling for loading and unloading into the reserved stack. The number of parked vehicles in the parking lot is the number of vehicles that have been called into the factory and have not been called for loading and unloading. When the value of T is in the range of (0, t), the value of R is 1 and the value of Z is 1. That is, the calling state of the vehicle is that the vehicle has been called into the factory and has been called for loading and unloading. At this time, it is indicated that the vehicle has entered or is about to enter the stack for loading and unloading. When T>t, the values of R and Z are both 0, i.e., the vehicle has completed the loading and unloading and has left the factory after being called for loading and unloading. The second utilization rate is the ratio between the sum of the values of R of the vehicles that have been called into the factory and have not been called for loading and unloading and the total number of parking spaces in the parking lot, and the total number of parking spaces in the parking lot is fixed. Specifically, the second utilization rate can be calculated according to the following formula (1).

[0059]

[0060] wherein p represents the parking utilization rate of the parking lot, Z represents the first function value of each vehicle, R represents the second function value of each vehicle, R n represents the first function value of each reserved vehicle in the parking lot, and W represents the total number of parking spaces in the parking lot.

[0061] In an embodiment, the first utilization rate of each stack can also be determined according to the calling state of each vehicle and the total service number of each stack. The total service number is the number of loading and unloading service positions, and the total service number of each stack is fixed. Specifically, the first utilization rate can be calculated according to the following formula (2).

[0062]

[0063] wherein S i represents the resource utilization rate of the i-th stack, i represents the i-th stack, j represents the queuing information of the reserved vehicle for the i-th stack, Z j represents the second function value of the reserved vehicle corresponding to the i-th stack, and M i represents the total service number of the i-th stack.

[0064] In an embodiment, referring to Figure 4 , a flowchart schematically showing the loading and unloading business process of the vehicle is shown. As Figure 4As shown, all vehicles can be queued and numbered by the applet before entering the factory area. If the second utilization rate of the parking area is greater than or equal to 1, no factory call number is performed. When the second utilization rate of the parking area is less than 1, the processor can start to perform the factory call number. The entry reservation numbers of the vehicles are A00001, A00002, A00003, and so on, and the factory entry order of the vehicles is A00001, A00002, A00003, and so on. The smaller the factory entry reservation number, the earlier the factory entry order. Assuming that the queuing information of the vehicles in the parking lot includes A00002, B00002, B00003, C00002, and C00003, and the queuing information of the vehicles waiting outside the factory includes A00003, B00004, and C00004, the number of vehicles reserving the A stack is 1, the number of vehicles reserving the B stack is 2, and the number of vehicles reserving the C stack is 2. Then, the vehicle with the queue number A00003 can be called first. Further, the processor can determine the first utilization rate of the stacks B and C to determine the priority order between B and C. The stack with a higher priority can be called first. Assuming that the priority of B is higher than that of C, the number of vehicles reserving the B stack will be less than that of the C stack. Therefore, after the vehicle with the queue number A00003 is called, the calling order of the vehicles with the queue numbers B00004 and C00004 is B00004, C00004. The processor can call the vehicles waiting outside the factory area in the factory entry order to make the vehicles enter the parking lot in turn. Further, after the vehicles enter the parking lot, they can wait for the loading and unloading call to enter the reserved stack for loading and unloading.

[0065] The vehicle enters the parking lot of the factory area to wait after receiving the factory entry call number. If the first utilization rate of each stack is greater than or equal to 1, no loading and unloading call number is performed. If the first utilization rate of a stack is less than 1, the vehicle parked in the parking lot of the stack is called. Specifically, the processor can first determine the priority of each stack of the loading and unloading point. Assuming that the first utilization rates of stacks A, B, and C are 20%, 30%, and 40% respectively, the priority of the stacks can be determined in the order of stack A, stack B, and stack C in the order of increasing first utilization rate. Assuming that the first utilization rates of stacks A, B, and C are 0%, 0%, and 0% respectively when the vehicle has not entered the factory area, the first utilization rates of stacks A, B, and C are the same. At this time, the processor can determine the default order of each stack. For example, the default order of stacks A, B, and C is A, B, and C in turn, and in the case where the first utilization rates of A, B, and C are the same, the priority of stack A is higher than that of stack B, and the priority of stack B is higher than that of stack C. Alternatively, the first utilization rates of stacks A, B, and C are 20%, 20%, and 80% respectively, and the first utilization rates of stacks A and B are the same. At this time, the processor can determine the order in which each stack enters the idle state, and if stack A is completed before stack B, the priority of stack A is higher than that of stack B. Assuming that there are multiple vehicles in the parking lot of stack A, and the queue information of the vehicles is A00001, A00002, B00002, B00003, and C00002, and assuming that the priority order of stacks A, B, and C is B, A, and C in turn, the loading and unloading order of the five vehicles is B00002, B00003, A00001, A00002, and C00002 in turn. The processor performs loading and unloading call numbers in the above order to make each vehicle enter the corresponding stack for loading and unloading in turn. After loading and unloading are completed, the vehicle can leave the factory area from the exit in turn.

[0066] By the above technical solution, the vehicles entering the factory area can be queued, and the queuing information of the vehicles includes an entry reservation number and a reservation portal identifier. The reservation portal identifier is the portal where the vehicle is to be loaded or unloaded, and the entry reservation number is sorted according to the time sequence of the vehicle initiating the reservation request. According to the calling number state of each vehicle, the vehicles waiting for entry calling outside the factory area, the vehicles waiting for loading or unloading in the parking lot, and the vehicles being loaded or unloaded at each portal can be determined. The function value corresponding to the calling number state of the vehicle is calculated by the door function to determine the first utilization rate of the parking lot and the second utilization rate of each portal. The entry sequence of each vehicle is determined according to the queuing information of each vehicle. The fewer the reservation quantity of the portal corresponding to the entry reservation number, the earlier the entry sequence of the vehicle corresponding to the entry reservation number, and the smaller the entry reservation number, the earlier the entry sequence. In the case where the value of the first utilization rate is less than 1, the entry calling is performed in sequence according to the entry sequence. Whether the loading or unloading calling is performed can be determined according to the value of the second utilization rate. The priority order of each portal can be determined according to the order from small to large of the second utilization rate. The smaller the second utilization rate, the higher the priority of the corresponding portal. If the second utilization rates of the portals are the same, the priority order of the portals can be determined according to the default order of the portals or the order in which each portal enters the idle state. The loading or unloading sequence of the vehicles in the parking lot can be determined according to the priority order. The higher the priority of the portal reserved by the vehicle, the earlier the loading or unloading sequence. Further, the loading or unloading calling is performed in sequence according to the loading or unloading sequence, so that the vehicles enter each portal in sequence for loading or unloading. In actual situations, there can be more than one parking area in the factory area, and the service quantity of each portal can be different. According to the above method, the waste of portal loading or unloading resources can be reduced, the resources can be maximally utilized, the occurrence of vehicle congestion can be reduced, the efficiency of the vehicle loading or unloading process can be improved, and the intelligent management of the vehicles entering the factory area for loading or unloading operation can be realized.

[0067] Figure 2 The flowchart of the vehicle dispatching method in one embodiment is shown. It should be understood that although the steps in the flowchart are shown in sequence according to the arrows, the steps are not necessarily executed in sequence according to the arrows. Unless otherwise specified herein, the execution of the steps is not strictly limited in sequence, and the steps can be executed in other sequences. Moreover, Figure 2 At least part of the steps in the flowchart can include multiple sub-steps or multiple stages, which are not necessarily executed at the same time, but can be executed at different times. The execution sequence of the sub-steps or stages is not necessarily sequential, but can be executed in rotation or alternation with at least part of other steps or sub-steps or stages of other steps. Figure 2

[0068] In one embodiment, as​Figure 5 As shown, a vehicle scheduling device 500 is provided, comprising a first utilization rate determining module 502, a bay priority determining module 504, a loading and unloading sequence determining module 506, and a loading and unloading call number module 508, wherein:

[0069] The first utilization rate determining module 502 is configured to determine the first utilization rate of each bay.

[0070] The bay priority determining module 504 is configured to determine the priority of each bay according to the first utilization rate.

[0071] The loading and unloading sequence determining module 506 is configured to determine the loading and unloading sequence of each vehicle in the parking lot according to the priority.

[0072] The loading and unloading call number module 508 is configured to sequentially call the loading and unloading number according to the loading and unloading sequence, so that the vehicles sequentially enter each bay for loading and unloading.

[0073] In one embodiment, the bay priority determining module 504 is further configured to determine the priority of each bay in the order from small to large according to the first utilization rate, wherein the bay with the smallest first utilization rate has the highest priority.

[0074] In one embodiment, the bay priority determining module 504 is further configured to determine the default order of each bay or the order of entering the idle state of each bay in the case that the first utilization rates of the bays are equal; determine the priority of the bays with equal first utilization rates according to the default order or the order of entering the idle state; wherein the bay with higher priority is in the front of the default order, or the bay with higher priority enters the idle state first.

[0075] In one embodiment, the loading and unloading call number module 508 is further configured to determine the queuing information of each vehicle, the queuing information comprising the bay identifier and the factory entry reservation number reserved by each vehicle; determine the reserved bay of each vehicle according to the bay identifier; in the case that the reserved bays of multiple vehicles are the same, determine the loading and unloading sequence of the vehicles with the same reserved bay according to the size of the factory entry reservation number; wherein the smaller the factory entry reservation number is, the earlier the loading and unloading sequence of the vehicle is.

[0076] In one embodiment, the device further comprises a factory entry sequence determining module (not shown in the figure), configured to obtain the factory entry reservation number of each vehicle; determine the factory entry sequence of each vehicle according to the factory entry reservation number, wherein the smaller the factory entry reservation number is, the earlier the factory entry sequence is; sequentially call the factory entry number according to the factory entry sequence, so that the vehicles sequentially enter the parking lot for waiting for loading and unloading.

[0077] In one embodiment, the factory entry order determining module (not shown in the figure) is further configured to determine a reservation bay number of each vehicle in the parking lot; determine a reservation quantity for each bay in the parking lot according to the reservation bay number; determine a factory entry order of each vehicle according to the reservation quantity and a factory entry reservation number of each vehicle; and the fewer the reservation quantity of the bay corresponding to the factory entry reservation number, the earlier the factory entry order of the vehicle corresponding to the factory entry reservation number.

[0078] In one embodiment, the device further comprises a factory entry calling module (not shown in the figure) configured to determine a parking quantity in the parking lot according to a quantity of vehicles that have been called for factory entry; determine a second utilization rate of the parking lot according to the parking quantity and a total quantity of parking spaces in the parking lot; and call for factory entry in sequence according to the factory entry order when the second utilization rate is lower than a preset value, and stop calling for factory entry when the second utilization rate is higher than the preset value.

[0079] In one embodiment, the factory entry calling module (not shown in the figure) is further configured to determine a first function for each vehicle, wherein a first function value of a vehicle that has been called for factory entry is a first value, and a first function value of a vehicle that has not been called for factory entry is a second value; and determine a parking quantity in the parking lot according to the first function values of all vehicles.

[0080] The vehicle scheduling device comprises a processor and a memory, and the first utilization rate determining module, the bay priority determining module, the loading and unloading order determining module, the loading and unloading calling module, the factory entry order determining module and the factory entry calling module are all stored in the memory as program units, and the corresponding functions are realized by the processor executing the above program modules stored in the memory.

[0081] The processor comprises a core, and the core retrieves the corresponding program units from the memory. The core can be one or more, and the vehicle scheduling method is realized by adjusting the core parameters.

[0082] The memory can include a non-permanent memory in a computer readable medium, a random access memory (RAM) and / or a non-volatile memory such as a read-only memory (ROM) or a flash memory (flash RAM), and the memory comprises at least one memory chip.

[0083] The embodiments of the present application provide a storage medium having a program stored thereon, and the program is executed by a processor to realize the above vehicle scheduling method.

[0084] The embodiments of the present application provide a processor configured to run a program, and the program is executed to realize the above vehicle scheduling method.

[0085] In one embodiment, a computer device is provided, which can be a server, and an internal structure diagram of the computer device can be as shown inFigure 6 As shown in the figure. The computer device includes a processor A01, a network interface A02, a memory (not shown in the figure) and a database (not shown in the figure) connected through a system bus. Among them, the processor A01 of the computer device is used to provide computing and control capabilities. The memory of the computer device includes an internal memory A03 and a non-volatile storage medium A04. The non-volatile storage medium A04 stores an operating system B01, a computer program B02 and a database (not shown in the figure). The internal memory A03 provides an environment for the operating system B01 and the computer program B02 in the non-volatile storage medium A04 to run. The database of the computer device is used to store vehicle scheduling data. The network interface A02 of the computer device is used to communicate with external terminals through network connection. The computer program B02 is executed by the processor A01 to implement a vehicle scheduling method.

[0086] Those skilled in the art can understand that, Figure 6 The structure shown in the figure is only a block diagram of part of the structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. The specific computer device can include more or fewer components than those shown in the figure, or combine certain components, or have a different component arrangement.

[0087] The embodiment of the present application provides a device, which includes a processor, a memory and a program stored in the memory and executable on the processor. When the processor executes the program, the steps of the vehicle scheduling method are implemented.

[0088] The present application also provides a computer program product adapted to execute the program initialized with the steps of the vehicle scheduling method when executed on a data processing device.

[0089] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer usable program code.

[0090] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flow or blocks Figure 1 means for functionally implementing the steps listed in the flowchart block or blocks.

[0091] These computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture including instructions which implement the function specified in the flowchart block or blocks. Figure 1 one or more flow or blocks Figure 1 means for functionally implementing the steps listed in the flowchart block or blocks.

[0092] The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flow or blocks Figure 1 means for functionally implementing the steps listed in the flowchart block or blocks.

[0093] In one typical configuration, the computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0094] The memory can include non-persistent memory and / or volatile memory, such as random access memory (RAM) and / or cache memory, for storing instructions and data used and / or generated by the computing device. The memory can also include non-volatile memory, such as read-only memory (ROM), electrically programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory, or other non-volatile memory.

[0095] Computer-readable media includes permanent and non-permanent, movable and non-movable media that can implement information storage by any method or technology. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible to a computing device. According to the definition herein, computer-readable media does not include transitory media such as modulated data signals and carriers.

[0096] It should also be noted that the terms "comprising", "containing", or any other variant thereof are intended to cover a non-exclusive inclusion, such that a process, method, article or apparatus that comprises a list of elements does not only include those elements, but can also include other elements not expressly listed or inherent to such process, method, article or apparatus. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0097] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. within the spirit and principle of the present application shall be included in the scope of claims of the present application.

Claims

1. A vehicle dispatching method characterized by comprising: The method comprises: determining a first utilization rate of each stack; determining a priority of each stack according to the first utilization rate, wherein the stack with the smallest first utilization rate has the highest priority; determining a loading and unloading sequence of each vehicle in the parking lot according to the priority; calling the loading and unloading sequence in sequence to make the vehicles enter each stack for loading and unloading in sequence; obtaining an entry reservation number of each vehicle; determining an entry sequence of each vehicle according to the entry reservation number, wherein the smaller the entry reservation number is, the earlier the entry sequence is; calling the entry sequence in sequence to make the vehicles enter the parking lot for waiting for loading and unloading in sequence; determining a first function for each vehicle, wherein the first function value of the vehicle that has been called for entry is a first numerical value, and the first function value of the vehicle that has not been called for entry is a second numerical value; determining a parking quantity in the parking lot according to the first function value of all vehicles; determining a second utilization rate of the parking lot according to the parking quantity and a total number of parking spaces of the parking lot; in the case that the second utilization rate is lower than a preset value, calling the entry sequence in sequence; in the case that the second utilization rate is higher than the preset value, stopping calling the entry sequence; wherein the determining the priority of each stack according to the first utilization rate comprises: determining the priority of each stack according to the first utilization rate from small to large.

2. The vehicle dispatching method according to claim 1, characterized by, The determining the priority of each stack according to the first utilization rate further comprises: in the case that the first utilization rates of the stacks are equal, determining a default order of each stack or a sequence of each stack entering an idle state; determining the priority of the stacks with the equal first utilization rates according to the default order or the sequence of entering the idle state; wherein the stack with the higher priority in the default order or the stack that enters the idle state first has the higher priority.

3. The vehicle dispatching method according to claim 1, characterized by, The calling the loading and unloading sequence in sequence to make the vehicles enter each stack for loading and unloading comprises: determining queuing information of each vehicle, the queuing information comprising a stack identifier and an entry reservation number of each vehicle; determining a reserved stack of each vehicle according to the stack identifier; in the case that the reserved stacks of multiple vehicles are the same, determining a loading and unloading sequence of the vehicles with the same reserved stack according to the size of the entry reservation number; wherein the smaller the entry reservation number is, the earlier the loading and unloading sequence of the vehicle is.

4. The vehicle dispatching method according to claim 1, characterized by, The determining the entry sequence of each vehicle according to the entry reservation number comprises: determining a reserved stack number of each vehicle in the parking lot; determining a reservation quantity for each stack in the parking lot according to the reserved stack number; determining the entry sequence of each vehicle according to the reservation quantity and the entry reservation number of each vehicle; wherein the fewer the reservation quantity of the stack corresponding to the entry reservation number is, the earlier the entry sequence of the vehicle corresponding to the entry reservation number is.

5. The vehicle dispatching method according to claim 1, characterized by, The determining the second utilization rate of the parking lot according to the parking quantity and the total number of parking spaces of the parking lot comprises: determining a second function for each vehicle, wherein the second function value of a vehicle that has made a loading or unloading call is a first numerical value, and the second function value of a vehicle that has not made a loading or unloading call is a second numerical value; determining a second utilization rate of the parking lot according to the first function value, the second function value of all vehicles in the parking lot, and the total number of parking spaces.

6. A processor, comprising: A vehicle dispatching method configured to perform any one of claims 1 to 5.

7. A vehicle dispatching device characterized by comprising: A processor comprising claim 6.

8. A machine-readable storage medium having stored thereon instructions, the instructions being executable by a machine to cause the machine to: The instructions, when executed by the processor, cause the processor to be configured to perform any one of claims 1 to 5. The instructions, when executed by the processor, cause the processor to be configured to perform any one of claims 1 to 5.

Images