Vehicle distribution method, device and equipment of integrated management platform, and storage medium

Abstract

The invention provides a vehicle distribution method and device for a comprehensive management platform, equipment and a storage medium, and the method comprises the steps: obtaining target acceptance information of each first acceptance account, and recording a station room position and an acceptance item in the target acceptance information; multiple vehicle allocation operations are executed based on the multiple target vehicles to obtain multiple first paths, and each target vehicle is allocated to a corresponding first acceptance account; the vehicle distribution operation comprises the steps of determining a first terminal point and a first starting point of each first acceptance account; distributing at least one first acceptance account for each target vehicle based on the corresponding seat number; planning a first path of each target vehicle according to all the corresponding first starting points and first ending points; and marking the station room position corresponding to the first terminal point determined this time. By means of multiple vehicle distribution operations, the target vehicle moving between stations of each first acceptance account is automatically determined, the vehicles for acceptance are automatically distributed, and the vehicle management efficiency and rationality are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of route planning, and in particular to a vehicle allocation method, device, equipment and storage medium for an integrated management platform. Background Art

[0002] During the construction of the power grid, it is necessary to build more switch stations, public distribution rooms, user distribution rooms and other stations according to the needs of the power grid. In order to ensure safe operation after construction, during the construction of the station, acceptance personnel need to perform acceptance operations on multiple acceptance items. Since each acceptance item is not completed on the same day, the acceptance personnel need to go to the same station multiple times at different times to perform acceptance operations, such as acceptance of construction materials in the material preparation stage, equipment acceptance in the equipment installation stage, and test acceptance after the equipment is installed.

[0003] Due to the large scale of the power grid, there are many stations under construction at the same time. Each acceptance officer is usually responsible for multiple stations. It is easy for multiple acceptance officers to go to multiple stations for acceptance on the same day. Acceptance officers usually need to apply for official vehicles when they go out for acceptance. However, due to cost constraints, each acceptance officer is usually not equipped with a vehicle.

[0004] In related technologies, vehicle applications are mainly completed through an integrated management platform. After logging into the integrated management platform, the acceptance personnel fill out the vehicle application, describing the vehicle use time, destination, stations involved, and other information in the vehicle application. The approval personnel will review the authenticity of the vehicle application. After receiving multiple vehicle applications, the vehicle management personnel will allocate vehicles based on personal experience. The entire process involves a lot of manual processing, which not only reduces the efficiency of vehicle allocation, but also relies on personal experience to allocate, which is likely to result in unreasonable path planning, affecting the acceptance progress. Summary of the invention

[0005] The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention proposes a vehicle allocation method, device, equipment, and storage medium for an integrated management platform, which can automatically allocate acceptance vehicles through the integrated management platform to improve vehicle management efficiency and the rationality of vehicle allocation.

[0006] In a first aspect, an embodiment of the present invention provides a vehicle allocation method for an integrated management platform, which is applied to the integrated management platform. The method includes: In response to vehicle requests sent by multiple first acceptance accounts, obtaining at least one target acceptance information corresponding to each of the first acceptance accounts, wherein the target acceptance information records the station room location and acceptance matters; Performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths, wherein the sum of the number of seats of the target vehicles is greater than or equal to the number of the first acceptance accounts; Allocating each of the target vehicles to a corresponding first acceptance account based on each of the first paths; Wherein, the vehicle allocation operation includes: Based on any of the first acceptance accounts, a first end point is selected from the corresponding and unmarked station room positions to determine a first starting point, wherein when the vehicle allocation operation is performed for the first time, the first starting point is a preset starting point, or when the vehicle allocation operation is not performed for the first time, the first starting point is the first end point determined by the last vehicle allocation operation; Allocate at least one first acceptance account number to each target vehicle based on the corresponding number of seats; Based on any of the target vehicles, planning the first path according to all the corresponding first starting points and first end points; After each of the target vehicles has determined the corresponding first path, the station room position corresponding to the first destination determined this time is marked.

[0007] According to some embodiments of the present invention, allocating each of the target vehicles to a corresponding first acceptance account based on each of the first paths includes: Based on any of the first acceptance accounts, determine the first commuting time corresponding to each of the first paths, and determine the sum of the first commuting time and the preset acceptance time of each of the acceptance items as the first account time; When the duration of each of the first accounts is less than or equal to a preset duration threshold, determining each of the first paths as a target path; When the duration of any of the first accounts is greater than the preset duration threshold, re-performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple second paths, wherein the first end point of the first acceptance account when the first path is determined for the first time is different from the first end point when the second path is determined for the first time; Based on any of the first acceptance accounts, determine the second commuting time corresponding to each of the second paths, and determine the sum of the second commuting time and each of the preset acceptance times as the second account time; When the duration of each of the second accounts is less than or equal to a preset duration threshold, determining each of the second paths as a target path; Each of the target vehicles is assigned to a corresponding first acceptance account based on each of the target paths.

[0008] According to some embodiments of the present invention, performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths includes: Based on any of the first acceptance accounts, the sum of the preset acceptance durations of the acceptance items is determined as a benchmark duration; When the vehicle allocation operation is performed for the first time, a first commuting time of each first acceptance account on the first route determined this time is determined, and a sum of the base time and the first commuting time is determined as the accumulated account time; Alternatively, when the vehicle allocation operation is not performed for the first time, the accumulated account duration is updated based on the first commuting duration determined this time; Whenever the vehicle allocation operation is performed once, when it is detected that the accumulated time of any of the accounts is greater than a preset time threshold, the corresponding first acceptance account is determined as a first abnormal account, and the corresponding first path is re-determined based on the first abnormal account; The accumulated account duration of each of the first acceptance accounts is updated based on the re-determined first path; when at least one of the updated accumulated account duration is greater than the preset duration threshold, the corresponding first acceptance account is determined as a second abnormal account, and the process goes back to the last vehicle allocation operation; a new first destination is determined for the second abnormal account, and then the vehicle allocation operation is performed.

[0009] According to some embodiments of the present invention, re-determining the corresponding first path based on the first abnormal account includes: Re-determining the first end point of the first abnormal account and re-corresponding the first path of the target vehicle; or, Determine the current target vehicle of the first abnormal account as a first adjustment vehicle, select any second adjustment vehicle from the target vehicles other than the first adjustment vehicle, and assign the first abnormal account to any of the second adjustment vehicles, wherein the number of seats in the second adjustment vehicle is greater than the number of the assigned first acceptance accounts; The first paths respectively corresponding to the first adjustment vehicle and the second adjustment vehicle are replanned.

