transit vehicle routing problem with time intervals-constrained is considered.
提出了具有时间窗的货物运输车辆路径问题。
they were unable to develop a solution to a mail routing problem using exchange.
他们无法使用exchange为一个邮件路由问题开发解决方案。
vehicle routing problem with time windows(vrptw) is much more attractive for the great realistic meaning.
本文重点研究了基于混合遗传算法求解有时间窗车辆路径问题。
in logistic management research, vehicle routing problem has gained a lot of attention.
车辆路径问题在物流管理的研究中受到大量关注。
the datapower xm70 addresses the llm routing problem through its ability to intelligently route, filter, and modify hundreds of thousands of messages per second.
datapowerxm70每秒能够智能路由、过滤和修改数十万条消息,从而能够解决llm路由问题。
the inventory routing problem of decentralized supply chain was considered and a modified nearest algorithm was proposed.
研究了非一体化供应链环境下的库存路径问题,给出改进的最邻近算法。
based on the hypothesis of limited reason, a flexible strategy of dynamic vehicle routing problem with fuzzy travel time was presented through introducing the concept of decision-maker's preference.
基于有限理性的思想,通过引入决策者主观偏好的概念,阐述了给定时间约束下车辆模糊路径的柔性选择策略;
this paper proposed a new genetic algorithm for solving vehicle routing problem with time window and weight under the uncertain vehicle number.
提出了带货物权重及时间窗的车辆路径问题在车辆数不确定条件下的一个新的求解算法。
the vehicle routing problem with time windows (vrptw) cannot be solved effectively by using the existing large neighborhood search (lns) algorithm. a universal mathematical model of vrptw was built.
为了克服原有大规模邻域搜索算法不能有效求解时间窗较宽的车辆路径问题的缺陷,介绍了有时间窗的车辆路径问题(vrptw)的通用数学模型。
a novel two-phase genetic-annealing algorithm is proposed to solve the vehicle routing problem with time window(mdvrptw) and multi-constraint in multiple dispatching centers.
针对多约束条件的多配送中心有时间窗车辆路径问题,提出了一种二阶段遗传退火算法。
vehicle routing problem on railway baggage and parcel is a problem of simultaneous delivery and pick up.
铁路行包配送车辆路径问题属于同时具有送货和集货需求的车辆路径问题。
in order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(mdvrpmc)was proposed.
为节约物流配送费用,提出一类多约束条件下的多车场车辆路径问题。
vehicle routing problem is an important content in supply chain field.
车辆路径问题是供应链研究的一项重要内容。
a new method is proposed for solving vehicle routing problem with stochastic demands(vrpsd).
提出一种解决随机需求车辆路径问题(vrpsd)新方法。
research on vehicle routing problem is of great importance in logistics distribution system.
研究车辆路径问题在物流配送系统中具有十分的重要意义。
this paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem with time windows.
根据带时间窗的车辆路径问题的实际情况,提出了一种基于分组匹配的亲和力的计算方法。
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.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式,是一个典型的np-难问题。