A method for optimizing international logistics routes

Abstract

The present invention relates to the technical field of route optimization, and in particular, to an international logistics route optimization method. The method comprises the following steps: obtaining international logistics information, customer needs and other information, then taking the information of the starting place and the destination from the obtained cargo information and planning the route, and then selecting the mode of transportation according to the obtained cargo information and the combined best shortest transportation route. The present invention optimizes the best transportation route according to the other information obtained and the planned route data, and optimizes the shortest transportation route according to the other information obtained and the planned route data, and then combines the best shortest transportation route according to the optimized best transportation route data and the optimized shortest transportation route data, and combines the advantages of the shortest route and the advantages of the best route, so as to ensure a shorter transportation time and a lower route cost, reduce transportation costs, enhance the reliability and flexibility of the transportation route, and improve the overall transportation efficiency.

Description

Technical Field

[0001] The present invention relates to the technical field of route optimization, and in particular to an international logistics route optimization method. Background Art

[0002] International logistics path optimization refers to the use of advanced information technology and logistics management methods to model and analyze the nodes, paths, and resources of the international logistics network to achieve optimization and management of international logistics transportation paths. International logistics path optimization can help logistics companies and enterprises optimize international logistics transportation paths, improve transportation efficiency, reduce costs, enhance competitiveness and customer satisfaction. Through path management and optimization, it helps to promote the development of international trade and the modernization of the logistics industry. When optimizing the path when obtaining data on cargo information, transportation time, and road conditions, the path optimization design used is unreasonable, and various constraints and variables cannot be effectively considered, causing deviations in the optimized path, resulting in unreliable generated paths. Due to the unreliability of the optimized path, the goods will be sent to the wrong destination, affecting the normal logistics transportation process and greatly increasing transportation costs. In order to avoid the reduction in the reliability of the optimized path due to the unreasonable path optimization design used, we provide an international logistics path optimization method. Summary of the invention

[0003] The purpose of the present invention is to provide an international logistics path optimization method to solve the problems raised in the above background technology.

[0004] To achieve the above object, the present invention provides an international logistics route optimization method, comprising the following method steps:

[0005] S1. Obtain international logistics information, customer needs and other information, then take the information of the origin and destination from the acquired cargo information and plan the route, optimize the best transportation route and the shortest transportation route based on other information and the planned route data, and then combine the best and shortest transportation routes based on the optimized best transportation route data and the optimized shortest transportation route data;

[0006] S2. Analyze the path distance data using the combined best shortest transportation path data, and then select the transportation mode based on the acquired cargo information and the combined best shortest transportation path;

[0007] S3. Obtain the maximum load-bearing capacity of the transport vehicle through the selected transport vehicle, calculate the optimal cargo capacity based on the obtained cargo information and the maximum load-bearing capacity of the transport vehicle, and carry out international transportation. When a change in traffic conditions is detected, obtain the location information of the cargo at this time through GPS technology;

[0008] S4. Optimize the best transport path and the shortest transport path again based on the current location information, destination information, geographic information and the best shortest transport path data of the goods that have not been driven, and then combine the best shortest transport path again based on the optimized best transport path data and the optimized shortest transport path data.

[0009] As a further improvement of the technical solution, the S1 specifically comprises the following method steps:

[0010] S1.1. Obtain international logistics information, customer needs and other information. When obtaining customer demand information, prepare the goods according to the obtained customer demand information, mark the prepared goods as untransported, and then obtain the origin and destination information from the obtained goods information, and plan the route according to the obtained origin and destination information and geographic information;

[0011] S1.2. Use genetic algorithms to optimize the best transportation path based on other information obtained and planned path data, and use ant colony algorithms to optimize the shortest transportation path based on other information obtained and planned path data. Then use a comprehensive algorithm to combine multiple advantages based on the optimized best transportation path data and the optimized shortest transportation path data, and obtain the combined best shortest transportation path.

[0012] As a further improvement of the technical solution, the S2 specifically comprises the following method steps:

[0013] S2.1. Analyze the path distance data based on the other information obtained and the relevant cost information therein, and use the combined best shortest transportation path data to perform a simple cost calculation based on the analyzed path distance data, the relevant cost information taken and the obtained cargo information, and select the transportation mode based on the simply calculated cost data, the obtained cargo information and the combined best shortest transportation path;

[0014] S2.2. Select a means of transport according to the selected mode of transport, then analyze the cost and speed of the means of transport according to the selected means of transport, calculate the transportation cost based on the analyzed cost of the means of transport and the simplified cost, and then use the speed of the means of transport and the analyzed path distance data to calculate the estimated time.

[0015] As a further improvement of the technical solution, the transportation mode selected in S2.1 of S2 includes sea transportation, air transportation, land transportation and multimodal transportation;

[0016] Sea transportation: suitable for large quantities or large volumes of goods and goods that are not time-sensitive, including bulk cargo and container cargo;

[0017] Air transport: suitable for urgent or high-value, low-volume goods and goods with high timeliness requirements, including emergency medical supplies;

[0018] Land transport: including rail and road transport, suitable for short-distance or land transport between countries with suitable geographical locations;

[0019] Multimodal transport involves two or more modes of transport;

[0020] Combination of sea and land transport: When the combined optimal shortest transport route data is planned as a sea route plus a railway or road route, it is suitable for large quantities or large volumes of goods and goods that are not time-sensitive;

[0021] A combination of sea, land and air transport: When goods need to be transported from their source to different destinations around the world, a combination of sea, land and air transport is used.

[0022] As a further improvement of the technical solution, the S3 specifically comprises the following method steps:

[0023] S3.1. According to the acquired cargo information package, the quantity, weight, volume and type of cargo are obtained, and then the maximum load-bearing capacity of the transport vehicle is obtained through the selected transport vehicle according to the quantity, weight, volume and type of cargo taken, and the optimal cargo capacity is calculated using the quantity, weight, volume and type of cargo taken and the maximum load-bearing capacity of the transport vehicle, and then the cargo is allocated according to the calculated optimal cargo capacity and the transport vehicle. When the allocated cargo is completed, international transportation is carried out according to the combined optimal shortest transportation path data, and then the cargo is marked as transported;

[0024] S3.2. GPS technology can be used to monitor the location of transported goods in real time. During the transportation process based on the combined best shortest transportation path data, weather information, emergencies, traffic conditions, customs-related policies in other information are taken into account in real time. When changes in traffic conditions are detected, it is detected that a mudslide has occurred in the combined best shortest transportation path data where the selected means of transport is about to pass, and the location information of the goods at this time is obtained through GPS technology.

[0025] As a further improvement of the technical solution, the S4 comprises the following method steps:

[0026] S4. Utilize a genetic algorithm to optimize the best transportation path again based on the current location information, destination information, geographic information and the best shortest transportation path data that has not been driven, and utilize an ant colony algorithm to optimize the shortest transportation path again based on the current location information, destination information, geographic information and the best shortest transportation path data that has not been driven. Then utilize a comprehensive algorithm to combine multiple advantages again based on the optimized best transportation path data and the optimized shortest transportation path data, and obtain the best shortest transportation path that has been combined again. Then dynamically adjust the path based on the best shortest transportation path data that has been combined again, and transport based on the best shortest transportation path data that has been combined again, until the goods are delivered to the destination, and the goods are marked as delivered.

[0027] As a further improvement of the technical solution, the implementation steps of optimizing the best transportation path by using a genetic algorithm in S1.2 of S1 are as follows:

[0028] Step ①: First, encode each possible transportation path into a chromosome. Each chromosome consists of a series of genes, each gene represents a path node or transportation decision point. Then, generate the initial population based on the path nodes or transportation decision points. Usually, a random generation method is used. The population size usually depends on the complexity of the problem and the computing resources.

[0029] Step 2: Collect weather information Traffic conditions 、Emergency , fuel costs , Port data , customs duties and fees Factor data, based on the planned path to get the actual geographical distance Factor data, and then according to the emergency situation and weather information Get transport reliability ;