[0010] According to some embodiments of the present invention, before rolling back to the last vehicle allocation operation, the method further includes: Continue to re-determine the first path of the corresponding target vehicle based on the second abnormal account; When the number of times the first path is re-determined in this vehicle allocation operation reaches a preset number, or when a new first path cannot be determined based on the second abnormal account, a rollback trigger signal is generated.

[0011] According to some embodiments of the present invention, when the vehicle allocation operation is not performed for the first time, after marking the station room position corresponding to the first destination determined this time, the method further includes: Based on any of the first acceptance accounts, the acceptance item associated with the marked station room position is determined as the first item, and the sum of the determined first commuting time and the preset acceptance time of the first item is determined as the path cumulative time; Based on any of the target vehicles, the first acceptance account assigned to other target vehicles is determined as the second acceptance account, and the second starting point and the second end point of the second acceptance account for executing the next vehicle allocation operation are determined; when the second starting point and the second end point are both located on the first path of the target vehicle, and the accumulated path time of the first acceptance account before the first end point in the first path is greater than the accumulated path time of the second acceptance account, the second acceptance account is assigned to the target vehicle.

[0012] According to some embodiments of the present invention, before allocating at least one first acceptance account number to each target vehicle based on the corresponding number of seats, the method further includes: Determine the sum of the number of seats as the number of allocatable seats, determine the number of the first acceptance accounts including at least one unmarked station room position as the number of allocatable accounts, and determine the difference between the number of allocatable seats and the number of allocatable accounts as the number of redundant seats; Selecting a redundant vehicle from the target vehicles whose number of seats is less than the redundant number of seats, updating the redundant number of seats based on the number of seats of the redundant vehicle, and removing the redundant vehicle.

[0013] In a second aspect, an embodiment of the present invention provides a vehicle allocation device for an integrated management platform, comprising at least one control processor and a memory for communicating with the at least one control processor; the memory stores instructions executable by the at least one control processor, and the instructions are executed by the at least one control processor so that the at least one control processor can execute the vehicle allocation method for the integrated management platform as described in the first aspect above.

[0014] In a third aspect, an embodiment of the present invention provides an electronic device, comprising a vehicle allocation device of the integrated management platform as described in the second aspect above.

[0015] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the vehicle allocation method of the integrated management platform as described in the first aspect above.

[0016] The vehicle allocation method of the integrated management platform according to the embodiment of the present invention has at least the following beneficial effects: in response to vehicle requests sent by multiple first acceptance accounts, obtaining at least one target acceptance information corresponding to each of the first acceptance accounts, wherein the target acceptance information records the station room position and acceptance matters; performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths, wherein the sum of the number of seats of the target vehicles is greater than or equal to the number of the first acceptance accounts; allocating each of the target vehicles to the corresponding first acceptance account based on each of the first paths; wherein the vehicle allocation operation includes: based on any of the first acceptance accounts, selecting a first end point from the corresponding and unmarked station room position to determine the first starting point, wherein when the vehicle allocation operation is performed for the first time, the first starting point is a preset starting point, or when the vehicle allocation operation is not performed for the first time, the first starting point is the first end point determined by the last vehicle allocation operation; allocating at least one first acceptance account to each of the target vehicles based on the corresponding number of seats; based on any of the target vehicles, planning the first path according to all the corresponding first starting points and first end points; after each of the target vehicles determines the corresponding first path, marking the station room position corresponding to the first end point determined this time. According to the technical solution of the embodiment of the present invention, it is possible to automatically obtain the station room position for each first acceptance account to perform acceptance, and after assigning multiple first acceptance accounts to target vehicles, plan the first path of the target vehicle with the station room positions in the same order as the starting point, and automatically plan all first paths that complete the station room movement of each first acceptance account through multiple target vehicles after repeated iterations. According to the first path, the vehicle allocation is realized after each first acceptance account completes the acceptance matters each time, and automatic allocation of acceptance vehicles is realized, thereby improving vehicle management efficiency and the rationality of vehicle allocation. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 is a schematic diagram of a vehicle allocation method of an integrated management platform provided by an embodiment of the present invention; Figure 2 is a flow chart of a vehicle allocation method of an integrated management platform provided by another embodiment of the present invention; Figure 3 is a complete flow chart of a vehicle allocation method of an integrated management platform provided by another embodiment of the present invention; Figure 4 It is a structural diagram of a vehicle allocation device of an integrated management platform provided in another embodiment of the present invention. DETAILED DESCRIPTION

[0018] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.

[0019] In the description of the present invention, it should be understood that descriptions involving orientations, such as up, down, front, back, left, right, etc., and orientations or positional relationships indicated are based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present invention.

[0020] In the description of the present invention, "several" means one or more, "more" means more than two, "greater than", "less than", "exceed" etc. are understood as not including the number itself, and "above", "below", "within" etc. are understood as including the number itself. If there is a description of "first" or "second", it is only used for the purpose of distinguishing the technical features, and cannot be understood as indicating or implying the relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.

[0021] In the description of the present invention, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in the present invention based on the specific content of the technical solution.

[0022] The embodiment of the present invention provides a vehicle allocation method, device, equipment, and storage medium for an integrated management platform, wherein the vehicle allocation method for the integrated management platform includes: in response to vehicle requests sent by multiple first acceptance accounts, obtaining at least one target acceptance information corresponding to each of the first acceptance accounts, wherein the target acceptance information records the station room location and acceptance matters; performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths, wherein the sum of the number of seats in the target vehicles is greater than or equal to the number of the first acceptance accounts; allocating each of the target vehicles to the corresponding first acceptance account based on each of the first paths; wherein the vehicle allocation operation includes: based on any The first acceptance account selects a first end point from the corresponding and unmarked station room positions to determine the first starting point, wherein when the vehicle allocation operation is performed for the first time, the first starting point is a preset starting point, or when the vehicle allocation operation is not performed for the first time, the first starting point is the first end point determined by the last vehicle allocation operation; at least one first acceptance account is allocated to each target vehicle based on the corresponding number of seats; based on any target vehicle, the first path is planned according to all the corresponding first starting points and first end points; after each target vehicle determines the corresponding first path, the station room position corresponding to the first end point determined this time is marked. According to the technical solution of the embodiment of the present invention, the station room position for each first acceptance account to perform acceptance can be automatically obtained, and after multiple first acceptance accounts are allocated to the target vehicle, the first path of the target vehicle is planned with the station room position in the same order as the starting point, and all first paths for completing the station room movement of each first acceptance account through multiple target vehicles are automatically planned after repeated iterations for multiple times, and the vehicle allocation of each first acceptance account after completing the acceptance matters each time is realized according to the first path, so as to realize automatic allocation of acceptance vehicles and improve vehicle management efficiency and rationality of vehicle allocation.

