1) wiring problem
线路问题
2) the shortest circuit problem
最短线路问题
1.
Traditionally,Dijkstra method is generally used to solve the shortest circuit problem in circuit teaching.
传统教学中一般使用Dijkstra方法解决最短线路问题。
3) vehicle routing problem
车辆路线问题
1.
Hybrid-genetic-heuristic algorithm of vehicle routing problem with hard time-windows;
带硬时间窗车辆路线问题的混合遗传启发式算法
2.
To solve the vehicle routing problem (VRP) with time windows, where over-constrained situation may exist that no feasible solution satisfying all constraints is found, a novel algorithm, guided local search (GLS), is provided to minimize the total cost of violated constraints.
针对一类带时间窗口和容量约束的车辆路线问题(VRP),给出了在过度约束即不存在满足所有约束的可行解的情况下,能够最小化约束违反成本的一种新颖的导引式局部搜索(GLS)算法。
3.
According to the features of vehicle routing problem,the paper designs an algorithm combining with SFC and 2-opt,namely SFC and 2-opt.
由现实生活中的不确定性因素引出需求随机的车辆路线问题,根据该问题随机性强的特点,设计了不断优化的求解方法。
5) vehicle routing problem(VRP)
车辆路线问题(VRP)
补充资料：短线产品
企业生产的少于社会需要的产品。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条