本文重点研究了基于混合遗传算法求解有时间窗车辆路径问题。
Vehicle Routing Problem with Time Windows(VRPTW) is much more attractive for the great realistic meaning.
把该方法应用于有时间窗车辆路径问题，试验结果表明该算法是有效的。
The proposed algorithm was applied to the Vehicle Routing Problem with Time Window (VRPTW). The experiment results indicates that the new algorithm is effective.
根据带时间窗车辆路径问题的实际情况，通过考察车辆数和总行程两个目标函数，给出了该问题的一种新的算法——蜂群算法。
This paper proposed a new algorithm, wasp colony algorithm, for VRPTW through comparing the two target function vehicle number and total distance.
通过对物流车辆配送过程的分析，建立了带时间窗约束的物流配送路径优化问题的数学模型。
A mathematical model of logistics distribution route with time window was proposed according to the analysis of the logistics vehicle distribution process.
提出了具有时间窗的货物运输车辆路径问题。
Transit vehicle routing problem with time intervals-constrained is considered.
在分析热轧生产批量计划通用模型的基础上，采用了带有时间窗的车辆路径问题模型。
The VRPTW model that is suitable to resolve the problems of the production lot planning of the hot rolling strip is suggested.
在物流的各种优化问题中，有时间窗的车辆路径问题由于其巨大的经济效益，从它被提出以来就一直是业界研究的热点。
In kinds of the optimum problems of logistic, the vehicle routing problem with time window has been focused in the area because of its enormous benefit since it was proposed.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的NP-难问题。
MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.
如果配送资源不受限制，总配送成本不受顾客的库存成本的影响，问题转化为带有时间窗的车辆路径问题(VRPTW)。
If the resource is infinite in the distribution center, the distribution cost is not affected by the custom inventory, the problem is a vehicle routing problem with time window (VRPTW).
在拼箱货物配送中，就目前客户对于配送服务时间要求的提高，本文重点讨论了带时间窗的车辆路径问题(VRPTW)。
In the distribution of the LCL, according to the requirement higher in the service time about customer at present, the Vehicle Routing Problem with time Windows (VRPTW) was discussed especially.
在实际生活中，带时间窗的回程取货车辆路径问题在物流配送路线中广泛存在，例如零售业、快件与货运和逆向物流等，是物流管理学科的前沿热点问题之一。
In reality, VRPBTW is applied in a wide range of logistics and distribution, like retail, express & freight and reverse logistics, and it is one of the cutting-edge issues in the field of logistics.
带软时间窗的车辆路径问题(VRPSTW)是在基本的车辆路径问题(VRP)上增加了时间窗约束条件的一种变化形式，是一个典型的NP -难问题。
Vehicle routing problem with soft time Windows (VRPSTW) is a variation of vehicle routing problem (VRP), which is a typical NP-hard problem.
本文首先介绍了遗传算法在解决简单约束车辆路径问题上的应用，改进了交叉算子，为研究有时间窗装卸问题的遗传算法作了充分准备。
In this paper, Genetic Algorithms (GA) for VRP with simple conditions was introduced and cross operator in GA was improved. These researches made full preparation for us to study PDPTW.
本文首先介绍了遗传算法在解决简单约束车辆路径问题上的应用，改进了交叉算子，为研究有时间窗装卸问题的遗传算法作了充分准备。
In this paper, Genetic Algorithms (GA) for VRP with simple conditions was introduced and cross operator in GA was improved. These researches made full preparation for us to study PDPTW.
应用推荐