Trailer scheduling method and system for centralized maintenance and transportation of vehicles

Abstract

The invention discloses a trailer scheduling method and system for centralized maintenance and transportation of vehicles. The method realizes two-way transportation from a maintenance center to a 4S store, and comprises the following steps: pre-scheduling a current idle trailer, and enabling the trailer to advance to a designated place or stay at the designated place after a task receiving terminal receives a pre-scheduling instruction; receiving a task request from a task request terminal, wherein the task request comprises task details; available trailers are obtained through retrieval according to task details of the task request, the available trailers are ranked, the task request is sent according to the ranking result, and the available trailers comprise the trailers which do not start transportation at the same starting point, the trailers with the transportation end point as the starting point of the task request, the trailers near the task starting point and the trailers with the unoccupied positions and the end points consistent. Compared with an existing trailer calling algorithm, the method can better meet the requirement for centralized maintenance and transportation of vehicles.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the field of computer technology, and in particular to a trailer dispatching method and system for centralized vehicle maintenance and transportation. Background Art

[0002] Centralized automobile repairs require the transportation of faulty vehicles between 4S stores and repair centers. This type of transportation service has many characteristics, such as fixed starting and ending points, 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 trailers.

[0003] However, the existing tow truck call service only provides one-way transportation service for broken-down vehicles or new cars, which does not fit well with the above-mentioned characteristics of centralized automobile maintenance. Summary of the invention

[0004] In view of this, an object of the embodiments of the present disclosure is to provide a trailer dispatching method and system for solving the pain points of centralized automobile maintenance.

[0005] According to a first aspect of an embodiment of the present disclosure, a method for dispatching a trailer for centralized vehicle maintenance transportation is provided, wherein the centralized vehicle maintenance transportation is a two-way transportation from a maintenance center to a 4S store, comprising:

[0006] Pre-dispatching the currently idle trailers, wherein after receiving the pre-dispatching instruction, the task receiving terminal moves the trailers to the designated location or stops at the designated location;

[0007] receiving a task request from a task request terminal, wherein the task request includes task details;

[0008] Available trailers are retrieved according to the task details, sorted, and a task request is sent according to the sorting result. The available trailers include: trailers that have not started transportation at the same starting point, trailers whose transportation destination is the starting point of the task request, trailers near the starting point of the task request, and trailers with free space that coincides with the destination of the task request.

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

[0010] Classify and sort the trailers according to the trailers with available positions and the same destination as the task request, the trailers that have not started transportation at the same starting point, the trailers whose transportation destination is the starting point of the task request, and the trailers near the starting point of the task request;

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

[0012] The trailers that have not started transportation from the same starting point are sorted according to the time when the first order was received;

[0013] The trailers whose transport destination is the starting point of the task request are sorted according to the estimated arrival time;

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

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

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

[0017] The three index values ​​are weighted and summed with preset weights, and the available trailers are sorted according to the weighted summation result.

[0018] In some embodiments, a higher weight is set for the transportation cost and transportation efficiency than for transportation timeliness.

[0019] In some embodiments, the pre-scheduling of currently idle trailers includes: initialization pre-scheduling performed outside a transportation period and real-time pre-scheduling performed during the transportation period.

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

[0021] Taking the maintenance center as the center, multiple 4S stores around it are merged to form multiple groups of 4S stores, where the distance between 4S stores in the same group does not exceed the set threshold;

[0022] Counting the number of task requests of the multiple groups of 4S stores respectively, and prioritizing the multiple groups of 4S stores accordingly;

[0023] Check whether the maintenance center has vehicles that need to be transported to the multiple 4S stores, and if the maintenance center has vehicles that need to be transported to the first 4S store, set the group where the first 4S store belongs to as having an idle trailer;

[0024] Query the number of trailers available on the day, and determine the number of trailers that should be allocated to the 4S store and the number of trailers that should be allocated to the maintenance center based on the allocation ratio; and