[0030] Step 3: According to weather information Traffic conditions and emergencies The factor data is used to obtain the weight coefficient , these involve factors related to the transportation process, based on fuel costs , Port data , customs duties and fees The factor data is used to obtain the weight coefficient , these factors involve fees and costs, based on actual geographical distance The factor data is used to obtain the weight coefficient , and then according to the transport reliability Get the weight coefficient ;

[0031] Step 4: Use weather information , Traffic conditions 、Emergency , fuel costs , Port data , customs duties and fees , Actual geographical distance and transport reliability Factor data and weight coefficients , , , Evaluate the fitness and obtain the evaluated fitness , the specific algorithm formula is:

[0032] ;

[0033] Step ⑤: Select individuals with higher assessed fitness from the current population for reproduction. Common selection methods include roulette selection and tournament selection. Then, perform crossover operations based on the results of reproduction and generate new individuals, which refer to chromosomes. Finally, the termination condition is reached and the generated new individuals are the optimized best transport path.

[0034] As a further improvement of the technical solution, the implementation steps of optimizing the shortest transportation path by using the ant colony algorithm in S1.2 of S1 are as follows:

[0035] Step 1: First, define the pheromone matrix, which represents the To Node The pheromone concentration is defined, and the heuristic information matrix is ​​defined, which represents the pheromone concentration from node To Node Heuristic information, usually the inverse distance of the path;

[0036] Step 2: Based on actual geographical distance Refers to the node To Node The actual geographical distance of the node The weather information influence coefficient , get the node Traffic condition influence coefficient , get the node The impact coefficient of emergencies , get the node Port data impact coefficient , get node The impact coefficient of customs-related policies ;

[0037] Step 2: Use actual geographical distance , Weather information influence coefficient , Traffic condition influence coefficient 、Emergency impact coefficient , Port data impact coefficient and the impact coefficient of customs-related policies Calculate the heuristic information value and obtain the calculated heuristic information value , the specific algorithm formula is:

[0038] ;

[0039] Step 3: Obtain the importance of pheromones based on the pheromone matrix , according to the heuristic information matrix, the importance of the heuristic information is obtained , and then extract the cities that pass through according to the optimized best transportation route, and then integrate the extracted cities into a data set , Refers to the first city passed by the optimized best transportation route. Refers to the first cities;

[0040] Step 4: Based on the data set Sum the cities in the table to get the summed city data , and then obtain the pheromone value according to the pheromone matrix , using the summed city data The importance of pheromones , the importance of inspiration information and the calculated heuristic information value Calculate the shortest transportation path and obtain the calculated shortest transportation path , the specific algorithm formula is:

[0041] .

[0042] Compared with the prior art, the present invention has the following beneficial effects:

[0043] The international logistics path optimization method optimizes the best transportation path according to other information obtained and planned path data, and optimizes the shortest transportation path according to other information obtained and planned path data, and then combines the best shortest transportation path according to the optimized best transportation path data and the optimized shortest transportation path data. Combining the advantages of the shortest path and the advantages of the best path, it can ensure a shorter transportation time and lower path cost, reduce transportation costs, enhance the reliability and flexibility of the transportation path, and improve overall transportation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 It is a flowchart of the overall steps of the present invention. DETAILED DESCRIPTION

[0045] The following will be combined with the accompanying drawings in 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.

[0046] Example 1: The present invention provides an international logistics route optimization method, please refer to Figure 1 , comprising the following method steps:

[0047] S1. Obtain international logistics information, customer needs and other information, then take the information of the origin and destination from the acquired cargo information and plan the route, optimize the best transportation route and the shortest transportation route based on other information and the planned route data, and then combine the best and shortest transportation routes based on the optimized best transportation route data and the optimized shortest transportation route data;

[0048] The S1 specifically includes the following steps:

