1) vehicle routing problem
车辆选径问题
1.
Chaotic neural network-based solution to the vehicle routing problem;
基于混沌神经网络车辆选径问题优化算法
2.
For a class of vehicle routing problems with stochastic dcmands,a novel solution is first proposed and a model set up to solve the problem and the solution is compared with that by the existing simulated annealing approach.
结果表明该算法具有很强的避免陷入局部极小点的能力,较大地提高了优化的性能和搜索效率,适用于求解车辆选径问题。
3.
Therefore, vehicle routing problem i.
而车辆选径问题(Vehicle Routing Problem, VRP)是供应链研究的一项重要内容。
2) vehicle routing problem(VRP)
车辆路径问题
1.
A novel hybrid particle swarm optimization(PSO) algorithm for vehicle routing problem(VRP) was proposed.
将粒子群优化算法与模拟退火算法结合,提出了一种求解车辆路径问题的混合粒子群算法。
2.
This paper presents several typical models of vehicle routing problem(VRP),and gives the today s different heuristic algorithms,and summarizes advantage or disadvantage of these algorithms, and then indicate that the research area of VRP will extend to supply chain s aspect.
本文阐述了车辆路径问题(VRP)的几种典型的模型和常见算法,分析了这些算法用于计算车辆路径问题的优缺点,并指出了VRP的研究范围还需向范围更广的供应链方向扩展。
3.
The vehicle routing problem(VRP)with capacity restrictions was described.
描述了带有能力约束的车辆路径问题（ＶＲＰ），在预先不固定车辆数的情况下，把聚类和排序有机地结合起来，并用遗传算法和３ｏｐｔ算法相结合的混合算法对问题进行求解，实验结果表明算法获得的最好解、平均负荷率和计算成本都比较令人满意
3) vehicle routing problem
车辆路径问题
1.
A genetic algorithm for the open vehicle routing problem with soft time windows;
求解带软时间窗的开放式车辆路径问题的遗传算法
2.
Modified NSGAII algorithm for vehicle routing problem in logistics;
基于NSGA Ⅱ的物流配送中车辆路径问题研究
3.
Heuristic genetic algorithm of vehicle routing problem with time windows;
带时间窗车辆路径问题的启发式遗传算法
4) Vehicle Routing
车辆路径问题
1.
A Genetic Algorithm for the Capacitated Open Vehicle Routing Problem;
求解带装载能力限制的开放式车辆路径问题的遗传算法
2.
A heuristic algorithm for vehicle routing;
车辆路径问题(VRP)的一个启发式算法
3.
Taking backhaul into consideration in the haul process,the vehicle routing problem with time windows (VRPTW) becomes the vehicle routing problem with backhaul and time windows (VRPBTW),which is more practical than normal VRPTW.
车辆路径问题如果考虑回程取货过程就可以在送货的过程中先后完成取货任务,比传统不考虑回程过程的问题更有实用性,基于此对传统问题进行了改进,不限制车辆的取送货顺序,而是设计了相应参数,避免了货物的重新排列·在确定目标时,综合考虑车辆运行成本、人员等待成本及服务成本等因素,实现目标解的真正可行·最后,根据此问题的特点,设计了先通过分枝定界法及遗传算法确定可行路线,再运用整数规划方法求解的算法,并以实例说明了算法的有效性
补充资料：径径
1.不停貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条