Cargo management method for aviation logistics

Abstract

The invention discloses a cargo management method for aviation logistics, and belongs to the technical field of cargo management, and the method specifically comprises the steps: obtaining a target address of a to-be-transported cargo, selecting a plurality of freight airports in a radius circle where the target address is located, and marking the selected freight airports as to-be-determined airports; acquiring all to-be-transported cargoes with the same list of the to-be-determined airports, marking the to-be-transported cargoes as the same batch of cargoes, respectively collecting the start time of the earliest freight flight between the starting airport and any one to-be-determined airport, and calculating the expected time length of the to-be-transported cargoes arriving at the any one to-be-determined airport according to the start time; respectively counting all freight routes between any one to-be-determined airport and all sorting centers, and screening the freight routes according to the predicted transportation duration and the resident disturbing index to obtain an optimal route; calculating the total transportation duration of arriving at all the sorting centers through any one undetermined airport, and judging the undetermined airport with the shortest maximum total transportation duration as a target airport of the same batch of goods; according to the invention, the time and economic cost of logistics distribution are reduced.

Description

Technical Field

[0001] The present invention relates to the technical field of cargo management, and in particular to a cargo management method for aviation logistics. Background Art

[0002] Air logistics is an important part of the modern logistics system, with the characteristics of high added value, fast and efficient transportation of goods. With the rapid development of the global economy, the role of air logistics in connecting international markets and promoting trade exchanges has become increasingly significant. It can quickly respond to market demand, provide transportation services for key materials, and ensure the stability and efficient operation of the supply chain. At the same time, air logistics is also an important force in promoting the upgrading of economic structure and the development of international supply chains.

[0003] In the field of air logistics, effective management of cargo is crucial to improving transportation efficiency, reducing operating costs and enhancing customer satisfaction. In the current global economic environment, competition among enterprises is becoming increasingly fierce, and efficient logistics management has become a key factor for enterprises to maintain their competitiveness and sustainable development. Through effective cargo distribution management, air logistics companies can ensure that cargo arrives at its destination quickly and safely, reduce waiting time and inventory costs, and thus greatly improve transportation efficiency. At the same time, optimized cargo management can also significantly reduce operating costs, such as reducing additional costs caused by delays or incorrect deliveries.

[0004] Traditional cargo management methods usually rely on manual or simple computer systems to allocate and schedule flights for cargo loading. These methods often fail to fully consider the complexity and dynamics of air logistics. The allocation of cargo usually only considers the availability of direct flights, while ignoring the impact of the choice of transit stations at the cargo destination on the overall transportation time. In addition, for large cargo volumes, existing methods usually lack effective strategies to optimize the allocation and scheduling of cargo. Summary of the invention

[0005] The purpose of the present invention is to provide a cargo management method for aviation logistics to solve the following technical problems:

[0006] Traditional cargo management methods usually rely on simple methods to allocate and schedule flights for cargo loading, which fails to fully consider the complexity and dynamics of air logistics. The allocation of cargo usually only considers the availability of direct flights, while ignoring the impact of the choice of destination transit stations on the overall transportation time.

[0007] The purpose of the present invention can be achieved through the following technical solutions:

[0008] A cargo management method for aviation logistics, comprising the following steps:

[0009] Taking the current time t0 as the standard, obtain the target address of any cargo to be transported at the current departure airport, obtain the address of the sorting center in the area where the target address is located, draw a circle with the address of the sorting center as the center and the preset distance as the radius, select several cargo airports within the circle and mark them as pending airports;

[0010] Get all the cargo to be transported with the same list of pending airports, mark them as the same batch of cargo, collect the departure and arrival times of the earliest cargo flights between the departure airport and any pending airport, and calculate the expected time Ta1, Ta2, ..., Ta of the cargo to be transported to any pending airport based on the departure and arrival times. n , n represents the number of pending airports;

[0011] Count the number m of sorting centers corresponding to all the same batch of goods, count all freight routes between any pending airport and all sorting centers, calculate the corresponding predicted transportation time according to the speed limit value and distance of each section in each freight route after screening, and mark the shortest freight routes in the predicted transportation time corresponding to each pending airport as pending routes, and screen the pending routes according to the nuisance index to obtain the preferred routes, and mark the transportation time of all preferred routes as Tb1, Tb2, ..., Tb nm ;

