A cargo management method for air logistics

Abstract

The present invention discloses a cargo management method for air logistics, which belongs to the technical field of cargo management and specifically comprises the following steps: obtaining a target address of cargo to be transported, selecting a number of cargo airports within a radius circle where the target address is located, and marking them as pending airports; obtaining all cargo to be transported having the same list of pending airports, marking them as cargo of the same batch, collecting the departure and arrival times of the earliest cargo flights between the departure airport and any pending airport, and calculating the expected arrival time of the cargo to be transported at any pending airport according to the departure and arrival times; respectively counting all cargo routes between any pending airport and all sorting centers, screening the cargo routes according to the predicted transport time and the nuisance index, and obtaining an optimal route; calculating the overall transport time from any pending airport to all sorting centers, and determining the pending airport with the shortest maximum overall transport time as the target airport for the cargo of the same batch. The present invention reduces the time and economic cost of logistics distribution.

Description

Technical Field

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

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

[0003] In the field of air logistics, the effective management of cargo is crucial for 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 competitiveness and sustainable development. Through effective cargo distribution management, air logistics companies can ensure that goods reach their destinations quickly and safely, reduce waiting time and inventory costs, and thus significantly 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 for the allocation and scheduling of the flights on which the cargo is loaded. These methods often fail to fully consider the complexity and dynamics of air logistics. The cargo allocation usually only takes into account the availability of direct flights, while ignoring the impact of the choice of transfer stations at the cargo destination on the overall transportation time. In addition, for the case of large cargo volumes, existing methods usually lack effective strategies to optimize the cargo allocation and scheduling. Summary of the Invention

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

[0006] Traditional cargo management methods usually rely on simple methods for the allocation and scheduling of the flights on which the cargo is loaded, and cannot fully consider the complexity and dynamics of air logistics. The cargo allocation usually only takes into account the availability of direct flights, while ignoring the impact of the choice of transfer stations at the destination 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 air 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, use the address of the sorting center as the center of a circle, and use the preset distance as the radius to draw a circle. Select several cargo airports within the circle and mark them as undetermined airports;

[0010] Obtain all the cargoes to be transported with the same undetermined airport list, mark them as the same batch of cargoes, respectively collect the departure and arrival times of the earliest cargo flights between the departure airport and any undetermined airport, and calculate the expected durations Ta1, Ta2,..., Ta for the cargoes to be transported to any undetermined airport according to the departure and arrival times n , where n represents the number of undetermined airports;

[0011] Count the number m of sorting centers corresponding to all the same batch of cargoes. Respectively count all the cargo routes between any undetermined airport and all sorting centers. Calculate the corresponding predicted transportation durations according to the speed limits and distances of each section in each cargo route after screening, and mark the several shortest cargo routes among the predicted transportation durations corresponding to each undetermined airport as undetermined routes. Then screen the undetermined routes according to the nuisance index to obtain the optimal routes, and mark the transportation durations of all the optimal routes as Tb1, Tb2,..., Tb nm ;

[0012] Respectively calculate the sum of the expected duration and the transportation duration for reaching all sorting centers through any undetermined airport, which is the total transportation duration. Select the maximum total transportation duration corresponding to any undetermined airport, and determine the undetermined airport with the shortest maximum total transportation duration as the target airport for this batch of cargoes, and determine the earliest cargo flight corresponding to the target airport as the target flight.

[0013] As a further solution of the present invention: when the volume of the same batch of cargoes exceeds the load capacity of the current target flight, then exclude the already determined target flight, obtain the next cargo flights between the current departure airport and the undetermined airports as the alternative sequence of the new earliest cargo flights, and recalculate the new target airport and target flight according to the departure and arrival times of the new batch of earliest cargo flights until all the same batch of cargoes are assigned to the corresponding cargo flights.

[0014] As a further solution of the present invention: when there are more than one target flight, the process of distributing the same batch of cargoes is as follows:

[0015] Taking the current time t0 as the standard, obtain the real-time total transportation durations T'b1, T'b2,..., T'b between the latest calculated target airport and all sorting centers nm , and compare the real-time total transportation durations with the original total transportation durations Tb1, Tb2,..., Tb between the target airport and all sorting centers nm If there exists T'bi less than the corresponding Tb i , where i ∈ 1, 2,..., nm, then load the goods of the same batch at the corresponding sorting center onto the target flight corresponding to the newly generated target airport. i For the goods of the same batch at the corresponding sorting center, load them 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 moment and the take-off time of the earliest freight flight and the flight duration t2.

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