[0025] The number of trailers actually allocated to the 4S stores and the number of trailers allocated to the maintenance center are determined based on the priority ranking of multiple groups of 4S stores, the number of trailers that should be allocated to the maintenance center and the number of trailers that should be allocated to the 4S stores, and whether there are idle trailers 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 real-time tasks of the 4S store on that day exceeds the historical average number of daily tasks of the 4S store on corresponding weekdays or weekends; and there are no idle trailers or trailers heading towards the 4S store in the adjacent 4S stores of the 4S store.

[0028] In some embodiments, the task details include transportation time, starting point and end point, 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 an embodiment of the present disclosure, there is provided a trailer dispatching system for centralized vehicle maintenance transportation, comprising:

[0030] Task request terminal, used to send task requests and receive task feedback;

[0031] A server, used in any one of the above trailer dispatching methods;

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

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

[0034] Compared with the existing trailer calling algorithm, the disclosed embodiment incorporates multiple trailers into the available trailers for the current task, such as trailers that have not started transportation at the same starting point, trailers whose transportation destination is the starting point of the task request, trailers near the starting point of the task, and trailers with free space and the same destination, and selects trailers that are more suitable for the characteristics of centralized vehicle maintenance transportation from the available trailers through sorting, thereby better meeting the needs of centralized vehicle maintenance transportation. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0036] Figure 1 is a schematic block diagram of a trailer dispatching system provided by an embodiment of the present disclosure;

[0037] Figure 2 is a flow chart of a trailer dispatching method executed by a server provided by an embodiment of the present disclosure;

[0038] Figure 3 It is a schematic diagram of a trailer in a lifting mode;

[0039] Figure 4 This is a schematic diagram of the locations of maintenance centers and 4S stores. DETAILED DESCRIPTION

[0040] The embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. In each of the accompanying drawings, the same elements are represented by similar reference numerals. For the sake of clarity, the various parts in the accompanying drawings are not drawn to scale. In addition, some well-known parts may not be shown.

[0041] The following describes the embodiments of the present disclosure based on the embodiments, 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, some specific details are described in detail. For those skilled in the art, the embodiments of the present disclosure can be fully understood without the description of these details. In order to avoid confusing the essence of the embodiments of the present disclosure, well-known methods, processes, processes, components and circuits are not described in detail.

[0042] Unless the context clearly requires otherwise, the words "include", "comprising", and the like throughout the specification and claims should be interpreted as inclusive rather than exclusive or exhaustive; that is, as "including but not limited to". In the description of the embodiments of the present disclosure, it should be understood that the terms "first", "second", etc. are used for descriptive purposes only and are not to be understood as indicating or implying relative importance. In addition, in the description of the embodiments of the present disclosure, unless otherwise specified, "plurality" means two or more.

[0043] Figure 1 1 is a schematic block diagram of a trailer dispatching system provided by an embodiment of the present disclosure. As shown in the figure, the trailer dispatching system provided by the present embodiment involves a task requesting 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 requesting terminal 110 are terminal types such as mobile phones, desktops or tablets, and the network 130 is the Internet, a wide area network, or a local area network. The network 130 can also be a wired network or a wireless network.

[0044] In order to realize 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 realize the following functions.

[0045] The server 140 performs basic data maintenance and management, including but not limited to: trailer transportation period maintenance, trailer information management, consignment location management, and trailer location management. The trailer transportation period refers to the start and end time of the maintenance transportation task. Different start and end times can be maintained according to different regions. When a certain region does not set the start and end time, it is considered that 24 hours is the transportation time. The task receiving terminal 120 can receive transportation tasks during the transportation time. At other times, only the received tasks can be completed. For example, assuming that the transportation time in the North China region is set to 7:00-19:00 every day, and the South China region is 8:30-17:30. Within the specified time period, the task receiving terminal 120 can receive new transportation tasks, and at other times, only the received tasks can be completed. Trailer management refers to the task request terminal 110 registering trailer information with the server 140 and changing the trailer information when necessary. The server 140 stores the trailer information. The trailer information includes the license plate number, trailer type (one-to-one, one-to-two, one-to-five, one-to-eight), trailer company, trailer driver, contact number, etc. The consignment location management means that the server 140 maintains the information of all dealerships and maintenance centers in different areas, including the names, coordinates, photos of the dealerships and maintenance centers, as well as the distance between each dealership and each maintenance center, and the cost of a single consignment. The trailer location management means that the server 140 can obtain the real-time location information of each trailer, especially the real-time location information of the trailer that is performing a task, for example, the trailer automatically reports the positioning information every 10 seconds.

