中文摘要：

考虑具有最大等待时间、最大运输时间限制且带时间窗的车辆路径问题,建立了以车辆行驶路径最短和使用车辆数最小为目标的数学模型。将单亲遗传算法和基本蚁群算法相结合,使其优势互补,并利用单亲遗传算法的特点,构建出两种求解该问题的单亲遗传混合蚁群算法,分别为：单点单亲遗传混合蚁群算法和多点单亲遗传混合蚁群算法。测试算例的结果表明：求解多目标带时间窗的车辆路径问题时,与基本蚁群算法相比,单亲遗传混合蚁群算法具有计算效率高、收敛性好等优点,尤其单点单亲遗传混合蚁群算法不仅具有较好的计算性能,而且具有较高的稳定性。

英文摘要：

Considering the vehicle routing problem which has the restriction of maximum vehicle waiting time,maximum vehicle transport time and time windows,a mathematical model for the shortest length of vehicle travel and the minimum number of the using vehicles as the multi-objective is established. Then,2partheno-genetic hybrid ant colony algorithms for solving the problem are proposed by combining parthenogenetic algorithm with basic ant colony algorithm to have their complementary advantages and the features of partheno-genetic algorithm,which are monogene partheno-genetic hybrid ant colony algorithm and polygenic partheno-genetic hybrid ant colony algorithm. The result of the test case shows that the partheno-genetic hybrid ant colony algorithm has the advantages of better computational efficiency and convergence,and especially monogene partheno-genetic hybrid ant colony algorithm is more stable and has better computational performance.