Intensive dynamic shunting method

Abstract

The invention provides an intensive dynamic shunting method. The method comprises the following specific steps: S1, recording and updating information of all online orders in real time; s2, forming a navigation route based on the starting place / destination of the order in the order module, and establishing a navigation route network according to the navigation routes of all online orders; s3, aiming at each navigation route, screening all sharable routes which have the same road section as the navigation route and are in reverse driving in the navigation route network within the driving time range of N-M hours; s4, all the shared routes are traversed, and the optimal segments are selected to be combined to form a new segmented navigation route map; s5, determining a new car changing meeting point of the segmented navigation route map; and S6, informing a related driver to complete a car changing procedure at the appointed car changing meeting point. According to the method, the efficiency can be effectively improved, the cost is reduced, and the safety is improved.

Description

Technical Field

[0001] The present invention relates to the field of vehicle safety for freight transportation or vehicles carrying special goods or objects, and in particular to an intensive dynamic shunting method. Background Art

[0002] Traditional long-distance trucking often relies on one or two drivers, who alternate driving from origin to destination. Long driving times, even with hotel stops, can lead to increased fatigue and exhaustion as the journey progresses, a daunting task that can easily lead to accidents. Furthermore, long-distance driving inevitably incurs expenses for food, accommodation, and other related expenses. To control costs, companies often include these expenses in driver compensation or charge a very low fixed fee. This leads drivers to increase their profits by driving longer, cutting back on food, spending a night on the truck, or even employing two-person shifts. However, this practice can lead to increased fatigue, a decline in driver health, and even accidents caused by poor driver health. Therefore, resolving the conflict between company costs and driver safety is crucial. Improving driver morale is also a pressing issue. Summary of the Invention

[0003] The present invention aims to overcome the above-mentioned defects and provide a solution that can reduce the safety accident rate, protect the driver's income level and driving status, improve the driver's emotional value, not affect the company's freight efficiency, and reduce the company's subsidy project expenditure to a certain extent.

[0004] The present invention provides an intensive dynamic shunting method, comprising the following specific steps: S1. Record and update all online order information in real time; S2. Based on the origin / destination of the order in the order module, a navigation route is formed, and a navigation route network is established based on the navigation routes of all online orders; S3. For each navigation route, filter out all shareable routes in the navigation route network that have the same road section and are traveling in the reverse direction within the NM hour range; S4. traverse all shared routes and select the optimal segment combination to form a new segmented navigation route map; S5. Establish a new segmented navigation route map for vehicle transfer meeting points; S6. Notify the relevant drivers and complete the vehicle change procedures at the designated vehicle change meeting point.

[0005] Furthermore, the present invention provides an intensive dynamic shunting method, which is also characterized by: In step S3 , the travel start / end times of all sharable routes on the road segment need to match the end / start times of the current route on the road segment.

[0006] Furthermore, the present invention provides an intensive dynamic shunting method, which is also characterized by: In step S3, the estimated driving time of the navigation route must be greater than 4 hours.

[0007] Furthermore, the present invention provides an intensive dynamic shunting method, which is also characterized by: In step S4, the new segmented navigation route map is assembled as follows: S4.1. Retrieve the current route and all available shared routes that match the time, label them as route set L, and label the starting city of each segment of each route Ln in route set Ln with the n1th node, n2th node, ..., nNth node; S4.2. Randomly select a route Ln and set its n1th node to the starting city Sn1 of the current route. Determine whether there is a route with the end city XZ as the starting city Sn1 among all the shared routes. If the answer is “yes”, proceed to S4.2.1; S4.2.1. Label all shareable routes that meet the rules in S4.2 as dataset A; S4.2.1.1. Organize the data in dataset A and list the starting cities XS of all sharable routes. S4.2.1.2. Sort the distances D between starting city XS and starting city S, from largest to smallest, as D1, D2, ..., Dn; S4.2.1.3. Select the D1 shareable route with the largest distance D; S4.2.1.4. Determine each such shareable route, excluding the current shared route segment, to see if there are any connected shippers on the routes preceding and following it, or if there are shared routes with other routes. When the answer is "yes", it is determined that the sharable route exists and proceed to S4.3; S4.3. Filter the n2th node to the nNth node in sequence to form a segmented navigation route map.

[0008] Furthermore, the present invention provides an intensive dynamic shunting method, which is also characterized by: In S4.2, when the result is "No", all routes Ln are checked until the result is "Yes". If the result is always "No", it is determined that the route cannot be shared and the planning of the current route is terminated.

[0009] Furthermore, the present invention provides an intensive dynamic shunting method, which is also characterized by: In S4.2.1.4, when the result is "No", select a shareable route with a distance D equal to the next largest distance D2, repeat the process of S4.2.1.4, and so on until a valid shared route is found. Or, if no valid shared route is found when D is Dn, it is determined that this route cannot be shared, and the planning of the current route ends.

