摘要
车辆路径问题(VRP)是组合优化中一个典型的NP难题,对于中等规模以上的问题,目前大多采用禁忌搜索、遗传算法和模拟退火等亚启发式算法,在吸取这些算法精髓的基础上,提出了一种新的并且简洁而高效的启发式算法.计算结果表明,在27个国际标准算例中应用该算法取得了2个解优于当前最优解,其余相当接近当前最优解.需要指出的是所有这些结果是在该算法应用同一组参数得到的.
The Vehicle Routing Problem is a well-known NP-hard problem, which is often＇solved by meta-heuristics like the Tabu Search, Genetie Algorithm or Simulated Annealing. The Random Recursion Algorithm inspiring from these algorithms is proposed, which is fast, robust and effective. The computational results of the 27 benchmark instances show the algorithm is every powerful that 2 solutions are superior to the best that already had been found and others are quite approaching to the best. It should be noted that all the results are calculated under the same set of parameters.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2008年第11期142-148,共7页
Systems Engineering-Theory & Practice
基金
国家自然科学基金NSFC(70271011)
国家教育基金(20020006-4)
