摘要
对适用于旅行商问题的最近距离搜索启发式算法进行修正,构造出评价函数,并依此提出一个求解有时间窗约束的车辆路径问题的启发式算法.求解具体算和表明,此算法是有效的.
Through analyzing the vehicle routing problem,we modify the nearest distance searching heuristic for the traveling salesman problem. A new evaluation function is constructed and a new heuristic for the vehicle routing problem with time windows constraints is proposed according to the new e-valuation function. The example we solved is shown that the heuristic can obtain the near optimal solution using less calculation and simple compari-tion.
出处
《系统工程》
CSCD
1998年第4期20-24,29,共6页
Systems Engineering
