Trailer dispatching method and system for centralized vehicle maintenance and transportation

Abstract

A method and system for trailer dispatching in centralized vehicle repair and transportation are disclosed. This method enables bidirectional transportation from repair centers to 4S stores and includes: pre-dispatching currently available trailers; upon receiving a pre-dispatching instruction, a task receiving terminal directs the trailer to a designated location or stops at a designated location; receiving task requests from a task request terminal, the task request including task details; retrieving available trailers based on the task details of the task request, sorting the available trailers, and sending task requests according to the sorting results; available trailers include: trailers that have not yet started transportation from the same origin, trailers whose transportation destination is the origin of the task request, trailers near the task origin, and trailers with available space and the same destination. Compared to existing trailer calling algorithms, this method better meets the needs of centralized vehicle repair and transportation.

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and in particular to a trailer dispatching method and system for centralized vehicle maintenance and transportation. Background Technology

[0002] Centralized car repair requires the transportation of faulty vehicles between 4S stores and repair centers. This type of transportation service has several characteristics, including fixed origin and destination, two-way vehicle transportation between 4S stores and repair centers, a certain tolerance for transportation timeliness, and a focus on the transportation cost and utilization efficiency of towing services.

[0003] However, existing towing services only provide one-way transportation services for broken-down vehicles or new cars, which does not well match the aforementioned characteristics of centralized vehicle repair. Summary of the Invention

[0004] In view of this, the purpose of this disclosure is to provide a trailer dispatching method and system to solve the pain point problem of centralized vehicle maintenance.

[0005] According to a first aspect of the present disclosure, a trailer dispatching method for centralized vehicle repair and transportation is provided, wherein the centralized vehicle repair and transportation is bidirectional transportation from a repair center to a 4S store, comprising:

[0006] The currently available trailers are pre-scheduled. After receiving the pre-scheduling instruction, the task receiving terminal will move the trailer to the designated location or stop at the designated location.

[0007] Receive a task request from the task request terminal, the task request including task details;

[0008] Available trailers are retrieved based on the task details, sorted, and task requests are sent based on the sorting results. The available trailers include: trailers that have not started transport from the same starting point, trailers whose transport destination is the starting point of the task request, trailers near the starting point of the task request, and trailers with available space that are consistent with the destination of the task request.

[0009] In some embodiments, sorting the available trailers includes:

[0010] The trailers are classified and sorted according to the following criteria: trailers with available space and the destination of the task request; trailers with the same origin but not yet started transport; trailers whose transport destination is the origin of the task request; and trailers near the origin of the task request.

[0011] The trailers with available spaces and the same destination are sorted according to the difficulty of loading.

[0012] For trailers that have not yet started transport from the same origin, they are sorted according to the time of the first order acceptance;

[0013] Trailers whose destination is the origin of the task request are sorted according to their estimated arrival time;

[0014] The trailers near the starting point of the task request are sorted according to their distance from the starting point.

[0015] In some embodiments, sorting the available trailers includes:

[0016] The transportation timeliness, transportation cost, and transportation efficiency of the available trailers are quantified to obtain three indicator values; and

[0017] The three indicator values ​​are weighted and summed with pre-set weights, and the available trailers are sorted according to the weighted summation result.

[0018] In some embodiments, transportation cost and transportation efficiency are given a higher weight than transportation timeliness.

[0019] In some embodiments, the pre-scheduling of currently available trailers includes: initial pre-scheduling outside of transport periods and real-time pre-scheduling during transport periods.

[0020] In some embodiments, the initial pre-scheduling includes:

[0021] Centered on the repair center, multiple adjacent 4S stores are merged to obtain multiple groups of 4S stores, where the distance between 4S stores in the same group does not exceed a set threshold.

[0022] The number of task requests from each of the multiple groups of 4S stores is counted, and the multiple groups of 4S stores are prioritized accordingly.