[0010] Furthermore, the present invention provides an intensive dynamic shunting method, which is also characterized by: The method for establishing the vehicle transfer meeting point of a new segmented navigation route map is as follows: S5.1. Split the new segmented navigation route map into J segments based on the shared segments; S5.2. Calculate the travel time for each road segment; S5.3. Search for a location that meets the rendezvous point criteria at or near the midpoint of the search time; S5.4. Select the meeting point with the least detour as the vehicle transfer meeting point. DETAILED DESCRIPTION

[0011] The present invention is capable of various modifications and embodiments, but this is not intended to limit the present invention to a specific embodiment, and should be understood to include all modifications, equivalents, and even substitutes that fall within the spirit and technical scope of the present invention.

[0012] This embodiment provides an intensive dynamic shunting method, which includes the following specific steps: S1. Record and update in real time all online order information; this information includes the name of the goods, the load capacity of the goods, the place of origin, the destination, the time the order was established, the time point when the goods need to be delivered, the time when the goods departed, the estimated time when the goods can be delivered, the courier, the route of delivery, etc. Among them, the information about the time of departure of the goods, the estimated time when the goods can be delivered, the courier, the place of residence of the courier, the route of delivery, etc. are all data entered after the waybill is established.

[0013] S2. Based on the origin / destination of the order in the order module, a navigation route is formed, and a navigation route network is established based on the navigation routes of all online orders; S3. For each navigation route, select all available routes within the navigation route network that have a driving time within the NM hour range (e.g., 6-8 hours, which is the upper limit for a single-person drive within a day. This parameter is adjustable on the device front-end. In other words, if a corresponding route cannot be found within this range, it can be expanded to 12-16 hours, which is the upper limit for a two-person drive within a day or the upper limit for a single-person drive within two days). These routes share the same road segments as the current navigation route and travel in the opposite direction. This screening process allows navigation routes to be combined into several combinations within the NM hour range according to different sharing methods.

[0014] The start / end time of all the above-mentioned shared routes on this road section must match the end / start time of the current route on this road section. This matching includes the following situations: (1) The start / end time of the shared route on this road section must be exactly the same as the end / start time of the current route on this road section. (2) The start / end time of the shared route must differ from the end / start time of the current route on this road section by an acceptable time interval. In this way, the drivers of the two vehicles can exchange at a suitable position in the middle of the road section.

[0015] That is, assuming the forward direction of the shared route is Truck I (Driver I) driving from City A to City B, then the reverse direction is Truck II (Driver II) driving from City B to City A. Therefore, in the first scenario, Truck I's planned arrival time in City B coincides with Truck II's arrival time. However, this coincidence is extremely rare, and using this as a screening criterion would result in almost no shared routes. Therefore, this embodiment proposes a second feasible solution: a time difference of no more than XY hours between Truck I's arrival time in City B and Truck II's arrival time in City B (X and Y are preset based on actual needs. If no optimal route is found, these parameters can be adjusted on the device front end to discover new targets).

[0016] In this way, when driver I and driver II exchange vehicles at a location between cities A and B, driver I and driver II can both start their return journey, which does not affect the normal progress of truck I and truck II and allows driver I and driver II to start their return journey. On the one hand, it allows the drivers to return home to rest on the same day or every few days, thereby maintaining a good mood and physical condition. On the other hand, it can also save the company's expenses on accommodation.

[0017] In addition, it is worth noting that the initial estimated driving time of the navigation route that needs to be segmented must be greater than 4 hours. In other words, the round-trip time from the starting point to the return point must exceed the legal limit of 8 hours, otherwise there is no point in segmenting.

[0018] S4. traverse all shared routes and select the optimal segment combination to form a new segmented navigation route map; The new step-by-step navigation roadmap is composed as follows: S4.1. Retrieve the current route and all available shared routes that match the time, label them as route set L, and label the starting city of each segment of each route Ln in route set Ln with the n1th node, n2th node, ..., nNth node; S4.2. Randomly select a route Ln and set its n1th node to the starting city Sn1 of the current route. Determine whether there is a route with the end city XZ as the starting city Sn1 among all the shared routes. If the answer is “yes”, proceed to S4.2.1; If the result is "No", all routes Ln are repeated until the result is "Yes". If the result is always "No", it is determined that the route cannot be shared and the planning of the current route ends; S4.2.1. Label all shareable routes that meet the rules in S4.2 as dataset A; S4.2.1.1. Organize the data in dataset A and list the starting cities XS of all sharable routes. S4.2.1.2. Sort the distances D between starting city XS and starting city S, from largest to smallest, as D1, D2, ..., Dn, where n is an integer greater than 1; S4.2.1.3. Select the D1 shareable route with the largest distance D; S4.2.1.4. Determine each such shareable route, excluding the current shared route segment, to see if there are any connected shippers on the routes preceding and following it, or if there are shared routes with other routes. When the answer is "yes", it is determined that the sharable route exists and proceed to S4.3; If the answer is "No", select the shareable route with the next largest distance D being D2, and repeat the steps in S4.2.1.4, and so on, until a valid shareable route is found. If no valid shareable route is found when D is Dn, then the route is determined to be unshareable and the current route planning ends. S4.3. Filter nodes n2 to nN in sequence to form a segmented navigation route map; S5. Establish a new segmented navigation route map for vehicle transfer meeting points; The specific method is: S5.1. Split the new segmented navigation route map into J segments based on the shared segments; S5.2. Calculate the travel time for each road segment; S5.3. Search for a location that meets the rendezvous point criteria at or near the midpoint of the search time; S5.4. Select the meeting point with the least detour as the transfer meeting point; S6. Notify the relevant drivers and complete the vehicle change procedures at the designated vehicle change meeting point.

