An Improved Petal Heuristic for the Vehicle Routeing Problem
提出一种改进的花瓣启发式算法，在14个基准测试问题上平均解质量与最优解相差仅2.38%，计算时间远少于禁忌搜索，适合需要快速获得高质量解的车辆路径问题场景。
Solutions produced by the first generation of heuristics for the vehicle routeing problem are often far from optimal. Recent adaptations of local search improvement heuristics, like tabu search, produce much better solutions but require increased computing time. However there are situations where good solutions must be obtained quickly. The algorithm proposed in this paper yields solutions almost as good as those produced by tabu search adaptations, but at only a small fraction of their computing time. This heuristic can be seen as an improved version of the original petal heuristic. On 14 benchmark test problems, the proposed heuristic yields solutions whose values lie on average within 2.38% of that of the best known solutions.