摘要
总结目前求解多车型车辆路径问题的5种基于知识的算法,提出采用大旅程法和禁忌搜索法相结合的混合启发式算法,在搜索过程中通过增加惩罚因子的方法允许不可行解的存在,减少求解陷于局部优化的可能性。采用GENIUS算法处理其中的TSP问题,不仅能产生较好的解,而且通过对解的周期性的扰动,进一步减少求解陷于局部优化的可能性。
In this paper,up to date knowledge based,five algorithms are introduced.A meta-heuristic algorithm is constructed by merging gaint-tour algorithm and tabu-search algorithm.In the searching process of this algorithm,infeasible solution is allowed by adding a penalizing factor,to reduce the probability of local optimal.GENIUS algorithm is used to solve TSP problem in this algorithm.Through this processing,not only better solution can be got,but also the likelihood of local optimal be reduced by perturbing solution periodically.
出处
《公路交通科技》
CAS
CSCD
北大核心
2005年第5期147-151,共5页
Journal of Highway and Transportation Research and Development
关键词
多车型车辆路径问题
算法
混合启发式算法
Multi-types vehicle routine problem
Solutions
Meta-heuristic solution