[0012] The expected time to reach all sorting centers through any pending airport and the sum of the transportation time are calculated separately, which is the overall transportation time. The maximum overall transportation time corresponding to any pending airport is selected, and the pending airport with the shortest maximum overall transportation time is determined as the target airport for the same batch of goods, and the earliest cargo flight corresponding to the target airport is determined as the target flight.

[0013] As a further solution of the present invention: when the volume of the same batch of goods exceeds the cargo capacity of the current target flight, the determined target flight will be eliminated, and the next cargo flights at the current departure airport and the to-be-determined airport will be obtained as the alternative sequence of the new earliest cargo flight. The new target airport and target flight will be recalculated according to the departure and arrival times of the new batch of earliest cargo flights until all the same batch of goods are allocated to the corresponding cargo flights.

[0014] As a further solution of the present invention: when the target flight is greater than 1, the process of allocating the same batch of goods is:

[0015] Taking the current time t0 as the standard, obtain the latest calculated real-time overall transportation time T'b1, T'b2, ..., T'b nm , the real-time total transportation time is compared with the total transportation time Tb1, Tb2, ..., Tb of the original target airport and all sorting centers nm For comparison, if there is T'bi Smaller than the corresponding Tb i , i∈1,2,...,nm, then Tb i The same batch of goods at the corresponding sorting center is loaded onto the target flight corresponding to the newly generated target airport.

[0016] As a further solution of the present invention: the expected duration is the sum of the duration t1 between the current time and the earliest cargo flight departure time and the flight duration t2.

[0017] As a further solution of the present invention: the calculation process of the predicted transportation time is:

[0018] For any freight route, obtain its speed limit value. If the speed limit value of the freight route is constant, directly calculate the predicted transportation time based on the freight distance and the speed limit value. If the route has multiple sections with different speed limits, calculate the section duration based on the distance and speed limit value of each section respectively, and add up the section durations to get the predicted transportation time.

[0019] As a further solution of the present invention: the screening process of the proposed route by the nuisance index is:

[0020] The noise impact range of freight vehicles is set according to the vehicle type, and all specific areas passed by the proposed route are counted, including but not limited to schools, hospitals and residential areas. Buildings within the noise impact range are selected from the specific areas, and the number and number of floors of the buildings are counted. The ratio of the product of the number of floors of the buildings and the length of the route is marked as the nuisance index, and the proposed route with the lowest nuisance index is marked as the preferred route.

[0021] As a further solution of the present invention: the calculation process of the noise impact range is:

[0022] Obtain the decibel value dB1 of the driving noise of the freight vehicle and the statutory noise standard value dB2 corresponding to the current driving period, calculate the difference ΔdB between dB1-dB2, and the calculation formula for the noise impact range r is:

[0023]

[0024] Beneficial effects of the present invention:

[0025] (1) The present invention can more comprehensively evaluate the overall transportation time by comprehensively considering multiple factors such as the duration of direct flights and the transportation time from the destination airport to the logistics sorting center, thereby optimizing the distribution and scheduling of goods, so that the time it takes for the goods to arrive at the destination and the logistics cost are balanced. This method can ensure that the goods arrive at the destination in the fastest way, reduce the time in transit and waiting time, improve the efficiency of the entire logistics process, ensure the accuracy of goods distribution and scheduling, and reduce the cost of air logistics;

[0026] (2) The present invention provides an effective strategy to optimize the distribution and scheduling of cargo in situations where the cargo volume is large. Through intelligent algorithms and data analysis, multiple target flights are comprehensively determined, and the cargo is reallocated according to the situation of each flight to achieve the optimization result of logistics time. The present invention can reasonably arrange the loading of cargo to ensure that the cargo capacity of the flight is maximized, while avoiding delays or additional costs caused by excess cargo. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The present invention will be further described below in conjunction with the accompanying drawings.

[0028] Figure 1 It is a schematic diagram of the process of the present invention. DETAILED DESCRIPTION

[0029] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0030] See also Figure 1 As shown, the present invention is a cargo management method for aviation logistics, comprising the following steps:

[0031] Taking the current time t0 as the standard, obtain the target address of any cargo to be transported at the current departure airport, obtain the address of the sorting center in the area where the target address is located, draw a circle with the address of the sorting center as the center and the preset distance as the radius, select several cargo airports within the circle and mark them as pending airports;

[0032] Get all the cargo to be transported with the same list of pending airports, mark them as the same batch of cargo, collect the departure and arrival times of the earliest cargo flights between the departure airport and any pending airport, and calculate the expected time Ta1, Ta2, ..., Ta of the cargo to be transported to any pending airport based on the departure and arrival times. n , n represents the number of pending airports;