[0023] Check if the repair center has vehicles that need to be transported to the multiple 4S stores. If the repair center has vehicles that need to be transported to the first 4S store, then set the group to which the first 4S store belongs to have available tow trucks.

[0024] Check the number of tow trucks available for the day, and determine, based on the allocation ratio, the number of tow trucks to be allocated to 4S stores and the number to be allocated to repair centers; and

[0025] The actual number of tow trucks allocated to 4S stores and to the repair center is determined based on the priority ranking of multiple groups of 4S stores, the number of tow trucks to be allocated to the repair center and the number of tow trucks to be allocated to the 4S stores, and whether there are any idle tow trucks in the 4S store group, and pre-dispatch instructions are issued accordingly.

[0026] In some embodiments, for a 4S store, real-time pre-scheduling is performed when the following conditions are met:

[0027] The total number of tasks assigned to the 4S store on that day exceeded the average number of tasks assigned to the 4S store on the corresponding weekday or weekend in history; and there were no idle tow trucks or tow trucks heading to the 4S store at the adjacent 4S stores.

[0028] In some embodiments, the task details include transportation time, origin and destination, vehicle model to be transported, key attributes of the vehicle to be transported, contact person, and contact information.

[0029] According to a second aspect of the present disclosure, a trailer dispatching system for centralized vehicle maintenance and transportation is provided, comprising:

[0030] The task request terminal is used to send task requests and receive task feedback.

[0031] A server for any of the trailer dispatching methods described above;

[0032] The task receiving terminal is used to accept or reject received task requests.

[0033] According to a third aspect of the present disclosure, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the trailer scheduling method described above.

[0034] Compared with existing trailer calling algorithms, this disclosed embodiment includes various types of trailers, such as trailers that have not started transportation from the same starting point, trailers whose transportation destination is the starting point of the task request, trailers near the task starting point, and trailers with available locations and the same destination, into the available trailers for the current task. By sorting, trailers that are more suitable for the characteristics of centralized vehicle maintenance and transportation are selected from the available trailers, thereby better meeting the needs of centralized vehicle maintenance and transportation. Attached Figure Description

[0035] The above and other objects, features and advantages of the present disclosure will become clearer from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0036] Figure 1 This is a schematic block diagram of a trailer dispatching system provided in an embodiment of this disclosure;

[0037] Figure 2 This is a flowchart of a trailer dispatching method executed by a server, provided in an embodiment of this disclosure;

[0038] Figure 3 This is a schematic diagram of a trailer that uses a lifting mode;

[0039] Figure 4 This is a location map showing the locations of repair centers and 4S stores. Detailed Implementation

[0040] Embodiments of the present disclosure will now be described in more detail with reference to the accompanying drawings. In the various drawings, the same elements are indicated by similar reference numerals. For clarity, the various parts in the drawings are not drawn to scale. Furthermore, certain well-known parts may not be shown.

[0041] The following description of embodiments of the present disclosure is based on examples, but the embodiments of the present disclosure are not limited to these embodiments. In the detailed description of the embodiments of the present disclosure below, certain specific details are described in detail. Those skilled in the art can fully understand the embodiments of the present disclosure without these details. To avoid obscuring the essence of the embodiments of the present disclosure, well-known methods, processes, flows, elements, and circuits are not described in detail.

[0042] Unless the context explicitly requires it, the terms "comprising," "including," and similar terms throughout the specification and claims should be interpreted as encompassing rather than exclusive or exhaustive; that is, meaning "including but not limited to." In the description of embodiments of this disclosure, it should be understood that terms such as "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance. Furthermore, in the description of embodiments of this disclosure, unless otherwise stated, "a plurality of" means two or more.