[0049] S1.1. Obtain international logistics information, customer needs and other information. The international logistics information obtained includes the name, specifications, quantity, weight, volume, type, origin and destination, and transportation status of the goods. Customer needs include time requirements and cargo safety requirements. Other information includes weather information, emergencies, traffic conditions, port data, customs-related policies, related costs (fuel costs, customs duties, customs clearance and document costs, transportation insurance, cargo packaging and handling costs), and geographic information (land routes, sea routes, and air routes). When customer demand information is obtained, prepare the goods according to the obtained customer demand information, and mark the prepared goods as untransported. Then, take the origin and destination information from the obtained cargo information, and plan the route based on the taken origin and destination information and geographic information, which can help determine the best land, sea, and air routes to achieve the most efficient transportation. Such planning can take into account factors such as traffic flow, road conditions, weather conditions, and terrain to ensure that the selected route is the safest, most economical, and fastest.

[0050] S1.2. Genetic algorithms are used to optimize the best transportation path based on other information obtained and planned path data. Geographic information and port data can be used to optimize path planning, select the best transportation mode and node, maximize the use of transportation resources, improve transportation efficiency and reduce costs. Ant colony algorithms are used to optimize the shortest transportation path based on other information obtained and planned path data. Through shortest path planning, transportation resources can be maximized, resource waste can be avoided, and transportation efficiency and economic benefits can be improved. A comprehensive algorithm is then used to combine multiple advantages based on the optimized best transportation path data and the optimized shortest transportation path data, and the combined best shortest transportation path is obtained. By combining the best (efficiency and cost considerations) and shortest (distance and time considerations) path optimization, the best balance between transportation cost and time can be achieved, ensuring the optimal solution between economy and speed, and achieving a balance between efficiency and cost.

[0051] The implementation steps of optimizing the best transportation path by using genetic algorithm in S1.2 of S1 are as follows:

[0052] Step ①: First, encode each possible transportation path into a chromosome. Each chromosome consists of a series of genes, each gene represents a path node or transportation decision point. Then, generate the initial population based on the path nodes or transportation decision points. Usually, a random generation method is used. The population size usually depends on the complexity of the problem and the computing resources.

[0053] Step 2: Collect weather information Traffic conditions 、Emergency , fuel costs , Port data , customs duties and fees Factor data, based on the planned path to get the actual geographical distance Factor data, and then according to the emergency situation and weather information Get transport reliability ;

[0054] Step 3: According to weather information Traffic conditions and emergencies The factor data is used to obtain the weight coefficient , these involve factors related to the transportation process, based on fuel costs , Port data , customs duties and fees The factor data is used to obtain the weight coefficient , these factors involve fees and costs, based on actual geographical distance The factor data is used to obtain the weight coefficient , and then according to the transport reliability Get the weight coefficient ;

[0055] Step 4: Use weather information , Traffic conditions 、Emergency , fuel costs , Port data , customs duties and fees , Actual geographical distance and transport reliability Factor data and weight coefficients , , , Evaluate the fitness and obtain the evaluated fitness , the specific algorithm formula is:

[0056] ;

[0057] This formula is used to evaluate fitness, taking into account factors such as traffic conditions and actual geographical distance, which helps to improve transportation efficiency. By evaluating these factors, more optimized transportation routes and plans can be selected, thereby improving overall transportation efficiency.

[0058] Step ⑤: Select individuals with higher fitness from the current population for reproduction. Common selection methods include roulette selection and tournament selection. Then, perform crossover operations based on the results of reproduction and generate new individuals, which refer to chromosomes. Finally, the termination condition is reached and the generated new individuals are the optimized best transportation paths. The termination condition can be reaching a predetermined number of iterations or the fitness of the population is no longer significantly improved.

[0059] Example:

[0060] Assume we have a transportation route with 5 nodes, an example of optimization using genetic algorithm:

[0061] Encoding: Each path is encoded as a chromosome, such as [1,3,2,5,4];

[0062] Initialize the population: generate 10 initial paths;

[0063] Fitness calculation: Calculate the fitness of each path;

[0064] Selection: select the path with high fitness, such as roulette wheel selection;

[0065] Cross: Perform cross operation on the selected path to generate a new path;

[0066] Mutation: perform mutation operations on some new paths;

[0067] Update the population: replace the old path with the new path;

