Programming VIP

Based on python language, the classical ant colony algorithm (ACO) is implemented to solve the vehicle path planning problem (MD) HFVRPTW) with constraints such as multi depot, heterogeneous fixed fleet and service time window. Previous information python implements six intelligent algorithms to solve CVRP problemspython implements seve ...

Graph algorithm (array version) 1.1 shortest path Dijkstra algorithm: Suppose the vertices are \ (V_0 to V_5 \) six points. There is no connection at the beginning, but the edge weights between the vertices that can reach each other are known. The step is to start searching from vertex 0 each time, find the point with the shortest distance fro ...

Why do you suddenly think of the algorithm to retrieve? The last time I seriously studied and reviewed the algorithm was three years ago. At that time, it was for school recruitment. After that, the algorithm seems to become less important. I just do a good job in front-end development, but when I become more and more skilled in business devel ...

Problem introduction Please find the minimum / maximum number of k in a pile of data. The title description is very simple. How many ideas do you have to realize it?     Solution 1 - simple sorting First of all, you can think of a very simple idea: sort the data from small to large, and take the first k numbers. Don't go into details, jus ...

1. Algorithm 1.1 dynamic planning 1.1. 1 simple topic 53. Maximum subsequence sum Given an integer array nums, find a continuous sub array with the largest sum (the sub array contains at least one element) and return its maximum sum. Method 1 /* Use f(i) to represent the "maximum sum of continuous subarrays" ending with the ...

This part does not pay attention to the derivation of Kalman filter, but only the function of Kalman filter [it is said that the derivation is difficult 😒😒， In short, this article is to explain the overall process of Kalman filter without the step-by-step derivation of tangled formula. After reading this part, you will know what Kalma ...

Lifting algorithm is a method to improve the accuracy of weak classification algorithm. This method first constructs a series of prediction functions, and then combines them into a prediction function in a certain way. Lifting algorithm is also a method to improve the accuracy of any given learning algorithm. It is an integrated algorithm. It ...

1, Background introduction 1.1 introduction to data set The Anime dataset used in this actual combat is PNG picture of "high definition animation character Avatar". The pictures are 64x64 color pictures, a total of 21551. The examples of the pictures are as follows: 1.2 model introduction The "generation countermeasure ...

Shortest path problem For the algorithm operation of related concepts, see This article. Only the codes of Dijkstra algorithm and Floyd algorithm are introduced here. Dijkstra algorithm BFS can find the shortest path length from a point to another point. Dijkstra algorithm is mainly to find the shortest path length from a point to all oth ...

Integrated learning To be exact, ensemble learning is not a real machine learning algorithm, at least it does not introduce any new learning algorithm in essence. The overall idea of ensemble learning is to complete the final task through multiple basic (weak) learners. Just as it used to be a single challenge between an algorithm and a proble ...