[0043] Figure 1 This is a schematic block diagram of a trailer dispatching system provided in this embodiment. As shown in the figure, the trailer dispatching system provided in this embodiment involves a task request terminal 110, a task receiving terminal 120, and a server 140. The server 140 is, for example, a computer cluster or a single server; the task receiving terminal 120 and the task request terminal 110 are terminal types such as mobile phones, desktop computers, or tablets; and the network 130 is the Internet, a wide area network, a local area network, or a wired network or a wireless network.

[0044] In order to achieve centralized vehicle maintenance and transportation, corresponding software programs need to be deployed on the task request terminal 110, the task receiving terminal 120 and the server 140 to achieve the following functions.

[0045] Server 140 performs basic data maintenance and management, including but not limited to: trailer transport time period maintenance, trailer information management, consignment location management, and trailer location management. Trailer transport time periods refer to the start and end times of transport tasks. Different start and end times can be maintained for different regions. When no start and end times are set for a certain region, it is considered that 24 hours are transport time. Task receiving terminal 120 can receive transport tasks during the transport time. At other times, it can only complete tasks that have already been received. For example, assuming the transport time for the North China region is set to 7:00-19:00 daily, and for the South China region it is 8:30-17:30, within the specified time period, task receiving terminal 120 can receive new transport tasks; at other times, it can only complete tasks that have already been received. Trailer management refers to task requesting terminal 110 registering trailer information with server 140 and modifying the trailer information as needed. Server 140 stores the trailer information, including license plate number, trailer type (one trailer per vehicle, one trailer per two vehicles, one trailer per five vehicles, one trailer per eight vehicles), trailer company, trailer driver, contact number, etc. Shipping location management refers to the server 140 maintaining information on all dealerships and service centers in different regions, including their names, coordinates, photos, distances from each dealership to each service center, and the cost per shipment. Trailer location management refers to the server 140's ability to obtain real-time location information for each trailer, especially the real-time location information of trailers currently performing tasks, for example, by having trailers automatically report their location information every 10 seconds.

[0046] Based on the aforementioned basic data, the task requesting terminal 110 can send a task request regarding centralized vehicle maintenance and transportation to the server 140 via the network 130. After receiving a task request, the server 140 matches one or more trailers according to the request, sorts the trailers, and sequentially sends the task request to the task receiving terminal 120 to which each trailer belongs. Upon receiving the task request, the task receiving terminal 120 can accept or reject the task and feeds back its decision to the server 140. The server 140 can set a waiting time; if the waiting time is exceeded, the task request is forwarded to the next task receiving terminal 120 to which the trailer belongs. More specifically... Figure 2 This is a flowchart of a trailer dispatching method executed by server 140 according to an embodiment of this disclosure, which specifically includes the following steps.

[0047] In step S201, a task request is received.

[0048] Step S201 means, for example, Figure 1 Server 140 from Figure 1The task request terminal 110 receives the task request, which includes task details, including but not limited to: transportation time, origin and destination of transportation, vehicle model to be transported, some key attributes of the vehicle to be transported (such as vehicle photos), contact person, and contact information.

[0049] In step S202, it is determined whether the current time is a transportation period. If it is, step S203 is executed; otherwise, step S204 is executed.

[0050] In step S203, the asynchronous queue is used to trigger the event again during the transportation period.

[0051] Steps S202 and S203 refer to the server receiving task requests 24 / 7. Upon receiving a task request, it queries the vehicle transportation time configured for the task's region. If the current time is within the transportation time range, it proceeds to the next step; otherwise, the task request's status is changed to "pending trigger," and it is stored in an asynchronous queue. A timer then passes the task to the next step when the task's region re-enters the transportation time range. This step can also use other storage methods besides asynchronous queues (e.g., a cache database) to store pending task requests, and use other triggering methods besides timers (e.g., database triggers) to trigger the task's passage to the next step when the task's region re-enters the transportation time range.

[0052] In step S204, the vehicle drive mode is queried based on the vehicle identification number (VIN).

[0053] In step S205, is it four-wheel drive or rear-wheel drive?