[0046] Based on the above basic data, the task request terminal 110 can send a task request about centralized vehicle maintenance and transportation to the server 140 through the network 130. After receiving a task request, the server 140 matches one or more trailers according to the task request, sorts the one or more trailers, and sends the task request to the task receiving terminal 120 to which the one or more trailers belong in sequence according to the sorting results. After receiving the task request, the task receiving terminal 120 can accept or reject the task and feed back the decision to the server 140. The server 140 can set a waiting time, and if the waiting time is exceeded, the task request will be sent to the task receiving terminal 120 where the next trailer is located. More specifically, Figure 2 It is a flowchart of a trailer dispatching method executed by the server 140 provided in an embodiment of the present 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 in Figure 1The task request terminal 110 receives the task request, which includes task details, including but not limited to: transportation time, starting point and end point of transportation, vehicle model to be transported, some key attributes of the vehicle to be transported (for example, it can also be displayed through vehicle photos), contact person, and contact information.

[0049] In step S202, it is determined whether the current time is a transportation period, if yes, step S203 is executed, if no, step S204 is executed.

[0050] In step S203, the asynchronous queue is retriggered within the transport period.

[0051] Steps S202 and S203 refer to the server 140 receiving task requests throughout the day. However, when receiving a task request, the server 140 queries the vehicle transportation time configured for the area to which the task belongs. If the current time is within the transportation time range, the server proceeds to the next step. Otherwise, the state of the task request is changed to pending triggering and stored in an asynchronous queue. The task is passed to the next step by the timer when the area to which the task belongs re-enters the transportation time range. This step can also use other storage methods other than asynchronous queues (such as cache databases) to store the task requests to be triggered, and use other triggering methods other than timers (such as database triggers) to trigger the task to be passed to the next step when the area to which the task belongs re-enters the transportation time range.

[0052] In step S204, the vehicle driving mode is queried according to the vehicle frame number.

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

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

[0055] Steps S204 to S206 are to 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 and super-major damage, the vehicle to be transported will be marked as prohibited from lifting the trailer. 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 lifting the trailer.

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

[0057] Step S207 includes searching for trailers with the same starting point that have not started transportation, specifically: querying for task requests whose starting point is the starting point of this task and whose task status is processed or the trailer has arrived at the store. The task status of processed means that the current task has been accepted by the trailer, but the trailer has not arrived at the store for loading. The task status of trailer arrived at the store means that the current trailer has arrived at the store but has not yet set off.

[0058] Step S207 also includes searching for a trailer whose transport destination is the starting point of this task, specifically: searching for tasks whose task status is in transport and whose destination is the starting point of this task. The main situation handled here is, for example, a vehicle that has been repaired at the maintenance center is being transported to dealership A, and dealership A just has a vehicle that needs to be transported to the maintenance center. At this time, the trailer can meet the two-way transportation without being empty.

[0059] Step S207 also includes searching for trailers near the starting point of the task, specifically: using the location coordinates set by the starting point 4S shop 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, the trailer near the starting point of the task and the trailer whose transport destination is the starting point are the same trailer, so only one piece of trailer data needs to be retained.

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

