本文针对基本量子进化算法易陷于局部最优解的缺陷，提出一种改进的量子进化算法(QEA)。并结 合乡村邮路问题，对算法进行了测试，测试结果表明，改进算法在全局寻优能力和种群多样性方面比基本量子进化算法有所改进，表明该算法是求解乡村邮路问题的一种有效的算法。

实现n<15的最短遍历 Gord is training for a marathon. Behind his house is a park with a large network of jogging trails connecting water stations. Gord wants to find the shortest jogging route that travels along every trail at least once. Input Input consists of several test cases. The first line of input for each case contains two positive integers: n <= 15, the number of water stations, and m < 1000, the number of trails. For each trail, there is one subsequent line of input containing three positive integers: the first two, between 1 and n, indicating the water stations at the end points of the trail; the third indicates the length of the trail, in cubits. There may be more than one trail between any two stations; each different trail is given only once in the input; each trail can be travelled in either direction. It is possible to reach any trail from any other trail by visiting a sequence of water stations connected by trails. Gord's route may start at any water station, and must end at the same station. A single line containing 0 follows the last test case. Output

时间依赖网络相比传统网络模型有更广泛的应用领域，比如公交网络和通信网络都可以抽象成为时间依赖的网络模型。当模型中弧的访问代价为时间依赖的变量时，中国邮路问题的求解将变得非常困难。首先分析了传统的中国邮路问题求解算法，如奇偶图上作业法和Edmonds＆Johnson算法，以及不能有效求解时间依赖中国邮路问题的根本原因；其次给出了一般时变无向中国邮路问题的特性，并在此基础上设计了该问题的分支限界最优化算法；然后针对FIFO（First In First Out）这一类特殊时变网络，设计了新的剪枝条件，从而得到

在用“奇偶点图上作业法”求解“中国邮路问题”时,需检查图中的每一个回路。当图中回路较多时,检查不便且易出错。针对此,本文建立了求解“中国邮路问题”的0-1规划模型,并给出了算例。

数据结构课程 研讨题目 中国邮路问题 c++代码实现以及 研讨ppt