[0054] In step S206, the trailer is marked as prohibited from being lifted.

[0055] Steps S204 to S206 determine some special requirements of the vehicle to be transported based on the task request. For example, the task request indicates the damage classification of the vehicle to be transported. If the damage classification is major damage or extremely major damage, the vehicle to be transported will be marked as prohibited from being towed. For another example, if the remarks field in the task request marks the vehicle to be transported as a high-value vehicle, the vehicle to be transported will be marked as prohibited from being towed.

[0056] In step S207, available trailers are retrieved.

[0057] Step S207 includes retrieving trailers that have not yet started transport from the same origin. Specifically, it involves querying task requests whose origin is the starting point of this task and whose task status is either "processed" or "trailer has arrived at the store." A "processed" task status indicates that the current task has been accepted by the trailer, but the trailer has not yet arrived at the store for loading. A "trailer has arrived at the store" task status indicates that the current trailer has arrived at the store but has not yet departed.

[0058] Step S207 also includes retrieving trailers whose destination is the current origin, specifically: querying tasks whose task status is in transit and whose destination is the current origin. This mainly handles situations where, for example, a repair center has vehicles that have completed repairs and are being transported to dealership A, while dealership A happens to have vehicles that need to be transported to the repair center. In this case, the trailer can meet the requirement of bidirectional transport without being empty.

[0059] Step S207 also includes retrieving trailers near the task starting point, specifically: using the location coordinates set by the starting point 4S store and the location coordinates uploaded by the trailer in real time to calculate and obtain all trailers that meet the conditions within the set range.

[0060] In some embodiments, the available trailers retrieved in step S207 are deduplicated. For example, a trailer near the starting point of the task and a trailer whose destination is the starting point of the current task are the same trailer, so only one trailer data needs to be retained.

[0061] In step S208, trailers with available locations and the same destination are selected.

[0062] Trailer types include 1-to-1, 1-to-2, 1-to-5, and 1-to-8 trailers. Some 1-to-2 models will use a lifting mode for the second vehicle, such as... Figure 3 As shown. When a vehicle to be transported is marked as prohibited from being towed, the maximum load capacity of some 1-to-2 vehicle models will be considered as one vehicle. Therefore, this step can use the trailer information retrieved in the previous step to associate with the previously processed task information to obtain the loading capacity of the corresponding trailer. Fully loaded trailers are then removed. For the remaining trailers, if the corresponding trailer already has other transport tasks, it is checked whether the destination of the transport task is consistent with the destination of the current task. If they are inconsistent, they are removed again, and finally, trailers with available space and the same destination are obtained.

[0063] In step S209, the trailers that meet the conditions are sorted.

[0064] This step sorts the trailers retrieved in steps S207 and S208. The sorting logic can be varied. For example, first, trailers with available locations and the same destination, trailers from the same origin that haven't started transport, trailers whose transport destination is the current origin, and trailers near the origin can be categorized and sorted. Then, trailers with available locations and the same destination can be sorted by loading difficulty; trailers from the same origin that haven't started transport can be sorted by the first order acceptance time; trailers whose transport destination is the current origin can be sorted by estimated arrival time; and trailers near the origin can be sorted by distance from the origin. Another example is quantifying the transport timeliness, transport cost, and transport efficiency of eligible trailers to obtain three numerical indicators. These three indicators are then weighted and summed with pre-set weights. Based on the weighted sum, the eligible trailers are sorted. Since trailer transport has a higher tolerance for transport timeliness than for transport cost and efficiency, transport cost and efficiency can be given higher weights than transport timeliness. In one embodiment, the following settings are made: transportation cost is the number of loaded vehicles divided by the number of vehicles that can be loaded when fully loaded, multiplied by 100; transportation efficiency is the distance in kilometers between the trailer and the target loading location, and when the distance in kilometers exceeds 100, it is recorded as 100; the value of transportation timeliness is 0-60, which is the number of minutes between the current time and the task allocation time, and when the number of minutes exceeds 60, it is recorded as 60. As for the weights, the weight of transportation cost is 0.4, the weight of transportation efficiency is 0.3, and the weight of transportation timeliness is 0.3.