[0023] The following is based on the Figure 1 The schematic diagram shown further illustrates the technical solution of the embodiment of the present invention.

[0024] exist Figure 1In the schematic diagram shown, the solid arrow is the first acceptance account assigned to each target vehicle when the vehicle allocation operation is performed for the first time, and the dotted arrow is the first acceptance account assigned to each target vehicle when the vehicle allocation operation is performed for the second time. The target vehicles include the first vehicle 21 and the second vehicle 22, the first acceptance account includes the first employee account 11, the second employee account 12, the third employee account 13, the fourth employee account 14, the fifth employee account 15 and the sixth employee account 16, the target acceptance information of the first employee account 11 includes acceptance information A, acceptance information B and acceptance information C, the target acceptance information of the second employee account 12 includes acceptance information D, acceptance information E and acceptance information F, the target acceptance information of the third employee account 13 includes acceptance information G and acceptance information H, the target acceptance information of the fourth employee account 14 includes acceptance information I, acceptance information J and acceptance information K, the target acceptance information of the fifth employee account 15 includes acceptance information L, acceptance information M and acceptance information N, and the target acceptance information of the sixth employee account 16 includes acceptance information O and acceptance information P. The corresponding relationship of each type of information will not be repeated in the following.

[0025] Reference Figure 2 , Figure 2 A flow chart of a vehicle allocation method of an integrated management platform provided in an embodiment of the present invention, the vehicle allocation method of the integrated management platform includes but is not limited to the following steps: S10, in response to vehicle requests sent by multiple first acceptance accounts, obtaining at least one target acceptance information corresponding to each first acceptance account, wherein the target acceptance information records the station room location and acceptance matters; S20, performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths, wherein the sum of the number of seats of the target vehicles is greater than or equal to the number of first acceptance accounts; S30, allocating each target vehicle to a corresponding first acceptance account based on each first path; The vehicle allocation operation includes: S21, based on any first acceptance account, select a first end point from the corresponding and unmarked station room positions to determine a first starting point, wherein when the vehicle allocation operation is performed for the first time, the first starting point is a preset starting point, or when the vehicle allocation operation is not performed for the first time, the first starting point is the first end point determined by the last vehicle allocation operation; S22, allocating at least one first acceptance account to each target vehicle based on the corresponding number of seats; S23, based on any target vehicle, planning a first path according to all corresponding first starting points and first end points; S24, after each target vehicle has determined its corresponding first path, mark the station room position corresponding to the first destination determined this time.

[0026] It should be noted that the integrated management platform is a management system for power grid construction enterprises. Each station room in the construction process can be pre-set on the integrated management platform. When each station room needs to be accepted, target acceptance information is created and assigned to the corresponding first acceptance account. The first acceptance account is the account of the acceptance personnel. The acceptance personnel can initiate a vehicle request in advance according to actual needs. For example, select a target date on the integrated management platform, initiate a vehicle request based on the target date, and the integrated management platform determines all acceptance information that has not been completed as the target acceptance information. In this embodiment, multiple first acceptance accounts can initiate vehicle requests on the same day, thereby obtaining multiple first acceptance accounts, and each first acceptance account has at least one target acceptance information. If the number of first acceptance accounts can be satisfied by only one target vehicle, then directly allocate one target vehicle. This is not within the scope of discussion in this embodiment. Unless otherwise specified, the scenario discussed in this embodiment is that multiple target vehicles are required to complete the commuting of the acceptance personnel. For example, the number of target vehicles is N (N is a positive integer), the sum of the number of seats of N target vehicles is greater than the number of first acceptance accounts, and the sum of the number of seats of N-1 target vehicles is less than the number of first acceptance accounts. Of course, the number of seats in different target vehicles may be different. The number of seats in this embodiment is the number excluding the driver. For example, some vehicles are 5-seater vehicles, so the number of seats is 4, and some vehicles are 7-seater vehicles, so the number of seats is 6.

[0027] It should be noted that the station room location refers to the geographical location of the station room to be accepted, and the acceptance items are the items that need to be accepted in the station room to be accepted, such as material acceptance, equipment installation acceptance, test acceptance, etc. The specific acceptance items are not limited here.

[0028] It should be noted that each first acceptance account includes multiple target acceptance information, so each acceptance personnel needs to start from a preset starting point and go to multiple station rooms in turn to perform corresponding acceptance matters. Since the acceptance matters take a certain amount of time, the target vehicle can only send the acceptance personnel to one station room at a time, but the target vehicle can carry multiple acceptance personnel at a time. Therefore, in this embodiment, in a vehicle allocation operation, multiple first acceptance accounts are allocated to each target vehicle, and the constructed first path can send each acceptance personnel to a station room position. After executing the first path once, the target vehicle will send the first acceptance account allocated again from the station room position delivered last time to the next station room position in the next first path, so that multiple acceptance personnel can share multiple target vehicles, realize commuting between multiple stations to be accepted, and realize automatic allocation of vehicles. The initial starting point of all first acceptance accounts in this embodiment is the same. For example, the company address can be set as the preset starting point to ensure that all target vehicles start from the preset starting point.

[0029] It should be noted that the present embodiment does not limit the number of acceptance items recorded in each target acceptance information. For example, the equipment installation acceptance and equipment test acceptance can be recorded simultaneously in one target acceptance information to ensure that one target acceptance information corresponds to one station room location. In the case of multiple acceptance items, the acceptance personnel only need to go to the station room location once. The only difference is that the preset acceptance time determined subsequently is different. Therefore, the present embodiment does not involve the same acceptance personnel going to the same station room location multiple times, nor does it involve multiple acceptance personnel going to the same station room location, that is, the station room locations corresponding to each target acceptance information must be different from each other.

[0030] It should be noted that when the vehicle allocation operation is performed for the first time, the first starting point of each first acceptance account is a preset starting point. The preset starting point can be the company address in the above example, and the first end point can be any target acceptance information. For example, the station room location closest to the preset starting point is selected as the first end point. When the vehicle allocation operation is not performed for the first time, such as the second time, the first account information is located at the first end point of the first time. Therefore, the first starting point is the first end point of the first vehicle allocation operation. The first end point of the second vehicle allocation operation can be selected from the station locations that have not been selected in the first acceptance account. The specific selection method is not limited here. For example, the closest distance or the one with a higher acceptance priority can be selected.