[0019] The above method has the following advantages: 1. It can turn long-distance transportation into short-distance transportation; 2. Short-distance transportation can effectively eliminate driver fatigue and effectively improve safety; 3. Ensuring drivers always keep short distances not only helps maintain their physical strength, but also allows them to always drive in familiar road conditions, effectively improving safety. 4. Short-distance transportation enables drivers to return to their homes every day or every few days (this is limited by the NM time range) to get better rest and reunite with their families, greatly improving the physical and emotional value of drivers and their families; 5. According to driving regulations, a driver's daily driving time is capped. Therefore, this segmented driving model not only ensures that daily driving time falls within the upper limit, but also allows the driver to always be in the best driving condition to complete driving tasks. 6. From the enterprise level, the shift from long-distance to short-distance transportation can reduce a large amount of accommodation expenses and has significant economic benefits.

[0020] While the above description focuses on the embodiments, this is merely illustrative and does not limit the present invention. Persons skilled in the art will readily appreciate that various modifications and applications not illustrated above are possible without departing from the essential characteristics of the embodiments. For example, the various components specifically illustrated in the embodiments may be implemented with modifications. Furthermore, any differences associated with such modifications and applications should be construed as being within the scope of the present invention as defined in the appended claims.

Claims

1. An intensive dynamic shunting method, characterized by: The following specific steps are included: S1. Record and update all online order information in real time; S2. Based on the origin / destination of the order in the order module, a navigation route is formed, and a navigation route network is established based on the navigation routes of all online orders; S3. For each navigation route, filter out all shareable routes in the navigation route network that have the same road section and are traveling in the reverse direction within the NM hour range; S4. traverse all shared routes and select the optimal segment combination to form a new segmented navigation route map; S5. Establish a new segmented navigation route map for vehicle transfer meeting points; S6. Notify the relevant drivers and complete the vehicle change procedures at the designated vehicle change meeting point.

2. The intensive dynamic shunting method according to claim 1, characterized in that: In step S3 , the travel start / end times of all sharable routes on the road segment need to match the end / start times of the current route on the road segment.

3. The intensive dynamic shunting method according to claim 1, characterized in that: In step S3, the estimated driving time of the navigation route must be greater than 4 hours.

4. The intensive dynamic shunting method according to claim 1, characterized in that: In step S4, the new segmented navigation route map is assembled as follows: S4.

1. Retrieve the current route and all available shared routes that match the time, label them as route set L, and label the starting city of each segment of each route Ln in route set Ln with the n1th node, n2th node, ..., nNth node; S4.

2. Randomly select a route Ln and set its n1th node to the starting city Sn1 of the current route. Determine whether there is a route with the end city XZ as the starting city Sn1 among all the shared routes. If the answer is "yes", proceed to S4.2.1; S4.2.

1. Label all shareable routes that meet the rules in S4.2 as dataset A; S4.2.1.

1. Organize the data in dataset A and list the starting cities XS of all sharable routes. S4.2.1.

2. Sort the distances D between starting city XS and starting city S, from largest to smallest, as D1, D2, ..., Dn; S4.2.1.

3. Select the D1 shareable route with the largest distance D; S4.2.1.

4. Determine each such shareable route, excluding the current shared route segment, to see if there are any connected shippers on the routes preceding and following it, or if there are shared routes with other routes. If the answer is "yes", it is determined that the sharable route exists and proceed to S4.3; S4.

3. Filter the n2th node to the nNth node in sequence to form a segmented navigation route map.

5. The intensive dynamic shunting method according to claim 4, characterized in that: In S4.2, when the result is "No", all routes Ln are repeated until the result is "Yes". If the result is always "No", it is determined that the route cannot be shared and the planning of the current route is terminated.

6. The intensive dynamic shunting method according to claim 4, characterized in that: In S4.2.1.4, if the result is "No", select a shareable route with a distance D equal to the next largest distance D2, repeat the process in S4.2.1.4, and so on until a valid shared route is found. Or, if no valid shared route is found when D is Dn, it is determined that the current route cannot be shared, and the current route planning ends.

7. The intensive dynamic shunting method according to claim 1, characterized in that: The method for establishing the vehicle transfer meeting point of a new segmented navigation route map is as follows: S5.

1. Split the new segmented navigation route map into J segments based on the shared segments; S5.

2. Calculate the travel time for each road segment; S5.

3. Search for a location that meets the rendezvous point criteria at or near the midpoint of the search time; S5.

4. Select the meeting point with the least detour as the vehicle transfer meeting point.