[0068] Check the termination conditions: such as 100 iterations or no further improvement in fitness.

[0069] The implementation steps of optimizing the shortest transportation path by using the ant colony algorithm in S1.2 of S1 are as follows:

[0070] Step 1: First, define the pheromone matrix, which represents the To Node The pheromone concentration is defined, and the heuristic information matrix is ​​defined, which represents the pheromone concentration from node To Node Heuristic information, usually the inverse distance of the path;

[0071] Step 2: Based on actual geographical distance Refers to the node To Node The actual geographical distance of the node The weather information influence coefficient , get the node Traffic condition influence coefficient , get the node The impact coefficient of emergencies , get the node Port data impact coefficient , get node The impact coefficient of customs-related policies ;

[0072] Step 2: Use actual geographical distance , Weather information influence coefficient , Traffic condition influence coefficient 、Emergency impact coefficient , Port data impact coefficient and the impact coefficient of customs-related policies Calculate the heuristic information value and obtain the calculated heuristic information value , the specific algorithm formula is:

[0073] ;

[0074] This formula is used to calculate the nodes in the heuristic information matrix To Node The heuristic information value can be used in path planning, logistics optimization, risk assessment and other fields to help decision makers choose the best path or plan;

[0075] Step 3: Obtain the importance of pheromones based on the pheromone matrix , according to the heuristic information matrix, the importance of the heuristic information is obtained , and then extract the cities that pass through according to the optimized best transportation route, and then integrate the extracted cities into a data set , Refers to the first city passed by the optimized best transportation route. Refers to the first cities;

[0076] Step 4: Based on the data set Sum the cities in the table to get the summed city data , and then obtain the pheromone value according to the pheromone matrix , using the summed city data The importance of pheromones , the importance of inspiration information and the calculated heuristic information value Calculate the shortest transportation path and obtain the calculated shortest transportation path , the specific algorithm formula is:

[0077] ;

[0078] This formula is used to optimize the transportation path to find the shortest transportation path;

[0079] The implementation steps of combining multiple advantages using comprehensive algorithms are as follows:

[0080] Step 1: Integrate the optimized best transport path data and the optimized shortest transport path data into the same data set, ensure the consistency of data format and fields, and determine the weight of each indicator according to actual needs and priorities, including actual geographical distance and required time;

[0081] Step 2: Use fuzzy comprehensive evaluation to comprehensively evaluate the optimized best transportation path data and the optimized shortest transportation path data, and generate a comprehensive score. Then, according to the comprehensive score, select the path with the highest score as the combined best shortest transportation path.

[0082] S2. Analyze the path distance data using the combined best shortest transportation path data, and then select the transportation mode based on the acquired cargo information and the combined best shortest transportation path;

[0083] The S2 specifically includes the following steps:

[0084] S2.1. Analyze the path distance data based on the other information obtained and the relevant cost information therein, and use the combined best shortest transportation path data to perform a simple cost calculation based on the analyzed path distance data, the relevant cost information taken and the obtained cargo information, and select the transportation mode based on the simply calculated cost data, the obtained cargo information and the combined best shortest transportation path;

[0085] The modes of transport selected in S2.1 of S2 include sea transport, air transport, land transport and multimodal transport;

[0086] Sea transportation: suitable for large quantities or large volumes of goods and goods that are not time-sensitive, including bulk cargo and container cargo;

[0087] Air transport: suitable for urgent or high-value, low-volume goods and goods with high timeliness requirements, including emergency medical supplies;

[0088] Land transport: including rail and road transport, suitable for short-distance or land transport between countries with suitable geographical locations;

[0089] Multimodal transport includes two (sea and land transport combined) or more (sea, land and air transport combined) modes of transport;

[0090] Combination of sea and land transport: When the combined optimal shortest transport route data is planned as a sea route plus a railway or road route, it is suitable for large quantities or large volumes of goods and goods that are not time-sensitive;