[0031] For example, Figure 1 As shown, after the vehicle allocation operation is performed for the first time, the first vehicle 21 is allocated with the first employee account 11, the second employee account 12 and the third employee account 13, so the first path obtained is Figure 1 The path A-1 shown in the figure has the passing points including the company (preset starting point), station A, station D and station G. After completing the commute, the first employee account 11 is located in station A, the second employee account 12 is located in station D, and so on. This embodiment does not involve the improvement of the path planning algorithm. After determining the specific passing points, those skilled in the art are familiar with how to plan the first path. The paths A-1, A-2, B-1 and B-2 of this embodiment are only used to describe the path composition. The specific order of the station positions can be adjusted according to the actual path planning algorithm.

[0032] It is worth noting that in this embodiment, the first acceptance account number is not bound to the target vehicle, but the first acceptance account number associated with the target vehicle can be re-determined each time the vehicle allocation operation is performed. In this embodiment, the first acceptance account number can be allocated to each target vehicle one by one, but it is not limited to each target vehicle to be fully allocated. For example, Figure 1As shown, if station room A, station room D and station room G are located in the same area, and station room I, station room L and station room O are located in another area, for the sake of path optimization, even if the number of seats in the first vehicle 21 is 4, only 3 first acceptance accounts need to be allocated. When the number of target vehicles required remains unchanged, the number of first acceptance accounts allocated to each target vehicle can be flexibly adjusted. In this embodiment, the number of target vehicles can meet the number of first acceptance accounts, but the number of first acceptance accounts cannot be met after reducing any target vehicle, ensuring that vehicle resources will not be wasted.

[0033] For example, when performing the second vehicle allocation operation, if the first vehicle 21 is closer to the station room I, and the second vehicle 22 is located in the station room O and farther from the station room I, the fourth employee account 14 can be allocated to the first vehicle 21. The first path obtained by performing the second vehicle allocation for the first vehicle 21 is path A-2. Since it is necessary to go to the station room where the acceptance personnel last arrived to pick up the person, each first acceptance account will add two waypoints to the first path during the non-first vehicle allocation operation, for example Figure 1 The path A-2 shown includes station A, station C, station D, station E, station G, station H, station I, and station J, wherein station A is the starting point of the path of the first employee account 11, station C is the end point of the path of the first employee account 11, and so on. A new first path is constructed based on the above 8 waypoints.

[0034] It should be noted that after determining each first starting point and first end point, the specific path planning algorithm is not within the scope of discussion of this embodiment. The first path is constructed for the target vehicle, not for the first acceptance account. For example Figure 1 As shown, after executing the first vehicle allocation operation, the first vehicle 21 obtains path A-1 and the second vehicle 22 obtains path B-1. After executing the second vehicle allocation operation, the first vehicle obtains path A-2 and the second vehicle 22 obtains path B-2. Each time a vehicle allocation operation is executed, the number of first paths that can be obtained is the same as the number of target vehicles.

[0035] It is worth noting that since the location information of each station room is determined as the first end point and the first starting point in two consecutive first paths respectively, after executing multiple vehicle allocation operations, each station room location appears in two consecutive first paths respectively, that is, the number of appearances of the station room location is twice the number of first paths.

[0036] It is worth noting that in order to ensure that the first destination selected each time is a station room location that has not been reached by the first acceptance account, this embodiment marks the station room location determined as the first destination in the corresponding target acceptance information after each vehicle allocation operation is performed, so that when the vehicle allocation operation is performed next time, the corresponding station room location can be excluded according to the mark to avoid repeated selection. Figure 1 As shown, after determining path A-1, taking the target acceptance information of the first employee account 11 as an example, mark the station room A in the acceptance information A. When the vehicle allocation operation is performed next time, based on the mark recognition, only the first destination will be determined from station rooms B and station room C, and the same applies to the remaining accounts.

[0037] It should be noted that when the first acceptance account has no unmarked station room position, when executing the current vehicle allocation operation, the preset starting point can be used as the first end point, so that the target vehicle can send the corresponding acceptance personnel back to the company. When each first acceptance account uses the preset starting point as the first end point, it can be determined that each station room has completed the acceptance. At this time, the vehicle allocation operation can be stopped, and the integrated management platform will allocate the first path that has been obtained to each first acceptance account, thereby notifying the corresponding acceptance personnel of the target vehicle to take at each station room position, and realizing automatic allocation of vehicles.

[0038] For example, Figure 1 As shown, taking the vehicle allocation operation as an example, the first vehicle 21 and station room A are sent to the first employee account 11, and the first vehicle 21 and station room C are sent. The corresponding acceptance personnel can know that they can take the first vehicle 21 from the company to station room A, and after the acceptance is completed, they can take the first vehicle 21 from station room A to station room C; for another example, the second vehicle and station room I are sent to the fourth employee account 14, and the first vehicle and station room J are sent. The corresponding acceptance personnel can know that they can take the second vehicle 22 from the company to station room I, and after the acceptance is completed, they can take the first vehicle 21 from station room I to station room J. The same applies to the remaining accounts and will not be repeated here.

[0039] In addition, in one embodiment, referring to Figure 3 Step S30 specifically includes but is not limited to the following steps: S31, based on any first acceptance account, determining the first commuting time corresponding to each first path, and determining the sum of the first commuting time and the preset acceptance time of each acceptance item as the first account time; S32, when the duration of each first account is less than or equal to a preset duration threshold, determining each first path as a target path; S33, when the duration of any first account is greater than a preset duration threshold, re-performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple second paths, wherein the first end point of the first acceptance account when the first path is determined for the first time is different from the first end point when the second path is determined for the first time; S34, based on any first acceptance account, determining the second commuting time corresponding to each second path, and determining the sum of the second commuting time and each preset acceptance time as the second account time; S35, when the duration of each second account is less than or equal to the preset duration threshold, determining each second path as a target path; S36, allocating each target vehicle to a corresponding first acceptance account based on each target path.

[0040] It should be noted that, according to the description of the above embodiment, this embodiment can be a vehicle request initiated for a target date. After obtaining the vehicle request, the integrated management platform determines all acceptance information to be accepted as target acceptance information. The working hours of each acceptance personnel are limited every day. After this implementation executes the vehicle allocation operation, the same target vehicle includes multiple first acceptance accounts, that is, not every acceptance personnel can go directly to the station room that needs acceptance, but need to wait for the target vehicles to be delivered one by one. Therefore, when there is a lot of target acceptance information, it is necessary to ensure that all target acceptance information can be completed within the limited working time when sharing the vehicle with other acceptance personnel.

[0041] It is worth noting that the preset acceptance time for each acceptance item is usually knowable. The preset acceptance time can be set for each type of acceptance item on the integrated management platform. After creating the target acceptance information, the acceptance personnel can enter the preset acceptance time according to the actual situation of the station to be accepted. This ensures that each acceptance item has a preset acceptance time when the integrated management platform receives a vehicle request.

