英汉例句

• the effective size of the vehicle scheduling problem algorithm analysis.

  规模车辆调度问题的有效算法分析。

• in the algorithm, the loaded point is named, the twvsp is transformed into several vehicle scheduling problem with specified time (stvsp).

  算法中引入重载点，把求解有时间窗的调度问题转化为求解多个有确定开始时间的车辆调度问题。

• the vehicle scheduling problem with fuzzy demands(vspfd) is a variation of vehicle scheduling problem(vsp), which is a typical np-hard problem.

  带模糊需求的车辆调度问题（vspfd）是在基本的车辆调度问题（vsp）上增加了模糊需求约束条件的一种变化形式，是一个典型的np难题。

• vehicle scheduling problem with full-loads has long been a hot research issue in logistics & transportation industry.

  满载车辆调度问题是物流运输领域中一个非常值得研究的问题。

• the traditional deterministic vehicle scheduling problem (vsp) was expanded into a vsp with fuzzy features. the cost coefficients of the vsp with the features were treated as fuzzy numbers.

  将传统的确定性车辆调度问题扩展为具有模糊特征的模糊车辆调度问题。

• whereas such circumstances, we studied a type of vehicle scheduling problem that single motor pool, multi-vehicles with time window in this paper.

  鑒于这种情况，本文对单车场多车型非满载并带有时间窗的车辆优化调度问题进行了研究。

• the results demonstrate that the feasible solutions to the not-fully-loaded vehicle scheduling problem with soft time windows can easily be obtained using the .

  结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。

• the solving tactics of dividing a multi-depot vehicle scheduling problem into several single-depot vehicle scheduling problems by using the minimum distance distribution method is presented.

  提出了采用距离最近分配法将多配送中心车辆调度问题分解为多个单配送中心车辆调度问题进行求解的策略。

• by means of the idea of parallel search, the detailed procedure of the mpso algorithm is given for solving vehicle scheduling problem with soft time windows.

  根据多相粒子群并行搜索的思想，给出mpso算法在带软时间窗物流配送车辆调度路径优化的实现流程。

• in the view of satisfaction of customers, at the base of introduction of physical distribution, this article discusses vehicle scheduling problem thoroughly.

  本文从客户满意度的角度出发，在对物流配送介绍的基础上，针对车辆调度问题进行了优化探讨。

• the delivery vehicles are divided into vehicle routing problem and vehicle scheduling problem according to their space and time characters.

  车辆优化调度问题一般可根据空间特性和时间特性分为车辆线路规划问题和车辆调度问题。

• the results demonstrate that the feasible solutions to the not-fully-loaded vehicle scheduling problem with soft time windows can easily be o…

  结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。

• introduces the state of the art on vehicle scheduling problem study and analyzes its classification, mathematical models, algorithms and application, finally, the authors'study is described briefly.

  本文介绍了国内外车辆优化调度问题的研究现状，对问题的分类、模型构造、求解算法及其适用范围等进行了分析。此外，还对作者自己的研究成果作了简要阐述。

• vehicle scheduling problem with non full load is a fundamental problem of vehicle scheduling problem. because it is a typical np hard problem, traditional algorithms usually are not satisfied.

  非满载车辆调度问题是车辆调度问题中的一个基本问题，由于它是一个典型的np难题，传统方法的求解结果往往不能令人满意。