Optimization solution method for transportation problem based on K-Means clustering and genetic algorithm

Abstract

The invention provides an optimization solution method for transportation problem based on K-Means clustering and a genetic algorithm. The method comprises the following steps: S1, setting parameters:clustering center population size N, iteration times T, production place number m and sales place number n; S2, firstly, setting m production places and n sales places through a map obtained by an ArcGIS Pro platform, and clustering the sales places by utilizing KMeans; S3, initializing a population, and calculating a cost matrix C through an intelligent hybrid algorithm; S4, setting the number of iterations; S5 randomly pairing the individuals in the population to form N / 2 male parent pairs; S6: performing crossover operation. The invention is different from a traditional linear programmingsolution, the K-Means algorithm is adopted to cluster the data, the K-Means algorithm can process image and text features, high stability and scalability are achieved, a data set in a numerical form can be processed, and the clustering effect is good.

Description

technical field [0001] The invention relates to the technical fields of computer data information processing, geographic information system, network data analysis and graph theory, and in particular relates to an optimal solution method device for transportation problems based on K-Means clustering and genetic algorithm. Background technique [0002] In recent years, the rapid development of the Internet has gradually led to the prosperity and development of the logistics and transportation industry. How to allocate transportation routes so that the transportation tasks can be completed at the same time, the transportation cost can be minimized, and the time efficiency can be maximized. problems that will be encountered. Therefore, how to optimize the logistics transportation system and transportation mode to make the transportation process more scientific and efficient, and to find the optimal solution for transportation can enable both parties to achieve a win-win cooperat...

AI Technical Summary

Problems solved by technology

[0003] As a special kind of linear programming problem, the transportation problem has a wide range of applications. However, the traditional transportation optimization method is cumbersome and cumbersome, and with the increase of the dimension, the time complexity and space complexity of the traditional algorithm will decrease. exponential growth

For example, the traditional table-based operation method, the solution process is relatively cumbersome, and it is based on the premise of production-sales balance transportation problem

However, transportation problems in real life are often affected by many factors.

Images