1) capacity-constrained vehicle routing problem(CVRP)
带运力限制的车辆路径问题
2) VRPTW
带时间窗车辆路径问题
1.
Based on the characteristics of Vehicle Routing Problem with Time Windows(VRPTW),an improved Ant Colony Algorithm is proposed in this paper,the ability of finding efficient solutions and the convergence speed are optimized with this algorithm,and the computational experiment demonstrates that the improved algorithm is efficient to the VRPTW.
针对带时间窗车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTW)的特点,对蚁群算法进行了改进,优化了其搜索解的能力和收敛速度,用实例证明了改进的蚁群算法对解决VRPTW的有效性。
3) vehicle routing problem with time windows
带时间窗车辆路径问题
1.
Application Research of the Ant Algorithm to Vehicle Routing Problem with Time Windows;
蚂蚁算法在带时间窗车辆路径问题中的应用研究
2.
This paper further extends the idea of this new biological optimization strategy to vehicle routing problem with time windows in logistic management and designs a new kind of dynamic ant algorithm.
将这种新型的生物优化思想扩展到物流管理中的带时间窗车辆路径问题,设计了一种动态蚁群算法,从数值计算上探索了这种新型蚁群算法的优化能力,获得了满意的效果。
4) vehicle routing problem with time windows(VRPTW)
带时间窗车辆路径问题
1.
Vehicle Routing Problem with Time Windows(VRPTW) is a very important extended type of Vehicle Routing Problem(VRP).
带时间窗车辆路径问题(VRPTW)是VRP的一种重要扩展类型,在蚂蚁算法思想基础上,设计用于求解该问题的混合改进型算法并求解Solomon标准数据库中的大量实例。
5) complicated Capacitated Arc Routing Problem(CARP)
复杂容量限制弦路径车辆行驶问题
6) vehicle routing problem with time window constraints
带时间窗约束的车辆路径问题
补充资料:运力
1.用力;尽力。 2.指运输力量。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条