摘要
该文探讨了如何将基于遗传算法和禁忌搜索算法的混合策略应用于求解有时间窗的车辆路径(VRPTM)问题,给出了相应的应用算法。实验结果表明,这种将禁忌搜索作为变异操作的混合策略对VRPTM问题是行之有效的,其优化性能优于简单的遗传算法。
This paper discusses how to solve vehicle routing problem with time windows (VRPTM)with a hybrid strategy based on genetic algorithm and tabu search algorithm,and gives a relative algorithm.The experiment results show that the hybrid strategy with tabu search as mutation operator is effective on solving VRPTM and its optimizing performance is superior to the simple genetic algorithm
出处
《计算机工程与应用》
CSCD
北大核心
2004年第18期54-57,共4页
Computer Engineering and Applications
基金
国家自然科学基金项目(编号:40062002)
广西自然科学基金项目(桂科自:0229008)的联合资助
