针对带装载能力开放式车辆路径问题,提出了一种基于遗传算法和禁忌搜索(GA-TS)的混合优化算法,将GA的并行计算、全局优化与TS的禁忌技术、快速局部搜索等特性相结合。该算法根据服务点需求及车辆装载能力,采用自然数编码,进行GA全局优化,种群中个体以一定的概率进行TS局部搜索,即对同属一辆车配送的所有服务点进行局部TS路径优化。既保证了优化的全局性,又保证了运算的速度性。应用于郑州煤电物资供销有限公司煤矿物资运输的车辆路径优化中,得到了最经济的运输路径,节约了成本。
This study primarily focuses on solving an open vehicle routing problem(OVRP) by a hybrid genetic algorithm and Tabu Search(GA-TS),which combines the GA's parallel computing and global optimization with fast local search of tabu search.First,the algorithm uses natural number coding according to the serve site demand and the capacity of the vehicle for global optimization.Then individuals of population carry local search with a certain probability.The mechanism not only ensures optimization globally,but also ensures the rapid speed of operations.The algorithm was used in Zhengzhou Coal Mine and power Supply Co.,Ltd.'s transport vehicle routing optimization problem to obtain optimal transportation paths and reduced transportation costs.