The middle of the specified node set of shortest path algorithm
The vast majority of researches about the shortest path algorithm, nowadays, focus just on the case starting from the beginning point and ending at the ending point. If additional condition that the shortest path must go through some given nodes of which number is uncertain must be met, then most of the existing classic algorithms are not applicable. A general method based on the Virus Co Evolutionary Genetic algorithm and greedy algorithm is presented to solve this kind of problem. The time complexity of the algorithm is given by theoretical analysis and the effectiveness of the algorithm is verified by programming calculation. Furthermore, this algorithm in HUAWEI Code Craft 2016 makes 17th score in preliminary to the semi finals.
2016 IEEE 13th International Conference on Signal Processing (ICSP)