[0033] Count the number m of sorting centers corresponding to all the same batch of goods, count all freight routes between any pending airport and all sorting centers, calculate the corresponding predicted transportation time according to the speed limit value and distance of each section in each freight route after screening, and mark the shortest freight routes in the predicted transportation time corresponding to each pending airport as pending routes, and screen the pending routes according to the nuisance index to obtain the preferred routes, and mark the transportation time of all preferred routes as Tb1, Tb2, ..., Tb nm ;

[0034] The expected time to reach all sorting centers through any pending airport and the sum of the transportation time are calculated separately, which is the overall transportation time. The maximum overall transportation time corresponding to any pending airport is selected, and the pending airport with the shortest maximum overall transportation time is determined as the target airport for the same batch of goods, and the earliest cargo flight corresponding to the target airport is determined as the target flight.

[0035] By comprehensively considering the selection of direct flights and transfer stations, the present invention can more comprehensively evaluate the overall transportation time, thereby optimizing the distribution and scheduling of goods. This method can ensure that the goods arrive at the destination in the fastest way, reduce the time in transit and waiting time, and improve the efficiency of the entire logistics process.

[0036] In another preferred embodiment of the present invention, when the volume of the same batch of goods exceeds the cargo capacity of the current target flight, the determined target flight will be eliminated, and the next cargo flights at the current departure airport and the to-be-determined airport will be obtained as the alternative sequence of the new earliest cargo flight. The new target airport and target flight will be recalculated according to the departure and arrival times of the new batch of earliest cargo flights until all the same batch of goods are assigned to the corresponding cargo flights.

[0037] In another preferred embodiment of the present invention, when the target flight number is greater than 1, the process of allocating the same batch of goods is as follows:

[0038] Taking the current time t0 as the standard, obtain the latest calculated real-time overall transportation time T'b1, T'b2, ..., T'b nm , the real-time total transportation time is compared with the total transportation time Tb1, Tb2, ..., Tb of the original target airport and all sorting centers nm For comparison, if there is T'b i Smaller than the corresponding Tb i , i∈1,2,...,nm, then Tb i The same batch of goods at the corresponding sorting center is loaded onto the target flight corresponding to the newly generated target airport.

[0039] The present invention provides an effective strategy to optimize the distribution and scheduling of cargo in the case of large cargo volume. Through intelligent algorithms and data analysis, the present invention can reasonably arrange the loading of cargo to ensure that the cargo capacity of the flight is maximized, while avoiding delays or additional costs caused by excess cargo.

[0040] In another preferred embodiment of the present invention, the expected duration is the sum of the duration t1 between the current time and the earliest cargo flight departure time and the flight duration t2.

[0041] In another preferred embodiment of the present invention, the calculation process of the predicted transportation time is:

[0042] For any freight route, obtain its speed limit value. If the speed limit value of the freight route is constant, directly calculate the predicted transportation time based on the freight distance and the speed limit value. If the route has multiple sections with different speed limits, calculate the section duration based on the distance and speed limit value of each section respectively, and add up the section durations to get the predicted transportation time.

[0043] In another preferred embodiment of the present invention, the process of screening the proposed routes by the nuisance index is as follows:

[0044] The noise impact range of freight vehicles is set according to the vehicle type, and all specific areas passed by the proposed route are counted, including but not limited to schools, hospitals and residential areas. Buildings within the noise impact range are selected from the specific areas, and the number and number of floors of the buildings are counted. The ratio of the product of the number of floors of the buildings and the length of the route is marked as the nuisance index, and the proposed route with the lowest nuisance index is marked as the preferred route.

[0045] It is worth noting that the calculation process of the noise impact range is:

[0046] Obtain the decibel value dB1 of the driving noise of the freight vehicle and the statutory noise standard value dB2 corresponding to the current driving period, calculate the difference ΔdB between dB1-dB2, and the calculation formula for the noise impact range r is:

[0047]

[0048] The present invention obtains the decibel value dB1 of the driving noise of the freight vehicle and the statutory noise standard value dB2 corresponding to the current driving period, calculates the difference ΔdB, and calculates the noise impact range r accordingly. The present invention can more accurately evaluate the noise impact of the freight vehicle on the surrounding environment;