[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 duration according to the freight distance and the speed limit value. If there are multiple sections with different speed limit values on this route, calculate the section duration according to the distance and speed limit value of each section respectively, and add up the section durations to obtain the predicted transportation duration.

[0019] As a further solution of the present invention: the screening process of the nuisance index for the to-be-determined route is as follows:

[0020] Set the noise impact range of the freight vehicle according to the vehicle type, count all specific areas passed through in the to-be-determined route, the specific areas include but are not limited to schools, hospitals and residential communities, and select the buildings located within the noise impact range from the specific areas, count the number and number of floors of the buildings, mark the ratio of the product of the number and number of floors of the buildings to the route length as the nuisance index, and mark the to-be-determined route with the lowest nuisance index as the preferred route.

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

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

[0023]

[0024] The beneficial effects of the present invention:

[0025] (1) By comprehensively considering multiple factors such as the duration of direct flights and the transportation duration from the destination airport to the logistics sorting center, the present invention can more comprehensively evaluate the overall transportation time, thereby optimizing the allocation and scheduling of goods, enabling the duration and logistics cost of the goods to be transported to reach a balanced state. This method can ensure that the goods reach the destination in the fastest way, reduce the in-transit time and waiting time, improve the efficiency of the entire logistics process, ensure the accuracy of goods allocation and scheduling, and reduce the cost of air logistics;

[0026] (2) For the case of large cargo volume, the present invention provides effective strategies to optimize the allocation and scheduling of goods. Through intelligent algorithms and data analysis, multiple target flights are comprehensively determined, and the goods are reallocated according to the situation of each flight to achieve the optimal result of logistics duration. The present invention can reasonably arrange the loading of goods, ensure the maximum utilization of the cargo capacity of the flight, and avoid delays or additional costs caused by overloading of goods. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0028] Figure 1 is a schematic flow chart of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0029] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0030] Please refer to Figure 1 shown, the present invention is a method for cargo management in air logistics, including the following steps:

[0031] Taking the current moment 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 a preset distance as the radius, and select several cargo airports within the circle and mark them as undetermined airports;

[0032] Obtain all the cargoes to be transported with the same undetermined airport list, mark them as the same batch of cargoes, respectively collect the departure and arrival times of the earliest cargo flights between the departure airport and any undetermined airport, and calculate the expected durations Ta1, Ta2,..., Ta of the cargoes to be transported to any undetermined airport according to the departure and arrival times n , where n represents the number of undetermined airports;

[0033] Count the number m of sorting centers corresponding to all goods in the same batch. Respectively count all freight routes between any pending airport and all sorting centers. Calculate the corresponding predicted transportation duration according to the speed limit value and distance of each section in each freight route after screening. Mark several freight routes with the shortest predicted transportation duration for each pending airport as pending routes, and screen the pending routes according to the nuisance index to obtain optimal routes. Mark the transportation durations of all optimal routes as Tb1, Tb2,..., Tb nm ;

[0034] Respectively calculate the sum of the expected duration and the transportation duration from any pending airport to all sorting centers, which is the overall transportation duration. Select the maximum overall transportation duration corresponding to any pending airport. Determine the pending airport with the shortest maximum overall transportation duration as the target airport for this batch of goods, and determine the earliest freight flight corresponding to the target airport 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 goods reach the destination in the fastest way, reduce the in-transit time 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 goods in the same batch exceeds the cargo capacity of the current target flight, the determined target flight is excluded, and the next freight flights from the current departure airport to the pending airports are obtained as a new alternative sequence of the earliest freight flights. Recalculate the new target airport and target flight according to the departure and arrival times of the new batch of earliest freight flights until all the goods in the same batch are assigned to the corresponding freight flights.

[0037] In another preferred embodiment of the present invention, when there are more than one target flight, the process of distributing the goods in the same batch is as follows:

[0038] Taking the current moment t0 as the standard, obtain the real-time overall transportation durations T'b1, T'b2,..., T'b between the newly calculated target airport and all sorting centers nm , and compare the real-time overall transportation durations with the original overall transportation durations Tb1, Tb2,..., Tb between the target airport and all sorting centers nm . If there exists T'b i less than the corresponding Tb i , i ∈ 1, 2,..., nm, then load the goods in the same batch corresponding to the sorting center of Tb i onto the target flight corresponding to the newly generated target airport.

[0039] In the case of large - volume goods, the present invention provides effective strategies to optimize the allocation and scheduling of goods. Through intelligent algorithms and data analysis, the present invention can reasonably arrange the loading of goods, ensure the maximum utilization of the cargo capacity of flights, and avoid delays or additional costs caused by overloading of goods.

[0040] In another preferred embodiment of the present invention, the expected duration is the sum of the duration t1 between the current moment and the take - off time of the earliest freight flight, and the flight duration t2.

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

