1）先进先出页面置换算法（FIFO） 2）最近最久未使用页面置换算法（LRU） 3）最佳置换页面置换算法（OPT）-1) FIFO page replacement algorithm (FIFO) 2) lack of use the most recent page replacement algorithm (LRU) 3) replacement of the best page replacement algorithm (OPT)

My initial attempt of porting the FreeRTOS Demo was considerably a success. But later on, I found out that the version used of STM32 standard peripheral library was already obsolete. And so I didn t anymore continue with that. In stead, I opt to use

Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.

Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.