多目标车辆路径的遗传算法

Multi-Objective Union Transport Scheduling Genetic Algorithm

传统的单目标遗传算法运行一次只能得到一个解,而多目标遗传算法运行一次可以得到一个解集,多个解可以为决策者提供更多的选择余地,作出更好的决策。本算法通过设计新的改进遗传算子,进一步提高了算法的性能,并设计采用擂台法则构建非支配集,降低了时间复杂度。通过实验验证表明,此算法能有效的解决车辆路径问题。

The traditional single-objective genetic algorithm can only get a solution every a run,but multi-objective genetic algorithm can get a solution set every a run.A number of solutions can provide decision-makers with more choice and decision-makers can make better decisions.This algorithm further improve the performance of the algorithm by improving the design of new genetic operators and design arena＇s principle to build non-dominating set rules which reduce the time complexity.Experiments show that this algorithm can effectively solve the vehicle routing problem.