【摘要】 提出了一种解决满载VSP的两阶段算法。首先通过选择启发式算法得到每辆车所需要完成的运输任务子集,然后通过遗传算法在每个任务子集内寻找最优路径,得到一个较为满意的满载VSP的解。更多还原

【Abstract】 This paper gaves a mixed algorithm to solve the full-load VSP problem.By using select-heuristic algorithm to get the transport task sub-sets of every car,and genetic algorithm to search the best path in the task sub-sets,then a satisfied solution of the full-load VSP has been obtained.更多还原