本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
This text has been researched to the vehicle-scheduling problem with time window on the basis of researched to logistic vehicle scheduling problem.
本文在建立物流配送车辆优化调度数学模型的基础上，构造了求解该问题的免疫算法，并进行了实例计算。
On the basis of establishing the optimizing model on logistic vehicle routing problem, this paper presents a Immune algorithm for saving this problem, and makes some experimental calculations.
配送车辆优化调度问题是一类求解较难的组合优化问题，由于其NP难特性，采用精确优化方法有一定的局限性，不能得到令人满意的结果。
Logistic vehicle routing problem is combination optimization that is difficult to solve. Due to its NP characteristics, we can't get satisfying results when we use exact approaches.
应用推荐