[0042] It should be noted that the first path is for the target vehicle. After the path planning is completed, the delivery order of each first acceptance account can be determined according to the first path. If the path is known, the average speed of the target vehicle in a specific time period can be determined according to historical data on the integrated management platform. For example Figure 1 As shown, the order of path A-1 is company, station room A, station room D and station room G. The commuting distance corresponding to the first employee account 11 is the distance from the company to station room A, which is divided by the average speed to obtain the first commuting time of the first employee account 11. The commuting distance corresponding to the second employee account 12 is the distance from the company to station room A plus the distance from station room A to station room D, which is divided by the average speed to obtain the first commuting time of the second employee account 12, and so on. The method for determining commuting time based on the path will not be repeated in the following.

[0043] It should be noted that for each first acceptance account, after determining the first commuting time of each first path, when all preset acceptance times are known, the first account time is obtained by summing up all the first commuting times and the preset acceptance times. The first account time is the estimated working time of the first acceptance account. The preset time threshold is the working time corresponding to each first acceptance account on the target date. The preset time threshold of each first acceptance account can be different and can be set according to the actual working time. Regardless of when the acceptance personnel arrive, the preset acceptance time for executing the acceptance project remains unchanged. Therefore, whether the vehicle allocation plan is feasible depends on the length of the commuting time. When the first account time is less than or equal to the preset time threshold, all the planned first paths can meet the requirements in terms of commuting time, and the first path is determined as the target path and allocated to the corresponding first acceptance account.

[0044] It should be noted that when the duration of any first account is greater than the preset duration threshold, the currently determined first path will cause at least one acceptance personnel to exceed the working hours, and the first path will be unavailable. Therefore, this embodiment uses this as a trigger signal to re-perform the vehicle allocation operation to obtain multiple second paths. The second path is determined in the same way as the first path. The first path of this embodiment is a plurality of paths obtained by completing multiple vehicle allocations and capable of delivering all first acceptance accounts to various station room locations. The second path is a plurality of paths obtained by completing multiple vehicle allocations and capable of delivering all first acceptance accounts to various station room locations, rather than two paths obtained from the same vehicle allocation.

[0045] It should be noted that, in order to distinguish from the first path, the first destination selected by each first acceptance account is different from that when the first path is planned, thereby triggering the second path obtained by the first vehicle allocation operation of the integrated management platform, which is different from the first path obtained by the first vehicle allocation operation, thereby triggering the second path obtained by subsequent iterations to further distinguish from the first path of the same time. After obtaining the second path different from the first path, the second commuting time and the second account time are recalculated. The judgment logic is the same as that of the first account time mentioned above, and will not be repeated here.

[0046] For example, Figure 1 As shown, the first path takes path A-1 and path A-2 as examples. When the vehicle allocation operation is performed for the first time to determine the second path, the selected first destination is changed to station room B, station room E and station room H. When the waypoints are different, the driving path of the target vehicle is also different. Therefore, the first first path and the first second path are different. When the vehicle allocation operation is performed subsequently, it is necessary to select from the remaining station room positions. Therefore, only the difference is formed during the first selection. The second path obtained subsequently will also be different from the first path due to the difference in the selectable station room positions.

[0047] In addition, in one embodiment, referring to Figure 3 Step S20 also includes but is not limited to the following steps: S25, based on any first acceptance account, determining the sum of the preset acceptance durations of the acceptance items as the benchmark duration; S26, when the vehicle allocation operation is performed for the first time, determining the first commuting time of each first acceptance account on the first route determined this time, and determining the sum of the base time and the first commuting time as the accumulated account time; S27: when the vehicle allocation operation is not performed for the first time, the accumulated account duration is updated based on the first commuting duration determined this time; S28, whenever a vehicle allocation operation is performed, when it is detected that the accumulated time of any account is greater than a preset time threshold, the corresponding first acceptance account is determined as a first abnormal account, and the corresponding first path is re-determined based on the first abnormal account; S29, based on the re-determined first path, the cumulative account duration of each first acceptance account is updated. When at least one updated cumulative account duration is greater than the preset duration threshold, the corresponding first acceptance account is determined as a second abnormal account, and the process goes back to the last vehicle allocation operation. After determining a new first destination for the second abnormal account, the vehicle allocation operation is performed.

[0048] It should be noted that in steps S31 to S36, the integrated management platform can concentrate platform resources to complete path planning and vehicle allocation, and perform duration judgment after determining all first paths, which can improve resource utilization. In this embodiment, a duration judgment is performed every time a first path is planned, and unnecessary path planning can be stopped in time when a duration anomaly occurs. By increasing some computing resources so that the output first path is a directly available target path, the accuracy of vehicle allocation can be improved. The strategy of steps S31 to S36 or the strategy of this embodiment can be selected according to the actual situation of platform resources.

[0049] It should be noted that the benchmark duration of each first acceptance account is the sum of the preset acceptance durations. Referring to the description of the above embodiment, the preset acceptance duration is fixed and will not change due to different paths. Therefore, the benchmark duration is the working time that each first acceptance account must consume. On this basis, each time a vehicle allocation operation is completed, the first commuting duration is determined according to the method of the above embodiment, and the cumulative account duration is updated according to the first commuting duration. Each first acceptance account has a cumulative account duration. When any cumulative account duration is greater than the duration threshold, it can be determined that the currently planned first path can no longer meet the duration requirement, and there is no need to continue to perform subsequent unfinished vehicle allocation operations. The first acceptance account corresponding to the cumulative account duration greater than the preset duration threshold is determined as the first abnormal account, and the first path is re-determined based on the first abnormal account. For example, another first destination is selected in the first path that causes the abnormality, and the first path is optimized, or the first abnormal account is replaced with another target vehicle for re-path planning. The path optimization is first performed on the first abnormal account to reduce the first commuting time.

[0050] It should be noted that after updating the first path of the first abnormal account, since the updated first path is also associated with multiple first acceptance accounts, it is necessary to recalculate the cumulative account time of the relevant first acceptance accounts. If there is still a time greater than the preset threshold, it is determined to be a second abnormal account. If updating the path based on the first abnormal account will lead to the emergence of another second abnormal account, the benefit of path optimization in this round of vehicle allocation operation is small, and the path optimization is further optimized by falling back to the last vehicle allocation operation, and a different first destination is selected for the second abnormal account to trigger a vehicle allocation operation after the fallback that is different from the first path obtained by the same vehicle allocation operation before the fallback.

[0051] For example, Figure 1 As shown, taking the second vehicle allocation operation currently being executed as an example, when the second abnormal account is determined to be the second employee account 12, the process returns to the first vehicle allocation operation, and the first destination is changed from station room D to station room E or station room F, thereby triggering changes in path A-1 and path A-2. The path change triggers the next duration threshold judgment, and the subsequent vehicle allocation operation continues after the accumulated account duration reaches the preset duration threshold, thereby realizing automatic update of vehicle allocation.