[0065] In step S210, a task request is sent to the trailer.

[0066] This step involves sending task requests to the task receiving terminals of each eligible trailer. Requests are sent in the order they are assigned, and then sent to the next task receiving terminal every set time interval (e.g., 30 seconds). Drivers who receive a task push can accept the order at any time if no other driver has accepted it. Once a driver accepts the order, the task information on other drivers' task receiving terminals is automatically hidden, and further calls cease.

[0067] The task initiator can cancel the call at any time before the tow truck driver accepts it. After the driver accepts, the task initiator needs to contact the tow truck driver by phone, and the tow truck driver will cancel the call after reporting the anomaly. After receiving feedback from the driver that the task has been accepted, the system will re-verify the tow truck's load status. If the tow truck is fully loaded, the system will notify the driver that the tow truck is full and cannot accept any more tasks, in order to prevent the tow truck's status from changing while waiting.

[0068] In practical implementation, the timeliness requirements for each region can be configured within the system. If no driver accepts the task within the specified time, the system will force assignment. If a suitable tow truck cannot be found, a notification will be sent to the central dispatcher for manual assignment. The system-assigned tow truck must be within the range of available tow trucks mentioned above. Manual assignment can select all tow trucks in the region. If the available tow trucks retrieved through steps S207 and S208 are zero, the system can perform a search for available tow trucks every set time (e.g., 2 minutes). If no available tow truck is found after the set time (e.g., 10 minutes), a manual assignment request will be sent to the dispatcher for manual assignment.

[0069] Continue to refer to Figure 1 As shown, based on the basic data maintained by server 140 and the task data generated during trailer scheduling, server 140 can also proactively pre-schedule idle trailers. After receiving the pre-schedule instruction, task request terminal 110 will move the trailer to the designated location or stop at the designated location. Pre-schedule of currently idle trailers mainly includes: pre-schedule performed outside of the transportation period (hereinafter collectively referred to as initial scheduling) and pre-schedule performed during the transportation period (hereinafter collectively referred to as real-time pre-schedule).

[0070] Initialize pre-schedule to Figure 4 Let's take an example. The system can be configured with adjacent store distances to allocate available tow trucks. When the adjacent distance is set to 3 kilometers, if stores A and B are within 3 kilometers of each other, it's assumed that both stores have available tow trucks if either store has one. The system performs initial pre-scheduling of tow trucks before the start of each transport period. Tow trucks are then distributed between 4S stores and repair centers. Repair centers typically operate 24 hours a day, and every morning vehicles that have completed repairs need to be transported back to the 4S stores. The system will arrange for tow trucks to go to the 4S stores or repair centers in the morning to wait based on these tasks.

[0071] As shown in the diagram, there are 4S stores A through F.

[0072] The first step is for the system to merge adjacent 4S stores into the same group. To improve delivery timeliness, the initial maximum number of adjacent stores is two; the system will select the two closest stores to merge. The allocation results are as follows:

[0073] (AB), (C), (DE) and (F), where the distance between DE is shorter than that between DF and EF.

[0074] The second step is to prioritize each group. The system counts the number of task requests from each 4S store and sorts them according to the number of task requests. Assume the number of task requests is as follows:

[0075] Table 1

[0076]

[0077] Sort the 4S stores in each group according to the number of tasks (the order in parentheses indicates the priority of merged 4S stores). First sort by the whole group, then sort the 4S stores within each group. The more task requests a store has, the higher it ranks. The final result is:

[0078] (AB), (C), (DE) and (F).

[0079] The third step is to check if the repair center has any vehicles that need to be transported to the 4S store. For example, if it is found that the repair center has vehicles that need to be transported to store B, then set (AB) to have available tow trucks.

