1) Service Composition Path Optimization
服务组合路径优化
2) path optimization
路径优化
1.
PCB drilling path optimization based on ant-colony algorithm;
基于蚁群算法的PCB孔加工路径优化
2.
Research of new algorithm for drilling path optimization;
新的求解钻削路径优化问题算法研究
3.
Study on Parallel Algorithms of Flow Prediction and Path Optimization for Traffic Flow Guidance System;
交通诱导系统的流量预测和路径优化并行算法研究
3) route optimization
路径优化
1.
Study on multi-objective route optimization for hazardous material road transportation;
危险品道路运输多目标路径优化方法研究
2.
Improvement of shortest path algorithm and its application to route optimization;
最小时间路径算法的改进及在路径优化中的应用
3.
Research of Route Optimization Method on Road Network in Urban Based on GIS;
基于GIS的城市路网中路径优化方法研究
4) Path optimize
路径优化
1.
The system implement the technology flow of Transmission line path optimize and optimizing on tower arrange,which provide scientific and accurate reference to the multi-scheme choose of Transmission line design in the aisle.
应用海拉瓦洛斯达技术在线路规划设计阶段中进行辅助路径优化和优化杆塔排位,可以提高工作效率和实时性,降低线路建设的投资预算。
5) optimal path
优化路径
1.
We put forward 4RC optimal path for curriculum design under the full credit system in this paper on the basis of the educational psychology in curriculum design and in view of the fact that most universities will have to set up a new curriculum under the credit system.
完全学分制下的课程设置的4RC优化路径,是以课程论教育心理学为依据,针对多数高校普遍存在学分制下的课程设置问题提出的。
6) routing optimization
路径优化
1.
Routing Optimization System Based on the Ant Colony Algorithm;
基于蚁群算法的配送路径优化系统研究
2.
According to the process of container terminal operations,the logistics routing optimization model, which targets in the minimum route of container trucks,is constructed,to seek the optimal route of container trucks under the condition of satisfying the requirement of container yard storage and vessel handling operation.
根据集装箱码头的工艺流程,提出了集装箱码头物流路径优化模型。
3.
The routing optimization function made the ant movement path to pull straight, shorten, which made the a.
运用路径优化功能,使蚂蚁运动路径拉直、变短,使路径可用性增强。
补充资料:组合最优化
组合最优化 combinatorial optimization 在给定有限集的所有具备某些条件的子集中,按某种目标找出一个最优子集的一类数学规划。又称组合规划。从最广泛的意义上说,组合规划与整数规划这两者的领域是一致的,都是指在有限个可供选择的方案的组成集合中,选择使目标函数达到极值的最优子集。 组合最优化发展的初期,研究一些比较实用的基本上属于网络极值方面的问题,如广播网的设计、开关电路设计、航船运输路线的计划、工作指派、货物装箱方案等。自从拟阵概念进入图论领域之后,对拟阵中的一些理论问题的研究成为组合规划研究的新课题,并得到应用。现在应用的主要方面仍是网络上的最优化问题,如最短路问题、最大(小)支撑树问题、最优边无关集问题、最小截集问题、推销员问题等。 |
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条