[0052] In addition, in one embodiment, referring to Figure 3 In step S28, the corresponding first path is re-determined based on the first abnormal account, including but not limited to the following steps: S281, re-determine the first destination of the first abnormal account and re-correspond to the first path of the target vehicle; S282, determining the current target vehicle of the first abnormal account as the first adjustment vehicle, selecting any second adjustment vehicle from the target vehicles other than the first adjustment vehicle, and assigning the first abnormal account to any second adjustment vehicle, wherein the number of seats in the second adjustment vehicle is greater than the number of the assigned first acceptance accounts; S283, replanning the first paths corresponding to the first adjustment vehicle and the second adjustment vehicle respectively.

[0053] It should be noted that the first destination of this embodiment is selected from the unmarked station room position. Even if the station room closest to the station room where the acceptance personnel is currently located can be selected as the first destination, the first path is planned based on the first destinations and the first starting point of multiple first acceptance accounts. Therefore, when the acceptance personnel move from the first starting point to the first destination, it is likely to take a detour due to path planning, and it is not necessarily directly from the first starting point to the first destination. For example, it is necessary to go to the first starting point of other acceptance personnel first, and then go to their own first destination. This will result in that even if the station room position closest to the first starting point is selected as the first destination, the path planning may be longer than the commuting time consumed by selecting other station room positions. Therefore, when the path planning is re-performed based on the first abnormal account, the present embodiment can re-select a first destination based on the currently assigned target vehicle, so that the first commuting time of the first abnormal account changes, and the accumulated account time after the change is compared with the preset time threshold again. If it is still not satisfied, another first destination can be changed. If there is no new first destination to choose, it can be returned to the last vehicle allocation operation, or the strategy of step S282 is executed.

[0054] It should be noted that in step S282, the strategy of replacing the target vehicle is adopted, the current target vehicle of the first abnormal account is determined as the first adjustment vehicle, the remaining target vehicles are determined as the second adjustment vehicles, and the first abnormal account is assigned to any second adjustment vehicle. Of course, the number of seats in the assigned second adjustment vehicle is greater than the number of assigned first acceptance accounts, that is, the second adjustment vehicle has enough seats to allocate new personnel. If the seats in the target vehicle are full, it will not be determined as the second adjustment vehicle.

[0055] It should be noted that after the first abnormal account is assigned to the second adjustment vehicle, the first adjustment vehicle reduces the first starting point and the first end point corresponding to the first abnormal account, and the second adjustment vehicle increases the first starting point and the first end point corresponding to the first abnormal account. The first paths of the two are re-planned in this vehicle allocation operation. Similarly, after the first paths of the first adjustment vehicle and the second adjustment vehicle are re-determined, the cumulative account time of the corresponding first acceptance account is recalculated and compared with the preset time threshold to ensure that the cumulative account time is less than or equal to the preset time threshold. If it still cannot be satisfied, the abnormal first acceptance account can also be assigned to a target vehicle that has not been assigned, and the path change is achieved through vehicle adjustment, thereby achieving a change in the first commuting time of the first acceptance account. If the comprehensive management platform has sufficient computing resources, it can perform multiple calculations by exhaustive traversal until all cumulative account times meet the preset time threshold.

[0056] For example, Figure 1 As shown, the second employee account 12 is still taken as the first abnormal account, and the corresponding first path is path A-2. The second employee account 12 is changed from the first vehicle 21 to the second vehicle 22, and two waypoints, station room D and station room E, are added to the path B-2 of the second vehicle 22.

[0057] In addition, in one embodiment, referring to Figure 3 In step S29, before returning to the last vehicle allocation operation, the following steps are also included but not limited to: S291, continue to re-determine the first path of the corresponding target vehicle based on the second abnormal account; S292, when the number of times the first path is re-determined in this vehicle allocation operation reaches a preset number of times, or when a new first path cannot be determined based on the second abnormal account, a rollback trigger signal is generated.

[0058] It should be noted that before rolling back to the last vehicle allocation operation, the present embodiment further redetermines the first path of the target vehicle. It can refer to the principle of the first abnormal account to select another first destination for the second abnormal account, triggering the update of the first path of the target vehicle. If the cumulative account time of the second abnormal account can meet the preset time threshold, it means that the path optimization can be achieved after the same vehicle allocation operation, without rolling back to the last vehicle allocation operation to reallocate each first acceptance account to each target vehicle, thereby reducing unnecessary processing.

[0059] It should be noted that, since the first end point of the second abnormal account is changed, the first commuting time of other first acceptance accounts of the same target vehicle will also change. Therefore, it is very likely that a new third abnormal account will continue to be generated, and the first path will be updated based on the third abnormal account according to the above embodiment. Although the first end point and the first starting point of the first path after each update can be marked to ensure that the passing points of each updated first path are different, it is also possible that the cumulative account time of each first acceptance account meets the preset time threshold. The present embodiment pre-sets the preset number of times. In the same target vehicle, each time the first path is updated, a count is performed. When the count value reaches the preset number of times, a fallback trigger signal is generated, and the fallback is returned to the last vehicle allocation operation, and a different first acceptance account is allocated to each target vehicle. Alternatively, when the second abnormal account no longer has a new first end point, it can be determined that the cumulative account time of the second abnormal account will inevitably fail to meet the preset time threshold through path optimization, and a fallback trigger signal is also generated.

[0060] For example, Figure 1 As shown, the preset number of times is 3 times. Taking the first vehicle 21 as an example, when the second abnormal account is the second employee account 12, taking path A-2 as an example, after station room E is changed to station room F, the cumulative account time of the second employee account 12 meets the preset time threshold, but causes the first employee account 11 to not meet, and station room C is changed to station room B, which continues to cause the fourth employee account 14 to not meet, and station room J is changed to station room K. At this time, as long as any cumulative time threshold cannot meet the preset time threshold, because it has been iterated 3 times, it will fall back to path A-1.

[0061] For example, Figure 1 As shown, continuing to refer to the above example, when the second abnormal account is the third employee account 13, since the station room G of the third employee account 13 has been marked, there is no new station room location except the station room H, and a fallback trigger signal is directly generated.