[0080] The fourth step is to check the number of tow trucks available that day and calculate the allocation ratio, setting it to 1:2 between tow trucks at the repair center and those at the 4S dealership. If there are currently 5 tow trucks available, the system will allocate 2 to the repair center and 3 to the 4S dealership.

[0081] The fifth step involves tow truck allocation. Based on the findings of step four, three tow trucks need to be allocated to the 4S dealerships, specifically to (AB), (C), and (DE). Step three indicates that dealerships (C) and (DE) do not have any vehicles. Therefore, tow trucks are dispatched to dealerships C and E according to priority. In practice, tow trucks closer to dealerships C and E are dispatched to those dealerships, while the remaining tow trucks are dispatched to the repair center. A tow truck from the repair center is then used to transport the repaired vehicle to dealership B.

[0082] Real-time pre-scheduling can only be executed when certain conditions are met to avoid interfering with towing operations and wasting time and resources. For example, for each 4S store, the system calculates the average number of tasks per day on corresponding weekdays and weekends based on historical task data. Then, at fixed intervals (e.g., every hour), the system calculates the total number of tasks for each 4S store in real time. If the total number of tasks for a certain 4S store in real time exceeds the average number of tasks per day on the corresponding weekday or weekend, the system checks whether there are any idle towing trucks or towing trucks heading to that 4S store in neighboring 4S stores. If there are no towing trucks, the 4S store is marked as needing towing. Pre-scheduling can be performed immediately, but a period of time can be waited for another calculation. If the result still meets the condition that there are no towing trucks or towing trucks heading to the 4S store in neighboring 4S stores, then the pre-scheduling task begins, and the selection range of the map is gradually expanded from the 4S store that needs towing to find available towing trucks. Available towing trucks must meet the following conditions: 1. The towing truck is idle and has no tasks. 2. There are other available tow trucks nearby (within 2 kilometers). Once a tow truck is found, it will be dispatched to the shop to wait. Service centers, due to their generally large size, do not need to participate in real-time pre-dispatch.

[0083] In addition, some parts for vehicle repairs need to be ordered by the 4S dealership and transported to the repair center during the repair process. Since the arrival time of the parts differs from the vehicle's transport time, these parts need to be transported to the repair center separately. The system can receive parts transport task requests initiated by the parts system and add these requests to a queue. When the system detects a vehicle requiring repair that needs to be transported from the 4S dealership that initiated the parts transport task request, it will simultaneously send the task to the parts system, notifying the relevant personnel to transport the parts concurrently with the vehicle's transport.

[0084] In a specific implementation, the trailer dispatching method and system mentioned above can be formed as a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the various operations in the above embodiments.

[0085] In summary, compared with existing trailer calling algorithms, the embodiments of this disclosure include various types of trailers, such as trailers that have not started transportation from the same starting point, trailers whose transportation destination is the starting point of the task request, trailers near the task starting point, and trailers with available locations and the same destination, into the available trailers for the current task. By sorting, trailers that are more suitable for the characteristics of centralized vehicle maintenance and transportation are selected from the available trailers, thereby better meeting the needs of centralized vehicle maintenance and transportation.

[0086] The embodiments of this disclosure are as described above. These embodiments do not exhaustively describe all details, nor do they limit the invention to the specific embodiments described. Obviously, many modifications and variations can be made based on the above description. This specification selects and specifically describes these embodiments to better explain the principles and practical applications of the embodiments of this disclosure, thereby enabling those skilled in the art to make good use of the embodiments of this disclosure and modifications based on them. The embodiments of this disclosure are limited only by the claims and their full scope and equivalents.

Claims

