【摘要】 影片递送问题 (简称FDP)是组合优化的一个新问题 ,它比旅行商问题 (简称TSP)复杂得多。介绍了一种新的演化算法 ,这种算法首先将FDP问题转换成TSP问题 ,然后基于次序杂交算子 (OX)和反转变异算子获得最佳解。该算法不仅易于实现 ,而且计算的结果精确、快速更多还原

【Abstract】 The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP). A new evolutionary algorithm is presented to solve the FPD. First, convert the FDP into TSP, and then solve the problem by using evolutionary algorithms based on order crossover and inversion mutation operators. This method is not only simple and easy to realize but also fast and accurate.更多还原