[0062] In addition, in one embodiment, referring to Figure 3 When the vehicle allocation operation is not performed for the first time, after executing step S24, the following steps are also included but not limited to: S241, based on any first acceptance account, determining the acceptance item associated with the marked station room position as the first item, and determining the sum of the determined first commuting time and the preset acceptance time of the first item as the path cumulative time; S242, based on any target vehicle, the first acceptance account assigned to other target vehicles is determined as the second acceptance account, and the second starting point and the second end point of the second acceptance account are determined to be used to execute the next vehicle allocation operation. When the second starting point and the second end point are both located on the first path of the target vehicle, and the first end point in the first path is located before the second starting point, the path cumulative time of the first acceptance account is greater than the path cumulative time of the second acceptance account, the second acceptance account is assigned to the target vehicle.

[0063] It should be noted that the marked station room position is the station room that has been reached and the acceptance operation can be performed. Therefore, the first item can be determined as the acceptance item that has completed the acceptance. After summing it with the determined first commuting time, the obtained path cumulative time can represent the time corresponding to the first acceptance account at each station room position, for example Figure 1 As shown, for the acceptance personnel corresponding to the first employee account 11, the calculated cumulative path duration corresponding to station A is 2 hours, station B is 4 hours, and station C is 5 hours. That is, starting from the triggering moment of the first first path, 2 hours after all the target vehicles depart from the preset starting point, the acceptance personnel corresponding to the first employee account 11 is located in station A, 4 hours later is located in station B, and 5 hours later is located in station C. The cumulative path duration represents the appearance time of the first acceptance account at each station location when using the current first path and target vehicle.

[0064] It should be noted that each target vehicle will be assigned multiple first acceptance accounts. In this embodiment, the first acceptance accounts other than the target vehicle are determined as the second acceptance accounts. Figure 1 As shown, taking the first vehicle 21 as an example, when performing the first vehicle allocation operation, the fourth employee account 14, the fifth employee account 15 and the sixth employee account 16 are allocated to the second vehicle 22. Therefore, for the first vehicle 21, the above three first acceptance accounts are the second acceptance accounts.

[0065] It should be noted that after determining the second acceptance account, when executing the vehicle allocation operation, since the first starting point and the first end point of this time have been determined, before determining the first path and officially applying it, the second starting point and the second end point of each second acceptance account during the next vehicle allocation operation can be pre-planned. It is worth noting that if the second acceptance account is assigned to a different target vehicle during the next vehicle allocation operation, it needs to be re-determined as the first acceptance account.

[0066] It should be noted that when the second starting point and the second end point are located on the current first path of the target vehicle, and the first end point in the first path is located before the second starting point, the path cumulative duration of the first acceptance account is greater than the path cumulative duration of the second acceptance account, according to the definition of the above path cumulative duration, it can be determined that when executing this first path, when the target vehicle passes the second starting point, the corresponding acceptance personnel have completed the acceptance matters and can move to the next station room. If the second end point is also located on the current first path of the target vehicle, the target vehicle can carry the second acceptance account to the second end point, thereby improving the utilization rate of the first path, reducing a set of first starting points and first end points during subsequent vehicle allocation operations, and optimizing the first commuting time of each first acceptance account in the next first path. It is worth noting that the second starting point needs to be after a first end point, which can ensure that the target vehicle must have enough seats.

[0067] For example, Figure 1 As shown, the target vehicle takes the first vehicle 21 as an example. In the second vehicle allocation operation, taking the cumulative path time of the third employee account 13 in path A-2 as 3 hours as an example, the cumulative path time of the fifth employee account 15 is 2.5 hours, and station rooms L and station rooms N are located on path A-2, and station room L is located after station room H. Then, after the first vehicle 21 arrives at station room H and drops off the acceptance personnel corresponding to the third employee account 13, continuing to execute the first path will pass through station room L. Since 3 hours have passed since arriving at station room H, the acceptance personnel corresponding to the fifth employee account 15 has completed the acceptance at 2.5 hours and is waiting in station room L. Therefore, the fifth employee account 15 can be assigned to the first vehicle 21, and station rooms L and station room N are removed from path B-2 of the second vehicle 22.

[0068] In addition, in one embodiment, referring to Figure 3 Before executing step S22, the process also includes but is not limited to the following steps: S211, determining the sum of the number of seats as the number of allocatable seats, determining the number of first acceptance accounts including at least one unmarked station room position as the number of allocatable accounts, and determining the difference between the number of allocatable seats and the number of allocatable accounts as the number of redundant seats; S212, selecting a redundant vehicle from the target vehicles whose seat numbers are smaller than the redundant seat number, updating the redundant seat number based on the seat number of the redundant vehicle, and removing the redundant vehicle.

[0069] It should be noted that, when determining the target vehicles, this embodiment needs to ensure that the number of target vehicles can just meet the number of first acceptance accounts. After departure, since the number of target acceptance information of each first acceptance account is different, it is very likely that after a certain vehicle allocation operation, at least one first acceptance account will end the acceptance work because it has completed the acceptance items of all stations. This reduces the number of seats required for the target vehicles. In order to improve the utilization rate of the vehicle, this embodiment determines the number of allocatable seats and the number of allocatable accounts, and uses the difference between the two as the number of redundant seats. When the number of redundant seats is greater than or equal to the number of seats of any target vehicle, it means that after removing the target vehicle, the number of seats can still meet the number of seats required by the first acceptance account. Therefore, the number of vehicles can be reduced to save vehicle expenses.

[0070] like Figure 4 As shown, Figure 4 The present invention also provides a vehicle allocation device for an integrated management platform, including: The processor 401 may be implemented by a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application; The memory 402 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 402 can store an operating system and other application programs. When the technical solution provided in the embodiment of this specification is implemented by software or firmware, the relevant program code is stored in the memory 402, and the processor 401 calls and executes the vehicle allocation method of the integrated management platform of the embodiment of this application; Input / output interface 403, used to implement information input and output; Communication interface 404, used to realize communication interaction between the device and other devices, which can be realized through wired mode (such as USB, network cable, etc.) or wireless mode (such as mobile network, WIFI, Bluetooth, etc.); A bus 405 that transmits information between various components of the device (e.g., processor 401, memory 402, input / output interface 403, and communication interface 404); The processor 401 , the memory 402 , the input / output interface 403 and the communication interface 404 are connected to each other in communication within the device via the bus 405 .

[0071] An embodiment of the present application also provides an electronic device, including a vehicle allocation device of the integrated management platform as described above.

[0072] An embodiment of the present application also provides a storage medium, which is a computer-readable storage medium and stores a computer program. When the computer program is executed by a processor, the vehicle allocation method of the above-mentioned integrated management platform is implemented.

[0073] As a non-transient computer-readable storage medium, the memory can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage devices. In some embodiments, the memory may optionally include a memory remotely arranged relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof. The device embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and are implemented to be located in one place, or may also be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment.