[0062] There are several types of trailers, including one-to-one, one-to-two, one-to-five, one-to-eight, etc. Some of the one-to-two models will use a lifting mode for the second vehicle, such as Figure 3 When the vehicle to be transported is marked as prohibited from lifting the trailer, the maximum full load quantity of some one-to-two models will be regarded as one. Therefore, this step can use the trailer information retrieved in the previous step to associate with the previously processed task information, obtain the loading quantity of the corresponding trailer, and eliminate the fully loaded trailers. For the remaining trailers, if the corresponding trailer has other transportation tasks, check whether the end point of the transportation task is consistent with the end point of the current task. If not, continue to eliminate them, and finally get the trailers with free space and consistent end points.

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

[0064] This step is to sort the trailers retrieved in steps S207 and S208, and there are multiple options for sorting logic. For example, first classify and sort the trailers with free positions and the same destination, the trailers that have not started transportation at the same starting point, the trailers whose transportation destination is the current starting point, and the trailers near the starting point, and then sort the trailers with free positions and the same destination according to the ease of loading, sort the trailers that have not started transportation at the same starting point according to the time of receiving the first order, sort the trailers whose transportation destination is the current starting point according to the estimated arrival time, and sort the trailers near the starting point according to the distance from the starting point. For another example, the transportation timeliness, transportation cost, and transportation efficiency of the trailers that meet the conditions are quantified to obtain three index values, and then the three index values ​​are weighted and summed with the pre-set weights, and the trailers that meet the conditions are sorted according to the weighted summation result, wherein, since trailer transportation has a higher tolerance for transportation timeliness than for the transportation cost and trailer efficiency of the trailer, the transportation cost and transportation efficiency of the trailer can be set with a higher weight than the transportation timeliness of the trailer. In one embodiment, the following settings are made respectively: the transportation cost is the number of loaded vehicles divided by the number of vehicles that can be loaded when fully loaded multiplied by 100; the transportation efficiency is the distance in kilometers between the trailer and the target loading location. 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 obtained by subtracting the task allocation time from the current time. 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 is to send task requests to the task receiving terminals where all qualified trailers are located. Task requests are sent in the order of sorting and sent to the next task receiving terminal every set time (e.g. 30s). Drivers who receive task push can accept the order at any time if the task is not accepted by other drivers. When a driver accepts the task, the task information of other drivers' task receiving terminals is automatically hidden and the call stops.

[0067] Before the task is accepted by the trailer driver, the task initiator can cancel the call at any time. After the driver accepts the task, the task initiator needs to contact the trailer driver by phone, and the trailer driver will cancel the task after reporting the abnormality. After the system receives feedback from the driver that the task has been accepted, it will check the full load of the trailer again. If it is fully loaded, it will prompt the driver that the trailer is full and can no longer accept tasks, which is used to prevent the trailer status from changing during the waiting process.

[0068] During specific implementation, the timeliness requirements of each major area can also be configured within the system. If no driver accepts the task within the time limit, the system will force the assignment. If a suitable trailer cannot be found, a notification will be sent to the central dispatcher, who will make a manual assignment. The system assignment requires that the trailer meet the range of available trailers above, and manual assignment can select all trailers in the area; if the available trailers retrieved through steps S207 and S208 are zero, the system can perform a search for available trailers once every set time (for example, 2 minutes). If there is still no available trailer after the set time (for example, 10 minutes), a manual allocation request will be sent to the dispatcher, who will make a manual assignment.

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

[0070] Initialize pre-scheduling to Figure 4 Take the example for explanation. The system can configure the distance between adjacent stores to schedule the location allocation of idle trailers. When the adjacent distance is set to 3 kilometers, when the distance between stores A and B is within 3 kilometers, as long as there is an idle trailer in store A or B, it is considered that both stores A and B have idle trailers. Every day before the start of the transportation period, the system initializes the pre-scheduling of trailers. Allocate trailers to distribute them in 4S stores and maintenance centers. Maintenance centers generally operate 24 hours a day, and every morning there will be vehicles that have been repaired and need to be transported back to 4S stores. The system will arrange trailers to go to 4S stores or maintenance centers in the morning to wait based on these tasks.

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