1. A trailer dispatching method for centralized vehicle repair and transportation, wherein the centralized vehicle repair and transportation is bidirectional transportation from a repair center to a 4S shop, comprising: The currently available trailers are pre-scheduled. After receiving the pre-scheduling instruction, the task receiving terminal will move the trailer to a designated location or stop at a designated location. The pre-scheduling allocates the distribution of trailers in 4S stores and repair centers. Receive a task request from the task request terminal, the task request including task details; Available trailers are retrieved based on the task details, sorted, and task requests are sent based on the sorting results. The available trailers include: trailers that have not started transport from the same starting point, trailers whose transport destination is the starting point of the task request, trailers near the starting point of the task request, and trailers with available space that are consistent with the destination of the task request. The pre-scheduling of currently available trailers includes: initial pre-scheduling performed outside of transport periods, wherein the initial pre-scheduling includes: Centered on the repair center, multiple adjacent 4S stores are merged to obtain multiple groups of 4S stores, where the distance between 4S stores in the same group does not exceed a set threshold. The number of task requests from each of the multiple groups of 4S stores is counted, and the multiple groups of 4S stores are prioritized accordingly. Check if the repair center has vehicles that need to be transported to the multiple 4S stores. If the repair center has vehicles that need to be transported to the first 4S store, then set the group to which the first 4S store belongs to have available tow trucks. Check the number of tow trucks available for the day, and determine the total number of tow trucks to be allocated to 4S stores and the total number of tow trucks to be allocated to repair centers based on the allocation ratio; and The actual number of tow trucks allocated to each 4S store and the number of tow trucks allocated to the repair center are determined based on the priority ranking of multiple groups of 4S stores, the total number of tow trucks to be allocated to the repair center and the total number of tow trucks to be allocated to the 4S stores, whether there are any idle tow trucks in each group of 4S stores, and the priority ranking of each 4S store in each group of 4S stores, and pre-dispatch instructions are issued accordingly.

2. The trailer dispatching method according to claim 1, wherein, The sorting of available trailers includes: The trailers are classified and sorted according to the following criteria: trailers with available space and the destination of the task request; trailers with the same origin but not yet started transport; trailers whose transport destination is the origin of the task request; and trailers near the origin of the task request. The trailers with available spaces and the same destination are sorted according to the difficulty of loading. For trailers that have not yet started transport from the same origin, they are sorted according to the time of the first order acceptance; Trailers whose destination is the origin of the task request are sorted according to their estimated arrival time; The trailers near the starting point of the task request are sorted according to their distance from the starting point.

3. The trailer dispatching method according to claim 1, wherein, The sorting of available trailers includes: The transportation timeliness, transportation cost, and transportation efficiency of the available trailers are quantified to obtain three indicator values; and The three indicator values ​​are weighted and summed with pre-set weights, and the available trailers are sorted according to the weighted summation result.

4. The trailer dispatching method according to claim 3, wherein, The transportation cost and transportation efficiency are given a higher weight than the transportation timeliness.

5. The trailer dispatching method according to claim 1, wherein, The pre-scheduling of currently available trailers also includes real-time pre-scheduling during the transport period.

6. The trailer dispatching method according to claim 1, wherein, For a 4S store, real-time pre-scheduling is performed when the following conditions are met: The 4S store's real-time tasks for the day exceeded the store's historical average task volume for the corresponding weekday or weekend; and there were no available tow trucks or tow trucks heading to the 4S store at the adjacent 4S stores.

7. The trailer dispatching method according to claim 1, wherein, The task details include transportation time, origin and destination, vehicle model to be transported, key attributes of the vehicle to be transported, contact person, and contact information.

8. A trailer dispatching system for centralized vehicle maintenance and transportation, comprising: The task request terminal is used to send task requests and receive task feedback. A server is configured to execute the trailer dispatching method according to any one of claims 1 to 7; The task receiving terminal is used to accept or reject received task requests.

9. A computer-readable storage medium having a computer program stored thereon, the computer program, when executed by a processor, implementing the trailer dispatching method as described in any one of claims 1 to 7.

Images