您要查找的是不是：
- M. H. Hsu and C. C. Chyu, "An Extended Neighborhood Search Algorithm for The Time Constrained Vehicle Routing Problem," Automation '98 and ICPR Asia Meeting, July 20-22, 1998. 廖亮富、徐旭升，"多部车含时窗限制车辆途程问题解算之研究"，中华民国工业工程学会八十七年度年会，1998/12/13。
- In addition it proposes taboo search algorithm based on a new neighborhood search method,and the TS algorithms in the method are used as local search algorithm. 针对蚁群算法易于陷入局部最优的情况,提出了一种基于关键工序的邻域搜索方法,将使用此邻域搜索方法的TS算法作为局部搜索策略。
- large neighborhood search algorithm 大规模邻域搜索算法
- variable neighborhood search algorithm 变邻域搜索算法
- neighborhood searching algorithm 邻域搜索算法
- Adaptive Neighborhood Searching Algorithm(ANSA) 自适应邻域搜索法
- Improved large neighborhood search algorithm for vehicle routing problem with time windows 有时间窗的车辆路径问题的近似算法研究
- neighborhood search algorithm 邻域搜索算法
- For a value, using a binary search algorithm. 使用二进制搜索算法在一维的排序。
- This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. 摘要 近年来，由于科技的进步与经济的发展，让人们享受著舒适便利的生活，但相对也制造了大量的废弃物。
- In the scheduling algorithm, the whole search strategy was applied and a rule of neighborhood search was defined to improve the performance of the individual search. Furthermore the global convergence of the algorithm was analyzed via Markov chain. 该算法实行群体搜索策略,由此定义了邻域搜索规则来增强个体的搜索能力,并运用马尔科夫链分析了算法的全局收敛性。
- A Discrete Shuffled Frog Leaping Algorithm（DSFLA） is proposed to solve Timetabling Problem（ETP），and employs the simple neighborhood search to present two improvement strategies. 摘要 针对考试时间安排问题，提出了一种离散化蛙跳求解算法，并结合简化邻域搜索算法给出了两种改进策略。
- Then it designs and realizes the fast rampart search algorithm. 其中,平面点集的凸壳是最重要、最基础的问题。
- Which uses a linear search algorithm to find entries in the list of delegates. 类型,它使用线性搜索算法在委托列表中查找项。
- This code has demonstrated Ma Zouri the checkerboard search algorithm. 本代码演示了马走日棋盘搜索算法。
- Exactly tracking the maximum power point depends on effective search algorithm. 准确跟踪太阳能光伏阵列的最大输出功率点依赖于有效的搜索算法。
- Genetic algorithm and Tabu Search Algorithm are combined in our method. 并比较了新算法与三种经典全局优 化算法的性能。
- To further improve the solution, we propose a metaheuristic that uses variable neighborhood search (VNS) with three different local searches. 在本论文中我们同时提出变动邻域搜寻法，包含了三个邻域搜寻的方法，以期望能够改善初始解并得到一个较佳可行解。
- The search algorithm rummages through a database with entries in random order. 搜寻算则会在资料库的条目中随意翻找。
- Because one of the strengths of NEH is its iterative neighborhood search policy,using the method of amplifying or simplifying neighborhod,several different space structures are given. 由于NEH算法取得成功的一个重要原因在于其迭代式插入邻域搜索过程,因此,着重从它的邻域搜索空间入手,用精简或增强邻域的方法,给出了几种不同的空间结构。