[0091] A combination of sea, land and air transport: When goods need to be transported from their source to different destinations around the world, a combination of sea, land and air transport is used. For example, the goods are first transported to the port of the destination country by sea, then transported to inland cities by land, and finally quickly delivered to the final destination by air.

[0092] S2.2. Select a means of transport according to the selected mode of transport, then analyze the cost and speed of the means of transport according to the selected means of transport, and calculate the transportation cost based on the analyzed means of transport cost and the simplified cost (the calculated transportation cost is obtained by adding the analyzed means of transport cost to the simplified cost), and then calculate the estimated time using the speed of the means of transport and the analyzed path distance data (the calculated estimated time is obtained by dividing the analyzed path distance data by the speed of the means of transport).

[0093] S3. Obtain the maximum load-bearing capacity of the transport vehicle through the selected transport vehicle, calculate the optimal cargo capacity based on the obtained cargo information and the maximum load-bearing capacity of the transport vehicle, and carry out international transportation. When a change in traffic conditions is detected, obtain the location information of the cargo at this time through GPS technology;

[0094] The S3 specifically includes the following steps:

[0095] S3.1. According to the acquired cargo information package, the quantity, weight, volume and type of cargo are obtained, and then the maximum load-bearing capacity of the transport vehicle is obtained through the selected transport vehicle according to the quantity, weight, volume and type of cargo taken, and the optimal cargo capacity is calculated using the quantity, weight, volume and type of cargo taken and the maximum load-bearing capacity of the transport vehicle, and then the cargo is allocated according to the calculated optimal cargo capacity and the transport vehicle. When the allocated cargo is completed, international transportation is carried out according to the combined optimal shortest transportation path data, and then the cargo is marked as transported;

[0096] S3.2. GPS technology can be used to monitor the location of transported goods in real time. The data provided by this GPS technology can help logistics companies ensure the safety of goods and take prompt action when necessary. In the process of transportation based on the combined best shortest transportation path data, other information such as weather information, emergencies, traffic conditions, and customs policies are taken in real time. When changes in traffic conditions are detected, it is detected that a mudslide will occur in the combined best shortest transportation path data where the selected transportation tool is about to pass, and the location information of the goods at this time is obtained through GPS technology;

[0097] S4, re-optimizing the best transportation path and the shortest transportation path according to the current location information, destination information, geographic information and the best shortest transportation path data of the goods, and then re-optimizing the best shortest transportation path according to the optimized best transportation path data and the optimized shortest transportation path data;

[0098] The S4 specifically includes the following steps:

[0099] S4. Utilize a genetic algorithm to optimize the best transportation path again based on the current location information, destination information, geographic information and the best shortest transportation path data that has not been driven, and utilize an ant colony algorithm to optimize the shortest transportation path again based on the current location information, destination information, geographic information and the best shortest transportation path data that has not been driven. Then utilize a comprehensive algorithm to combine multiple advantages again based on the optimized best transportation path data and the optimized shortest transportation path data, and obtain the best shortest transportation path that has been combined again. Then dynamically adjust the path based on the best shortest transportation path data that has been combined again, and transport based on the best shortest transportation path data that has been combined again, until the goods are delivered to the destination, and the goods are marked as delivered.

[0100] The above shows and describes the basic principles, main features and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited by the above embodiments. The above embodiments and descriptions are only preferred examples of the present invention and are not intended to limit the present invention. Without departing from the spirit and scope of the present invention, the present invention may have various changes and improvements, which fall within the scope of the present invention. The scope of protection of the present invention is defined by the attached claims and their equivalents.

Claims

1. A method for optimizing international logistics routes, characterized in that: The method comprises the following steps: S1. Obtain international logistics information, customer needs and other information, then take the information of the origin and destination from the acquired cargo information and plan the route, optimize the best transportation route and the shortest transportation route based on other information and the planned route data, and then combine the best and shortest transportation routes based on the optimized best transportation route data and the optimized shortest transportation route data; S2. Analyze the path distance data using the combined best shortest transportation path data, and then select the transportation mode based on the acquired cargo information and the combined best shortest transportation path; S3. Obtain the maximum load-bearing capacity of the transport vehicle through the selected transport vehicle, calculate the optimal cargo capacity based on the obtained cargo information and the maximum load-bearing capacity of the transport vehicle, and carry out international transportation. When a change in traffic conditions is detected, obtain the location information of the cargo at this time through GPS technology; S4, re-optimizing the best transportation path and the shortest transportation path according to the current location information, destination information, geographic information and the best shortest transportation path data of the goods, and then re-optimizing the best shortest transportation path according to the optimized best transportation path data and the optimized shortest transportation path data; The S1 specifically includes the following steps: S1.

