Transit vehicle routing problem with time intervals-constrained is considered.
提出了具有时间窗的货物运输车辆路径问题。
Research on vehicle routing problem is of great importance in logistics distribution system.
研究车辆路径问题在物流配送系统中具有十分的重要意义。
A new method is proposed for solving Vehicle Routing Problem with Stochastic Demands (VRPSD).
提出一种解决随机需求车辆路径问题(VRPSD)新方法。
The paper provides a new way to the multiple vehicles coordinated Stochastic vehicle Routing Problem.
为研究多车辆协作的随机路径问题提供了新的理论和方法。
Vehicle routing problem on railway baggage and parcel is a problem of simultaneous delivery and pick up.
铁路行包配送车辆路径问题属于同时具有送货和集货需求的车辆路径问题。
Vehicle Routing Problem with Time Windows(VRPTW) is much more attractive for the great realistic meaning.
本文重点研究了基于混合遗传算法求解有时间窗车辆路径问题。
This paper established the mathematic model and solving flow of multi-restriction vehicle routing problem.
建立了多约束条件车辆路径问题的数学模型和求解流程。
This paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem.
将免疫算法用于求解车辆路径问题，并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法。
The fault - tolerant routing problem in wormhole networks is studied, and a novel rerouting algorithm is presented.
研究了蛀洞网络的容错路由问题，提出了一种新的重新路由算法。
The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.
分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 -OPT算法计算时间的平均复杂度。
The optimization of order-picking routing problem in raising the efficiency of logistics centre has an important role.
拣货路径优化问题在提高物流中心效率中具有重要的作用。
An integration pattern has been created to use this new function and solve the IDoc routing problem. The solution has two parts.
一个集成模式已被创建，以便使用这个新功能并解决idoc路由问题。
The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.
结果表明，该方法能有效地解决有行驶里程限制的满载车辆调度问题。
Faced to concrete routing problem, time and routs are both restricted and required and researches in this field are not enough.
而且具体的车辆路径优化问题，往往在时间和路程两方面都有限制和要求，而在这方面的研究相对较少。
But the vehicle routing problem, as the traditional model for logistics distribution, fails behind the need of agile logistics.
但是，传统的车辆配送模型不适应敏捷物流的需要。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem.
针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。
In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.
为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。
A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function.
设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。
A special asymmetric vehicle routing problem is presented for modeling the hot rolling lot planning since it accords with the production practice.
本文提出了更为接近热轧批量计划编制实际的特殊不对称车辆路径问题作为热轧批量计划编制问题的数学模型。
The dissimilar path routing problem is to find out spatial dissimilar paths between source and destination nodes for a given transportation network.
相异路径选线问题考虑的是，给定一运输网络和源宿接点，找出源宿节点之间在空间上有差异的路径。
In this paper, the performance of as is improved and the improved as is combined with the heuristic algorithm to solve the multicast routing problem.
提出一种改进的蚁群算法，并将其与启发式方法相结合以解决多点路由问题。
Multiple demands vehicle routing problem (MVRP) comes from organization and implementation of transportation in large scale industrial production process.
多重运输调度问题(MVRP)来源于大规模生产过程的运输组织与实施。
The DataPower XM70 addresses the LLM routing problem through its ability to intelligently route, filter, and modify hundreds of thousands of messages per second.
DataPower XM 70每秒能够智能路由、过滤和修改数十万条消息，从而能够解决llm路由问题。
Delay-constrained least-cost multicast routing problem is studied, and a multicast routing algorithm based on link optimizing is proposed to solve the problem.
研究具有时延约束的最小代价组播路由问题，提出一种基于链路优化的组播路由算法求解该问题。
The dissimilar path routing problem is to find out spatial dissimilar paths between two specific source and destination nodes for a given transportation network.
相异路径选线问题考虑的是，给定一运输网络，找出某对源宿节点之间的空间上有差异的路径。
The dissimilar path routing problem is to find out spatial dissimilar paths between two specific source and destination nodes for a given transportation network.
相异路径选线问题考虑的是，给定一运输网络，找出某对源宿节点之间的空间上有差异的路径。
应用推荐