[0049] According to the noise impact range, the number of buildings and floors passing through a specific area is counted, and the ratio of the product of the number of buildings and floors to the route length is marked as the nuisance index. The present invention gives priority to routes with low nuisance indexes, thereby reducing the noise impact on surrounding residents and schools. By choosing routes with less noise impact, logistics companies can demonstrate their concern for environmental protection and social responsibility, and enhance public recognition and support for their operations.

[0050] The above is a detailed description of an embodiment of the present invention, but the content is only a preferred embodiment of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made within the scope of the present invention should still fall within the scope of the patent coverage of the present invention.

Claims

1. A cargo management method for aviation logistics, characterized in that: The following steps are involved: Taking the current time t0 as the standard, obtain the target address of any cargo to be transported at the current departure airport, obtain the address of the sorting center in the area where the target address is located, draw a circle with the address of the sorting center as the center and the preset distance as the radius, select several cargo airports within the circle and mark them as pending airports; Get all the cargo to be transported with the same list of pending airports, mark them as the same batch of cargo, collect the departure and arrival times of the earliest cargo flights between the departure airport and any pending airport, and calculate the expected time Ta1, Ta2, ..., Ta of the cargo to be transported to any pending airport based on the departure and arrival times. n , n represents the number of pending airports; Count the number m of sorting centers corresponding to all the same batch of goods, count all freight routes between any pending airport and all sorting centers, calculate the corresponding predicted transportation time according to the speed limit value and distance of each section in each freight route after screening, and mark the shortest freight routes in the predicted transportation time corresponding to each pending airport as pending routes, and screen the pending routes according to the nuisance index to obtain the preferred routes, and mark the transportation time of all preferred routes as Tb1, Tb2, ..., Tb nm ; The expected time to reach all sorting centers through any pending airport and the sum of the transportation time are calculated separately, which is the overall transportation time. The maximum overall transportation time corresponding to any pending airport is selected, and the pending airport with the shortest maximum overall transportation time is determined as the target airport for the same batch of goods, and the earliest cargo flight corresponding to the target airport is determined as the target flight.

2. A cargo management method for aviation logistics according to claim 1, characterized in that: When the volume of the same batch of goods exceeds the cargo capacity of the current target flight, the determined target flight will be eliminated, and the next cargo flights at the current departure airport and the to-be-determined airport will be obtained as the alternative sequence of the new earliest cargo flight. The new target airport and target flight will be recalculated according to the departure and arrival times of the new batch of earliest cargo flights until all the same batch of goods are assigned to the corresponding cargo flights.

3. A cargo management method for aviation logistics according to claim 2, characterized in that: When the target flight number is greater than 1, the process of allocating the same batch of goods is as follows: Taking the current time t0 as the standard, obtain the latest calculated real-time overall transportation time T'b1, T'b2, ..., T'b nm , the real-time total transportation time is compared with the total transportation time Tb1, Tb2, ..., Tb of the original target airport and all sorting centers nm For comparison, if there is T'b i Smaller than the corresponding Tb i , i∈1,2,...,nm, then Tb i The same batch of goods at the corresponding sorting center is loaded onto the target flight corresponding to the newly generated target airport.

4. A cargo management method for aviation logistics according to claim 1, characterized in that: The expected duration is the sum of the duration t1 between the current time and the earliest cargo flight departure time and the flight duration t2.

5. A cargo management method for aviation logistics according to claim 1, characterized in that: The calculation process of the predicted transportation time is: For any freight route, obtain its speed limit value. If the speed limit value of the freight route is constant, directly calculate the predicted transportation time based on the freight distance and the speed limit value. If the route has multiple sections with different speed limits, calculate the section duration based on the distance and speed limit value of each section respectively, and add up the section durations to get the predicted transportation time.

6. A cargo management method for aviation logistics according to claim 1, characterized in that: The screening process of the proposed routes by the nuisance index is as follows: The noise impact range of freight vehicles is set according to the vehicle type, and all specific areas passed by the proposed route are counted, including but not limited to schools, hospitals and residential areas. Buildings within the noise impact range are selected from the specific areas, and the number and number of floors of the buildings are counted. The ratio of the product of the number of floors of the buildings and the length of the route is marked as the nuisance index, and the proposed route with the lowest nuisance index is marked as the preferred route.

7. A cargo management method for aviation logistics according to claim 6, characterized in that: The calculation process of the noise impact range is: Obtain the decibel value dB1 of the driving noise of the freight vehicle and the statutory noise standard value dB2 corresponding to the current driving period, calculate the difference ΔdB between dB1-dB2, and the calculation formula for the noise impact range r is:

Images