[0072] In the first step, the system merges adjacent 4S stores into the same group. To improve transportation timeliness, the maximum number of adjacent stores allowed during initial allocation is 2, and the system will select the two closest stores for merging. The allocation results are as follows:

[0073] (AB), (C), (DE) and (F), among which 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 that the number of task requests is as follows: Table 1

[0075] Sort the 4S stores in each group by the number of tasks (the priority of the merged 4S stores and stores is in brackets). Sort by overall order first, then sort the 4S stores in the group. The more task requests there are, the higher the ranking is. The final result is:

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

[0077] The third step is to check whether the maintenance center has vehicles that need to be transported to the 4S store. For example, if it is found that the maintenance center has vehicles that need to be transported to store B, it is set that (AB) has an idle trailer.

[0078] The fourth step is to query the number of trailers available on the day and calculate according to the allocation ratio, setting the ratio of trailers at the repair center and at the 4S store to 1:2. If there are currently 5 trailers available, the system will allocate 2 at the repair center and 3 at the 4S store.

[0079] Step 5: Tow truck allocation According to step 4, three tow trucks need to be allocated to 4S stores, namely (AB), (C) and (DE). According to step 3, the 4S stores without vehicles are (C) and (DE), so the tow trucks are dispatched to stores C and E according to the priority order. In actual implementation, the tow trucks that are closer to stores C and E are dispatched to stores C and E respectively, and the remaining tow trucks are dispatched to the maintenance center, and a tow truck from the maintenance center is arranged to transport the repaired vehicle to store B.

[0080] Real-time pre-scheduling can only be performed when conditions are met, so as to avoid pre-scheduling interfering with trailer work and causing waste of time and resources. For example, for each 4S store, the system calculates the average number of tasks per day on the corresponding working days and weekends based on historical task data, and then counts the total number of real-time tasks of each 4S store on the same day in real time every fixed period (for example, every 1 hour). If the total number of real-time tasks of a 4S store on the same day exceeds the average number of tasks per day on the corresponding working days or weekends of the 4S store, then check whether there are idle trailers or trailers heading to the 4S store in the adjacent 4S store. If there are no trailers, then mark the 4S store as needing to dispatch trailers. At this time, pre-scheduling can be performed immediately, but it can also wait for a while and count again. If the result still satisfies that there are no trailers in the adjacent 4S stores and trailers heading to the 4S store, then start pre-scheduling tasks, and gradually expand the selection range of the map with the 4S store that needs trailers as the center to find dispatchable trailers. Dispatched trailers need to meet 1. The trailer is idle and has no tasks. 2. There are other idle trailers near the idle trailer (configuration is possible within 2 kilometers). When a trailer is found, it will be arranged to go to the store and wait. Since the maintenance center is generally large, it does not need to participate in real-time pre-dispatch.

[0081] In addition, some parts of the repaired vehicle need to be ordered by the 4S store, and the parts need to be shipped to the repair center during the repair, because the arrival time of the parts is inconsistent with the transportation time of the vehicle. The parts need to be shipped to the repair center separately. The system can receive the task request for parts transportation initiated by the parts system, and the system will add the task request for parts transportation to the queue. When the system detects that a repaired vehicle needs to be shipped from the 4S store that initiated the task request for parts transportation, it will send the task to the parts system synchronously, notifying the corresponding person in charge to transport the parts while transporting the vehicle.

[0082] In a specific implementation, the above-mentioned trailer dispatching method and system may be formed into a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the operations in the above embodiments are implemented.

[0083] In summary, compared with the existing trailer calling algorithm, the embodiment of the present disclosure incorporates multiple trailers into the available trailers for the current task, such as trailers that have not started transportation with the same starting point, trailers whose transportation destination is the starting point of the task request, trailers near the starting point of the task, and trailers with free space and the same destination, and selects trailers that are more suitable for the characteristics of centralized vehicle maintenance transportation from the available trailers through sorting, thereby better meeting the needs of centralized vehicle maintenance transportation.