1. Obtain international logistics information, customer needs and other information. When obtaining customer demand information, prepare the goods according to the obtained customer demand information, mark the prepared goods as untransported, and then obtain the origin and destination information from the obtained goods information, and plan the route according to the obtained origin and destination information and geographic information; Geographic information includes land paths, sea paths, and air paths; S1.

2. Optimize the best transportation path based on other information obtained and planned path data using genetic algorithms, and optimize the shortest transportation path based on other information obtained and planned path data using ant colony algorithms, and then use comprehensive algorithms to combine multiple advantages based on the optimized best transportation path data and the optimized shortest transportation path data, and obtain the combined best shortest transportation path; achieve the best balance between transportation cost and time by combining the best transportation path considering efficiency and cost and the shortest transportation path considering distance and time to ensure the best solution between economy and speed, and achieve a balance between efficiency and cost; The S2 specifically includes the following steps: S2.

1. Analyze the path distance data based on the other information obtained and the relevant cost information therein, and use the combined best shortest transportation path data to perform a simple cost calculation based on the analyzed path distance data, the relevant cost information taken and the obtained cargo information, and select the transportation mode based on the simply calculated cost data, the obtained cargo information and the combined best shortest transportation path; Related costs include fuel costs, customs duties, customs clearance and documentation fees, shipping insurance, cargo packaging and handling fees; S2.2, select a transport tool according to the selected transport mode, then analyze the cost and speed of the transport tool according to the selected transport tool, calculate the transport cost according to the analyzed transport tool cost and the simplified cost, and then calculate the estimated time using the speed of the transport tool and the analyzed path distance data; The transportation mode selected in S2.1 of S2 includes sea transportation, air transportation, land transportation and multimodal transportation; Sea transportation: suitable for large quantities or large volumes of goods and goods that are not time-sensitive, including bulk cargo and container cargo; Air transport: suitable for urgent or high-value, low-volume goods and goods with high timeliness requirements, including emergency medical supplies; Land transport: including rail and road transport, suitable for short-distance or land transport between countries with suitable geographical locations; Multimodal transport involves two or more modes of transport; Combination of sea and land transport: When the combined optimal shortest transport route data is planned as a sea route plus a railway or road route, it is suitable for large quantities or large volumes of goods and goods that are not time-sensitive; A combination of sea, land and air transport: When goods need to be transported from the source to different destinations around the world, a combination of sea, land and air transport is used; The S3 specifically includes the following steps: S3.

1. According to the acquired cargo information package, the quantity, weight, volume and type of cargo are obtained, and then the maximum load-bearing capacity of the transport vehicle is obtained through the selected transport vehicle according to the quantity, weight, volume and type of cargo taken, and the optimal cargo capacity is calculated using the quantity, weight, volume and type of cargo taken and the maximum load-bearing capacity of the transport vehicle, and then the cargo is allocated according to the calculated optimal cargo capacity and the transport vehicle. When the allocated cargo is completed, international transportation is carried out according to the combined optimal shortest transportation path data, and then the cargo is marked as transported; S3.