[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 duration according to the freight distance and the speed limit value. If there are sections with different speed limit values on the route, calculate the section duration according to the distance and speed limit value of each section respectively, and add up the section durations to obtain the predicted transportation duration.

[0043] In another preferred embodiment of the present invention, the screening process of the nuisance index for a to - be - determined route is as follows:

[0044] Set the noise impact range of the freight vehicle according to the vehicle type, count all specific areas passed through in the to - be - determined route. The specific areas include but are not limited to schools, hospitals, and residential communities, and frame out the buildings located within the noise impact range from the specific areas, count the number and floors of the buildings, mark the ratio of the product of the number and floors of the buildings to the route length as the nuisance index, and mark the to - be - determined route with the lowest nuisance index as the preferred route.

[0045] It should be noted that the calculation process of the noise impact range is as follows:

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

[0047]

[0048] By obtaining the driving noise decibel value dB1 of the freight vehicle and the legal noise standard value dB2 corresponding to the current driving period, calculating the difference ΔdB, and calculating the noise impact range r based on this, the present invention can more accurately evaluate the noise impact of the freight vehicle on the surrounding environment;

[0049] According to the noise influence range, and by counting the number and floors of buildings passing through a specific area, the ratio of the product of the number and floors of buildings to the route length is marked as the nuisance index. The present invention preferentially considers the route with a low nuisance index, thereby reducing the noise impact on surrounding residents and schools. By selecting a route with less noise impact, logistics companies can demonstrate their attention to environmental protection and social responsibility, enhancing the public's recognition and support for their operations.

[0050] The above has described an embodiment of the present invention in detail, but the content described is only the preferred embodiment of the present invention and cannot be considered as defining the scope of implementation of the present invention. All equivalent changes and improvements made according to the scope of the present invention application should still fall within the patent coverage scope of the present invention.

Claims

1. A cargo management method for air logistics, characterized in that, It includes the following steps: Taking the current moment t0 as the standard, obtain the target address of any goods to be transported at the current departure airport, obtain the address of the sorting center in the area where the target address is located, use the address of the sorting center as the center of a circle, and use the preset distance as the radius to draw a circle. Select several freight airports within the circle and mark them as undetermined airports; Retrieve all goods to be transported with the same list of airports to be determined, mark them as goods in the same batch, respectively collect the departure and arrival times of the earliest freight flights between the departure airport and any airport to be determined, and calculate the expected durations Ta1, Ta2,..., Ta for the goods to be transported to reach any airport to be determined based on the departure and arrival times. n , where n represents the number of airports to be determined; Count the number \(m\) of sorting centers corresponding to all goods in the same batch. Respectively count all freight routes between any undetermined airport and all sorting centers. Calculate the corresponding predicted transportation duration according to the speed limit value and distance of each section in each freight route after screening. Mark several freight routes with the shortest predicted transportation duration for each undetermined airport as undetermined routes, and screen the undetermined routes according to the nuisance index to obtain the optimal routes. Mark the transportation durations of all optimal routes as \(T_b\) in turn 11 , \(T_b\) 12 ,..., \(T_b\) 1m ,..., \(T_b\) nm ; Calculate the sum of the expected duration and the transportation duration for passing through any undetermined airport and reaching all sorting centers via the optimal route, which is the total transportation duration. Select the maximum total transportation duration corresponding to any undetermined airport, determine the undetermined airport with the shortest maximum total transportation duration as the target airport for this batch of goods, and determine the earliest freight flight corresponding to the target airport as the target flight; The specific screening process of the nuisance index for the undetermined route is as follows: Set the noise impact range of the freight vehicle according to the vehicle type, count all specific areas passed through in the undetermined route. The specific areas include, but are not limited to, schools, hospitals, and residential communities, and select the buildings located within the noise impact range from the specific areas. Count the number and number of floors of the buildings, and mark the ratio of the product of the number and number of floors of the buildings to the route length as the nuisance index. Mark the undetermined route with the lowest nuisance index as the optimal route; The calculation process of the noise impact range is as follows: Obtain the driving noise decibel value dB1 of the freight vehicle and the legal noise standard value dB2 corresponding to the current driving period, calculate the difference ΔdB between dB1 and dB2, then the calculation formula for the noise impact range r is:

2. The goods management method for air logistics according to claim 1, characterized in that, When the volume of this batch of goods exceeds the load capacity of the current target flight, then exclude the already determined target flight, obtain the next freight flights of the current departure airport and the undetermined airports as the alternative sequence of the new earliest freight flight, and recalculate the new target airport and target flight according to the departure and arrival times of the new batch of earliest freight flights until all the goods in this batch are assigned to the corresponding freight flights.

3. A cargo management method for air logistics according to claim 2, characterized in that, When there are more than one target flights, the process of distributing the goods in this batch is as follows: Taking the current moment t0 as the standard, obtain the real-time total transportation duration for passing through the target airport and reaching all sorting centers calculated newly. Compare the real-time total transportation duration with the total transportation duration from the originally determined target airport to all sorting centers. If there is any sorting center corresponding to a real-time total transportation duration less than the originally determined total transportation duration, then load the goods in this batch of the sorting center onto the target flight corresponding to the newly generated target airport.

4. A cargo management method for air logistics according to claim 1, characterized in that The expected duration is the sum of the duration t1 between the current moment and the take-off time of the earliest freight flight and the flight duration t2.

5. A cargo management method for air logistics according to claim 1, characterized in that, The calculation process of the predicted transportation duration is as follows: 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 duration according to the freight distance and the speed limit value. If there are multiple sections with different speed limit values on the route, calculate the section duration according to the distance and speed limit value of each section respectively, and add the section durations to obtain the predicted transportation duration.

Images