The Vehicle Routing Problem (VRP) is NP-hard.The author describes VRP as a multi-objective optimization problem and presents a biobjective genetic algorithm to solve this problem.

• 摘要车辆路径问题是一个NP-难问题，将该问题描述成为一个多目标最优化问题，并为之提出了一种双目标遗传算法来解决该问题。