2. GPS technology can be used to monitor the location of the transported goods in real time. During the transportation process based on the combined best shortest transportation path data, weather information, emergencies, traffic conditions, customs-related policies in other information are taken in real time. When changes in traffic conditions are detected, it is detected that a mudslide has occurred in the combined best shortest transportation path data where the selected transportation vehicle is about to pass, and the location information of the goods at this time is obtained through GPS technology; The S4 specifically includes the following steps: S4, using a genetic algorithm to optimize the best transportation path again based on the current location information, destination information, geographic information and the best shortest transportation path data of the goods that have not been driven, and using an ant colony algorithm to optimize the shortest transportation path again based on the current location information, destination information, geographic information and the best shortest transportation path data of the goods that have not been driven, and then using a comprehensive algorithm to combine multiple advantages again based on the optimized best transportation path data and the optimized shortest transportation path data, and obtain the best shortest transportation path that has been combined again, and then dynamically adjust the path based on the best shortest transportation path data that has been combined again, and transport based on the best shortest transportation path data that has been combined again, until the goods are delivered to the destination, and the goods are marked as delivered; The implementation steps of optimizing the best transportation path by using genetic algorithm in S1.2 of S1 are as follows: Step ①: First, encode each possible transportation path into a chromosome. Each chromosome consists of a series of genes, each gene represents a path node or transportation decision point. Then, generate the initial population based on the path nodes or transportation decision points. Usually, a random generation method is used. The population size usually depends on the complexity of the problem and the computing resources. Step 2: Collect weather information Traffic conditions 、Emergency Fuel costs , Port data , customs duties and fees Factor data, based on the planned path to get the actual geographical distance Factor data, and then according to the emergency situation and weather information Get transport reliability ; Step 3: According to weather information Traffic conditions and emergencies The factor data is used to obtain the weight coefficient , these involve factors related to the transportation process, based on fuel costs , Port data , customs duties and fees The factor data is used to obtain the weight coefficient , these factors involve fees and costs, based on actual geographical distance The factor data is used to obtain the weight coefficient , and then according to the transport reliability Get the weight coefficient ; Step 4: Use weather information Traffic conditions 、Emergency , fuel costs , Port data , customs duties and fees , Actual geographical distance and transport reliability Factor data and weight coefficients , , , Evaluate the fitness and obtain the evaluated fitness , the specific algorithm formula is: ； Step ⑤: Select individuals with higher fitness from the current population for reproduction. Common selection methods include roulette selection and tournament selection. Then, perform crossover operations based on the results of reproduction and generate new individuals, which refer to chromosomes. Finally, the termination condition is reached and the generated new individuals are the optimized best transportation path. The process of optimization using genetic algorithm: Encoding: Each path is encoded as a chromosome; Initialize the population: generate the initial path; Fitness calculation: Calculate the fitness of each path; Selection: Select the path with high fitness; Cross: Perform cross operation on the selected path to generate a new path; Mutation: perform mutation operations on some new paths; Update the population: replace the old path with the new path; Check termination conditions; The implementation steps of optimizing the shortest transportation path by using the ant colony algorithm in S1.2 of S1 are as follows: Step 1: First, define the pheromone matrix, which represents the To Node The pheromone concentration is defined, and the heuristic information matrix is ​​defined, which represents the pheromone concentration from node To Node Heuristic information, usually the inverse distance of the path; Step 2: Based on actual geographical distance Refers to the node To Node The actual geographical distance of the node The weather information influence coefficient , get the node Traffic condition influence coefficient , get the node The impact coefficient of emergencies , get the node Port data impact coefficient , get node The impact coefficient of customs-related policies ; Step 3: Use actual geographic distance , Weather information influence coefficient , Traffic condition impact coefficient 、Emergency impact coefficient , Port data impact coefficient and the impact coefficient of customs-related policies Calculate the heuristic information value and obtain the calculated heuristic information value ; Step 4: Obtain the importance of pheromones based on the pheromone matrix , according to the heuristic information matrix, the importance of the heuristic information is obtained , and then extract the cities that pass through according to the optimized best transportation route, and then integrate the extracted cities into a data set , Refers to the first city passed by the optimized best transportation route. Refers to the first cities; Step 5: Based on the data set Sum the cities in the table to get the summed city data , and then obtain the pheromone value according to the pheromone matrix , using the summed city data The importance of pheromones , the importance of inspiration information and the calculated heuristic information value Calculate the shortest transportation path and obtain the calculated shortest transportation path .

Images