[0074] It will be appreciated by those skilled in the art that all or some of the steps and systems in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or transient medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically include computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0075] The above is a specific description of the preferred implementation of the present invention, but the present invention is not limited to the above implementation mode. Technical personnel familiar with the field can also make various equivalent deformations or substitutions under the shared conditions without violating the spirit of the present invention. These equivalent deformations or substitutions are all included in the scope defined by the claims of the present invention.

Claims

1. A vehicle allocation method for an integrated management platform, characterized in that: Applied to the integrated management platform, the method comprises: In response to vehicle requests sent by multiple first acceptance accounts, obtaining at least one target acceptance information corresponding to each of the first acceptance accounts, wherein the target acceptance information records the station room location and acceptance matters; Performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths, wherein the sum of the number of seats of the target vehicles is greater than or equal to the number of the first acceptance accounts; Allocating each of the target vehicles to the corresponding first acceptance account based on each of the first paths; Wherein, the vehicle allocation operation includes: Based on any of the first acceptance accounts, a first end point is selected from the corresponding and unmarked station room positions to determine a first starting point, wherein when the vehicle allocation operation is performed for the first time, the first starting point is a preset starting point, or when the vehicle allocation operation is not performed for the first time, the first starting point is the first end point determined by the last vehicle allocation operation; Allocate at least one first acceptance account number to each target vehicle based on the corresponding number of seats; Based on any of the target vehicles, planning the first path according to all of the corresponding first starting points and first end points; After each of the target vehicles has determined the corresponding first path, the station room position corresponding to the first destination determined this time is marked.

2. The vehicle allocation method of the integrated management platform according to claim 1 is characterized in that: Allocating each of the target vehicles to the corresponding first acceptance account based on each of the first paths includes: Based on any of the first acceptance accounts, determine the first commuting time corresponding to each of the first paths, and determine the sum of the first commuting time and the preset acceptance time of each of the acceptance items as the first account time; When the duration of each of the first accounts is less than or equal to a preset duration threshold, determining each of the first paths as a target path; When the duration of any of the first accounts is greater than the preset duration threshold, re-performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple second paths, wherein the first end point of the first acceptance account when the first path is determined for the first time is different from the first end point when the second path is determined for the first time; Based on any of the first acceptance accounts, determine the second commuting time corresponding to each of the second paths, and determine the sum of the second commuting time and each of the preset acceptance times as the second account time; When the duration of each of the second accounts is less than or equal to a preset duration threshold, determining each of the second paths as a target path; Each of the target vehicles is assigned to a corresponding first acceptance account based on each of the target paths.

3. The vehicle allocation method of the integrated management platform according to claim 1 is characterized in that: Performing multiple vehicle allocation operations based on multiple target vehicles to obtain multiple first paths includes: Based on any of the first acceptance accounts, the sum of the preset acceptance durations of the acceptance items is determined as a benchmark duration; When the vehicle allocation operation is performed for the first time, a first commuting time of each first acceptance account on the first route determined this time is determined, and a sum of the base time and the first commuting time is determined as the accumulated account time; Alternatively, when the vehicle allocation operation is not performed for the first time, the accumulated account duration is updated based on the first commuting duration determined this time; Whenever the vehicle allocation operation is performed once, when it is detected that the accumulated time of any of the accounts is greater than a preset time threshold, the corresponding first acceptance account is determined as a first abnormal account, and the corresponding first path is re-determined based on the first abnormal account; The accumulated account duration of each of the first acceptance accounts is updated based on the re-determined first path; when at least one of the updated accumulated account duration is greater than the preset duration threshold, the corresponding first acceptance account is determined as a second abnormal account, and the process goes back to the last vehicle allocation operation; a new first destination is determined for the second abnormal account, and then the vehicle allocation operation is performed.

4. The vehicle allocation method of the integrated management platform according to claim 3 is characterized in that: Re-determining the first path corresponding to the first abnormal account includes: Re-determining the first end point of the first abnormal account and re-corresponding the first path of the target vehicle; or, Determine the current target vehicle of the first abnormal account as a first adjustment vehicle, select any second adjustment vehicle from the target vehicles other than the first adjustment vehicle, and assign the first abnormal account to any of the second adjustment vehicles, wherein the number of seats in the second adjustment vehicle is greater than the number of the assigned first acceptance accounts; The first paths respectively corresponding to the first adjustment vehicle and the second adjustment vehicle are replanned.

5. The vehicle allocation method of the integrated management platform according to claim 3 or 4, characterized in that: Before rolling back to the last vehicle allocation operation, the method further includes: Continue to re-determine the first path of the corresponding target vehicle based on the second abnormal account; When the number of times the first path is re-determined in this vehicle allocation operation reaches a preset number, or when a new first path cannot be determined based on the second abnormal account, a rollback trigger signal is generated.

6. The vehicle allocation method of the integrated management platform according to claim 3 is characterized in that: When the vehicle allocation operation is not performed for the first time, after marking the station room position corresponding to the first destination determined this time, the method further includes: Based on any of the first acceptance accounts, the acceptance item associated with the marked station room position is determined as the first item, and the sum of the determined first commuting time and the preset acceptance time of the first item is determined as the path cumulative time; Based on any of the target vehicles, the first acceptance account assigned to other target vehicles is determined as the second acceptance account, and the second starting point and the second end point of the second acceptance account for executing the next vehicle allocation operation are determined; when the second starting point and the second end point are both located on the first path of the target vehicle, and the accumulated path time of the first acceptance account before the first end point in the first path is greater than the accumulated path time of the second acceptance account, the second acceptance account is assigned to the target vehicle.

7. The vehicle allocation method of the integrated management platform according to claim 1, characterized in that: Before allocating at least one first acceptance account number to each target vehicle based on the corresponding number of seats, the method further includes: Determine the sum of the number of seats as the number of allocatable seats, determine the number of the first acceptance accounts including at least one unmarked station room position as the number of allocatable accounts, and determine the difference between the number of allocatable seats and the number of allocatable accounts as the number of redundant seats; Selecting a redundant vehicle from the target vehicles whose number of seats is less than the redundant number of seats, updating the redundant number of seats based on the number of seats of the redundant vehicle, and removing the redundant vehicle.

8. A vehicle allocation device for an integrated management platform, characterized in that: It includes at least one control processor and a memory for communicating with the at least one control processor; the memory stores instructions that can be executed by the at least one control processor, and the instructions are executed by the at least one control processor so that the at least one control processor can execute the vehicle allocation method of the integrated management platform as described in any one of claims 1 to 7.

9. An electronic device, characterized in that: A vehicle allocation device comprising the integrated management platform as described in claim 8.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the vehicle allocation method of the integrated management platform as described in any one of claims 1 to 7.

Images