[0084] The embodiments according to the embodiments of the present disclosure are described above, and these embodiments do not describe all the details in detail, nor do they limit the invention to the specific embodiments described. Obviously, many modifications and changes can be made based on the above description. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the embodiments of the present disclosure, so that those skilled in the art can make good use of the embodiments of the present disclosure and the modified use based on the embodiments of the present disclosure. The embodiments of the present disclosure are limited only by the claims and their full scope and equivalents.

Claims

1. A method for dispatching trailers for centralized vehicle maintenance transportation, wherein the centralized vehicle maintenance transportation is a two-way transportation from a maintenance center to a 4S store, comprising: Pre-dispatching the currently idle trailers, wherein after receiving the pre-dispatching instruction, the task receiving terminal moves the trailers to the designated location or stops at the designated location; receiving a task request from a task request terminal, wherein the task request includes task details; Available trailers are retrieved according to the task details, sorted, and a task request is sent according to the sorting result. The available trailers include: trailers that have not started transportation at the same starting point, trailers whose transportation destination is the starting point of the task request, trailers near the starting point of the task request, and trailers with free space that coincides with the destination of the task request.

2. The trailer dispatching method according to claim 1, wherein: The sorting of available trailers includes: Classify and sort the trailers according to the trailers with available positions and the same destination as the task request, the trailers that have not started transportation at the same starting point, the trailers whose transportation destination is the starting point of the task request, and the trailers near the starting point of the task request; The trailers with available positions and the same destination are sorted according to the difficulty of loading; The trailers that have not started transportation from the same starting point are sorted according to the time when the first order was received; The trailers whose transport destination is the starting point of the task request are sorted according to the estimated arrival time; The trailers near the starting point of the task request are sorted according to the distance from the starting point.

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

4. The trailer dispatching method according to claim 3, wherein: A higher weight is set for the transportation cost and transportation efficiency than for the transportation timeliness.

5. The trailer dispatching method according to claim 1, wherein: The pre-scheduling of currently idle trailers includes: initialization pre-scheduling performed outside the transportation period and real-time pre-scheduling performed during the transportation period.

6. The trailer dispatching method according to claim 5, wherein: The initialization pre-scheduling includes: Taking the maintenance center as the center, multiple 4S stores around it are merged to form multiple groups of 4S stores, where the distance between 4S stores in the same group does not exceed the set threshold; Counting the number of task requests of the multiple groups of 4S stores respectively, and prioritizing the multiple groups of 4S stores accordingly; Check whether the maintenance center has vehicles that need to be transported to the multiple 4S stores, and if the maintenance center has vehicles that need to be transported to the first 4S store, set the group where the first 4S store belongs to as having an idle trailer; Query the number of trailers available on the day, and determine the number of trailers that should be allocated to the 4S store and the number of trailers that should be allocated to the maintenance center based on the allocation ratio; and The number of trailers actually allocated to the 4S stores and the number of trailers allocated to the maintenance center are determined based on the priority ranking of multiple groups of 4S stores, the number of trailers that should be allocated to the maintenance center and the number of trailers that should be allocated to the 4S stores, and whether there are idle trailers in the 4S store group, and pre-dispatch instructions are issued accordingly.

7. The trailer dispatching method according to claim 5, wherein: For a 4S store, real-time pre-scheduling is performed when the following conditions are met: The real-time tasks of the 4S store on that day exceed the average total tasks of the 4S store on corresponding working days or weekends in history; and there are no idle trailers or trailers heading towards the 4S store in the adjacent 4S stores of the 4S store.

8. The trailer dispatching method according to claim 1, wherein: The task details include transportation time, starting point and end point, vehicle model to be transported, key attributes of the vehicle to be transported, contact person, and contact information.

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

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the trailer dispatching method according to any one of claims 1 to 8.

Images